/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-nonblocking-cntr-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 02:14:59,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 02:14:59,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 02:14:59,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 02:14:59,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 02:14:59,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 02:14:59,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 02:14:59,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 02:14:59,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 02:14:59,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 02:14:59,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 02:14:59,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 02:14:59,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 02:14:59,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 02:14:59,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 02:14:59,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 02:14:59,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 02:14:59,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 02:14:59,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 02:14:59,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 02:14:59,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 02:14:59,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 02:14:59,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 02:14:59,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 02:14:59,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 02:14:59,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 02:14:59,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 02:14:59,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 02:14:59,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 02:14:59,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 02:14:59,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 02:14:59,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 02:14:59,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 02:14:59,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 02:14:59,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 02:14:59,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 02:14:59,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 02:14:59,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 02:14:59,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 02:14:59,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 02:14:59,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 02:14:59,793 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 02:14:59,823 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 02:14:59,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 02:14:59,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 02:14:59,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 02:14:59,826 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 02:14:59,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 02:14:59,827 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 02:14:59,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 02:14:59,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 02:14:59,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 02:14:59,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 02:14:59,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 02:14:59,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 02:14:59,828 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 02:14:59,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 02:14:59,829 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 02:14:59,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 02:14:59,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 02:14:59,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 02:14:59,829 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 02:14:59,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 02:14:59,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:14:59,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 02:14:59,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 02:14:59,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 02:14:59,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 02:14:59,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 02:14:59,830 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 02:14:59,830 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 02:15:00,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 02:15:00,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 02:15:00,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 02:15:00,150 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 02:15:00,150 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 02:15:00,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c [2022-12-13 02:15:01,332 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 02:15:01,534 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 02:15:01,535 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c [2022-12-13 02:15:01,546 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c6c7bdd/f332e220c9014f74be53dccac3106054/FLAGf12541f85 [2022-12-13 02:15:01,567 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c6c7bdd/f332e220c9014f74be53dccac3106054 [2022-12-13 02:15:01,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 02:15:01,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 02:15:01,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 02:15:01,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 02:15:01,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 02:15:01,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:15:01" (1/1) ... [2022-12-13 02:15:01,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca25955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01, skipping insertion in model container [2022-12-13 02:15:01,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:15:01" (1/1) ... [2022-12-13 02:15:01,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 02:15:01,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 02:15:01,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:15:01,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:15:01,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:15:01,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:15:01,763 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-nonblocking-cntr-alt.wvr.c[2098,2111] [2022-12-13 02:15:01,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:15:01,775 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 02:15:01,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:15:01,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:15:01,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:15:01,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:15:01,798 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-nonblocking-cntr-alt.wvr.c[2098,2111] [2022-12-13 02:15:01,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:15:01,815 INFO L208 MainTranslator]: Completed translation [2022-12-13 02:15:01,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01 WrapperNode [2022-12-13 02:15:01,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 02:15:01,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 02:15:01,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 02:15:01,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 02:15:01,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01" (1/1) ... [2022-12-13 02:15:01,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01" (1/1) ... [2022-12-13 02:15:01,849 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2022-12-13 02:15:01,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 02:15:01,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 02:15:01,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 02:15:01,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 02:15:01,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01" (1/1) ... [2022-12-13 02:15:01,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01" (1/1) ... [2022-12-13 02:15:01,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01" (1/1) ... [2022-12-13 02:15:01,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01" (1/1) ... [2022-12-13 02:15:01,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01" (1/1) ... [2022-12-13 02:15:01,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01" (1/1) ... [2022-12-13 02:15:01,881 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01" (1/1) ... [2022-12-13 02:15:01,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01" (1/1) ... [2022-12-13 02:15:01,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 02:15:01,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 02:15:01,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 02:15:01,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 02:15:01,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01" (1/1) ... [2022-12-13 02:15:01,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:15:01,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:15:01,921 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 02:15:01,936 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 02:15:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 02:15:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 02:15:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 02:15:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 02:15:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 02:15:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 02:15:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 02:15:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 02:15:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 02:15:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 02:15:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 02:15:01,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 02:15:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 02:15:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 02:15:01,961 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 02:15:02,052 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 02:15:02,053 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 02:15:02,222 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 02:15:02,287 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 02:15:02,287 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 02:15:02,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:15:02 BoogieIcfgContainer [2022-12-13 02:15:02,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 02:15:02,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 02:15:02,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 02:15:02,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 02:15:02,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:15:01" (1/3) ... [2022-12-13 02:15:02,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f797d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:15:02, skipping insertion in model container [2022-12-13 02:15:02,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:15:01" (2/3) ... [2022-12-13 02:15:02,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f797d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:15:02, skipping insertion in model container [2022-12-13 02:15:02,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:15:02" (3/3) ... [2022-12-13 02:15:02,313 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-nonblocking-cntr-alt.wvr.c [2022-12-13 02:15:02,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 02:15:02,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 02:15:02,330 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 02:15:02,393 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 02:15:02,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 79 transitions, 174 flow [2022-12-13 02:15:02,506 INFO L130 PetriNetUnfolder]: 6/77 cut-off events. [2022-12-13 02:15:02,507 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:15:02,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 77 events. 6/77 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-13 02:15:02,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 79 transitions, 174 flow [2022-12-13 02:15:02,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 69 transitions, 150 flow [2022-12-13 02:15:02,518 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:02,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 69 transitions, 150 flow [2022-12-13 02:15:02,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 69 transitions, 150 flow [2022-12-13 02:15:02,564 INFO L130 PetriNetUnfolder]: 6/69 cut-off events. [2022-12-13 02:15:02,565 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:15:02,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 69 events. 6/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-13 02:15:02,568 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 69 transitions, 150 flow [2022-12-13 02:15:02,568 INFO L226 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-13 02:15:04,507 INFO L241 LiptonReduction]: Total number of compositions: 54 [2022-12-13 02:15:04,520 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 02:15:04,526 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;@7b0b472a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 02:15:04,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 02:15:04,531 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-13 02:15:04,531 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:15:04,532 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:04,532 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:04,533 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 02:15:04,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:04,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1884038689, now seen corresponding path program 1 times [2022-12-13 02:15:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:04,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92863932] [2022-12-13 02:15:04,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:04,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:04,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:15:04,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:04,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92863932] [2022-12-13 02:15:04,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92863932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:04,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:04,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:04,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790011742] [2022-12-13 02:15:04,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:04,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:15:04,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:04,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:15:04,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:15:04,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-13 02:15:04,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:15:04,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:04,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-13 02:15:04,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:05,017 INFO L130 PetriNetUnfolder]: 54/95 cut-off events. [2022-12-13 02:15:05,017 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 02:15:05,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 95 events. 54/95 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 241 event pairs, 20 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 160. Up to 73 conditions per place. [2022-12-13 02:15:05,019 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 17 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2022-12-13 02:15:05,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 21 transitions, 97 flow [2022-12-13 02:15:05,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:15:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:15:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-12-13 02:15:05,029 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 02:15:05,031 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 4 states and 25 transitions. [2022-12-13 02:15:05,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 21 transitions, 97 flow [2022-12-13 02:15:05,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 21 transitions, 87 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:05,035 INFO L231 Difference]: Finished difference. Result has 20 places, 16 transitions, 48 flow [2022-12-13 02:15:05,037 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=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=48, PETRI_PLACES=20, PETRI_TRANSITIONS=16} [2022-12-13 02:15:05,040 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2022-12-13 02:15:05,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:05,041 INFO L89 Accepts]: Start accepts. Operand has 20 places, 16 transitions, 48 flow [2022-12-13 02:15:05,043 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:05,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:05,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 16 transitions, 48 flow [2022-12-13 02:15:05,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 48 flow [2022-12-13 02:15:05,049 INFO L130 PetriNetUnfolder]: 2/16 cut-off events. [2022-12-13 02:15:05,049 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 02:15:05,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 2/16 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 15. Up to 4 conditions per place. [2022-12-13 02:15:05,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 16 transitions, 48 flow [2022-12-13 02:15:05,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 02:15:05,096 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:05,098 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 02:15:05,098 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 15 transitions, 44 flow [2022-12-13 02:15:05,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:15:05,099 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:05,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:05,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 02:15:05,099 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 02:15:05,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:05,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1484734868, now seen corresponding path program 1 times [2022-12-13 02:15:05,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:05,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474901822] [2022-12-13 02:15:05,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:05,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:05,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:15:05,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:05,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474901822] [2022-12-13 02:15:05,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474901822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:05,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:05,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:05,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680607065] [2022-12-13 02:15:05,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:05,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:15:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:05,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:15:05,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:15:05,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 02:15:05,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:15:05,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:05,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 02:15:05,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:05,259 INFO L130 PetriNetUnfolder]: 51/92 cut-off events. [2022-12-13 02:15:05,259 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-13 02:15:05,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 92 events. 51/92 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 180 event pairs, 24 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 154. Up to 73 conditions per place. [2022-12-13 02:15:05,261 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 19 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2022-12-13 02:15:05,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 22 transitions, 111 flow [2022-12-13 02:15:05,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:15:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:15:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-12-13 02:15:05,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2022-12-13 02:15:05,262 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 44 flow. Second operand 4 states and 23 transitions. [2022-12-13 02:15:05,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 22 transitions, 111 flow [2022-12-13 02:15:05,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 22 transitions, 93 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 02:15:05,263 INFO L231 Difference]: Finished difference. Result has 20 places, 16 transitions, 48 flow [2022-12-13 02:15:05,264 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=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=48, PETRI_PLACES=20, PETRI_TRANSITIONS=16} [2022-12-13 02:15:05,264 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2022-12-13 02:15:05,264 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:05,265 INFO L89 Accepts]: Start accepts. Operand has 20 places, 16 transitions, 48 flow [2022-12-13 02:15:05,265 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:05,265 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:05,266 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 16 transitions, 48 flow [2022-12-13 02:15:05,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 48 flow [2022-12-13 02:15:05,270 INFO L130 PetriNetUnfolder]: 2/16 cut-off events. [2022-12-13 02:15:05,270 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 02:15:05,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 2/16 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 4 conditions per place. [2022-12-13 02:15:05,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 16 transitions, 48 flow [2022-12-13 02:15:05,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 02:15:05,356 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:05,358 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:15:05,359 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 15 transitions, 44 flow [2022-12-13 02:15:05,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:15:05,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:05,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:05,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 02:15:05,360 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 02:15:05,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash -246878708, now seen corresponding path program 1 times [2022-12-13 02:15:05,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:05,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039589625] [2022-12-13 02:15:05,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:05,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:05,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:15:05,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:05,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039589625] [2022-12-13 02:15:05,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039589625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:05,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:05,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:15:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865165454] [2022-12-13 02:15:05,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:05,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:15:05,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:05,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:15:05,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:15:05,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 02:15:05,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 44 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 02:15:05,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:05,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 02:15:05,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:05,733 INFO L130 PetriNetUnfolder]: 74/140 cut-off events. [2022-12-13 02:15:05,733 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-12-13 02:15:05,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 140 events. 74/140 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 412 event pairs, 6 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 89. Up to 73 conditions per place. [2022-12-13 02:15:05,739 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 34 selfloop transitions, 9 changer transitions 5/48 dead transitions. [2022-12-13 02:15:05,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 48 transitions, 242 flow [2022-12-13 02:15:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:15:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:15:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-12-13 02:15:05,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-13 02:15:05,742 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 44 flow. Second operand 7 states and 49 transitions. [2022-12-13 02:15:05,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 48 transitions, 242 flow [2022-12-13 02:15:05,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 48 transitions, 204 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-13 02:15:05,744 INFO L231 Difference]: Finished difference. Result has 26 places, 23 transitions, 94 flow [2022-12-13 02:15:05,744 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=94, PETRI_PLACES=26, PETRI_TRANSITIONS=23} [2022-12-13 02:15:05,746 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2022-12-13 02:15:05,746 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:05,746 INFO L89 Accepts]: Start accepts. Operand has 26 places, 23 transitions, 94 flow [2022-12-13 02:15:05,747 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:05,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:05,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 23 transitions, 94 flow [2022-12-13 02:15:05,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 23 transitions, 94 flow [2022-12-13 02:15:05,760 INFO L130 PetriNetUnfolder]: 10/39 cut-off events. [2022-12-13 02:15:05,761 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-12-13 02:15:05,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 39 events. 10/39 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 85 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 74. Up to 14 conditions per place. [2022-12-13 02:15:05,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 23 transitions, 94 flow [2022-12-13 02:15:05,761 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 02:15:05,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_35 1) (= (+ v_~counter~0_86 1) v_~counter~0_85) (< 0 v_~M1~0_69)) InVars {~counter~0=v_~counter~0_86, ~M1~0=v_~M1~0_69} OutVars{~counter~0=v_~counter~0_85, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_23|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_35, ~M1~0=v_~M1~0_69} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [294] $Ultimate##0-->L54-1: Formula: (and (< 0 v_~M2~0_61) (let ((.cse0 (< 0 v_~counter~0_90))) (or (and .cse0 (= (+ v_~counter~0_89 1) v_~counter~0_90) (= v_thread2Thread1of1ForFork1_~i~1_31 1)) (and (= |v_thread2Thread1of1ForFork1_#t~post4_24| |v_thread2Thread1of1ForFork1_#t~post4_23|) (= v_thread2Thread1of1ForFork1_~i~1_31 0) (= |v_thread2Thread1of1ForFork1_#t~post3_24| |v_thread2Thread1of1ForFork1_#t~post3_23|) (= v_~counter~0_89 v_~counter~0_90) (not .cse0))))) InVars {~counter~0=v_~counter~0_90, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_24|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_24|, ~M2~0=v_~M2~0_61} OutVars{~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_23|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_31, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_23|, ~M2~0=v_~M2~0_61} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3] [2022-12-13 02:15:05,965 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_35 1) (= (+ v_~counter~0_86 1) v_~counter~0_85) (< 0 v_~M1~0_69)) InVars {~counter~0=v_~counter~0_86, ~M1~0=v_~M1~0_69} OutVars{~counter~0=v_~counter~0_85, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_23|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_35, ~M1~0=v_~M1~0_69} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [245] L54-1-->L54-1: Formula: (and (let ((.cse0 (< 0 v_~counter~0_42))) (or (and (= (+ v_thread2Thread1of1ForFork1_~i~1_18 1) v_thread2Thread1of1ForFork1_~i~1_17) (= (+ v_~counter~0_41 1) v_~counter~0_42) .cse0) (and (not .cse0) (= |v_thread2Thread1of1ForFork1_#t~post4_12| |v_thread2Thread1of1ForFork1_#t~post4_11|) (= v_~counter~0_42 v_~counter~0_41) (= |v_thread2Thread1of1ForFork1_#t~post3_12| |v_thread2Thread1of1ForFork1_#t~post3_11|) (= v_thread2Thread1of1ForFork1_~i~1_18 v_thread2Thread1of1ForFork1_~i~1_17)))) (< v_thread2Thread1of1ForFork1_~i~1_18 v_~M2~0_15)) InVars {~counter~0=v_~counter~0_42, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_12|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_18, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_12|, ~M2~0=v_~M2~0_15} OutVars{~counter~0=v_~counter~0_41, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_11|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_17, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_11|, ~M2~0=v_~M2~0_15} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3] [2022-12-13 02:15:06,063 WARN L322 ript$VariableManager]: TermVariable LBE124 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:15:06,063 WARN L322 ript$VariableManager]: TermVariable LBE41 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:15:06,292 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:15:06,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 547 [2022-12-13 02:15:06,293 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 21 transitions, 93 flow [2022-12-13 02:15:06,293 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 02:15:06,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:06,293 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:06,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 02:15:06,294 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 02:15:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:06,294 INFO L85 PathProgramCache]: Analyzing trace with hash -638074659, now seen corresponding path program 1 times [2022-12-13 02:15:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:06,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386360577] [2022-12-13 02:15:06,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:06,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:06,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:15:06,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:06,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386360577] [2022-12-13 02:15:06,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386360577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:06,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:06,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:06,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453165599] [2022-12-13 02:15:06,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:06,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:15:06,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:06,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:15:06,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:15:06,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:15:06,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:15:06,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:06,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:15:06,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:06,459 INFO L130 PetriNetUnfolder]: 77/138 cut-off events. [2022-12-13 02:15:06,460 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-12-13 02:15:06,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 138 events. 77/138 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 12 based on Foata normal form. 12/136 useless extension candidates. Maximal degree in co-relation 410. Up to 84 conditions per place. [2022-12-13 02:15:06,461 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 32 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2022-12-13 02:15:06,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 42 transitions, 252 flow [2022-12-13 02:15:06,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:15:06,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2022-12-13 02:15:06,464 INFO L175 Difference]: Start difference. First operand has 23 places, 21 transitions, 93 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:15:06,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 42 transitions, 252 flow [2022-12-13 02:15:06,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 42 transitions, 242 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 02:15:06,466 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 158 flow [2022-12-13 02:15:06,466 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2022-12-13 02:15:06,467 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 8 predicate places. [2022-12-13 02:15:06,467 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:06,467 INFO L89 Accepts]: Start accepts. Operand has 28 places, 26 transitions, 158 flow [2022-12-13 02:15:06,468 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:06,468 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:06,468 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 26 transitions, 158 flow [2022-12-13 02:15:06,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 26 transitions, 158 flow [2022-12-13 02:15:06,474 INFO L130 PetriNetUnfolder]: 13/46 cut-off events. [2022-12-13 02:15:06,474 INFO L131 PetriNetUnfolder]: For 36/44 co-relation queries the response was YES. [2022-12-13 02:15:06,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 46 events. 13/46 cut-off events. For 36/44 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 117 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 96. Up to 18 conditions per place. [2022-12-13 02:15:06,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 26 transitions, 158 flow [2022-12-13 02:15:06,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-13 02:15:06,476 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:15:06,477 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 02:15:06,477 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 158 flow [2022-12-13 02:15:06,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:15:06,477 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:06,477 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:06,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 02:15:06,478 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 02:15:06,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:06,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1388189997, now seen corresponding path program 1 times [2022-12-13 02:15:06,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:06,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71302819] [2022-12-13 02:15:06,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:06,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:06,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:06,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71302819] [2022-12-13 02:15:06,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71302819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:06,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:06,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803506041] [2022-12-13 02:15:06,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:06,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:06,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:06,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:06,573 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:15:06,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 02:15:06,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:06,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:15:06,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:06,685 INFO L130 PetriNetUnfolder]: 112/205 cut-off events. [2022-12-13 02:15:06,685 INFO L131 PetriNetUnfolder]: For 294/294 co-relation queries the response was YES. [2022-12-13 02:15:06,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 205 events. 112/205 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 648 event pairs, 21 based on Foata normal form. 4/209 useless extension candidates. Maximal degree in co-relation 361. Up to 77 conditions per place. [2022-12-13 02:15:06,687 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 35 selfloop transitions, 9 changer transitions 8/52 dead transitions. [2022-12-13 02:15:06,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 52 transitions, 353 flow [2022-12-13 02:15:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-13 02:15:06,689 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2022-12-13 02:15:06,689 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 158 flow. Second operand 5 states and 47 transitions. [2022-12-13 02:15:06,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 52 transitions, 353 flow [2022-12-13 02:15:06,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 52 transitions, 335 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 02:15:06,697 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 174 flow [2022-12-13 02:15:06,697 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2022-12-13 02:15:06,699 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 13 predicate places. [2022-12-13 02:15:06,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:06,700 INFO L89 Accepts]: Start accepts. Operand has 33 places, 27 transitions, 174 flow [2022-12-13 02:15:06,701 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:06,701 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:06,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 174 flow [2022-12-13 02:15:06,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 174 flow [2022-12-13 02:15:06,708 INFO L130 PetriNetUnfolder]: 14/57 cut-off events. [2022-12-13 02:15:06,708 INFO L131 PetriNetUnfolder]: For 67/74 co-relation queries the response was YES. [2022-12-13 02:15:06,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 57 events. 14/57 cut-off events. For 67/74 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 172 event pairs, 1 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 123. Up to 17 conditions per place. [2022-12-13 02:15:06,709 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 174 flow [2022-12-13 02:15:06,710 INFO L226 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-13 02:15:06,718 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [296] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~i~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (< 0 v_~M1~0_73) (= (+ v_~counter~0_100 1) v_~counter~0_99) (not (< v_thread1Thread1of1ForFork0_~i~0_43 v_~M1~0_73))) InVars {~counter~0=v_~counter~0_100, ~M1~0=v_~M1~0_73} OutVars{~counter~0=v_~counter~0_99, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_29|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_25|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_43, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, ~M1~0=v_~M1~0_73} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_#res.offset] and [245] L54-1-->L54-1: Formula: (and (let ((.cse0 (< 0 v_~counter~0_42))) (or (and (= (+ v_thread2Thread1of1ForFork1_~i~1_18 1) v_thread2Thread1of1ForFork1_~i~1_17) (= (+ v_~counter~0_41 1) v_~counter~0_42) .cse0) (and (not .cse0) (= |v_thread2Thread1of1ForFork1_#t~post4_12| |v_thread2Thread1of1ForFork1_#t~post4_11|) (= v_~counter~0_42 v_~counter~0_41) (= |v_thread2Thread1of1ForFork1_#t~post3_12| |v_thread2Thread1of1ForFork1_#t~post3_11|) (= v_thread2Thread1of1ForFork1_~i~1_18 v_thread2Thread1of1ForFork1_~i~1_17)))) (< v_thread2Thread1of1ForFork1_~i~1_18 v_~M2~0_15)) InVars {~counter~0=v_~counter~0_42, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_12|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_18, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_12|, ~M2~0=v_~M2~0_15} OutVars{~counter~0=v_~counter~0_41, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_11|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_17, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_11|, ~M2~0=v_~M2~0_15} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3] [2022-12-13 02:15:06,832 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:06,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:15:06,833 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 168 flow [2022-12-13 02:15:06,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 02:15:06,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:06,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:06,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 02:15:06,834 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 02:15:06,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:06,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2103859190, now seen corresponding path program 1 times [2022-12-13 02:15:06,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:06,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566193485] [2022-12-13 02:15:06,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:06,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:06,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:15:06,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:06,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566193485] [2022-12-13 02:15:06,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566193485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:06,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:06,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:06,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389056102] [2022-12-13 02:15:06,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:06,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:06,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:06,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:06,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:06,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 02:15:06,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 168 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 02:15:06,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:06,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 02:15:06,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:07,165 INFO L130 PetriNetUnfolder]: 120/228 cut-off events. [2022-12-13 02:15:07,165 INFO L131 PetriNetUnfolder]: For 509/509 co-relation queries the response was YES. [2022-12-13 02:15:07,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 228 events. 120/228 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 795 event pairs, 29 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 649. Up to 141 conditions per place. [2022-12-13 02:15:07,167 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 39 selfloop transitions, 7 changer transitions 6/52 dead transitions. [2022-12-13 02:15:07,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 378 flow [2022-12-13 02:15:07,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:15:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:15:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-13 02:15:07,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4351851851851852 [2022-12-13 02:15:07,168 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 168 flow. Second operand 6 states and 47 transitions. [2022-12-13 02:15:07,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 52 transitions, 378 flow [2022-12-13 02:15:07,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 354 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 02:15:07,171 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 187 flow [2022-12-13 02:15:07,171 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-12-13 02:15:07,172 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-13 02:15:07,172 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:07,172 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 187 flow [2022-12-13 02:15:07,173 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:07,173 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:07,173 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 187 flow [2022-12-13 02:15:07,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 187 flow [2022-12-13 02:15:07,181 INFO L130 PetriNetUnfolder]: 14/68 cut-off events. [2022-12-13 02:15:07,181 INFO L131 PetriNetUnfolder]: For 77/82 co-relation queries the response was YES. [2022-12-13 02:15:07,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 68 events. 14/68 cut-off events. For 77/82 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 254 event pairs, 1 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 169. Up to 20 conditions per place. [2022-12-13 02:15:07,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 187 flow [2022-12-13 02:15:07,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-13 02:15:07,183 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:15:07,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 02:15:07,184 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 187 flow [2022-12-13 02:15:07,184 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 02:15:07,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:07,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:07,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 02:15:07,185 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 02:15:07,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2020742300, now seen corresponding path program 2 times [2022-12-13 02:15:07,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:07,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903168161] [2022-12-13 02:15:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:07,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:07,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:15:07,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:07,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903168161] [2022-12-13 02:15:07,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903168161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:07,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:07,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:07,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80052271] [2022-12-13 02:15:07,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:07,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:07,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:07,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:07,347 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 02:15:07,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 187 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 02:15:07,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:07,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 02:15:07,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:07,483 INFO L130 PetriNetUnfolder]: 117/219 cut-off events. [2022-12-13 02:15:07,483 INFO L131 PetriNetUnfolder]: For 541/541 co-relation queries the response was YES. [2022-12-13 02:15:07,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 219 events. 117/219 cut-off events. For 541/541 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 725 event pairs, 33 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 844. Up to 141 conditions per place. [2022-12-13 02:15:07,485 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 34 selfloop transitions, 8 changer transitions 8/50 dead transitions. [2022-12-13 02:15:07,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 383 flow [2022-12-13 02:15:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:15:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:15:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-13 02:15:07,487 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 02:15:07,487 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 187 flow. Second operand 6 states and 45 transitions. [2022-12-13 02:15:07,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 383 flow [2022-12-13 02:15:07,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 361 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 02:15:07,490 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 206 flow [2022-12-13 02:15:07,490 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-12-13 02:15:07,490 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 21 predicate places. [2022-12-13 02:15:07,491 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:07,491 INFO L89 Accepts]: Start accepts. Operand has 41 places, 29 transitions, 206 flow [2022-12-13 02:15:07,491 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:07,491 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:07,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 206 flow [2022-12-13 02:15:07,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 206 flow [2022-12-13 02:15:07,498 INFO L130 PetriNetUnfolder]: 15/62 cut-off events. [2022-12-13 02:15:07,498 INFO L131 PetriNetUnfolder]: For 123/130 co-relation queries the response was YES. [2022-12-13 02:15:07,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 62 events. 15/62 cut-off events. For 123/130 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 200 event pairs, 1 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 172. Up to 17 conditions per place. [2022-12-13 02:15:07,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 206 flow [2022-12-13 02:15:07,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-13 02:15:07,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [289] L54-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork1_~i~1_In_1 v_~M2~0_In_1)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~M2~0=v_~M2~0_In_1, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_1, ~M2~0=v_~M2~0_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [288] L41-4-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_32 v_~M1~0_67) (= (+ v_~counter~0_82 1) v_~counter~0_81) (= v_thread1Thread1of1ForFork0_~i~0_31 (+ v_thread1Thread1of1ForFork0_~i~0_32 1))) InVars {~counter~0=v_~counter~0_82, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_32, ~M1~0=v_~M1~0_67} OutVars{~counter~0=v_~counter~0_81, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_31, ~M1~0=v_~M1~0_67} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 02:15:07,555 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:07,556 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 02:15:07,556 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 204 flow [2022-12-13 02:15:07,556 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 02:15:07,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:07,557 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:07,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 02:15:07,557 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 02:15:07,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:07,557 INFO L85 PathProgramCache]: Analyzing trace with hash -300989494, now seen corresponding path program 1 times [2022-12-13 02:15:07,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:07,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997037094] [2022-12-13 02:15:07,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:07,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:07,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:15:07,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:07,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997037094] [2022-12-13 02:15:07,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997037094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:07,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:07,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:07,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789793688] [2022-12-13 02:15:07,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:07,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:07,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:07,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:07,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:07,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:15:07,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 204 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 02:15:07,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:07,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:15:07,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:07,959 INFO L130 PetriNetUnfolder]: 118/214 cut-off events. [2022-12-13 02:15:07,959 INFO L131 PetriNetUnfolder]: For 696/696 co-relation queries the response was YES. [2022-12-13 02:15:07,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 214 events. 118/214 cut-off events. For 696/696 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 683 event pairs, 25 based on Foata normal form. 1/215 useless extension candidates. Maximal degree in co-relation 851. Up to 147 conditions per place. [2022-12-13 02:15:07,961 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 34 selfloop transitions, 10 changer transitions 10/54 dead transitions. [2022-12-13 02:15:07,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 415 flow [2022-12-13 02:15:07,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:15:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:15:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-12-13 02:15:07,962 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37593984962406013 [2022-12-13 02:15:07,962 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 204 flow. Second operand 7 states and 50 transitions. [2022-12-13 02:15:07,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 415 flow [2022-12-13 02:15:07,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 387 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-13 02:15:07,965 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 217 flow [2022-12-13 02:15:07,966 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-12-13 02:15:07,966 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 22 predicate places. [2022-12-13 02:15:07,966 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:07,966 INFO L89 Accepts]: Start accepts. Operand has 42 places, 29 transitions, 217 flow [2022-12-13 02:15:07,967 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:07,967 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:07,967 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 29 transitions, 217 flow [2022-12-13 02:15:07,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 217 flow [2022-12-13 02:15:07,974 INFO L130 PetriNetUnfolder]: 16/63 cut-off events. [2022-12-13 02:15:07,974 INFO L131 PetriNetUnfolder]: For 114/121 co-relation queries the response was YES. [2022-12-13 02:15:07,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 63 events. 16/63 cut-off events. For 114/121 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 202 event pairs, 1 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 182. Up to 21 conditions per place. [2022-12-13 02:15:07,975 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 217 flow [2022-12-13 02:15:07,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-13 02:15:08,022 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] $Ultimate##0-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_39 (+ v_~M1~0_71 1)) (= 2 v_thread1Thread1of1ForFork0_~i~0_39) (= (+ 2 v_~counter~0_95) v_~counter~0_93)) InVars {~counter~0=v_~counter~0_95, ~M1~0=v_~M1~0_71} OutVars{~counter~0=v_~counter~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_25|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_39, ~M1~0=v_~M1~0_71} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [245] L54-1-->L54-1: Formula: (and (let ((.cse0 (< 0 v_~counter~0_42))) (or (and (= (+ v_thread2Thread1of1ForFork1_~i~1_18 1) v_thread2Thread1of1ForFork1_~i~1_17) (= (+ v_~counter~0_41 1) v_~counter~0_42) .cse0) (and (not .cse0) (= |v_thread2Thread1of1ForFork1_#t~post4_12| |v_thread2Thread1of1ForFork1_#t~post4_11|) (= v_~counter~0_42 v_~counter~0_41) (= |v_thread2Thread1of1ForFork1_#t~post3_12| |v_thread2Thread1of1ForFork1_#t~post3_11|) (= v_thread2Thread1of1ForFork1_~i~1_18 v_thread2Thread1of1ForFork1_~i~1_17)))) (< v_thread2Thread1of1ForFork1_~i~1_18 v_~M2~0_15)) InVars {~counter~0=v_~counter~0_42, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_12|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_18, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_12|, ~M2~0=v_~M2~0_15} OutVars{~counter~0=v_~counter~0_41, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_11|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_17, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_11|, ~M2~0=v_~M2~0_15} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3] [2022-12-13 02:15:08,118 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:08,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-13 02:15:08,119 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 235 flow [2022-12-13 02:15:08,119 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 02:15:08,119 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:08,119 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:08,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 02:15:08,119 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 02:15:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:08,120 INFO L85 PathProgramCache]: Analyzing trace with hash -246734803, now seen corresponding path program 1 times [2022-12-13 02:15:08,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:08,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584540908] [2022-12-13 02:15:08,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:08,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:08,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:15:08,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:08,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584540908] [2022-12-13 02:15:08,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584540908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:08,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:08,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:08,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782741873] [2022-12-13 02:15:08,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:08,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:08,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:08,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:08,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:08,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 02:15:08,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 235 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 02:15:08,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:08,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 02:15:08,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:08,360 INFO L130 PetriNetUnfolder]: 108/202 cut-off events. [2022-12-13 02:15:08,360 INFO L131 PetriNetUnfolder]: For 649/649 co-relation queries the response was YES. [2022-12-13 02:15:08,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 202 events. 108/202 cut-off events. For 649/649 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 648 event pairs, 29 based on Foata normal form. 1/201 useless extension candidates. Maximal degree in co-relation 841. Up to 151 conditions per place. [2022-12-13 02:15:08,362 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 33 selfloop transitions, 9 changer transitions 6/48 dead transitions. [2022-12-13 02:15:08,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 409 flow [2022-12-13 02:15:08,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:15:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:15:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-12-13 02:15:08,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2022-12-13 02:15:08,363 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 235 flow. Second operand 6 states and 43 transitions. [2022-12-13 02:15:08,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 409 flow [2022-12-13 02:15:08,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 372 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 02:15:08,366 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 222 flow [2022-12-13 02:15:08,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-12-13 02:15:08,367 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 22 predicate places. [2022-12-13 02:15:08,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:08,367 INFO L89 Accepts]: Start accepts. Operand has 42 places, 29 transitions, 222 flow [2022-12-13 02:15:08,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:08,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:08,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 29 transitions, 222 flow [2022-12-13 02:15:08,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 222 flow [2022-12-13 02:15:08,374 INFO L130 PetriNetUnfolder]: 15/56 cut-off events. [2022-12-13 02:15:08,374 INFO L131 PetriNetUnfolder]: For 130/134 co-relation queries the response was YES. [2022-12-13 02:15:08,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 56 events. 15/56 cut-off events. For 130/134 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 160 event pairs, 1 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 171. Up to 18 conditions per place. [2022-12-13 02:15:08,375 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 222 flow [2022-12-13 02:15:08,375 INFO L226 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-13 02:15:08,458 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:08,459 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:15:08,459 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 218 flow [2022-12-13 02:15:08,459 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 02:15:08,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:08,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:08,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 02:15:08,460 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 02:15:08,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:08,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1806461050, now seen corresponding path program 1 times [2022-12-13 02:15:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:08,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451979283] [2022-12-13 02:15:08,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:08,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:08,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:15:08,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:08,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451979283] [2022-12-13 02:15:08,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451979283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:08,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:08,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:15:08,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33329466] [2022-12-13 02:15:08,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:08,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:15:08,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:08,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:15:08,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:15:08,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 02:15:08,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 218 flow. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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 02:15:08,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:08,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 02:15:08,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:08,839 INFO L130 PetriNetUnfolder]: 122/222 cut-off events. [2022-12-13 02:15:08,839 INFO L131 PetriNetUnfolder]: For 648/648 co-relation queries the response was YES. [2022-12-13 02:15:08,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 222 events. 122/222 cut-off events. For 648/648 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 701 event pairs, 22 based on Foata normal form. 1/223 useless extension candidates. Maximal degree in co-relation 921. Up to 149 conditions per place. [2022-12-13 02:15:08,841 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 42 selfloop transitions, 12 changer transitions 5/59 dead transitions. [2022-12-13 02:15:08,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 461 flow [2022-12-13 02:15:08,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:15:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:15:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-12-13 02:15:08,842 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2022-12-13 02:15:08,843 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 218 flow. Second operand 7 states and 54 transitions. [2022-12-13 02:15:08,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 461 flow [2022-12-13 02:15:08,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 427 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 02:15:08,846 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 268 flow [2022-12-13 02:15:08,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=268, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-13 02:15:08,847 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2022-12-13 02:15:08,847 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:08,847 INFO L89 Accepts]: Start accepts. Operand has 43 places, 33 transitions, 268 flow [2022-12-13 02:15:08,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:08,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:08,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 268 flow [2022-12-13 02:15:08,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 268 flow [2022-12-13 02:15:08,855 INFO L130 PetriNetUnfolder]: 18/66 cut-off events. [2022-12-13 02:15:08,855 INFO L131 PetriNetUnfolder]: For 167/171 co-relation queries the response was YES. [2022-12-13 02:15:08,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 66 events. 18/66 cut-off events. For 167/171 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 215 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 218. Up to 23 conditions per place. [2022-12-13 02:15:08,856 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 268 flow [2022-12-13 02:15:08,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-13 02:15:08,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] $Ultimate##0-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_39 (+ v_~M1~0_71 1)) (= 2 v_thread1Thread1of1ForFork0_~i~0_39) (= (+ 2 v_~counter~0_95) v_~counter~0_93)) InVars {~counter~0=v_~counter~0_95, ~M1~0=v_~M1~0_71} OutVars{~counter~0=v_~counter~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_25|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_39, ~M1~0=v_~M1~0_71} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [294] $Ultimate##0-->L54-1: Formula: (and (< 0 v_~M2~0_61) (let ((.cse0 (< 0 v_~counter~0_90))) (or (and .cse0 (= (+ v_~counter~0_89 1) v_~counter~0_90) (= v_thread2Thread1of1ForFork1_~i~1_31 1)) (and (= |v_thread2Thread1of1ForFork1_#t~post4_24| |v_thread2Thread1of1ForFork1_#t~post4_23|) (= v_thread2Thread1of1ForFork1_~i~1_31 0) (= |v_thread2Thread1of1ForFork1_#t~post3_24| |v_thread2Thread1of1ForFork1_#t~post3_23|) (= v_~counter~0_89 v_~counter~0_90) (not .cse0))))) InVars {~counter~0=v_~counter~0_90, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_24|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_24|, ~M2~0=v_~M2~0_61} OutVars{~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_23|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_31, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_23|, ~M2~0=v_~M2~0_61} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3] [2022-12-13 02:15:09,052 WARN L322 ript$VariableManager]: TermVariable LBE124 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:15:09,052 WARN L322 ript$VariableManager]: TermVariable LBE41 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:15:09,277 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:15:09,277 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 430 [2022-12-13 02:15:09,278 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 270 flow [2022-12-13 02:15:09,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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 02:15:09,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:09,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:09,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 02:15:09,278 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 02:15:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:09,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1816158580, now seen corresponding path program 1 times [2022-12-13 02:15:09,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:09,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355909567] [2022-12-13 02:15:09,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:09,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:09,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:15:09,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:09,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355909567] [2022-12-13 02:15:09,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355909567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:09,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:09,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:15:09,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310360346] [2022-12-13 02:15:09,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:09,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:15:09,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:09,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:15:09,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:15:09,454 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 02:15:09,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 270 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 02:15:09,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:09,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 02:15:09,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:09,614 INFO L130 PetriNetUnfolder]: 115/209 cut-off events. [2022-12-13 02:15:09,614 INFO L131 PetriNetUnfolder]: For 1059/1059 co-relation queries the response was YES. [2022-12-13 02:15:09,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 209 events. 115/209 cut-off events. For 1059/1059 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 649 event pairs, 25 based on Foata normal form. 1/210 useless extension candidates. Maximal degree in co-relation 972. Up to 158 conditions per place. [2022-12-13 02:15:09,616 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 34 selfloop transitions, 11 changer transitions 5/50 dead transitions. [2022-12-13 02:15:09,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 461 flow [2022-12-13 02:15:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:15:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:15:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 02:15:09,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 02:15:09,617 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 270 flow. Second operand 6 states and 46 transitions. [2022-12-13 02:15:09,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 461 flow [2022-12-13 02:15:09,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 406 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:09,621 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 269 flow [2022-12-13 02:15:09,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-13 02:15:09,622 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2022-12-13 02:15:09,622 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:09,622 INFO L89 Accepts]: Start accepts. Operand has 43 places, 32 transitions, 269 flow [2022-12-13 02:15:09,622 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:09,622 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:09,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 269 flow [2022-12-13 02:15:09,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 269 flow [2022-12-13 02:15:09,630 INFO L130 PetriNetUnfolder]: 18/61 cut-off events. [2022-12-13 02:15:09,630 INFO L131 PetriNetUnfolder]: For 159/169 co-relation queries the response was YES. [2022-12-13 02:15:09,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 61 events. 18/61 cut-off events. For 159/169 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 167 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 208. Up to 20 conditions per place. [2022-12-13 02:15:09,631 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 269 flow [2022-12-13 02:15:09,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-13 02:15:09,711 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:09,712 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-13 02:15:09,712 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 263 flow [2022-12-13 02:15:09,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 02:15:09,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:09,712 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:09,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 02:15:09,713 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 02:15:09,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:09,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2016782445, now seen corresponding path program 1 times [2022-12-13 02:15:09,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:09,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762051739] [2022-12-13 02:15:09,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:09,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:09,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 02:15:09,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:09,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762051739] [2022-12-13 02:15:09,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762051739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:09,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:09,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:09,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80436687] [2022-12-13 02:15:09,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:09,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:09,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:09,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:09,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:09,872 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 02:15:09,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 263 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 02:15:09,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:09,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 02:15:09,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:10,000 INFO L130 PetriNetUnfolder]: 119/215 cut-off events. [2022-12-13 02:15:10,000 INFO L131 PetriNetUnfolder]: For 747/747 co-relation queries the response was YES. [2022-12-13 02:15:10,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 215 events. 119/215 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 680 event pairs, 22 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 938. Up to 149 conditions per place. [2022-12-13 02:15:10,002 INFO L137 encePairwiseOnDemand]: 11/23 looper letters, 39 selfloop transitions, 11 changer transitions 5/55 dead transitions. [2022-12-13 02:15:10,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 461 flow [2022-12-13 02:15:10,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:15:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:15:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-12-13 02:15:10,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36231884057971014 [2022-12-13 02:15:10,004 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 263 flow. Second operand 6 states and 50 transitions. [2022-12-13 02:15:10,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 461 flow [2022-12-13 02:15:10,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 423 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 02:15:10,010 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 267 flow [2022-12-13 02:15:10,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-13 02:15:10,011 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2022-12-13 02:15:10,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:10,011 INFO L89 Accepts]: Start accepts. Operand has 43 places, 32 transitions, 267 flow [2022-12-13 02:15:10,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:10,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:10,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 267 flow [2022-12-13 02:15:10,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 267 flow [2022-12-13 02:15:10,018 INFO L130 PetriNetUnfolder]: 18/65 cut-off events. [2022-12-13 02:15:10,019 INFO L131 PetriNetUnfolder]: For 161/176 co-relation queries the response was YES. [2022-12-13 02:15:10,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 65 events. 18/65 cut-off events. For 161/176 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/61 useless extension candidates. Maximal degree in co-relation 211. Up to 21 conditions per place. [2022-12-13 02:15:10,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 267 flow [2022-12-13 02:15:10,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-13 02:15:10,028 WARN L322 ript$VariableManager]: TermVariable LBE124 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:15:10,028 WARN L322 ript$VariableManager]: TermVariable LBE41 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:15:10,381 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:10,382 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 371 [2022-12-13 02:15:10,382 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 263 flow [2022-12-13 02:15:10,382 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 02:15:10,382 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:10,382 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:10,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 02:15:10,383 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 02:15:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:10,383 INFO L85 PathProgramCache]: Analyzing trace with hash 10927556, now seen corresponding path program 1 times [2022-12-13 02:15:10,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:10,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000074447] [2022-12-13 02:15:10,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:10,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:10,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:15:10,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:10,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000074447] [2022-12-13 02:15:10,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000074447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:10,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:10,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:10,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326516227] [2022-12-13 02:15:10,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:10,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:10,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:10,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:10,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:10,499 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 02:15:10,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 263 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 02:15:10,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:10,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 02:15:10,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:10,629 INFO L130 PetriNetUnfolder]: 115/209 cut-off events. [2022-12-13 02:15:10,629 INFO L131 PetriNetUnfolder]: For 767/767 co-relation queries the response was YES. [2022-12-13 02:15:10,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 209 events. 115/209 cut-off events. For 767/767 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 647 event pairs, 25 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 936. Up to 158 conditions per place. [2022-12-13 02:15:10,632 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 34 selfloop transitions, 11 changer transitions 5/50 dead transitions. [2022-12-13 02:15:10,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 448 flow [2022-12-13 02:15:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:15:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:15:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 02:15:10,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 02:15:10,633 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 263 flow. Second operand 6 states and 46 transitions. [2022-12-13 02:15:10,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 448 flow [2022-12-13 02:15:10,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 406 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-13 02:15:10,636 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 269 flow [2022-12-13 02:15:10,637 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-13 02:15:10,637 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2022-12-13 02:15:10,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:10,637 INFO L89 Accepts]: Start accepts. Operand has 43 places, 32 transitions, 269 flow [2022-12-13 02:15:10,638 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:10,638 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:10,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 269 flow [2022-12-13 02:15:10,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 269 flow [2022-12-13 02:15:10,645 INFO L130 PetriNetUnfolder]: 18/61 cut-off events. [2022-12-13 02:15:10,645 INFO L131 PetriNetUnfolder]: For 159/174 co-relation queries the response was YES. [2022-12-13 02:15:10,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 61 events. 18/61 cut-off events. For 159/174 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 167 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 208. Up to 20 conditions per place. [2022-12-13 02:15:10,646 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 269 flow [2022-12-13 02:15:10,646 INFO L226 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-13 02:15:10,737 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:10,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:15:10,740 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 263 flow [2022-12-13 02:15:10,740 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 02:15:10,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:10,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:10,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 02:15:10,740 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 02:15:10,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:10,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2102669898, now seen corresponding path program 1 times [2022-12-13 02:15:10,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:10,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948769463] [2022-12-13 02:15:10,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:10,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:10,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:15:10,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:10,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948769463] [2022-12-13 02:15:10,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948769463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:10,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:10,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:10,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453412963] [2022-12-13 02:15:10,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:10,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:10,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:10,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:10,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:10,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 02:15:10,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 02:15:10,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:10,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 02:15:10,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:10,928 INFO L130 PetriNetUnfolder]: 143/254 cut-off events. [2022-12-13 02:15:10,928 INFO L131 PetriNetUnfolder]: For 959/959 co-relation queries the response was YES. [2022-12-13 02:15:10,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 254 events. 143/254 cut-off events. For 959/959 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 846 event pairs, 21 based on Foata normal form. 24/274 useless extension candidates. Maximal degree in co-relation 1118. Up to 147 conditions per place. [2022-12-13 02:15:10,931 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 35 selfloop transitions, 16 changer transitions 10/61 dead transitions. [2022-12-13 02:15:10,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 536 flow [2022-12-13 02:15:10,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:15:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:15:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-12-13 02:15:10,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39855072463768115 [2022-12-13 02:15:10,932 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 263 flow. Second operand 6 states and 55 transitions. [2022-12-13 02:15:10,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 536 flow [2022-12-13 02:15:10,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 488 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-13 02:15:10,937 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 320 flow [2022-12-13 02:15:10,937 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2022-12-13 02:15:10,937 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2022-12-13 02:15:10,937 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:10,937 INFO L89 Accepts]: Start accepts. Operand has 44 places, 34 transitions, 320 flow [2022-12-13 02:15:10,938 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:10,938 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:10,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 34 transitions, 320 flow [2022-12-13 02:15:10,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 34 transitions, 320 flow [2022-12-13 02:15:10,946 INFO L130 PetriNetUnfolder]: 21/74 cut-off events. [2022-12-13 02:15:10,947 INFO L131 PetriNetUnfolder]: For 199/205 co-relation queries the response was YES. [2022-12-13 02:15:10,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 74 events. 21/74 cut-off events. For 199/205 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 255 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 247. Up to 25 conditions per place. [2022-12-13 02:15:10,948 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 34 transitions, 320 flow [2022-12-13 02:15:10,948 INFO L226 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-13 02:15:11,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [297] $Ultimate##0-->L54-1: Formula: (and (< 0 v_~M2~0_63) (< 0 v_~M1~0_75) (= v_thread1Thread1of1ForFork0_~i~0_45 1) (let ((.cse1 (+ v_~counter~0_105 1))) (let ((.cse0 (< 0 .cse1))) (or (and (= v_~counter~0_103 v_~counter~0_105) .cse0 (= v_thread2Thread1of1ForFork1_~i~1_35 1)) (and (= v_~counter~0_103 .cse1) (not .cse0) (= v_thread2Thread1of1ForFork1_~i~1_35 0) (= |v_thread2Thread1of1ForFork1_#t~post3_28| |v_thread2Thread1of1ForFork1_#t~post3_27|) (= |v_thread2Thread1of1ForFork1_#t~post4_28| |v_thread2Thread1of1ForFork1_#t~post4_27|)))))) InVars {~counter~0=v_~counter~0_105, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_28|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_28|, ~M2~0=v_~M2~0_63, ~M1~0=v_~M1~0_75} OutVars{~counter~0=v_~counter~0_103, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_27|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_35, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_27|, ~M2~0=v_~M2~0_63, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_31|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_45, ~M1~0=v_~M1~0_75} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [288] L41-4-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_32 v_~M1~0_67) (= (+ v_~counter~0_82 1) v_~counter~0_81) (= v_thread1Thread1of1ForFork0_~i~0_31 (+ v_thread1Thread1of1ForFork0_~i~0_32 1))) InVars {~counter~0=v_~counter~0_82, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_32, ~M1~0=v_~M1~0_67} OutVars{~counter~0=v_~counter~0_81, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_31, ~M1~0=v_~M1~0_67} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 02:15:11,206 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:11,207 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 270 [2022-12-13 02:15:11,207 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 338 flow [2022-12-13 02:15:11,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 02:15:11,208 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:11,208 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:11,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 02:15:11,208 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 02:15:11,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:11,208 INFO L85 PathProgramCache]: Analyzing trace with hash 442745643, now seen corresponding path program 1 times [2022-12-13 02:15:11,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:11,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753466804] [2022-12-13 02:15:11,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:11,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15: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:15:11,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:11,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753466804] [2022-12-13 02:15:11,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753466804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:11,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:11,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:11,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899510574] [2022-12-13 02:15:11,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:11,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:11,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:11,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:11,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:11,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 02:15:11,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 338 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 02:15:11,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:11,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 02:15:11,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:11,375 INFO L130 PetriNetUnfolder]: 135/243 cut-off events. [2022-12-13 02:15:11,376 INFO L131 PetriNetUnfolder]: For 1338/1338 co-relation queries the response was YES. [2022-12-13 02:15:11,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 243 events. 135/243 cut-off events. For 1338/1338 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 828 event pairs, 33 based on Foata normal form. 1/244 useless extension candidates. Maximal degree in co-relation 1101. Up to 177 conditions per place. [2022-12-13 02:15:11,378 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 35 selfloop transitions, 11 changer transitions 5/51 dead transitions. [2022-12-13 02:15:11,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 515 flow [2022-12-13 02:15:11,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-13 02:15:11,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2022-12-13 02:15:11,379 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 338 flow. Second operand 5 states and 42 transitions. [2022-12-13 02:15:11,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 515 flow [2022-12-13 02:15:11,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 477 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 02:15:11,383 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 342 flow [2022-12-13 02:15:11,383 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=342, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2022-12-13 02:15:11,384 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 26 predicate places. [2022-12-13 02:15:11,384 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:11,384 INFO L89 Accepts]: Start accepts. Operand has 46 places, 35 transitions, 342 flow [2022-12-13 02:15:11,384 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:11,385 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:11,385 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 342 flow [2022-12-13 02:15:11,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 342 flow [2022-12-13 02:15:11,392 INFO L130 PetriNetUnfolder]: 21/75 cut-off events. [2022-12-13 02:15:11,393 INFO L131 PetriNetUnfolder]: For 292/300 co-relation queries the response was YES. [2022-12-13 02:15:11,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 75 events. 21/75 cut-off events. For 292/300 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 268 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 282. Up to 28 conditions per place. [2022-12-13 02:15:11,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 342 flow [2022-12-13 02:15:11,394 INFO L226 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-13 02:15:11,497 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:11,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 02:15:11,498 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 332 flow [2022-12-13 02:15:11,498 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 02:15:11,498 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:11,498 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:11,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 02:15:11,498 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 02:15:11,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:11,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1786559945, now seen corresponding path program 1 times [2022-12-13 02:15:11,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:11,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239111648] [2022-12-13 02:15:11,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:11,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:11,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:15:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:11,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239111648] [2022-12-13 02:15:11,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239111648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:11,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:11,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072060800] [2022-12-13 02:15:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:11,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:11,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:11,669 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 02:15:11,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 332 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 02:15:11,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:11,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 02:15:11,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:11,828 INFO L130 PetriNetUnfolder]: 163/302 cut-off events. [2022-12-13 02:15:11,828 INFO L131 PetriNetUnfolder]: For 1630/1630 co-relation queries the response was YES. [2022-12-13 02:15:11,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 302 events. 163/302 cut-off events. For 1630/1630 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1157 event pairs, 29 based on Foata normal form. 2/304 useless extension candidates. Maximal degree in co-relation 1432. Up to 193 conditions per place. [2022-12-13 02:15:11,831 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 41 selfloop transitions, 17 changer transitions 5/63 dead transitions. [2022-12-13 02:15:11,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 622 flow [2022-12-13 02:15:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:15:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:15:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-13 02:15:11,832 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2022-12-13 02:15:11,832 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 332 flow. Second operand 6 states and 51 transitions. [2022-12-13 02:15:11,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 622 flow [2022-12-13 02:15:11,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 582 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:11,837 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 427 flow [2022-12-13 02:15:11,837 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=427, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2022-12-13 02:15:11,837 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 28 predicate places. [2022-12-13 02:15:11,838 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:11,838 INFO L89 Accepts]: Start accepts. Operand has 48 places, 41 transitions, 427 flow [2022-12-13 02:15:11,838 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:11,838 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:11,838 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 41 transitions, 427 flow [2022-12-13 02:15:11,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 427 flow [2022-12-13 02:15:11,848 INFO L130 PetriNetUnfolder]: 28/103 cut-off events. [2022-12-13 02:15:11,849 INFO L131 PetriNetUnfolder]: For 436/445 co-relation queries the response was YES. [2022-12-13 02:15:11,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 103 events. 28/103 cut-off events. For 436/445 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 433 event pairs, 1 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 411. Up to 34 conditions per place. [2022-12-13 02:15:11,850 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 41 transitions, 427 flow [2022-12-13 02:15:11,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-13 02:15:11,854 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L41-4-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~i~0_In_1 v_~M1~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, ~M1~0=v_~M1~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~M1~0=v_~M1~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [245] L54-1-->L54-1: Formula: (and (let ((.cse0 (< 0 v_~counter~0_42))) (or (and (= (+ v_thread2Thread1of1ForFork1_~i~1_18 1) v_thread2Thread1of1ForFork1_~i~1_17) (= (+ v_~counter~0_41 1) v_~counter~0_42) .cse0) (and (not .cse0) (= |v_thread2Thread1of1ForFork1_#t~post4_12| |v_thread2Thread1of1ForFork1_#t~post4_11|) (= v_~counter~0_42 v_~counter~0_41) (= |v_thread2Thread1of1ForFork1_#t~post3_12| |v_thread2Thread1of1ForFork1_#t~post3_11|) (= v_thread2Thread1of1ForFork1_~i~1_18 v_thread2Thread1of1ForFork1_~i~1_17)))) (< v_thread2Thread1of1ForFork1_~i~1_18 v_~M2~0_15)) InVars {~counter~0=v_~counter~0_42, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_12|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_18, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_12|, ~M2~0=v_~M2~0_15} OutVars{~counter~0=v_~counter~0_41, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_11|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_17, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_11|, ~M2~0=v_~M2~0_15} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3] [2022-12-13 02:15:11,981 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L41-4-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~i~0_In_1 v_~M1~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, ~M1~0=v_~M1~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~M1~0=v_~M1~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [245] L54-1-->L54-1: Formula: (and (let ((.cse0 (< 0 v_~counter~0_42))) (or (and (= (+ v_thread2Thread1of1ForFork1_~i~1_18 1) v_thread2Thread1of1ForFork1_~i~1_17) (= (+ v_~counter~0_41 1) v_~counter~0_42) .cse0) (and (not .cse0) (= |v_thread2Thread1of1ForFork1_#t~post4_12| |v_thread2Thread1of1ForFork1_#t~post4_11|) (= v_~counter~0_42 v_~counter~0_41) (= |v_thread2Thread1of1ForFork1_#t~post3_12| |v_thread2Thread1of1ForFork1_#t~post3_11|) (= v_thread2Thread1of1ForFork1_~i~1_18 v_thread2Thread1of1ForFork1_~i~1_17)))) (< v_thread2Thread1of1ForFork1_~i~1_18 v_~M2~0_15)) InVars {~counter~0=v_~counter~0_42, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_12|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_18, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_12|, ~M2~0=v_~M2~0_15} OutVars{~counter~0=v_~counter~0_41, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_11|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_17, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_11|, ~M2~0=v_~M2~0_15} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3] [2022-12-13 02:15:12,114 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:12,114 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-13 02:15:12,114 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 443 flow [2022-12-13 02:15:12,115 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 02:15:12,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:12,115 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:12,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 02:15:12,115 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 02:15:12,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash 500003945, now seen corresponding path program 1 times [2022-12-13 02:15:12,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:12,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097665112] [2022-12-13 02:15:12,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:12,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:15:12,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:12,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097665112] [2022-12-13 02:15:12,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097665112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:12,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:12,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:12,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949259751] [2022-12-13 02:15:12,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:12,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:12,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:12,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:12,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:12,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 443 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 02:15:12,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:12,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:12,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:12,283 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:12,283 INFO L131 PetriNetUnfolder]: For 1680/1680 co-relation queries the response was YES. [2022-12-13 02:15:12,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 291 events. 155/291 cut-off events. For 1680/1680 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1504. Up to 225 conditions per place. [2022-12-13 02:15:12,285 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:12,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 646 flow [2022-12-13 02:15:12,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:12,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:12,287 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 443 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:12,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 646 flow [2022-12-13 02:15:12,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-13 02:15:12,291 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:12,291 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:12,292 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:12,292 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:12,292 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:12,292 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:12,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:12,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:12,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:12,303 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:12,303 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:15:12,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:12,304 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:12,304 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:12,401 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:12,402 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 02:15:12,402 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:12,403 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 02:15:12,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:12,403 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:12,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 02:15:12,403 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 02:15:12,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash 585891398, now seen corresponding path program 1 times [2022-12-13 02:15:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:12,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393131689] [2022-12-13 02:15:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:12,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:15:12,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:12,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393131689] [2022-12-13 02:15:12,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393131689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:12,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:12,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:12,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612666991] [2022-12-13 02:15:12,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:12,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:12,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:12,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:12,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:12,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:12,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:12,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:12,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:12,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:12,590 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:12,591 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:12,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:12,593 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:12,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:12,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:12,594 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:12,594 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:12,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:12,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:12,599 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:12,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:12,600 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:12,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:12,600 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:12,601 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:12,601 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:12,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:12,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:12,610 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:12,611 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:15:12,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:12,612 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:12,612 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:12,728 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:12,730 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:15:12,731 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:12,731 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 02:15:12,731 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:12,731 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:12,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 02:15:12,731 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 02:15:12,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash 614520549, now seen corresponding path program 1 times [2022-12-13 02:15:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:12,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126056803] [2022-12-13 02:15:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:12,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:12,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:15:12,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:12,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126056803] [2022-12-13 02:15:12,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126056803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:12,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:12,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:12,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520556394] [2022-12-13 02:15:12,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:12,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:12,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:12,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:12,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:12,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:12,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:12,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:12,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:12,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:12,908 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:12,908 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:15:12,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:12,911 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:12,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:12,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:12,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:12,912 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:12,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:12,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:12,919 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:12,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:12,919 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:12,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:12,919 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:12,920 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:12,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:12,921 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:12,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:12,930 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:12,930 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:15:12,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:12,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:12,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:13,044 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:13,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:15:13,045 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:13,045 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 02:15:13,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:13,045 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:13,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 02:15:13,046 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 02:15:13,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash 643149700, now seen corresponding path program 1 times [2022-12-13 02:15:13,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:13,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240797543] [2022-12-13 02:15:13,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:13,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:13,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:15:13,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:13,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240797543] [2022-12-13 02:15:13,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240797543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:13,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:13,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:13,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293013398] [2022-12-13 02:15:13,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:13,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:13,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:13,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:13,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:13,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:13,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:13,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:13,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:13,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:13,232 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:13,232 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:13,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:13,235 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:13,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:13,237 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:13,237 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:13,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:13,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:13,242 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:13,242 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:13,242 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:13,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:13,243 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:13,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:13,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:13,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:13,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:13,253 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:13,253 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:13,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:13,254 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:13,254 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:13,362 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:13,362 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:15:13,363 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:13,363 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 02:15:13,363 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:13,363 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:13,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 02:15:13,363 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 02:15:13,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash 671778851, now seen corresponding path program 1 times [2022-12-13 02:15:13,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:13,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130419266] [2022-12-13 02:15:13,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:13,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:13,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:13,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130419266] [2022-12-13 02:15:13,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130419266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:13,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:13,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:13,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772158169] [2022-12-13 02:15:13,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:13,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:13,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:13,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:13,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:13,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:13,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:13,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:13,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:13,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:13,642 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:13,642 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:13,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:13,645 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:13,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:13,646 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:13,646 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:13,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:13,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:13,655 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:13,655 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:13,655 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:13,656 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:13,657 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:13,658 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:13,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:13,659 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:13,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:13,670 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:13,670 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:13,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:13,672 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:13,672 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:13,766 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:13,767 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 02:15:13,767 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:13,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:13,767 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:13,768 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:13,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 02:15:13,768 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 02:15:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash 700408002, now seen corresponding path program 1 times [2022-12-13 02:15:13,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:13,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990567110] [2022-12-13 02:15:13,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:13,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:13,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:15:13,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:13,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990567110] [2022-12-13 02:15:13,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990567110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:13,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:13,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126718912] [2022-12-13 02:15:13,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:13,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:13,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:13,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:13,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:13,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:13,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:13,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:13,954 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:13,955 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:13,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:13,957 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:13,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:13,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:13,958 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:13,958 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:13,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:13,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:13,963 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:13,963 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:13,964 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:13,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:13,964 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:13,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:13,964 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:13,964 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:13,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:13,974 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:13,974 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:15:13,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:13,975 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:13,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:14,088 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:14,089 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:15:14,089 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:14,089 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 02:15:14,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:14,089 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:14,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 02:15:14,089 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 02:15:14,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:14,090 INFO L85 PathProgramCache]: Analyzing trace with hash 729037153, now seen corresponding path program 1 times [2022-12-13 02:15:14,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:14,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545861086] [2022-12-13 02:15:14,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:14,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:14,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:15:14,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:14,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545861086] [2022-12-13 02:15:14,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545861086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:14,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:14,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:14,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717789977] [2022-12-13 02:15:14,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:14,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:14,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:14,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:14,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:14,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:14,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:14,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:14,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:14,284 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:14,284 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:14,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1093 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:14,286 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:14,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:14,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:14,287 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:14,287 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:14,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:14,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:14,292 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:14,292 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:14,293 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:14,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:14,293 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:14,294 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:14,294 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:14,294 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:14,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:14,303 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:14,304 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:15:14,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:14,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:14,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:14,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:14,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:15:14,424 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:14,425 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 02:15:14,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:14,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:14,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 02:15:14,425 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 02:15:14,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash 757666304, now seen corresponding path program 1 times [2022-12-13 02:15:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:14,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163188472] [2022-12-13 02:15:14,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:14,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:14,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:14,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163188472] [2022-12-13 02:15:14,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163188472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:14,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:14,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29871199] [2022-12-13 02:15:14,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:14,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:14,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:14,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:14,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:14,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:14,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:14,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:14,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:14,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:14,637 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:14,637 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:14,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:14,640 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:14,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:14,641 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:14,641 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:14,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:14,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:14,646 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:14,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:14,647 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:14,647 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:14,647 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:14,647 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:14,647 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:14,648 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:14,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:14,658 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:14,658 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:15:14,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:14,659 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:14,659 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:14,764 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:14,764 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:15:14,765 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:14,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:14,765 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:14,765 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:14,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 02:15:14,765 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 02:15:14,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash 786295455, now seen corresponding path program 1 times [2022-12-13 02:15:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:14,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759175822] [2022-12-13 02:15:14,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:14,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 02:15:14,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:14,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759175822] [2022-12-13 02:15:14,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759175822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:14,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:14,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:14,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607452768] [2022-12-13 02:15:14,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:14,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:14,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:14,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:14,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:14,881 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:14,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:14,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:14,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:14,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:14,992 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:14,993 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:14,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:14,995 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:14,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:14,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:14,996 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:14,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:15,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:15,003 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:15,003 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:15,004 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:15,004 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:15,004 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:15,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:15,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:15,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:15,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:15,015 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:15,016 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:15:15,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:15,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:15,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:15,127 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:15,128 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:15:15,128 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:15,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:15,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:15,128 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:15,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 02:15:15,128 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 02:15:15,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash 814924606, now seen corresponding path program 1 times [2022-12-13 02:15:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:15,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531644049] [2022-12-13 02:15:15,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:15,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:15,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:15:15,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:15,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531644049] [2022-12-13 02:15:15,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531644049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:15,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:15,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:15,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146421140] [2022-12-13 02:15:15,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:15,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:15,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:15,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:15,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:15,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:15,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:15,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:15,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:15,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:15,304 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:15,304 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:15,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:15,310 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:15,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:15,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:15,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:15,311 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:15,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:15,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:15,316 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:15,316 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:15,317 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:15,317 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:15,318 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:15,318 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:15,318 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:15,318 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:15,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:15,327 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:15,327 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:15:15,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:15,328 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:15,328 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:15,444 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:15,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:15:15,444 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:15,445 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 02:15:15,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:15,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:15,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 02:15:15,445 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 02:15:15,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:15,445 INFO L85 PathProgramCache]: Analyzing trace with hash 843553757, now seen corresponding path program 1 times [2022-12-13 02:15:15,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:15,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14655020] [2022-12-13 02:15:15,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:15,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:15,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:15:15,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:15,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14655020] [2022-12-13 02:15:15,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14655020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:15,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:15,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:15,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153936012] [2022-12-13 02:15:15,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:15,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:15,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:15,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:15,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:15,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:15,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:15,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:15,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:15,601 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:15,601 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:15,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:15,604 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:15,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:15,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:15,605 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:15,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:15,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:15,609 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:15,609 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:15,610 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:15,610 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:15,610 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:15,610 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:15,610 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:15,610 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:15,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:15,618 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:15,619 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:15,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:15,620 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:15,620 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:15,734 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:15,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:15:15,735 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:15,735 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 02:15:15,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:15,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:15,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 02:15:15,735 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 02:15:15,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:15,736 INFO L85 PathProgramCache]: Analyzing trace with hash 872182908, now seen corresponding path program 1 times [2022-12-13 02:15:15,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:15,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556575084] [2022-12-13 02:15:15,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:15,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:15,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:15:15,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:15,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556575084] [2022-12-13 02:15:15,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556575084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:15,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:15,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:15,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249037645] [2022-12-13 02:15:15,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:15,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:15,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:15,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:15,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:15,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:15,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:15,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:15,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:15,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:15,953 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:15,953 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:15,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:15,956 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:15,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:15,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:15,957 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:15,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:15,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:15,962 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:15,962 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:15,966 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:15,966 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:15,966 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:15,966 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:15,966 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:15,967 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:15,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:15,976 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:15,976 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:15,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:15,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:15,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:16,089 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:16,090 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:15:16,090 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:16,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:16,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:16,090 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:16,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 02:15:16,091 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 02:15:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash 900812059, now seen corresponding path program 1 times [2022-12-13 02:15:16,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:16,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144964684] [2022-12-13 02:15:16,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:16,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:16,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:15:16,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:16,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144964684] [2022-12-13 02:15:16,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144964684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:16,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:16,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:16,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988436476] [2022-12-13 02:15:16,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:16,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:16,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:16,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:16,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:16,164 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:16,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:16,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:16,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:16,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:16,282 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:16,283 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:16,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:16,285 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:16,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:16,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:16,286 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:16,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:16,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:16,290 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:16,291 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:16,291 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:16,291 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:16,291 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:16,292 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:16,292 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:16,292 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:16,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:16,300 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:16,300 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:16,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:16,301 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:16,301 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:16,409 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:16,410 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:15:16,410 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:16,410 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 02:15:16,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:16,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:16,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 02:15:16,410 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 02:15:16,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:16,411 INFO L85 PathProgramCache]: Analyzing trace with hash 929441210, now seen corresponding path program 1 times [2022-12-13 02:15:16,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:16,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550468428] [2022-12-13 02:15:16,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:16,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:16,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:15:16,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:16,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550468428] [2022-12-13 02:15:16,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550468428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:16,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:16,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:16,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140744619] [2022-12-13 02:15:16,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:16,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:16,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:16,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:16,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:16,504 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:16,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:16,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:16,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:16,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:16,606 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:16,606 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:16,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:16,609 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:16,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:16,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:16,610 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:16,610 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:16,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:16,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:16,614 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:16,614 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:16,615 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:16,615 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:16,615 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:16,615 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:16,616 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:16,616 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:16,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:16,624 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:16,624 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:16,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:16,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:16,626 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:16,734 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:16,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:15:16,735 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:16,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:16,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:16,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:16,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 02:15:16,735 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 02:15:16,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:16,736 INFO L85 PathProgramCache]: Analyzing trace with hash 958070361, now seen corresponding path program 1 times [2022-12-13 02:15:16,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:16,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460691724] [2022-12-13 02:15:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:16,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 02:15:16,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:16,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460691724] [2022-12-13 02:15:16,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460691724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:16,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:16,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:16,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870318126] [2022-12-13 02:15:16,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:16,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:16,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:16,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:16,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:16,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:16,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:16,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:16,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:16,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:16,930 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:16,930 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:16,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:16,933 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:16,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:16,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:16,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:16,934 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:16,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:16,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:16,939 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:16,939 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:16,939 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:16,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:16,939 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:16,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:16,940 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:16,940 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:16,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:16,948 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:16,949 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:16,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:16,950 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:16,950 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:17,038 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:17,040 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:15:17,041 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:17,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:17,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:17,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:17,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 02:15:17,041 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 02:15:17,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash 986699512, now seen corresponding path program 1 times [2022-12-13 02:15:17,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:17,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418692453] [2022-12-13 02:15:17,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:17,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:17,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:17,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418692453] [2022-12-13 02:15:17,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418692453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:17,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:17,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:17,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012165526] [2022-12-13 02:15:17,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:17,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:17,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:17,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:17,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:17,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:17,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:17,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:17,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:17,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:17,235 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:17,235 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:17,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:17,238 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:17,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:17,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:17,239 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:17,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:17,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:17,243 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:17,244 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:17,244 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:17,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:17,244 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:17,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:17,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:17,245 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:17,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:17,255 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:17,255 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:17,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:17,257 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:17,257 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:17,375 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:17,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:15:17,376 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:17,376 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 02:15:17,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:17,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:17,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 02:15:17,377 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 02:15:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:17,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1015328663, now seen corresponding path program 1 times [2022-12-13 02:15:17,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:17,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423901260] [2022-12-13 02:15:17,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:17,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:17,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:15:17,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:17,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423901260] [2022-12-13 02:15:17,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423901260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:17,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:17,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:17,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941504587] [2022-12-13 02:15:17,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:17,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:17,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:17,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:17,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:17,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:17,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:17,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:17,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:17,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:17,565 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:17,565 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:17,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:17,567 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:17,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:17,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:17,568 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:17,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:17,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:17,573 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:17,573 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:17,573 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:17,574 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:17,574 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:17,574 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:17,574 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:17,574 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:17,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:17,583 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:17,583 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:17,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:17,584 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:17,584 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:17,695 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:17,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:15:17,696 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:17,696 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 02:15:17,696 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:17,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:17,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 02:15:17,697 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 02:15:17,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1043957814, now seen corresponding path program 1 times [2022-12-13 02:15:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:17,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677772507] [2022-12-13 02:15:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:17,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:17,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:15:17,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:17,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677772507] [2022-12-13 02:15:17,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677772507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:17,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:17,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:17,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401906585] [2022-12-13 02:15:17,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:17,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:17,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:17,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:17,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:17,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:17,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:17,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:17,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:17,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:17,865 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:17,865 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:17,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:17,868 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:17,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:17,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:17,869 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:17,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:17,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:17,874 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:17,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:17,875 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:17,875 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:17,875 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:17,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:17,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:17,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:17,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:17,884 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:17,885 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:17,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:17,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:17,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:18,005 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:18,007 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:15:18,007 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:18,007 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 02:15:18,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:18,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:18,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 02:15:18,007 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 02:15:18,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:18,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1072586965, now seen corresponding path program 1 times [2022-12-13 02:15:18,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:18,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8816455] [2022-12-13 02:15:18,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:18,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:18,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:15:18,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:18,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8816455] [2022-12-13 02:15:18,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8816455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:18,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:18,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:18,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94113496] [2022-12-13 02:15:18,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:18,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:18,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:18,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:18,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:18,087 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:18,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:18,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:18,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:18,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:18,182 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:18,182 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:18,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:18,185 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:18,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:18,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:18,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:18,186 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:18,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:18,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:18,191 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:18,191 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:18,191 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:18,191 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:18,192 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:18,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:18,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:18,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:18,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:18,201 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:18,201 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:18,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:18,202 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:18,203 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:18,300 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:18,301 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 02:15:18,301 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:18,301 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 02:15:18,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:18,301 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:18,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 02:15:18,301 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 02:15:18,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:18,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1101216116, now seen corresponding path program 1 times [2022-12-13 02:15:18,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:18,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197854739] [2022-12-13 02:15:18,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:18,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:18,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:15:18,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:18,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197854739] [2022-12-13 02:15:18,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197854739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:18,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:18,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:18,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886694361] [2022-12-13 02:15:18,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:18,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:18,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:18,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:18,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:18,390 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:18,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:18,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:18,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:18,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:18,489 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:18,489 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:18,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:18,492 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:18,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:18,493 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:18,494 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:18,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:18,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:18,498 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:18,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:18,498 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:18,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:18,498 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:18,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:18,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:18,501 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:18,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:18,510 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:18,510 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:15:18,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:18,511 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:18,511 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:18,622 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:18,625 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:15:18,625 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:18,626 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 02:15:18,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:18,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:18,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 02:15:18,626 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 02:15:18,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:18,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1129845267, now seen corresponding path program 1 times [2022-12-13 02:15:18,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:18,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305288867] [2022-12-13 02:15:18,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:18,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:18,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305288867] [2022-12-13 02:15:18,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305288867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:18,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:18,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:18,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102099483] [2022-12-13 02:15:18,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:18,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:18,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:18,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:18,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:18,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:18,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:18,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:18,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:18,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:18,807 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:18,807 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:18,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:18,810 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:18,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:18,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:18,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:18,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:18,811 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:18,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:18,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:18,817 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:18,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:18,817 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:18,817 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:18,817 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:18,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:18,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:18,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:18,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:18,827 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:18,827 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:18,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:18,828 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:18,828 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:18,933 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:18,934 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:15:18,934 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:18,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:18,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:18,934 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:18,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 02:15:18,935 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 02:15:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1158474418, now seen corresponding path program 1 times [2022-12-13 02:15:18,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:18,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305112961] [2022-12-13 02:15:18,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:18,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:19,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:15:19,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:19,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305112961] [2022-12-13 02:15:19,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305112961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:19,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:19,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:19,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158833478] [2022-12-13 02:15:19,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:19,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:19,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:19,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:19,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:19,007 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:19,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:19,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:19,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:19,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:19,097 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:19,098 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:19,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:19,100 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:19,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:19,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:19,101 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:19,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:19,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:19,106 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:19,106 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:19,106 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:19,106 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:19,106 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:19,107 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:19,107 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:19,107 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:19,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:19,115 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:19,116 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:15:19,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:19,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:19,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:19,221 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:19,222 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:15:19,222 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:19,222 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 02:15:19,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:19,222 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:19,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 02:15:19,222 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 02:15:19,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:19,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1187103569, now seen corresponding path program 1 times [2022-12-13 02:15:19,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:19,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210433822] [2022-12-13 02:15:19,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:19,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:19,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:15:19,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:19,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210433822] [2022-12-13 02:15:19,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210433822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:19,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:19,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991837632] [2022-12-13 02:15:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:19,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:19,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:19,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:19,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:19,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:19,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:19,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:19,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:19,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:19,421 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:19,422 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:19,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:19,424 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:19,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:19,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:19,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:19,425 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:19,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:19,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:19,429 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:19,429 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:19,430 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:19,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:19,430 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:19,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:19,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:19,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:19,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:19,439 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:19,439 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:19,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:19,440 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:19,440 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:19,545 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:19,546 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:15:19,546 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:19,547 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 02:15:19,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:19,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:19,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 02:15:19,547 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 02:15:19,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:19,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1215732720, now seen corresponding path program 1 times [2022-12-13 02:15:19,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:19,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694208964] [2022-12-13 02:15:19,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:19,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:19,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:15:19,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:19,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694208964] [2022-12-13 02:15:19,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694208964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:19,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:19,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:19,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301955448] [2022-12-13 02:15:19,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:19,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:19,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:19,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:19,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:19,620 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:19,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:19,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:19,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:19,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:19,704 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:19,704 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:19,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:19,707 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:19,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:19,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:19,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:19,709 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:19,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:19,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:19,713 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:19,713 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:19,713 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:19,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:19,713 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:19,714 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:19,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:19,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:19,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:19,723 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:19,723 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:19,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:19,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:19,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:19,832 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:19,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:15:19,833 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:19,833 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 02:15:19,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:19,833 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:19,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 02:15:19,834 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 02:15:19,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1244361871, now seen corresponding path program 1 times [2022-12-13 02:15:19,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:19,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553072514] [2022-12-13 02:15:19,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:19,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:19,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:15:19,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:19,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553072514] [2022-12-13 02:15:19,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553072514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:19,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:19,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082177076] [2022-12-13 02:15:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:19,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:19,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:19,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:19,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:19,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:19,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:19,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:19,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:20,005 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:20,007 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:20,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:20,014 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:20,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:20,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:20,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:20,016 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:20,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:20,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:20,020 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:20,020 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:20,021 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:20,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:20,021 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:20,021 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:20,021 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:20,021 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:20,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:20,029 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:20,030 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:20,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:20,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:20,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:20,139 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:20,140 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:15:20,140 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:20,140 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 02:15:20,140 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:20,140 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:20,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 02:15:20,141 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 02:15:20,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:20,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1272991022, now seen corresponding path program 1 times [2022-12-13 02:15:20,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:20,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590225344] [2022-12-13 02:15:20,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:20,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:20,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:15:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:20,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590225344] [2022-12-13 02:15:20,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590225344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:20,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:20,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517458199] [2022-12-13 02:15:20,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:20,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:20,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:20,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:20,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:20,214 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:20,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:20,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:20,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:20,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:20,328 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:20,329 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:20,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:20,331 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:20,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:20,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:20,335 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:20,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:20,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:20,339 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:20,339 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:20,339 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:20,339 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:20,339 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:20,340 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:20,340 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:20,340 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:20,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:20,348 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:20,348 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:20,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:20,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:20,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:20,456 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:20,457 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:15:20,457 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:20,457 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 02:15:20,457 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:20,458 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:20,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 02:15:20,458 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 02:15:20,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:20,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1301620173, now seen corresponding path program 1 times [2022-12-13 02:15:20,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:20,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044868258] [2022-12-13 02:15:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:20,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:20,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:15:20,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:20,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044868258] [2022-12-13 02:15:20,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044868258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:20,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:20,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:20,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631955747] [2022-12-13 02:15:20,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:20,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:20,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:20,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:20,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:20,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:20,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:20,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:20,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:20,616 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:20,616 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:20,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:20,618 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:20,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:20,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:20,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:20,619 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:20,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:20,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:20,624 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:20,624 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:20,624 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:20,624 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:20,624 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:20,625 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:20,625 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:20,625 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:20,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:20,634 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:20,634 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:20,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:20,635 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:20,635 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:20,748 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:20,749 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:15:20,749 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:20,749 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 02:15:20,749 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:20,749 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:20,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 02:15:20,749 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 02:15:20,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1330249324, now seen corresponding path program 1 times [2022-12-13 02:15:20,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:20,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068535125] [2022-12-13 02:15:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:20,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:20,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:15:20,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:20,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068535125] [2022-12-13 02:15:20,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068535125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:20,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:20,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:20,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447396940] [2022-12-13 02:15:20,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:20,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:20,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:20,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:20,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:20,814 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:20,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:20,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:20,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:20,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:20,918 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:20,918 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:20,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:20,920 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:20,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:20,922 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:20,922 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:20,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:20,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:20,926 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:20,927 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:20,927 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:20,927 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:20,927 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:20,927 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:20,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:20,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:20,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:20,936 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:20,937 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:20,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:20,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:20,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:21,050 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:21,050 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:15:21,050 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:21,050 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 02:15:21,050 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:21,051 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:21,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 02:15:21,051 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 02:15:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1358878475, now seen corresponding path program 1 times [2022-12-13 02:15:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:21,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869500857] [2022-12-13 02:15:21,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:21,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:21,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:15:21,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:21,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869500857] [2022-12-13 02:15:21,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869500857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:21,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:21,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:21,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990787809] [2022-12-13 02:15:21,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:21,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:21,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:21,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:21,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:21,141 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:21,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:21,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:21,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:21,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:21,232 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:21,232 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:21,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:21,234 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:21,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:21,236 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:21,236 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:21,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:21,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:21,240 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:21,241 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:21,241 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:21,241 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:21,241 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:21,241 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:21,242 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:21,242 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:21,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:21,250 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:21,250 INFO L131 PetriNetUnfolder]: For 435/444 co-relation queries the response was YES. [2022-12-13 02:15:21,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/444 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:21,251 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:21,251 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:21,367 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:21,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:15:21,367 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:21,368 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 02:15:21,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:21,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:21,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 02:15:21,368 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 02:15:21,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:21,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1387507626, now seen corresponding path program 1 times [2022-12-13 02:15:21,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:21,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267914235] [2022-12-13 02:15:21,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:21,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:21,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:15:21,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:21,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267914235] [2022-12-13 02:15:21,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267914235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:21,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:21,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286958877] [2022-12-13 02:15:21,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:21,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:21,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:21,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:21,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:21,437 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:21,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:21,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:21,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:21,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:21,523 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:21,523 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:15:21,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:21,525 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:21,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:21,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:21,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:21,526 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:21,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:21,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:21,530 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:21,531 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:21,531 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:21,531 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:21,531 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:21,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:21,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:21,532 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:21,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:21,539 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:21,540 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:15:21,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:21,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:21,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:21,650 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:21,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:15:21,651 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:21,651 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 02:15:21,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:21,651 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:21,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 02:15:21,651 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 02:15:21,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:21,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1416136777, now seen corresponding path program 1 times [2022-12-13 02:15:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:21,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843196331] [2022-12-13 02:15:21,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:21,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:15:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:21,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843196331] [2022-12-13 02:15:21,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843196331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:21,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:21,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:21,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995107636] [2022-12-13 02:15:21,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:21,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:21,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:21,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:21,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:21,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:21,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:21,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:21,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:21,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:21,847 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:21,847 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:21,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:21,849 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:21,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:21,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:21,850 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:21,850 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:21,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:21,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:21,855 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:21,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:21,855 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:21,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:21,855 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:21,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:21,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:21,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:21,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:21,864 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:21,865 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:21,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:21,866 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:21,866 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:21,967 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:21,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:15:21,968 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:21,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:21,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:21,968 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:21,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 02:15:21,969 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 02:15:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1444765928, now seen corresponding path program 1 times [2022-12-13 02:15:21,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:21,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356173126] [2022-12-13 02:15:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:22,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:15:22,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:22,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356173126] [2022-12-13 02:15:22,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356173126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:22,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:22,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:22,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894029171] [2022-12-13 02:15:22,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:22,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:22,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:22,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:22,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:22,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:22,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:22,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:22,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:22,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:22,121 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:22,121 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:22,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:22,123 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:22,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:22,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:22,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:22,124 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:22,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:22,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:22,128 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:22,129 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:22,129 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:22,129 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:22,130 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:22,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:22,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:22,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:22,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:22,138 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:22,138 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:22,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:22,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:22,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:22,252 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:22,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:15:22,253 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:22,253 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 02:15:22,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:22,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:22,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 02:15:22,254 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 02:15:22,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1473395079, now seen corresponding path program 1 times [2022-12-13 02:15:22,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:22,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772024502] [2022-12-13 02:15:22,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:22,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:22,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:15:22,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:22,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772024502] [2022-12-13 02:15:22,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772024502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:22,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:22,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:22,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42740411] [2022-12-13 02:15:22,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:22,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:22,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:22,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:22,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:22,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:22,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:22,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:22,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:22,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:22,404 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:22,404 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:22,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:22,406 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:22,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:22,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:22,407 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:22,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:22,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:22,411 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:22,411 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:22,411 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:22,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:22,412 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:22,412 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:22,412 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:22,412 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:22,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:22,420 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:22,420 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:22,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:22,422 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:22,422 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:22,528 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:22,529 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:15:22,529 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:22,529 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 02:15:22,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:22,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:22,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 02:15:22,529 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 02:15:22,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:22,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1502024230, now seen corresponding path program 1 times [2022-12-13 02:15:22,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:22,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142226755] [2022-12-13 02:15:22,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:22,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15: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:15:22,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:22,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142226755] [2022-12-13 02:15:22,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142226755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:22,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:22,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:22,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982663472] [2022-12-13 02:15:22,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:22,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:22,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:22,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:22,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:22,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:22,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:22,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:22,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:22,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:22,702 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:22,702 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:15:22,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:22,704 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:22,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:22,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:22,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:22,705 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:22,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:22,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:22,710 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:22,710 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:22,710 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:22,710 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:22,710 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:22,711 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:22,711 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:22,711 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:22,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:22,731 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:22,731 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:15:22,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:22,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:22,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:22,835 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:22,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:15:22,836 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:22,836 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 02:15:22,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:22,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:22,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 02:15:22,836 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 02:15:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:22,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1530653381, now seen corresponding path program 1 times [2022-12-13 02:15:22,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:22,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370939064] [2022-12-13 02:15:22,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:22,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:22,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:15:22,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:22,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370939064] [2022-12-13 02:15:22,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370939064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:22,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:22,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:22,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749782496] [2022-12-13 02:15:22,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:22,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:22,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:22,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:22,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:22,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:22,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:22,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:22,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:22,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:23,027 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:23,027 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:23,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:23,029 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:23,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:23,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:23,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:23,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:23,030 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:23,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:23,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:23,036 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:23,036 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:23,037 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:23,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:23,037 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:23,037 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:23,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:23,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:23,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:23,045 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:23,046 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:23,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:23,047 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:23,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:23,208 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:23,209 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-13 02:15:23,209 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:23,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:23,209 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:23,209 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:23,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 02:15:23,209 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 02:15:23,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:23,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1559282532, now seen corresponding path program 1 times [2022-12-13 02:15:23,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:23,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692815109] [2022-12-13 02:15:23,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:23,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15: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:15:23,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:23,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692815109] [2022-12-13 02:15:23,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692815109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:23,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:23,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796451151] [2022-12-13 02:15:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:23,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:23,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:23,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:23,278 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:23,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:23,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:23,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:23,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:23,370 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:23,371 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:23,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:23,372 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:23,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:23,373 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:23,373 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:23,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:23,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:23,377 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:23,378 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:23,378 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:23,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:23,378 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:23,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:23,378 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:23,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:23,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:23,386 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:23,386 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:23,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:23,387 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:23,387 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:23,496 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:23,496 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:15:23,496 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:23,496 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 02:15:23,496 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:23,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:23,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 02:15:23,497 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 02:15:23,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:23,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1587911683, now seen corresponding path program 1 times [2022-12-13 02:15:23,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:23,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088420181] [2022-12-13 02:15:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:23,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:23,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:15:23,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:23,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088420181] [2022-12-13 02:15:23,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088420181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:23,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:23,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:23,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076063478] [2022-12-13 02:15:23,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:23,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:23,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:23,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:23,563 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:23,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:23,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:23,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:23,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:23,664 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:23,664 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:23,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:23,666 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:23,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:23,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:23,667 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:23,667 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:23,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:23,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:23,672 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:23,672 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:23,672 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:23,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:23,672 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:23,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:23,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:23,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:23,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:23,681 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:23,681 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:15:23,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:23,682 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:23,682 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:23,790 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:23,791 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:15:23,791 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:23,791 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 02:15:23,791 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:23,791 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:23,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 02:15:23,791 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 02:15:23,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:23,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1616540834, now seen corresponding path program 1 times [2022-12-13 02:15:23,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:23,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895452261] [2022-12-13 02:15:23,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:23,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:15:23,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:23,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895452261] [2022-12-13 02:15:23,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895452261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:23,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:23,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:23,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439684127] [2022-12-13 02:15:23,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:23,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:23,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:23,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:23,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:23,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:23,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:23,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:23,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:23,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:23,990 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:23,990 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:23,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:23,992 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:23,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:23,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:23,993 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:23,993 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:23,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:23,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:23,997 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:23,997 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:23,997 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:23,997 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:23,997 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:23,998 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:23,998 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:23,998 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:23,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:24,006 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:24,006 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:15:24,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:24,007 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:24,007 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:24,115 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:24,116 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:15:24,116 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:24,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:24,116 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:24,117 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:24,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 02:15:24,117 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 02:15:24,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1645169985, now seen corresponding path program 1 times [2022-12-13 02:15:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:24,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444217633] [2022-12-13 02:15:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:24,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:24,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:24,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444217633] [2022-12-13 02:15:24,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444217633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:24,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:24,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964338805] [2022-12-13 02:15:24,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:24,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:24,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:24,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:24,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:24,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:24,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:24,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:24,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:24,288 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:24,288 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:24,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:24,290 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:24,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:24,291 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:24,291 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:24,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:24,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:24,295 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:24,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:24,295 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:24,295 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:24,295 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:24,296 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:24,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:24,296 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:24,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:24,304 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:24,305 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:24,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:24,306 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:24,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:24,402 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:24,403 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:15:24,403 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:24,403 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 02:15:24,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:24,403 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:24,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 02:15:24,403 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 02:15:24,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:24,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1673799136, now seen corresponding path program 1 times [2022-12-13 02:15:24,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:24,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333030509] [2022-12-13 02:15:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:24,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15: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:15:24,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:24,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333030509] [2022-12-13 02:15:24,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333030509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:24,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:24,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:24,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016896146] [2022-12-13 02:15:24,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:24,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:24,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:24,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:24,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:24,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:24,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:24,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:24,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:24,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:24,574 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:24,574 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:24,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:24,576 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:24,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:24,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:24,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:24,577 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:24,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:24,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:24,582 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:24,582 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:24,582 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:24,582 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:24,582 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:24,583 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:24,583 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:24,583 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:24,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:24,591 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:24,591 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:24,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:24,592 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:24,592 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:24,700 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:24,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:15:24,700 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:24,700 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 02:15:24,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:24,701 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:24,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 02:15:24,701 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 02:15:24,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1702428287, now seen corresponding path program 1 times [2022-12-13 02:15:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:24,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211610070] [2022-12-13 02:15:24,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:24,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:24,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:15:24,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:24,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211610070] [2022-12-13 02:15:24,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211610070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:24,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:24,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:24,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628902983] [2022-12-13 02:15:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:24,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:24,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:24,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:24,767 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:24,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:24,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:24,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:24,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:24,855 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:24,855 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:24,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1089 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:24,857 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:24,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:24,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:24,861 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:24,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:24,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:24,865 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:24,865 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:24,865 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:24,865 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:24,865 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:24,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:24,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:24,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:24,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:24,874 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:24,874 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:24,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:24,875 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:24,875 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:24,983 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:24,984 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:15:24,984 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:24,984 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 02:15:24,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:24,984 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:24,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 02:15:24,984 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 02:15:24,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1731057438, now seen corresponding path program 1 times [2022-12-13 02:15:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:24,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458544040] [2022-12-13 02:15:24,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:24,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:25,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:15:25,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:25,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458544040] [2022-12-13 02:15:25,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458544040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:25,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:25,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:25,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161768360] [2022-12-13 02:15:25,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:25,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:25,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:25,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:25,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:25,064 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:25,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:25,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:25,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:25,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:25,164 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:25,164 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:25,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:25,166 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:25,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:25,167 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:25,167 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:25,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:25,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:25,173 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:25,173 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:25,173 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:25,173 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:25,173 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:25,174 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:25,174 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:25,174 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:25,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:25,184 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:25,184 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:25,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:25,185 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:25,185 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:25,295 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:25,296 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:15:25,296 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:25,296 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 02:15:25,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:25,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:25,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 02:15:25,297 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 02:15:25,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:25,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1759686589, now seen corresponding path program 1 times [2022-12-13 02:15:25,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:25,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971937475] [2022-12-13 02:15:25,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:25,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:25,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:15:25,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:25,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971937475] [2022-12-13 02:15:25,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971937475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:25,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:25,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:25,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973047764] [2022-12-13 02:15:25,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:25,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:25,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:25,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:25,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:25,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:25,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:25,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:25,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:25,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:25,484 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:25,484 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:25,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:25,486 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:25,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:25,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:25,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:25,488 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:25,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:25,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:25,492 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:25,492 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:25,492 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:25,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:25,492 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:25,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:25,493 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:25,493 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:25,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:25,501 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:25,501 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:25,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:25,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:25,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:25,613 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:25,613 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:15:25,613 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:25,614 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 02:15:25,614 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:25,614 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:25,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 02:15:25,614 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 02:15:25,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:25,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1788315740, now seen corresponding path program 1 times [2022-12-13 02:15:25,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:25,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789779590] [2022-12-13 02:15:25,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:25,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:25,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:15:25,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:25,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789779590] [2022-12-13 02:15:25,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789779590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:25,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:25,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:25,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503602794] [2022-12-13 02:15:25,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:25,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:25,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:25,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:25,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:25,692 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:25,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:25,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:25,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:25,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:25,775 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:25,775 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:25,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:25,777 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:25,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:25,778 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:25,778 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:25,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:25,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:25,782 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:25,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:25,783 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:25,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:25,783 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:25,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:25,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:25,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:25,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:25,792 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:25,792 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:25,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:25,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:25,793 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:25,903 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:25,904 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:15:25,904 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:25,904 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 02:15:25,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:25,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:25,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-13 02:15:25,905 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 02:15:25,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:25,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1816944891, now seen corresponding path program 1 times [2022-12-13 02:15:25,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:25,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621399112] [2022-12-13 02:15:25,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:25,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:25,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:15:25,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:25,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621399112] [2022-12-13 02:15:25,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621399112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:25,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:25,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:25,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698203370] [2022-12-13 02:15:25,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:25,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:25,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:25,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:25,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:25,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:25,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:25,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:25,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:25,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:26,059 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:26,060 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:26,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:26,061 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:26,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:26,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:26,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:26,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:26,062 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:26,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:26,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:26,067 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:26,067 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:26,067 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:26,068 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:26,068 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:26,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:26,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:26,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:26,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:26,078 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:26,078 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:26,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:26,079 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:26,079 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:26,169 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:26,169 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:15:26,169 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:26,170 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 02:15:26,170 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:26,170 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:26,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-13 02:15:26,170 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 02:15:26,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:26,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1845574042, now seen corresponding path program 1 times [2022-12-13 02:15:26,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:26,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102405417] [2022-12-13 02:15:26,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:26,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:26,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:15:26,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:26,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102405417] [2022-12-13 02:15:26,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102405417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:26,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:26,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:26,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619471248] [2022-12-13 02:15:26,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:26,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:26,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:26,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:26,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:26,249 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:26,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:26,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:26,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:26,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:26,358 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:26,358 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:26,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:26,361 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:26,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:26,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:26,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:26,363 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:26,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:26,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:26,367 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:26,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:26,368 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:26,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:26,368 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:26,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:26,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:26,369 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:26,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:26,377 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:26,377 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:26,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:26,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:26,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:26,485 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:26,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:15:26,486 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:26,490 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 02:15:26,490 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:26,490 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:26,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-13 02:15:26,490 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 02:15:26,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:26,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1874203193, now seen corresponding path program 1 times [2022-12-13 02:15:26,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:26,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614419667] [2022-12-13 02:15:26,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:26,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:26,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:15:26,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:26,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614419667] [2022-12-13 02:15:26,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614419667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:26,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:26,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:26,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138705573] [2022-12-13 02:15:26,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:26,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:26,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:26,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:26,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:26,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:26,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:26,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:26,657 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:26,657 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:15:26,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:26,659 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:26,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:26,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:26,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:26,660 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:26,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:26,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:26,664 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:26,664 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:26,664 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:26,664 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:26,664 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:26,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:26,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:26,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:26,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:26,673 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:26,673 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:15:26,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:26,674 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:26,675 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:26,779 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:26,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:15:26,780 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:26,780 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 02:15:26,780 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:26,780 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:26,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 02:15:26,781 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 02:15:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1902832344, now seen corresponding path program 1 times [2022-12-13 02:15:26,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:26,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221428120] [2022-12-13 02:15:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:26,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:26,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:15:26,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:26,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221428120] [2022-12-13 02:15:26,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221428120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:26,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:26,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:26,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344725486] [2022-12-13 02:15:26,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:26,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:26,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:26,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:26,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:26,865 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:26,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:26,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:26,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:26,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:26,959 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:26,959 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:26,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:26,961 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:26,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:26,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:26,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:26,963 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:26,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:26,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:26,967 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:26,968 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:26,969 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:26,969 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:26,969 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:26,969 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:26,969 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:26,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:26,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:26,977 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:26,977 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:15:26,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:26,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:26,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:27,093 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:27,093 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:15:27,093 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:27,094 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 02:15:27,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:27,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:27,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 02:15:27,094 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 02:15:27,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:27,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1931461495, now seen corresponding path program 1 times [2022-12-13 02:15:27,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:27,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509266870] [2022-12-13 02:15:27,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:27,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:27,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:15:27,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:27,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509266870] [2022-12-13 02:15:27,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509266870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:27,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:27,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:27,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243702283] [2022-12-13 02:15:27,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:27,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:27,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:27,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:27,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:27,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:27,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:27,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:27,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:27,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:27,262 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:27,262 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:27,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:27,264 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:27,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:27,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:27,265 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:27,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:27,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:27,270 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:27,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:27,270 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:27,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:27,270 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:27,271 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:27,271 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:27,271 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:27,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:27,280 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:27,280 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:27,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:27,281 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:27,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:27,391 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:27,392 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:15:27,392 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:27,392 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 02:15:27,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:27,392 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:27,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 02:15:27,392 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 02:15:27,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1960090646, now seen corresponding path program 1 times [2022-12-13 02:15:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:27,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051858443] [2022-12-13 02:15:27,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:27,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:27,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:15:27,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:27,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051858443] [2022-12-13 02:15:27,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051858443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:27,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:27,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673079440] [2022-12-13 02:15:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:27,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:27,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:27,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:27,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:27,460 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:27,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:27,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:27,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:27,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:27,543 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:27,543 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:27,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:27,545 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:27,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:27,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:27,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:27,546 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:27,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:27,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:27,550 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:27,550 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:27,550 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:27,550 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:27,550 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:27,551 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:27,551 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:27,551 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:27,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:27,559 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:27,559 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:27,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:27,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:27,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:27,683 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:27,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:15:27,684 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:27,684 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 02:15:27,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:27,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:27,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 02:15:27,684 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 02:15:27,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:27,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1988719797, now seen corresponding path program 1 times [2022-12-13 02:15:27,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:27,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036404318] [2022-12-13 02:15:27,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:27,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:27,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:15:27,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:27,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036404318] [2022-12-13 02:15:27,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036404318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:27,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:27,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:27,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674281558] [2022-12-13 02:15:27,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:27,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:27,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:27,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:27,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:27,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:27,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:27,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:27,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:27,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:27,854 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:27,854 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:27,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:27,856 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:27,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:27,857 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:27,857 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:27,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:27,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:27,861 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:27,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:27,861 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:27,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:27,861 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:27,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:27,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:27,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:27,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:27,869 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:27,870 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:15:27,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:27,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:27,871 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:27,975 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:27,976 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:15:27,976 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:27,976 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 02:15:27,976 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:27,976 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:27,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-13 02:15:27,976 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 02:15:27,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:27,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2017348948, now seen corresponding path program 1 times [2022-12-13 02:15:27,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:27,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719738094] [2022-12-13 02:15:27,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:27,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:28,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:15:28,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:28,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719738094] [2022-12-13 02:15:28,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719738094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:28,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:28,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682920840] [2022-12-13 02:15:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:28,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:28,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:28,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:28,042 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:28,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:28,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:28,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:28,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:28,143 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:28,143 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:28,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:28,145 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:28,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:28,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:28,145 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:28,146 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:28,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:28,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:28,150 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:28,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:28,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:28,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:28,150 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:28,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:28,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:28,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:28,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:28,158 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:28,159 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:28,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:28,160 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:28,160 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:28,268 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:28,269 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:15:28,269 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:28,269 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 02:15:28,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:28,269 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:28,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-13 02:15:28,269 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 02:15:28,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:28,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2045978099, now seen corresponding path program 1 times [2022-12-13 02:15:28,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:28,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737052340] [2022-12-13 02:15:28,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:28,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:28,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:15:28,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:28,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737052340] [2022-12-13 02:15:28,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737052340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:28,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:28,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:28,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852471137] [2022-12-13 02:15:28,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:28,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:28,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:28,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:28,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:28,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:28,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:28,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:28,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:28,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:28,420 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:28,421 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:28,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:28,422 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:28,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:28,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:28,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:28,423 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:28,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:28,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:28,425 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:28,425 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:28,426 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:28,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:28,426 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:28,426 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:28,426 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:28,426 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:28,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:28,432 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:28,432 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:15:28,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:28,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:28,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:28,528 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:28,529 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:15:28,529 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:28,529 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 02:15:28,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:28,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:28,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-13 02:15:28,529 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 02:15:28,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2074607250, now seen corresponding path program 1 times [2022-12-13 02:15:28,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:28,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617817531] [2022-12-13 02:15:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:28,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:28,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:15:28,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:28,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617817531] [2022-12-13 02:15:28,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617817531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:28,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:28,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:28,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771166616] [2022-12-13 02:15:28,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:28,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:28,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:28,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:28,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:28,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:28,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:28,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:28,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:28,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:28,734 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:28,734 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:28,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:28,736 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:28,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:28,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:28,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:28,737 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:28,737 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:28,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:28,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:28,742 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:28,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:28,742 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:28,742 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:28,742 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:28,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:28,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:28,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:28,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:28,751 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:28,751 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:28,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:28,752 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:28,752 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:28,860 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:28,861 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:15:28,861 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:28,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:28,861 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:28,861 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:28,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-13 02:15:28,861 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 02:15:28,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2103236401, now seen corresponding path program 1 times [2022-12-13 02:15:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:28,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330860131] [2022-12-13 02:15:28,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:28,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:15:28,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:28,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330860131] [2022-12-13 02:15:28,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330860131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:28,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:28,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:28,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096513845] [2022-12-13 02:15:28,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:28,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:28,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:28,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:28,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:28,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:28,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:28,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:28,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:28,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:29,032 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:29,032 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:29,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:29,034 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:29,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:29,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:29,035 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:29,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:29,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:29,039 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:29,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:29,039 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:29,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:29,040 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:29,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:29,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:29,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:29,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:29,048 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:29,048 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:29,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:29,050 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:29,050 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:29,156 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:29,157 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:15:29,157 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:29,158 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 02:15:29,158 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:29,158 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:29,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-13 02:15:29,158 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 02:15:29,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:29,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2131865552, now seen corresponding path program 1 times [2022-12-13 02:15:29,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:29,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889704288] [2022-12-13 02:15:29,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:29,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:29,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:15:29,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:29,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889704288] [2022-12-13 02:15:29,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889704288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:29,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:29,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:29,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831322200] [2022-12-13 02:15:29,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:29,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:29,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:29,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:29,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:29,220 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:29,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:29,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:29,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:29,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:29,310 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:29,311 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:29,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:29,312 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:29,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:29,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:29,313 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:29,313 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:29,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:29,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:29,317 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:29,318 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:29,318 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:29,318 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:29,318 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:29,321 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:29,321 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:29,321 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:29,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:29,329 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:29,329 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:29,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:29,330 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:29,330 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:29,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:29,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:15:29,425 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:29,425 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 02:15:29,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:29,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:29,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-13 02:15:29,426 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 02:15:29,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:29,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2134472593, now seen corresponding path program 1 times [2022-12-13 02:15:29,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:29,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629092905] [2022-12-13 02:15:29,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:29,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:29,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:15:29,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:29,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629092905] [2022-12-13 02:15:29,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629092905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:29,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:29,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:29,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123036117] [2022-12-13 02:15:29,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:29,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:29,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:29,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:29,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:29,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:29,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:29,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:29,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:29,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:29,561 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:29,561 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:29,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:29,563 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:29,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:29,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:29,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:29,567 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:29,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:29,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:29,569 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:29,570 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:29,570 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:29,570 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:29,570 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:29,570 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:29,570 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:29,570 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:29,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:29,577 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:29,577 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:29,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:29,578 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:29,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:29,664 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:29,665 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:15:29,665 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:29,665 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 02:15:29,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:29,665 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:29,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-13 02:15:29,665 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 02:15:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:29,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2105843442, now seen corresponding path program 1 times [2022-12-13 02:15:29,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:29,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138546806] [2022-12-13 02:15:29,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:29,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:15:29,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:29,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138546806] [2022-12-13 02:15:29,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138546806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:29,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:29,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:29,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832609360] [2022-12-13 02:15:29,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:29,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:29,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:29,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:29,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:29,730 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:29,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:29,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:29,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:29,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:29,827 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:29,827 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:29,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:29,829 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:29,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:29,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:29,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:29,830 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:29,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:29,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:29,834 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:29,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:29,834 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:29,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:29,835 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:29,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:29,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:29,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:29,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:29,843 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:29,843 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:29,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:29,844 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:29,844 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:29,959 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:29,960 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:15:29,960 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:29,960 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 02:15:29,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:29,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:29,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-13 02:15:29,960 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 02:15:29,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2077214291, now seen corresponding path program 1 times [2022-12-13 02:15:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:29,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990659246] [2022-12-13 02:15:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:30,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:15:30,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:30,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990659246] [2022-12-13 02:15:30,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990659246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:30,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:30,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:30,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884431339] [2022-12-13 02:15:30,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:30,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:30,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:30,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:30,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:30,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:30,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:30,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:30,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:30,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:30,164 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:30,164 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:30,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:30,166 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:30,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:30,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:30,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:30,174 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:30,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:30,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:30,177 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:30,177 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:30,178 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:30,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:30,178 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:30,178 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:30,178 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:30,178 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:30,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:30,185 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:30,185 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:30,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:30,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:30,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:30,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:30,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:15:30,291 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:30,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:30,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:30,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:30,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-13 02:15:30,292 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 02:15:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2048585140, now seen corresponding path program 1 times [2022-12-13 02:15:30,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:30,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364592609] [2022-12-13 02:15:30,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:30,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:30,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:15:30,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:30,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364592609] [2022-12-13 02:15:30,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364592609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:30,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:30,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:30,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859485593] [2022-12-13 02:15:30,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:30,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:30,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:30,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:30,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:30,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:30,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:30,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:30,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:30,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:30,427 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:30,427 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:30,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:30,428 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:30,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:30,436 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:30,436 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:30,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:30,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:30,441 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:30,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:30,441 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:30,441 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:30,442 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:30,443 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:30,443 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:30,443 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:30,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:30,452 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:30,452 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:15:30,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:30,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:30,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:30,565 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:30,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:15:30,565 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:30,565 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 02:15:30,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:30,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:30,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-13 02:15:30,566 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 02:15:30,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:30,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2019955989, now seen corresponding path program 1 times [2022-12-13 02:15:30,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:30,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623482650] [2022-12-13 02:15:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:30,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:30,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:15:30,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:30,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623482650] [2022-12-13 02:15:30,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623482650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:30,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:30,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:30,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309324479] [2022-12-13 02:15:30,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:30,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:30,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:30,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:30,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:30,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:30,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:30,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:30,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:30,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:30,714 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:30,714 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:30,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:30,716 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:30,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:30,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:30,717 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:30,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:30,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:30,721 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:30,721 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:30,721 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:30,721 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:30,721 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:30,722 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:30,722 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:30,722 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:30,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:30,730 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:30,730 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:30,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:30,731 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:30,731 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:30,835 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:30,835 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 02:15:30,836 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:30,836 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 02:15:30,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:30,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:30,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-13 02:15:30,836 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 02:15:30,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:30,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1991326838, now seen corresponding path program 1 times [2022-12-13 02:15:30,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:30,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285524396] [2022-12-13 02:15:30,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:30,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:30,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:15:30,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:30,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285524396] [2022-12-13 02:15:30,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285524396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:30,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:30,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:30,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614720775] [2022-12-13 02:15:30,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:30,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:30,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:30,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:30,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:30,895 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:30,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:30,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:30,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:30,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:30,984 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:30,984 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:30,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:30,985 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:30,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:30,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:30,986 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:30,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:30,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:30,989 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:30,989 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:30,990 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:30,990 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:30,990 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:30,990 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:30,990 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:30,990 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:30,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:30,998 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:30,998 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:15:30,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:30,999 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:30,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:31,085 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:31,086 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:15:31,086 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:31,086 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 02:15:31,086 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:31,086 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:31,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-13 02:15:31,087 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 02:15:31,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1962697687, now seen corresponding path program 1 times [2022-12-13 02:15:31,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:31,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093038960] [2022-12-13 02:15:31,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:31,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:31,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:15:31,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:31,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093038960] [2022-12-13 02:15:31,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093038960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:31,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:31,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:31,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821912138] [2022-12-13 02:15:31,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:31,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:31,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:31,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:31,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:31,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:31,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:31,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:31,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:31,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:31,255 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:31,255 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:31,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:31,256 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:31,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:31,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:31,257 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:31,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:31,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:31,261 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:31,261 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:31,261 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:31,261 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:31,261 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:31,262 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:31,262 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:31,262 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:31,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:31,269 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:31,269 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:31,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:31,270 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:31,270 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:31,356 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:31,357 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:15:31,357 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:31,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:31,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:31,358 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:31,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-13 02:15:31,358 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 02:15:31,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:31,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1934068536, now seen corresponding path program 1 times [2022-12-13 02:15:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:31,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490438430] [2022-12-13 02:15:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:31,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:31,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:15:31,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:31,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490438430] [2022-12-13 02:15:31,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490438430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:31,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:31,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:31,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221097870] [2022-12-13 02:15:31,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:31,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:31,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:31,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:31,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:31,440 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:31,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:31,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:31,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:31,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:31,534 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:31,534 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:31,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:31,536 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:31,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:31,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:31,537 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:31,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:31,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:31,541 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:31,541 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:31,542 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:31,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:31,542 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:31,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:31,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:31,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:31,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:31,551 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:31,551 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:31,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:31,553 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:31,553 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:31,655 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:31,656 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 02:15:31,656 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:31,656 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 02:15:31,656 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:31,656 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:31,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-13 02:15:31,656 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 02:15:31,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:31,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1905439385, now seen corresponding path program 1 times [2022-12-13 02:15:31,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:31,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503286069] [2022-12-13 02:15:31,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:31,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:31,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:15:31,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:31,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503286069] [2022-12-13 02:15:31,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503286069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:31,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:31,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259258634] [2022-12-13 02:15:31,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:31,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:31,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:31,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:31,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:31,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:31,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:31,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:31,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:31,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:31,818 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:31,818 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:31,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:31,820 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:31,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:31,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:31,821 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:31,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:31,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:31,825 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:31,826 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:31,826 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:31,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:31,826 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:31,826 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:31,826 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:31,827 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:31,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:31,834 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:31,834 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:31,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:31,836 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:31,836 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:31,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:31,941 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:15:31,941 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:31,941 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 02:15:31,941 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:31,941 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:31,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-13 02:15:31,941 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 02:15:31,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1876810234, now seen corresponding path program 1 times [2022-12-13 02:15:31,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:31,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165053683] [2022-12-13 02:15:31,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:31,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:32,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:15:32,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:32,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165053683] [2022-12-13 02:15:32,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165053683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:32,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:32,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543660187] [2022-12-13 02:15:32,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:32,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:32,008 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:32,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:32,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:32,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:32,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:32,090 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:32,090 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:32,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:32,092 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:32,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:32,096 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:32,096 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:32,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:32,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:32,100 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:32,100 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:32,100 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:32,100 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:32,100 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:32,101 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:32,101 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:32,101 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:32,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:32,109 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:32,109 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:15:32,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:32,110 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:32,110 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:32,214 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:32,214 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 02:15:32,214 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:32,214 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 02:15:32,214 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:32,215 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:32,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-13 02:15:32,215 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 02:15:32,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:32,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1848181083, now seen corresponding path program 1 times [2022-12-13 02:15:32,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:32,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438377673] [2022-12-13 02:15:32,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:32,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:32,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:15:32,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:32,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438377673] [2022-12-13 02:15:32,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438377673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:32,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:32,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:32,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761066046] [2022-12-13 02:15:32,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:32,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:32,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:32,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:32,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:32,302 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:32,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:32,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:32,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:32,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:32,388 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:32,389 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:32,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:32,390 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:32,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:32,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:32,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:32,391 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:32,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:32,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:32,396 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:32,396 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:32,396 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:32,396 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:32,396 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:32,397 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:32,397 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:32,397 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:32,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:32,403 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:32,403 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:15:32,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:32,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:32,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:32,502 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:32,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:15:32,503 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:32,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:32,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:32,503 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:32,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-13 02:15:32,503 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 02:15:32,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:32,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1819551932, now seen corresponding path program 1 times [2022-12-13 02:15:32,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:32,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30391336] [2022-12-13 02:15:32,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:32,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:32,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:15:32,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:32,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30391336] [2022-12-13 02:15:32,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30391336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:32,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:32,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:32,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466799582] [2022-12-13 02:15:32,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:32,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:32,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:32,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:32,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:32,584 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:32,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:32,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:32,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:32,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:32,681 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:32,681 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:32,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:32,682 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:32,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:32,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:32,683 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:32,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:32,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:32,686 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:32,686 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:32,686 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:32,686 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:32,686 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:32,687 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:32,687 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:32,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:32,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:32,695 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:32,696 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:32,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:32,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:32,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:32,783 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:32,783 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:15:32,783 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:32,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:32,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:32,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:32,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-13 02:15:32,784 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 02:15:32,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:32,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1790922781, now seen corresponding path program 1 times [2022-12-13 02:15:32,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:32,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004966657] [2022-12-13 02:15:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:32,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 02:15:32,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:32,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004966657] [2022-12-13 02:15:32,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004966657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:32,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:32,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:32,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353271123] [2022-12-13 02:15:32,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:32,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:32,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:32,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:32,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:32,840 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:32,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:32,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:32,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:32,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:32,925 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:32,925 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:32,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:32,927 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:32,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:32,928 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:32,928 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:32,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:32,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:32,932 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:32,932 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:32,932 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:32,932 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:32,932 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:32,933 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:32,933 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:32,933 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:32,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:32,942 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:32,942 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:15:32,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:32,943 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:32,943 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:33,045 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:33,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 02:15:33,046 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:33,046 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 02:15:33,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:33,046 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:33,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-13 02:15:33,047 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 02:15:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1762293630, now seen corresponding path program 1 times [2022-12-13 02:15:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:33,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143058468] [2022-12-13 02:15:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:33,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:33,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:33,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143058468] [2022-12-13 02:15:33,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143058468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:33,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:33,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:33,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064325253] [2022-12-13 02:15:33,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:33,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:33,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:33,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:33,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:33,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:33,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:33,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:33,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:33,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:33,205 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:33,206 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:33,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:33,207 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:33,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:33,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:33,208 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:33,208 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:33,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:33,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:33,212 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:33,212 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:33,212 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:33,212 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:33,213 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:33,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:33,213 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:33,213 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:33,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:33,219 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:33,219 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:33,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:33,220 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:33,220 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:33,310 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:33,311 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:15:33,311 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:33,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:33,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:33,311 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:33,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-13 02:15:33,311 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 02:15:33,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:33,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1733664479, now seen corresponding path program 1 times [2022-12-13 02:15:33,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:33,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810371448] [2022-12-13 02:15:33,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:33,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:33,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:15:33,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:33,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810371448] [2022-12-13 02:15:33,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810371448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:33,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:33,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:33,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092815011] [2022-12-13 02:15:33,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:33,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:33,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:33,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:33,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:33,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:33,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:33,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:33,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:33,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:33,468 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:33,469 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:33,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:33,470 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:33,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:33,471 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:33,472 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:33,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:33,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:33,474 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:33,475 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:33,475 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:33,475 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:33,475 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:33,475 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:33,475 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:33,475 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:33,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:33,481 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:33,482 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:33,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:33,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:33,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:33,570 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:33,570 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:15:33,570 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:33,571 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 02:15:33,571 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:33,571 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:33,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-13 02:15:33,571 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 02:15:33,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:33,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1705035328, now seen corresponding path program 1 times [2022-12-13 02:15:33,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:33,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816394804] [2022-12-13 02:15:33,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:33,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:33,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:15:33,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:33,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816394804] [2022-12-13 02:15:33,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816394804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:33,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:33,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:33,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830400174] [2022-12-13 02:15:33,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:33,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:33,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:33,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:33,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:33,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:33,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:33,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:33,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:33,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:33,737 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:33,737 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:33,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:33,738 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:33,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:33,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:33,739 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:33,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:33,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:33,749 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:33,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:33,750 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:33,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:33,750 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:33,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:33,750 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:33,750 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:33,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:33,759 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:33,759 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:33,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:33,760 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:33,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:33,849 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:33,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:15:33,850 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:33,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:33,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:33,850 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:33,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-13 02:15:33,850 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 02:15:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:33,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1676406177, now seen corresponding path program 1 times [2022-12-13 02:15:33,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:33,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627876932] [2022-12-13 02:15:33,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:33,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:33,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:15:33,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:33,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627876932] [2022-12-13 02:15:33,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627876932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:33,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:33,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:33,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011315162] [2022-12-13 02:15:33,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:33,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:33,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:33,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:33,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:33,918 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:33,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:33,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:33,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:33,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:34,004 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:34,005 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:34,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:34,006 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:34,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:34,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:34,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:34,007 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:34,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:34,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:34,010 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:34,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:34,010 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:34,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:34,010 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:34,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:34,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:34,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:34,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:34,017 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:34,017 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:15:34,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:34,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:34,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:34,107 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:34,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:15:34,108 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:34,108 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 02:15:34,108 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:34,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:34,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-13 02:15:34,108 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 02:15:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:34,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1647777026, now seen corresponding path program 1 times [2022-12-13 02:15:34,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:34,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290952052] [2022-12-13 02:15:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:34,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:34,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:15:34,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:34,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290952052] [2022-12-13 02:15:34,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290952052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:34,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:34,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:34,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459883594] [2022-12-13 02:15:34,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:34,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:34,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:34,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:34,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:34,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:34,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:34,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:34,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:34,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:34,263 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:34,263 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:34,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:34,265 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:34,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:34,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:34,265 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:34,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:34,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:34,268 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:34,268 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:34,269 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:34,269 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:34,269 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:34,269 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:34,269 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:34,269 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:34,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:34,275 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:34,275 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:34,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:34,276 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:34,276 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:34,385 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:34,386 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:15:34,386 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:34,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:34,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:34,386 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:34,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-13 02:15:34,386 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 02:15:34,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:34,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1619147875, now seen corresponding path program 1 times [2022-12-13 02:15:34,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:34,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315393948] [2022-12-13 02:15:34,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:34,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:34,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:15:34,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:34,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315393948] [2022-12-13 02:15:34,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315393948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:34,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:34,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:34,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263333710] [2022-12-13 02:15:34,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:34,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:34,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:34,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:34,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:34,448 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:34,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:34,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:34,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:34,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:34,521 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:34,522 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:34,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:34,523 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:34,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:34,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:34,523 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:34,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:34,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:34,526 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:34,526 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:34,526 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:34,526 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:34,526 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:34,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:34,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:34,527 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:34,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:34,532 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:34,532 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:15:34,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:34,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:34,533 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:34,619 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:34,619 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:15:34,619 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:34,619 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 02:15:34,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:34,620 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:34,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-13 02:15:34,620 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 02:15:34,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:34,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1590518724, now seen corresponding path program 1 times [2022-12-13 02:15:34,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:34,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809810734] [2022-12-13 02:15:34,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:34,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:15:34,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:34,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809810734] [2022-12-13 02:15:34,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809810734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:34,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:34,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:34,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684790994] [2022-12-13 02:15:34,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:34,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:34,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:34,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:34,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:34,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:34,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:34,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:34,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:34,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:34,774 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:34,774 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:34,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:34,776 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:34,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:34,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:34,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:34,777 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:34,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:34,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:34,781 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:34,781 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:34,781 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:34,781 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:34,781 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:34,781 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:34,782 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:34,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:34,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:34,790 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:34,790 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:34,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:34,791 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:34,791 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:34,894 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:34,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:15:34,895 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:34,895 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 02:15:34,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:34,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:34,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-13 02:15:34,895 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 02:15:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:34,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1561889573, now seen corresponding path program 1 times [2022-12-13 02:15:34,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:34,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126548588] [2022-12-13 02:15:34,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:34,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:34,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:34,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126548588] [2022-12-13 02:15:34,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126548588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:34,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:34,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:34,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681449304] [2022-12-13 02:15:34,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:34,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:34,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:34,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:34,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:34,969 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:34,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:34,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:34,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:34,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:35,040 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:35,040 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:35,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:35,041 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:35,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:35,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:35,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:35,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:35,042 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:35,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:35,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:35,046 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:35,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:35,047 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:35,047 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:35,047 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:35,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:35,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:35,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:35,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:35,054 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:35,054 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:35,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:35,055 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:35,055 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:35,143 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:35,144 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:15:35,144 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:35,144 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 02:15:35,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:35,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:35,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-13 02:15:35,144 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 02:15:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:35,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1533260422, now seen corresponding path program 1 times [2022-12-13 02:15:35,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:35,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620667007] [2022-12-13 02:15:35,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:35,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:35,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:15:35,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:35,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620667007] [2022-12-13 02:15:35,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620667007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:35,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:35,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:35,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537773243] [2022-12-13 02:15:35,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:35,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:35,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:35,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:35,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:35,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:35,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:35,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:35,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:35,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:35,294 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:35,294 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:35,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:35,296 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:35,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:35,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:35,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:35,297 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:35,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:35,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:35,300 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:35,300 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:35,300 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:35,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:35,300 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:35,300 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:35,300 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:35,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:35,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:35,309 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:35,309 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:35,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:35,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:35,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:35,397 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:35,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:15:35,398 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:35,398 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 02:15:35,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:35,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:35,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-13 02:15:35,399 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 02:15:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:35,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1504631271, now seen corresponding path program 1 times [2022-12-13 02:15:35,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:35,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811363273] [2022-12-13 02:15:35,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:35,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:35,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:15:35,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:35,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811363273] [2022-12-13 02:15:35,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811363273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:35,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:35,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:35,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759045298] [2022-12-13 02:15:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:35,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:35,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:35,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:35,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:35,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:35,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:35,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:35,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:35,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:35,553 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:35,553 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:35,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:35,555 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:35,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:35,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:35,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:35,555 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:35,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:35,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:35,560 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:35,560 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:35,560 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:35,560 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:35,560 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:35,561 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:35,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:35,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:35,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:35,569 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:35,569 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:35,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:35,570 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:35,570 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:35,675 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:35,676 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:15:35,676 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:35,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:35,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:35,676 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:35,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-13 02:15:35,677 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 02:15:35,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:35,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1476002120, now seen corresponding path program 1 times [2022-12-13 02:15:35,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:35,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945273071] [2022-12-13 02:15:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:35,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:15:35,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:35,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945273071] [2022-12-13 02:15:35,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945273071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:35,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:35,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:35,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036800777] [2022-12-13 02:15:35,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:35,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:35,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:35,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:35,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:35,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:35,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:35,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:35,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:35,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:35,864 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:35,864 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:35,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:35,866 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:35,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:35,866 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:35,866 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:35,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:35,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:35,869 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:35,869 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:35,869 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:35,869 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:35,870 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:35,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:35,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:35,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:35,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:35,876 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:35,876 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:15:35,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:35,877 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:35,877 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:35,966 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:35,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:15:35,967 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:35,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:35,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:35,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:35,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-13 02:15:35,967 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 02:15:35,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:35,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1447372969, now seen corresponding path program 1 times [2022-12-13 02:15:35,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:35,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139799737] [2022-12-13 02:15:35,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:35,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:36,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:15:36,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:36,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139799737] [2022-12-13 02:15:36,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139799737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:36,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:36,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646750860] [2022-12-13 02:15:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:36,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:36,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:36,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:36,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:36,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:36,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:36,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:36,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:36,138 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:36,138 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:36,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:36,140 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:36,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:36,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:36,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:36,141 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:36,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:36,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:36,145 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:36,145 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:36,146 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:36,146 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:36,146 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:36,146 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:36,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:36,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:36,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:36,154 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:36,154 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:36,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:36,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:36,156 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:36,262 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:36,262 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:15:36,262 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:36,263 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 02:15:36,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:36,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:36,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-13 02:15:36,263 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 02:15:36,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:36,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1418743818, now seen corresponding path program 1 times [2022-12-13 02:15:36,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:36,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962142642] [2022-12-13 02:15:36,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:36,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:36,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:15:36,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:36,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962142642] [2022-12-13 02:15:36,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962142642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:36,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:36,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:36,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299265198] [2022-12-13 02:15:36,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:36,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:36,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:36,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:36,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:36,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:36,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:36,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:36,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:36,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:36,420 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:36,420 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:36,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:36,422 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:36,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:36,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:36,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:36,422 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:36,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:36,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:36,427 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:36,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:36,427 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:36,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:36,427 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:36,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:36,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:36,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:36,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:36,435 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:36,435 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:36,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:36,436 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:36,436 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:36,528 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:36,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:15:36,528 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:36,528 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 02:15:36,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:36,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:36,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-13 02:15:36,529 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 02:15:36,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1390114667, now seen corresponding path program 1 times [2022-12-13 02:15:36,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:36,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132526093] [2022-12-13 02:15:36,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:36,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:36,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:15:36,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:36,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132526093] [2022-12-13 02:15:36,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132526093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:36,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:36,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:36,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627554650] [2022-12-13 02:15:36,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:36,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:36,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:36,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:36,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:36,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:36,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:36,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:36,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:36,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:36,675 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:36,675 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:36,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:36,677 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:36,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:36,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:36,678 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:36,678 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:36,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:36,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:36,682 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:36,682 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:36,682 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:36,683 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:36,683 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:36,683 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:36,683 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:36,683 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:36,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:36,692 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:36,692 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:36,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:36,693 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:36,693 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:36,806 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:36,807 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:15:36,807 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:36,807 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 02:15:36,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:36,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:36,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-13 02:15:36,807 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 02:15:36,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:36,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1361485516, now seen corresponding path program 1 times [2022-12-13 02:15:36,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:36,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030565596] [2022-12-13 02:15:36,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:36,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:36,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:15:36,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:36,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030565596] [2022-12-13 02:15:36,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030565596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:36,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:36,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:36,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276932887] [2022-12-13 02:15:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:36,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:36,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:36,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:36,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:36,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:36,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:36,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:36,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:36,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:36,971 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:36,971 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:36,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:36,973 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:36,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:36,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:36,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:36,974 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:36,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:36,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:36,980 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:36,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:36,980 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:36,981 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:36,981 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:36,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:36,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:36,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:36,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:36,991 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:36,991 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:36,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:36,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:36,993 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:37,080 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:37,081 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:15:37,081 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:37,081 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 02:15:37,081 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:37,081 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:37,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-13 02:15:37,081 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 02:15:37,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:37,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1332856365, now seen corresponding path program 1 times [2022-12-13 02:15:37,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:37,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852583753] [2022-12-13 02:15:37,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:37,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:37,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:37,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852583753] [2022-12-13 02:15:37,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852583753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:37,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:37,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:37,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048682545] [2022-12-13 02:15:37,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:37,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:37,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:37,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:37,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:37,152 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:37,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:37,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:37,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:37,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:37,238 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:37,238 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:37,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:37,240 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:37,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:37,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:37,243 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:37,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:37,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:37,248 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:37,249 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:37,249 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:37,249 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:37,249 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:37,249 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:37,249 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:37,250 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:37,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:37,257 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:37,258 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:37,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:37,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:37,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:37,361 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:37,362 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:15:37,362 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:37,362 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 02:15:37,362 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:37,362 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:37,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-13 02:15:37,362 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 02:15:37,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:37,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1304227214, now seen corresponding path program 1 times [2022-12-13 02:15:37,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:37,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471204278] [2022-12-13 02:15:37,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:37,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:37,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:37,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471204278] [2022-12-13 02:15:37,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471204278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:37,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:37,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:37,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208148407] [2022-12-13 02:15:37,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:37,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:37,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:37,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:37,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:37,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:37,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:37,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:37,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:37,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:37,514 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:37,514 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:37,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:37,516 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:37,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:37,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:37,519 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:37,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:37,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:37,523 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:37,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:37,524 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:37,524 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:37,524 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:37,524 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:37,524 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:37,524 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:37,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:37,533 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:37,533 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:15:37,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:37,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:37,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:37,622 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:37,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:15:37,622 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:37,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:37,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:37,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:37,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-13 02:15:37,623 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 02:15:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1275598063, now seen corresponding path program 1 times [2022-12-13 02:15:37,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:37,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484359530] [2022-12-13 02:15:37,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:37,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:37,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:15:37,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:37,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484359530] [2022-12-13 02:15:37,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484359530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:37,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:37,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:37,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999881288] [2022-12-13 02:15:37,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:37,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:37,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:37,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:37,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:37,683 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:37,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:37,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:37,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:37,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:37,758 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:37,759 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:37,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:37,760 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:37,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:37,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:37,761 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:37,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:37,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:37,764 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:37,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:37,765 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:37,765 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:37,765 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:37,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:37,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:37,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:37,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:37,772 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:37,772 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:37,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:37,773 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:37,773 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:37,860 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:37,861 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:15:37,861 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:37,861 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 02:15:37,861 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:37,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:37,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-13 02:15:37,862 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 02:15:37,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:37,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1246968912, now seen corresponding path program 1 times [2022-12-13 02:15:37,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:37,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988144953] [2022-12-13 02:15:37,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:37,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:37,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:15:37,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:37,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988144953] [2022-12-13 02:15:37,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988144953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:37,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:37,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:37,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125641432] [2022-12-13 02:15:37,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:37,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:37,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:37,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:37,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:37,971 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:37,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:37,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:37,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:37,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:38,064 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:38,064 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:38,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:38,066 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:38,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:38,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:38,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:38,068 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:38,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:38,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:38,072 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:38,072 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:38,073 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:38,073 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:38,073 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:38,073 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:38,073 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:38,074 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:38,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:38,082 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:38,082 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:38,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:38,083 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:38,083 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:38,173 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:38,173 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:15:38,174 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:38,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:38,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:38,174 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:38,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-13 02:15:38,174 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 02:15:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:38,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1218339761, now seen corresponding path program 1 times [2022-12-13 02:15:38,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:38,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574224133] [2022-12-13 02:15:38,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:38,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:38,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:15:38,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:38,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574224133] [2022-12-13 02:15:38,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574224133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:38,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:38,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421723731] [2022-12-13 02:15:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:38,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:38,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:38,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:38,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:38,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:38,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:38,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:38,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:38,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:38,308 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:38,308 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:38,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:38,309 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:38,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:38,310 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:38,310 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:38,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:38,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:38,314 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:38,315 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:38,315 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:38,315 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:38,315 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:38,315 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:38,316 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:38,316 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:38,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:38,322 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:38,322 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:38,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:38,322 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:38,323 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:38,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:38,419 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:15:38,419 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:38,419 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 02:15:38,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:38,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:38,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-12-13 02:15:38,419 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 02:15:38,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1189710610, now seen corresponding path program 1 times [2022-12-13 02:15:38,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:38,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453163609] [2022-12-13 02:15:38,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:38,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:38,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:15:38,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:38,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453163609] [2022-12-13 02:15:38,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453163609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:38,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:38,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:38,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985472647] [2022-12-13 02:15:38,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:38,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:38,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:38,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:38,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:38,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:38,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:38,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:38,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:38,547 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:38,547 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:38,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:38,548 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:38,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:38,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:38,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:38,549 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:38,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:38,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:38,552 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:38,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:38,552 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:38,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:38,553 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:38,553 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:38,553 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:38,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:38,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:38,559 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:38,559 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:38,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:38,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:38,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:38,649 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:38,650 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:15:38,650 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:38,650 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 02:15:38,650 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:38,650 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:38,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-12-13 02:15:38,651 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 02:15:38,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:38,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1161081459, now seen corresponding path program 1 times [2022-12-13 02:15:38,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:38,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633285207] [2022-12-13 02:15:38,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:38,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:38,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:38,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633285207] [2022-12-13 02:15:38,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633285207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:38,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:38,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:38,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116251328] [2022-12-13 02:15:38,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:38,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:38,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:38,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:38,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:38,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:38,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:38,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:38,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:38,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:38,819 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:38,820 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:38,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:38,821 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:38,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:38,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:38,824 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:38,824 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:38,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:38,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:38,827 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:38,827 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:38,827 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:38,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:38,828 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:38,828 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:38,828 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:38,828 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:38,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:38,834 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:38,834 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:38,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:38,835 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:38,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:38,929 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:38,930 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:15:38,930 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:38,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:38,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:38,930 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:38,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-12-13 02:15:38,930 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 02:15:38,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:38,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1132452308, now seen corresponding path program 1 times [2022-12-13 02:15:38,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:38,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502874237] [2022-12-13 02:15:38,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:38,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:38,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:15:38,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:38,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502874237] [2022-12-13 02:15:38,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502874237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:38,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:38,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:38,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558739710] [2022-12-13 02:15:38,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:38,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:38,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:38,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:38,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:38,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:38,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:38,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:38,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:39,064 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:39,064 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:39,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:39,066 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:39,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:39,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:39,066 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:39,066 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:39,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:39,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:39,069 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:39,069 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:39,069 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:39,069 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:39,070 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:39,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:39,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:39,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:39,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:39,076 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:39,076 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:39,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:39,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:39,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:39,165 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:39,165 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:15:39,166 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:39,166 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 02:15:39,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:39,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:39,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-12-13 02:15:39,166 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 02:15:39,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:39,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1103823157, now seen corresponding path program 1 times [2022-12-13 02:15:39,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:39,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133913350] [2022-12-13 02:15:39,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:39,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:39,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 02:15:39,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:39,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133913350] [2022-12-13 02:15:39,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133913350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:39,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:39,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:39,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6954080] [2022-12-13 02:15:39,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:39,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:39,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:39,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:39,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:39,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:39,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:39,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:39,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:39,335 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:39,335 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:39,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:39,336 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:39,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:39,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:39,337 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:39,337 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:39,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:39,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:39,340 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:39,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:39,340 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:39,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:39,340 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:39,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:39,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:39,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:39,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:39,347 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:39,347 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:39,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:39,348 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:39,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:39,435 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:39,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:15:39,436 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:39,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:39,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:39,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:39,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-12-13 02:15:39,436 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 02:15:39,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1075194006, now seen corresponding path program 1 times [2022-12-13 02:15:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:39,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688211746] [2022-12-13 02:15:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:39,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:15:39,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:39,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688211746] [2022-12-13 02:15:39,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688211746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:39,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:39,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:39,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576747929] [2022-12-13 02:15:39,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:39,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:39,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:39,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:39,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:39,487 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:39,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:39,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:39,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:39,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:39,563 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:39,563 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:39,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:39,565 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:39,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:39,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:39,565 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:39,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:39,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:39,568 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:39,568 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:39,569 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:39,569 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:39,569 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:39,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:39,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:39,570 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:39,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:39,578 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:39,578 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:39,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:39,579 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:39,579 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:39,668 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:39,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:15:39,669 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:39,669 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 02:15:39,669 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:39,669 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:39,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2022-12-13 02:15:39,669 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 02:15:39,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:39,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1046564855, now seen corresponding path program 1 times [2022-12-13 02:15:39,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:39,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880335409] [2022-12-13 02:15:39,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:39,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:39,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:15:39,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:39,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880335409] [2022-12-13 02:15:39,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880335409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:39,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:39,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:39,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650798909] [2022-12-13 02:15:39,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:39,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:39,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:39,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:39,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:39,731 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:39,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:39,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:39,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:39,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:39,798 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:39,799 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:39,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:39,800 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:39,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:39,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:39,800 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:39,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:39,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:39,803 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:39,803 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:39,803 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:39,803 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:39,804 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:39,804 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:39,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:39,804 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:39,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:39,810 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:39,810 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:15:39,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:39,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:39,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:39,906 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:39,907 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:15:39,907 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:39,907 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 02:15:39,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:39,907 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:39,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2022-12-13 02:15:39,907 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 02:15:39,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1017935704, now seen corresponding path program 1 times [2022-12-13 02:15:39,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:39,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922946475] [2022-12-13 02:15:39,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:39,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:15:39,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:39,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922946475] [2022-12-13 02:15:39,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922946475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:39,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:39,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:39,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103475748] [2022-12-13 02:15:39,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:39,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:39,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:39,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:39,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:39,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:39,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:39,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:39,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:39,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:40,054 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:40,054 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:40,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:40,055 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:40,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:40,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:40,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:40,056 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:40,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:40,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:40,059 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:40,059 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:40,059 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:40,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:40,059 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:40,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:40,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:40,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:40,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:40,065 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:40,065 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:15:40,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:40,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:40,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:40,153 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:40,154 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:15:40,154 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:40,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:40,154 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:40,154 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:40,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2022-12-13 02:15:40,154 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 02:15:40,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:40,155 INFO L85 PathProgramCache]: Analyzing trace with hash -989306553, now seen corresponding path program 1 times [2022-12-13 02:15:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:40,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792731308] [2022-12-13 02:15:40,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15: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:15:40,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:40,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792731308] [2022-12-13 02:15:40,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792731308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:40,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:40,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:40,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539517196] [2022-12-13 02:15:40,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:40,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:40,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:40,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:40,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:40,220 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:40,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:40,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:40,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:40,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:40,316 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:40,317 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:40,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:40,318 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:40,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:40,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:40,319 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:40,319 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:40,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:40,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:40,323 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:40,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:40,324 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:40,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:40,324 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:40,324 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:40,324 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:40,325 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:40,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:40,332 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:40,333 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:15:40,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:40,334 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:40,334 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:40,442 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:40,443 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:15:40,443 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:40,443 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 02:15:40,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:40,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:40,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2022-12-13 02:15:40,443 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 02:15:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:40,444 INFO L85 PathProgramCache]: Analyzing trace with hash -960677402, now seen corresponding path program 1 times [2022-12-13 02:15:40,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:40,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552750089] [2022-12-13 02:15:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:40,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:40,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:15:40,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:40,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552750089] [2022-12-13 02:15:40,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552750089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:40,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:40,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:40,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520562313] [2022-12-13 02:15:40,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:40,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:40,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:40,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:40,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:40,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:40,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:40,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:40,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:40,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:40,611 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:40,611 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:40,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:40,612 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:40,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:40,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:40,613 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:40,613 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:40,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:40,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:40,615 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:40,615 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:40,615 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:40,615 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:40,616 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:40,616 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:40,616 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:40,616 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:40,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:40,622 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:40,622 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:15:40,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:40,622 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:40,622 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:40,723 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:40,724 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 02:15:40,724 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:40,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:40,724 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:40,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:40,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2022-12-13 02:15:40,724 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 02:15:40,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:40,724 INFO L85 PathProgramCache]: Analyzing trace with hash -932048251, now seen corresponding path program 1 times [2022-12-13 02:15:40,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:40,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170765791] [2022-12-13 02:15:40,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:40,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:40,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:15:40,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:40,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170765791] [2022-12-13 02:15:40,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170765791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:40,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:40,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:40,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839011755] [2022-12-13 02:15:40,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:40,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:40,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:40,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:40,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:40,816 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:40,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:40,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:40,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:40,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:40,887 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:40,887 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:40,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:40,888 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:40,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:40,889 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:40,889 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:40,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:40,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:40,891 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:40,891 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:40,892 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:40,892 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:40,892 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:40,892 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:40,892 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:40,893 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:40,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:40,898 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:40,898 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:15:40,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:40,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:40,899 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:41,006 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:41,007 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:15:41,007 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:41,007 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 02:15:41,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:41,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:41,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2022-12-13 02:15:41,008 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 02:15:41,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:41,008 INFO L85 PathProgramCache]: Analyzing trace with hash -903419100, now seen corresponding path program 1 times [2022-12-13 02:15:41,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:41,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051608293] [2022-12-13 02:15:41,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:41,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:41,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:15:41,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:41,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051608293] [2022-12-13 02:15:41,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051608293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:41,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:41,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:41,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873763643] [2022-12-13 02:15:41,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:41,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:41,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:41,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:41,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:41,061 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:41,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:41,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:41,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:41,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:41,137 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:41,137 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:41,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:41,138 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:41,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:41,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:41,139 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:41,139 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:41,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:41,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:41,142 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:41,142 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:41,142 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:41,142 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:41,142 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:41,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:41,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:41,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:41,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:41,148 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:41,149 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:41,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:41,149 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:41,150 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:41,241 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:41,242 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:15:41,242 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:41,242 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 02:15:41,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:41,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:41,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2022-12-13 02:15:41,242 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 02:15:41,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash -874789949, now seen corresponding path program 1 times [2022-12-13 02:15:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:41,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906786191] [2022-12-13 02:15:41,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:41,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:41,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:15:41,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:41,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906786191] [2022-12-13 02:15:41,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906786191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:41,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:41,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:41,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524762568] [2022-12-13 02:15:41,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:41,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:41,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:41,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:41,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:41,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:41,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:41,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:41,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:41,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:41,394 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:41,394 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:41,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:41,396 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:41,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:41,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:41,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:41,396 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:41,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:41,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:41,399 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:41,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:41,400 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:41,400 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:41,400 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:41,400 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:41,400 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:41,400 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:41,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:41,407 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:41,407 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:41,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:41,408 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:41,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:41,497 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:41,497 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:15:41,497 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:41,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:41,498 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:41,498 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:41,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2022-12-13 02:15:41,498 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 02:15:41,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:41,498 INFO L85 PathProgramCache]: Analyzing trace with hash -846160798, now seen corresponding path program 1 times [2022-12-13 02:15:41,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:41,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143815014] [2022-12-13 02:15:41,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:41,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:41,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 02:15:41,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:41,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143815014] [2022-12-13 02:15:41,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143815014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:41,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:41,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:41,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12662052] [2022-12-13 02:15:41,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:41,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:41,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:41,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:41,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:41,548 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:41,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:41,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:41,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:41,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:41,625 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:41,625 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:41,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:41,627 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:41,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:41,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:41,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:41,629 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:41,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:41,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:41,633 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:41,633 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:41,633 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:41,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:41,633 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:41,634 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:41,634 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:41,634 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:41,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:41,642 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:41,643 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:41,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:41,644 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:41,644 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:41,737 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:41,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:15:41,738 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:41,738 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 02:15:41,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:41,738 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:41,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2022-12-13 02:15:41,738 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 02:15:41,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash -817531647, now seen corresponding path program 1 times [2022-12-13 02:15:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:41,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642925944] [2022-12-13 02:15:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:41,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:41,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:15:41,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:41,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642925944] [2022-12-13 02:15:41,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642925944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:41,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:41,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:41,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17422590] [2022-12-13 02:15:41,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:41,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:41,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:41,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:41,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:41,811 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:41,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:41,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:41,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:41,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:41,889 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:41,889 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:41,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:41,890 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:41,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:41,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:41,891 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:41,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:41,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:41,894 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:41,894 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:41,894 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:41,894 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:41,894 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:41,894 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:41,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:41,895 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:41,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:41,900 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:41,900 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:41,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:41,901 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:41,901 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:41,990 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:41,990 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:15:41,991 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:41,991 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 02:15:41,991 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:41,991 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:41,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2022-12-13 02:15:41,991 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 02:15:41,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:41,991 INFO L85 PathProgramCache]: Analyzing trace with hash -788902496, now seen corresponding path program 1 times [2022-12-13 02:15:41,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:41,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286197606] [2022-12-13 02:15:41,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:41,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:42,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:15:42,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:42,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286197606] [2022-12-13 02:15:42,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286197606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:42,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:42,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:42,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012977997] [2022-12-13 02:15:42,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:42,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:42,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:42,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:42,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:42,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:42,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:42,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:42,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:42,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:42,138 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:42,138 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:42,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:42,140 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:42,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:42,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:42,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:42,141 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:42,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:42,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:42,144 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:42,144 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:42,145 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:42,145 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:42,145 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:42,146 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:42,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:42,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:42,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:42,154 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:42,154 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:42,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:42,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:42,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:42,263 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:42,263 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:15:42,263 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:42,264 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 02:15:42,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:42,264 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:42,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2022-12-13 02:15:42,264 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 02:15:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:42,264 INFO L85 PathProgramCache]: Analyzing trace with hash -760273345, now seen corresponding path program 1 times [2022-12-13 02:15:42,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:42,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362168900] [2022-12-13 02:15:42,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:42,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:42,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:15:42,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:42,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362168900] [2022-12-13 02:15:42,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362168900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:42,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:42,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612134397] [2022-12-13 02:15:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:42,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:42,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:42,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:42,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:42,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:42,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:42,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:42,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:42,438 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:42,438 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:42,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:42,439 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:42,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:42,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:42,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:42,440 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:42,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:42,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:42,443 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:42,443 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:42,443 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:42,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:42,443 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:42,443 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:42,443 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:42,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:42,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:42,449 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:42,449 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:42,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:42,450 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:42,450 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:42,549 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:42,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:15:42,550 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:42,550 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 02:15:42,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:42,550 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:42,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2022-12-13 02:15:42,550 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 02:15:42,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:42,550 INFO L85 PathProgramCache]: Analyzing trace with hash -731644194, now seen corresponding path program 1 times [2022-12-13 02:15:42,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:42,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660383997] [2022-12-13 02:15:42,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:42,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:42,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:15:42,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:42,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660383997] [2022-12-13 02:15:42,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660383997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:42,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:42,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:42,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522497056] [2022-12-13 02:15:42,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:42,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:42,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:42,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:42,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:42,604 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:42,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:42,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:42,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:42,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:42,671 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:42,672 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:42,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:42,673 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:42,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:42,673 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:42,673 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:42,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:42,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:42,676 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:42,676 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:42,676 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:42,676 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:42,676 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:42,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:42,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:42,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:42,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:42,682 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:42,682 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:42,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:42,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:42,683 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:42,770 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:42,771 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:15:42,771 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:42,771 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 02:15:42,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:42,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:42,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2022-12-13 02:15:42,771 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 02:15:42,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:42,771 INFO L85 PathProgramCache]: Analyzing trace with hash -703015043, now seen corresponding path program 1 times [2022-12-13 02:15:42,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:42,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748959770] [2022-12-13 02:15:42,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:42,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:42,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:15:42,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:42,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748959770] [2022-12-13 02:15:42,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748959770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:42,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:42,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:42,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991506739] [2022-12-13 02:15:42,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:42,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:42,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:42,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:42,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:42,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:42,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:42,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:42,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:42,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:42,975 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:42,975 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:42,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:42,976 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:42,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:42,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:42,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:42,977 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:42,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:42,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:42,980 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:42,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:42,980 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:42,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:42,980 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:42,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:42,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:42,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:42,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:42,987 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:42,987 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:42,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:42,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:42,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:43,102 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:43,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:15:43,102 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:43,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:43,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:43,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:43,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2022-12-13 02:15:43,103 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 02:15:43,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:43,103 INFO L85 PathProgramCache]: Analyzing trace with hash -674385892, now seen corresponding path program 1 times [2022-12-13 02:15:43,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:43,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766539284] [2022-12-13 02:15:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:43,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:43,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:15:43,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:43,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766539284] [2022-12-13 02:15:43,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766539284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:43,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:43,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:43,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339972430] [2022-12-13 02:15:43,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:43,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:43,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:43,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:43,165 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:43,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:43,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:43,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:43,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:43,255 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:43,256 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:43,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:43,257 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:43,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:43,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:43,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:43,257 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:43,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:43,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:43,260 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:43,260 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:43,260 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:43,261 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:43,261 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:43,261 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:43,261 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:43,261 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:43,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:43,267 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:43,267 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:15:43,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:43,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:43,268 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:43,356 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:43,356 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:15:43,356 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:43,356 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 02:15:43,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:43,356 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:43,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2022-12-13 02:15:43,357 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 02:15:43,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash -645756741, now seen corresponding path program 1 times [2022-12-13 02:15:43,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:43,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192111770] [2022-12-13 02:15:43,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:43,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:43,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 02:15:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:43,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192111770] [2022-12-13 02:15:43,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192111770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:43,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:43,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623202803] [2022-12-13 02:15:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:43,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:43,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:43,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:43,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:43,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:43,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:43,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:43,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:43,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:43,504 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:43,504 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:43,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:43,506 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:43,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:43,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:43,507 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:43,507 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:43,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:43,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:43,511 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:43,511 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:43,511 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:43,511 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:43,511 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:43,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:43,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:43,512 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:43,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:43,520 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:43,520 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:43,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:43,521 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:43,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:43,613 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:43,613 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:15:43,613 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:43,613 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 02:15:43,613 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:43,613 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:43,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2022-12-13 02:15:43,614 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 02:15:43,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:43,614 INFO L85 PathProgramCache]: Analyzing trace with hash -617127590, now seen corresponding path program 1 times [2022-12-13 02:15:43,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:43,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248176230] [2022-12-13 02:15:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:43,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:15:43,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:43,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248176230] [2022-12-13 02:15:43,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248176230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:43,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:43,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:43,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909003430] [2022-12-13 02:15:43,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:43,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:43,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:43,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:43,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:43,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:43,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:43,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:43,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:43,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:43,759 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:43,760 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:43,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:43,761 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:43,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:43,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:43,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:43,762 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:43,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:43,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:43,764 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:43,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:43,765 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:43,765 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:43,765 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:43,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:43,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:43,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:43,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:43,771 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:43,771 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:15:43,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:43,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:43,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:43,858 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:43,859 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:15:43,859 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:43,859 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 02:15:43,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:43,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:43,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2022-12-13 02:15:43,859 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 02:15:43,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash -588498439, now seen corresponding path program 1 times [2022-12-13 02:15:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:43,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299992776] [2022-12-13 02:15:43,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:43,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:43,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:15:43,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:43,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299992776] [2022-12-13 02:15:43,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299992776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:43,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:43,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291838984] [2022-12-13 02:15:43,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:43,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:43,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:43,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:43,915 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:43,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:43,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:43,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:43,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:44,013 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:44,013 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:44,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:44,014 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:44,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:44,015 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:44,015 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:44,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:44,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:44,018 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:44,018 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:44,018 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:44,018 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:44,018 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:44,018 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:44,018 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:44,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:44,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:44,025 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:44,025 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:15:44,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:44,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:44,026 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:44,122 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:44,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:15:44,123 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:44,123 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 02:15:44,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:44,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:44,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2022-12-13 02:15:44,124 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 02:15:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash -559869288, now seen corresponding path program 1 times [2022-12-13 02:15:44,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:44,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038443480] [2022-12-13 02:15:44,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:44,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:44,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 02:15:44,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:44,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038443480] [2022-12-13 02:15:44,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038443480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:44,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:44,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186277732] [2022-12-13 02:15:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:44,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:44,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:44,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:44,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:44,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:44,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:44,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:44,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:44,246 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:44,246 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:44,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:44,248 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:44,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:44,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:44,249 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:44,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:44,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:44,252 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:44,252 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:44,252 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:44,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:44,252 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:44,253 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:44,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:44,253 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:44,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:44,260 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:44,260 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:44,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:44,260 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:44,260 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:44,349 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:44,350 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:15:44,350 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:44,350 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 02:15:44,350 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:44,350 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:44,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2022-12-13 02:15:44,351 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 02:15:44,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:44,351 INFO L85 PathProgramCache]: Analyzing trace with hash -531240137, now seen corresponding path program 1 times [2022-12-13 02:15:44,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:44,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839538918] [2022-12-13 02:15:44,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:44,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:44,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:15:44,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:44,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839538918] [2022-12-13 02:15:44,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839538918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:44,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:44,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:44,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713221775] [2022-12-13 02:15:44,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:44,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:44,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:44,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:44,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:44,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:44,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:44,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:44,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:44,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:44,478 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:44,478 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:44,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:44,479 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:44,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:44,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:44,480 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:44,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:44,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:44,482 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:44,483 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:44,483 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:44,483 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:44,483 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:44,484 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:44,484 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:44,484 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:44,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:44,491 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:44,491 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:15:44,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:44,492 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:44,492 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:44,584 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:44,584 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:15:44,584 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:44,584 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 02:15:44,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:44,584 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:44,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2022-12-13 02:15:44,585 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 02:15:44,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:44,585 INFO L85 PathProgramCache]: Analyzing trace with hash -502610986, now seen corresponding path program 1 times [2022-12-13 02:15:44,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:44,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147023089] [2022-12-13 02:15:44,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:44,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:15:44,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:44,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147023089] [2022-12-13 02:15:44,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147023089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:44,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:44,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:44,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891206065] [2022-12-13 02:15:44,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:44,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:44,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:44,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:44,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:44,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:44,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:44,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:44,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:44,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:44,738 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:44,738 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:44,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:44,740 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:44,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:44,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:44,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:44,741 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:44,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:44,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:44,744 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:44,744 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:44,745 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:44,745 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:44,745 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:44,745 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:44,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:44,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:44,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:44,755 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:44,755 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:15:44,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:44,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:44,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:44,865 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:44,866 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:15:44,866 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:44,866 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 02:15:44,866 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:44,866 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:44,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2022-12-13 02:15:44,866 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 02:15:44,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:44,866 INFO L85 PathProgramCache]: Analyzing trace with hash -473981835, now seen corresponding path program 1 times [2022-12-13 02:15:44,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:44,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117323479] [2022-12-13 02:15:44,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:44,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:44,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:15:44,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:44,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117323479] [2022-12-13 02:15:44,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117323479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:44,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:44,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:44,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437677127] [2022-12-13 02:15:44,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:44,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:44,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:44,925 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:44,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:44,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:44,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:44,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:45,000 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:45,000 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:45,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:45,001 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:45,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:45,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:45,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:45,002 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:45,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:45,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:45,006 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:45,007 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:45,007 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:45,007 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:45,007 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:45,007 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:45,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:45,008 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:45,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:45,016 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:45,016 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:15:45,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:45,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:45,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:45,121 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:45,121 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 02:15:45,121 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:45,121 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 02:15:45,121 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:45,121 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:45,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2022-12-13 02:15:45,122 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 02:15:45,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:45,122 INFO L85 PathProgramCache]: Analyzing trace with hash -445352684, now seen corresponding path program 1 times [2022-12-13 02:15:45,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:45,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664126577] [2022-12-13 02:15:45,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:45,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:45,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:15:45,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:45,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664126577] [2022-12-13 02:15:45,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664126577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:45,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:45,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738785932] [2022-12-13 02:15:45,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:45,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:45,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:45,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:45,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:45,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:45,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:45,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:45,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:45,282 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:45,283 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:45,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:45,284 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:45,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:45,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:45,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:45,285 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:45,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:45,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:45,289 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:45,289 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:45,290 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:45,290 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:45,290 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:45,290 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:45,290 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:45,290 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:45,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:45,298 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:45,298 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:45,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:45,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:45,299 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:45,407 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:45,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:15:45,408 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:45,408 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 02:15:45,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:45,408 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:45,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2022-12-13 02:15:45,409 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 02:15:45,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:45,409 INFO L85 PathProgramCache]: Analyzing trace with hash -416723533, now seen corresponding path program 1 times [2022-12-13 02:15:45,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:45,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068684429] [2022-12-13 02:15:45,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:45,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:45,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:15:45,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:45,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068684429] [2022-12-13 02:15:45,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068684429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:45,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:45,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6755283] [2022-12-13 02:15:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:45,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:45,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:45,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:45,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:45,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:45,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:45,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:45,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:45,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:45,560 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:45,560 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:45,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:45,561 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:45,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:45,562 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:45,562 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:45,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:45,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:45,564 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:45,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:45,565 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:45,565 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:45,565 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:45,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:45,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:45,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:45,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:45,571 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:45,571 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:45,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:45,572 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:45,572 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:45,662 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:45,662 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:15:45,662 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:45,662 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 02:15:45,662 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:45,662 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:45,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2022-12-13 02:15:45,663 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 02:15:45,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:45,663 INFO L85 PathProgramCache]: Analyzing trace with hash -388094382, now seen corresponding path program 1 times [2022-12-13 02:15:45,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:45,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968785578] [2022-12-13 02:15:45,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:45,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:45,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:15:45,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:45,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968785578] [2022-12-13 02:15:45,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968785578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:45,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:45,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:45,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069061822] [2022-12-13 02:15:45,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:45,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:45,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:45,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:45,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:45,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:45,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:45,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:45,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:45,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:45,800 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:45,800 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:45,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:45,802 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:45,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:45,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:45,802 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:45,802 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:45,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:45,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:45,806 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:45,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:45,807 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:45,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:45,807 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:45,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:45,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:45,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:45,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:45,816 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:45,816 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:45,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:45,817 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:45,817 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:45,922 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:45,923 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:15:45,923 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:45,923 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 02:15:45,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:45,923 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:45,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2022-12-13 02:15:45,924 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 02:15:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash -359465231, now seen corresponding path program 1 times [2022-12-13 02:15:45,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:45,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614820030] [2022-12-13 02:15:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:45,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:45,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:15:45,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:45,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614820030] [2022-12-13 02:15:45,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614820030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:45,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:45,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:45,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111395585] [2022-12-13 02:15:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:45,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:45,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:45,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:45,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:45,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:45,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:45,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:45,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:45,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:46,081 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:46,081 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:46,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:46,083 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:46,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:46,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:46,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:46,084 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:46,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:46,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:46,089 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:46,089 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:46,089 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:46,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:46,089 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:46,089 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:46,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:46,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:46,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:46,099 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:46,099 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:46,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:46,100 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:46,100 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:46,199 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:46,199 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 02:15:46,199 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:46,199 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 02:15:46,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:46,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:46,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2022-12-13 02:15:46,199 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 02:15:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash -330836080, now seen corresponding path program 1 times [2022-12-13 02:15:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:46,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759546651] [2022-12-13 02:15:46,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:46,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:46,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:15:46,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:46,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759546651] [2022-12-13 02:15:46,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759546651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:46,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:46,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:46,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104674431] [2022-12-13 02:15:46,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:46,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:46,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:46,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:46,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:46,260 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:46,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:46,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:46,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:46,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:46,345 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:46,346 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:46,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:46,347 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:46,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:46,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:46,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:46,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:46,348 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:46,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:46,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:46,350 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:46,350 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:46,350 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:46,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:46,351 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:46,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:46,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:46,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:46,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:46,357 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:46,357 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:46,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:46,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:46,358 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:46,453 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:46,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:15:46,453 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:46,453 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 02:15:46,453 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:46,453 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:46,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2022-12-13 02:15:46,454 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 02:15:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash -302206929, now seen corresponding path program 1 times [2022-12-13 02:15:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:46,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027375143] [2022-12-13 02:15:46,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:46,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:46,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:15:46,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:46,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027375143] [2022-12-13 02:15:46,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027375143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:46,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:46,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722314248] [2022-12-13 02:15:46,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:46,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:46,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:46,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:46,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:46,511 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:46,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:46,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:46,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:46,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:46,594 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:46,595 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:46,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:46,596 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:46,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:46,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:46,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:46,597 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:46,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:46,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:46,601 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:46,601 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:46,601 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:46,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:46,601 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:46,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:46,602 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:46,602 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:46,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:46,610 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:46,610 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:46,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:46,611 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:46,611 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:46,714 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:46,715 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 02:15:46,715 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:46,715 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 02:15:46,715 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:46,715 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:46,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2022-12-13 02:15:46,716 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 02:15:46,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:46,716 INFO L85 PathProgramCache]: Analyzing trace with hash -273577778, now seen corresponding path program 1 times [2022-12-13 02:15:46,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:46,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960445535] [2022-12-13 02:15:46,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:46,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:46,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:15:46,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:46,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960445535] [2022-12-13 02:15:46,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960445535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:46,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:46,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:46,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528792115] [2022-12-13 02:15:46,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:46,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:46,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:46,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:46,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:46,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:46,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:46,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:46,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:46,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:46,842 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:46,843 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:46,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:46,844 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:46,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:46,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:46,845 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:46,845 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:46,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:46,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:46,848 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:46,848 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:46,848 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:46,848 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:46,848 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:46,849 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:46,849 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:46,849 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:46,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:46,858 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:46,858 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:46,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:46,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:46,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:46,955 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:46,956 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:15:46,956 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:46,956 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 02:15:46,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:46,956 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:46,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2022-12-13 02:15:46,956 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 02:15:46,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:46,956 INFO L85 PathProgramCache]: Analyzing trace with hash -244948627, now seen corresponding path program 1 times [2022-12-13 02:15:46,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:46,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692559974] [2022-12-13 02:15:46,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:46,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:47,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:15:47,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:47,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692559974] [2022-12-13 02:15:47,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692559974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:47,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:47,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:47,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729397919] [2022-12-13 02:15:47,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:47,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:47,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:47,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:47,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:47,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:47,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:47,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:47,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:47,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:47,105 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:47,105 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:47,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:47,107 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:47,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:47,108 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:47,108 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:47,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:47,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:47,112 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:47,112 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:47,112 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:47,112 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:47,112 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:47,113 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:47,113 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:47,113 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:47,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:47,121 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:47,121 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:47,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:47,122 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:47,122 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:47,226 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:47,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:15:47,227 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:47,227 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 02:15:47,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:47,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:47,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2022-12-13 02:15:47,227 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 02:15:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash -216319476, now seen corresponding path program 1 times [2022-12-13 02:15:47,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:47,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839655770] [2022-12-13 02:15:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:47,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:47,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:15:47,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:47,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839655770] [2022-12-13 02:15:47,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839655770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:47,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:47,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:47,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111732872] [2022-12-13 02:15:47,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:47,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:47,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:47,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:47,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:47,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:47,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:47,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:47,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:47,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:47,382 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:47,382 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:47,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:47,384 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:47,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:47,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:47,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:47,385 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:47,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:47,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:47,391 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:47,391 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:47,391 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:47,391 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:47,391 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:47,392 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:47,392 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:47,392 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:47,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:47,399 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:47,400 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:47,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:47,400 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:47,401 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:47,502 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:47,503 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 02:15:47,503 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:47,503 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 02:15:47,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:47,503 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:47,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2022-12-13 02:15:47,504 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 02:15:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:47,504 INFO L85 PathProgramCache]: Analyzing trace with hash -187690325, now seen corresponding path program 1 times [2022-12-13 02:15:47,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:47,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8111301] [2022-12-13 02:15:47,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:47,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:47,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:15:47,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:47,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8111301] [2022-12-13 02:15:47,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8111301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:47,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:47,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:47,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948668691] [2022-12-13 02:15:47,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:47,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:47,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:47,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:47,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:47,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:47,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:47,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:47,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:47,695 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:47,696 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:47,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:47,697 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:47,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:47,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:47,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:47,698 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:47,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:47,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:47,702 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:47,702 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:47,702 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:47,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:47,703 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:47,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:47,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:47,703 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:47,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:47,711 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:47,711 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:15:47,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:47,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:47,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:47,820 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:47,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:15:47,821 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:47,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:47,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:47,821 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:47,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2022-12-13 02:15:47,821 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 02:15:47,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:47,821 INFO L85 PathProgramCache]: Analyzing trace with hash -159061174, now seen corresponding path program 1 times [2022-12-13 02:15:47,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:47,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855900020] [2022-12-13 02:15:47,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:47,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:47,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:47,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855900020] [2022-12-13 02:15:47,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855900020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:47,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:47,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:47,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311000221] [2022-12-13 02:15:47,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:47,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:47,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:47,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:47,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:47,872 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:47,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:47,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:47,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:47,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:47,942 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:47,943 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:47,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:47,944 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:47,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:47,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:47,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:47,944 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:47,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:47,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:47,947 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:47,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:47,947 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:47,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:47,947 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:47,948 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:47,948 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:47,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:47,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:47,953 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:47,954 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:15:47,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:47,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:47,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:48,043 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:48,043 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:15:48,043 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:48,043 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 02:15:48,044 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:48,044 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:48,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2022-12-13 02:15:48,044 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 02:15:48,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash -130432023, now seen corresponding path program 1 times [2022-12-13 02:15:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:48,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424209864] [2022-12-13 02:15:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:48,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:48,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:15:48,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:48,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424209864] [2022-12-13 02:15:48,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424209864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:48,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:48,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:48,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557476506] [2022-12-13 02:15:48,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:48,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:48,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:48,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:48,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:48,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:48,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:48,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:48,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:48,203 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:48,203 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:48,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:48,207 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:48,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:48,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:48,208 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:48,208 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:48,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:48,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:48,213 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:48,213 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:48,214 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:48,214 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:48,214 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:48,214 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:48,214 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:48,215 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:48,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:48,223 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:48,223 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:48,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:48,224 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:48,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:48,340 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:48,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:15:48,340 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:48,340 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 02:15:48,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:48,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:48,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2022-12-13 02:15:48,341 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 02:15:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:48,341 INFO L85 PathProgramCache]: Analyzing trace with hash -101802872, now seen corresponding path program 1 times [2022-12-13 02:15:48,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:48,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122472441] [2022-12-13 02:15:48,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:48,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:15:48,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:48,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122472441] [2022-12-13 02:15:48,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122472441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:48,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:48,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:48,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493682790] [2022-12-13 02:15:48,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:48,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:48,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:48,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:48,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:48,397 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:48,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:48,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:48,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:48,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:48,477 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:48,477 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:48,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:48,479 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:48,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:48,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:48,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:48,479 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:48,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:48,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:48,484 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:48,484 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:48,484 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:48,484 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:48,484 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:48,485 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:48,485 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:48,485 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:48,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:48,493 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:48,493 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:15:48,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:48,495 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:48,495 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:48,598 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:48,599 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:15:48,599 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:48,599 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 02:15:48,599 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:48,599 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:48,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2022-12-13 02:15:48,599 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 02:15:48,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash -73173721, now seen corresponding path program 1 times [2022-12-13 02:15:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:48,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328274412] [2022-12-13 02:15:48,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:48,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:48,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:15:48,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:48,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328274412] [2022-12-13 02:15:48,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328274412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:48,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:48,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:48,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726587886] [2022-12-13 02:15:48,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:48,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:48,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:48,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:48,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:48,666 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:48,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:48,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:48,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:48,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:48,738 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:48,738 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:48,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:48,739 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:48,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:48,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:48,740 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:48,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:48,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:48,743 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:48,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:48,743 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:48,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:48,743 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:48,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:48,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:48,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:48,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:48,767 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:48,767 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:48,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:48,768 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:48,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:48,858 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:48,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:15:48,859 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:48,859 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 02:15:48,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:48,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:48,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2022-12-13 02:15:48,859 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 02:15:48,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:48,859 INFO L85 PathProgramCache]: Analyzing trace with hash -44544570, now seen corresponding path program 1 times [2022-12-13 02:15:48,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:48,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351278468] [2022-12-13 02:15:48,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:48,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:48,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:15:48,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:48,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351278468] [2022-12-13 02:15:48,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351278468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:48,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:48,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:48,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400280372] [2022-12-13 02:15:48,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:48,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:48,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:48,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:48,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:48,914 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:48,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:48,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:48,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:48,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:48,997 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:48,997 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:48,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1109 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:48,999 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:48,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:48,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:48,999 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:49,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:49,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:49,003 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:49,003 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:49,003 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:49,004 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:49,004 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:49,004 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:49,004 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:49,004 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:49,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:49,012 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:49,013 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:15:49,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:49,014 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:49,014 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:49,111 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:49,112 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:15:49,112 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:49,112 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 02:15:49,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:49,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:49,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2022-12-13 02:15:49,113 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 02:15:49,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:49,113 INFO L85 PathProgramCache]: Analyzing trace with hash -15915419, now seen corresponding path program 1 times [2022-12-13 02:15:49,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:49,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431467920] [2022-12-13 02:15:49,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:49,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:49,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:15:49,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:49,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431467920] [2022-12-13 02:15:49,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431467920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:49,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:49,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:49,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217085027] [2022-12-13 02:15:49,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:49,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:49,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:49,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:49,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:49,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:49,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:49,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:49,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:49,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:49,239 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:49,239 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:49,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:49,240 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:49,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:49,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:49,241 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:49,241 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:49,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:49,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:49,245 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:49,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:49,245 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:49,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:49,245 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:49,246 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:49,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:49,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:49,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:49,254 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:49,254 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:49,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:49,255 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:49,255 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:49,343 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:49,343 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:15:49,343 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:49,343 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 02:15:49,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:49,344 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:49,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2022-12-13 02:15:49,344 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 02:15:49,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:49,344 INFO L85 PathProgramCache]: Analyzing trace with hash 12713732, now seen corresponding path program 1 times [2022-12-13 02:15:49,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:49,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87803600] [2022-12-13 02:15:49,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:49,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:49,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:15:49,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:49,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87803600] [2022-12-13 02:15:49,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87803600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:49,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:49,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:49,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983346845] [2022-12-13 02:15:49,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:49,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:49,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:49,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:49,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:49,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:49,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:49,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:49,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:49,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:49,507 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:49,508 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:49,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:49,509 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:49,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:49,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:49,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:49,510 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:49,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:49,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:49,514 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:49,514 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:49,514 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:49,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:49,514 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:49,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:49,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:49,515 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:49,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:49,522 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:49,523 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:49,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:49,524 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:49,524 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:49,624 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:49,625 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 02:15:49,625 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:49,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:49,625 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:49,625 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:49,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2022-12-13 02:15:49,625 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 02:15:49,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:49,626 INFO L85 PathProgramCache]: Analyzing trace with hash 41342883, now seen corresponding path program 1 times [2022-12-13 02:15:49,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:49,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71285249] [2022-12-13 02:15:49,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:49,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:49,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:15:49,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:49,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71285249] [2022-12-13 02:15:49,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71285249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:49,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:49,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:49,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034279478] [2022-12-13 02:15:49,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:49,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:49,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:49,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:49,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:49,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:49,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:49,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:49,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:49,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:49,786 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:49,786 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:49,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:49,788 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:49,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:49,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:49,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:49,790 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:49,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:49,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:49,794 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:49,794 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:49,794 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:49,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:49,795 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:49,795 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:49,795 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:49,795 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:49,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:49,803 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:49,803 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:49,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:49,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:49,804 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:49,906 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:49,907 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:15:49,907 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:49,907 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 02:15:49,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:49,907 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:49,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2022-12-13 02:15:49,907 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 02:15:49,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:49,907 INFO L85 PathProgramCache]: Analyzing trace with hash 69972034, now seen corresponding path program 1 times [2022-12-13 02:15:49,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:49,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343646187] [2022-12-13 02:15:49,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:49,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:49,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:15:49,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:49,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343646187] [2022-12-13 02:15:49,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343646187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:49,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:49,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:49,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988877901] [2022-12-13 02:15:49,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:49,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:49,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:49,961 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:49,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:49,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:49,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:49,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:50,059 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:50,059 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:50,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1129 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:50,061 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:50,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:50,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:50,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:50,062 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:50,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:50,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:50,066 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:50,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:50,066 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:50,066 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:50,066 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:50,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:50,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:50,067 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:50,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:50,075 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:50,075 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:15:50,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:50,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:50,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:50,183 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:50,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:15:50,184 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:50,184 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 02:15:50,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:50,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:50,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2022-12-13 02:15:50,185 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 02:15:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash 98601185, now seen corresponding path program 1 times [2022-12-13 02:15:50,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:50,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90256417] [2022-12-13 02:15:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:50,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:50,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:15:50,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:50,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90256417] [2022-12-13 02:15:50,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90256417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:50,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:50,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:50,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050067360] [2022-12-13 02:15:50,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:50,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:50,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:50,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:50,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:50,243 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:50,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:50,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:50,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:50,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:50,329 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:50,329 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:50,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:50,330 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:50,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:50,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:50,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:50,331 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:50,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:50,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:50,333 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:50,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:50,334 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:50,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:50,334 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:50,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:50,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:50,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:50,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:50,340 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:50,340 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:15:50,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:50,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:50,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:50,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:50,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:15:50,427 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:50,427 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 02:15:50,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:50,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:50,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2022-12-13 02:15:50,427 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 02:15:50,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:50,428 INFO L85 PathProgramCache]: Analyzing trace with hash 127230336, now seen corresponding path program 1 times [2022-12-13 02:15:50,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:50,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842272587] [2022-12-13 02:15:50,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:50,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:50,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:15:50,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:50,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842272587] [2022-12-13 02:15:50,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842272587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:50,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:50,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:50,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729733362] [2022-12-13 02:15:50,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:50,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:50,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:50,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:50,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:50,494 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:50,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:50,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:50,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:50,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:50,573 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:50,573 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:50,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:50,575 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:50,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:50,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:50,575 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:50,575 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:50,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:50,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:50,578 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:50,578 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:50,578 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:50,578 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:50,578 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:50,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:50,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:50,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:50,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:50,584 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:50,585 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:50,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:50,585 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:50,585 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:50,672 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:50,672 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:15:50,673 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:50,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:50,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:50,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:50,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2022-12-13 02:15:50,673 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 02:15:50,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:50,673 INFO L85 PathProgramCache]: Analyzing trace with hash 155859487, now seen corresponding path program 1 times [2022-12-13 02:15:50,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:50,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901996909] [2022-12-13 02:15:50,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:50,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15: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:15:50,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:50,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901996909] [2022-12-13 02:15:50,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901996909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:50,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:50,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:50,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033538209] [2022-12-13 02:15:50,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:50,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:50,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:50,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:50,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:50,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:50,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:50,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:50,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:50,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:50,823 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:50,824 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:50,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:50,825 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:50,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:50,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:50,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:50,826 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:50,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:50,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:50,828 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:50,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:50,829 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:50,829 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:50,829 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:50,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:50,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:50,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:50,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:50,837 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:50,837 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:50,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:50,838 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:50,838 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:50,926 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:50,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:15:50,927 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:50,927 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 02:15:50,927 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:50,927 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:50,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2022-12-13 02:15:50,927 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 02:15:50,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:50,927 INFO L85 PathProgramCache]: Analyzing trace with hash 184488638, now seen corresponding path program 1 times [2022-12-13 02:15:50,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:50,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84312551] [2022-12-13 02:15:50,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:50,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:15:50,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:50,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84312551] [2022-12-13 02:15:50,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84312551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:50,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:50,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:50,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252937982] [2022-12-13 02:15:50,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:50,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:50,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:50,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:50,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:50,983 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:50,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:50,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:50,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:50,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:51,073 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:51,073 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:51,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:51,075 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:51,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:51,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:51,075 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:51,076 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:51,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:51,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:51,083 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:51,083 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:51,084 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:51,084 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:51,084 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:51,084 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:51,084 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:51,084 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:51,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:51,092 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:51,093 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:51,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:51,093 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:51,094 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:51,203 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:51,204 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:15:51,204 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:51,204 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 02:15:51,204 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:51,204 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:51,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2022-12-13 02:15:51,204 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 02:15:51,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash 213117789, now seen corresponding path program 1 times [2022-12-13 02:15:51,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:51,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80665268] [2022-12-13 02:15:51,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:51,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:51,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:15:51,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:51,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80665268] [2022-12-13 02:15:51,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80665268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:51,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:51,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:51,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648415389] [2022-12-13 02:15:51,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:51,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:51,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:51,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:51,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:51,278 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:51,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:51,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:51,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:51,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:51,365 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:51,365 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:51,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:51,366 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:51,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:51,367 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:51,367 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:51,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:51,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:51,369 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:51,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:51,370 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:51,370 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:51,370 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:51,370 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:51,370 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:51,370 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:51,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:51,377 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:51,377 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:15:51,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:51,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:51,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:51,463 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:51,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:15:51,463 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:51,463 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 02:15:51,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:51,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:51,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2022-12-13 02:15:51,464 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 02:15:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:51,464 INFO L85 PathProgramCache]: Analyzing trace with hash 241746940, now seen corresponding path program 1 times [2022-12-13 02:15:51,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:51,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442770679] [2022-12-13 02:15:51,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:51,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:51,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:15:51,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:51,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442770679] [2022-12-13 02:15:51,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442770679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:51,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:51,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:51,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097630717] [2022-12-13 02:15:51,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:51,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:51,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:51,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:51,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:51,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:51,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:51,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:51,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:51,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:51,596 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:51,597 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:51,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:51,598 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:51,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:51,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:51,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:51,598 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:51,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:51,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:51,601 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:51,601 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:51,602 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:51,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:51,602 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:51,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:51,602 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:51,602 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:51,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:51,608 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:51,608 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:51,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:51,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:51,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:51,695 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:51,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:15:51,696 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:51,696 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 02:15:51,696 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:51,696 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:51,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2022-12-13 02:15:51,696 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 02:15:51,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash 270376091, now seen corresponding path program 1 times [2022-12-13 02:15:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:51,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814620602] [2022-12-13 02:15:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:51,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:15:51,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:51,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814620602] [2022-12-13 02:15:51,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814620602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:51,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:51,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:51,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922220076] [2022-12-13 02:15:51,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:51,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:51,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:51,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:51,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:51,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:51,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:51,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:51,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:51,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:51,841 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:51,841 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:51,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:51,843 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:51,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:51,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:51,844 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:51,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:51,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:51,848 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:51,848 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:51,848 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:51,848 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:51,849 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:51,849 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:51,849 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:51,849 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:51,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:51,858 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:51,858 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:51,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:51,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:51,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:51,966 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:51,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:15:51,967 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:51,967 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 02:15:51,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:51,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:51,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2022-12-13 02:15:51,967 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 02:15:51,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:51,968 INFO L85 PathProgramCache]: Analyzing trace with hash 299005242, now seen corresponding path program 1 times [2022-12-13 02:15:51,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:51,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606961258] [2022-12-13 02:15:51,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:51,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:52,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:15:52,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:52,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606961258] [2022-12-13 02:15:52,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606961258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:52,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:52,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:52,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730116489] [2022-12-13 02:15:52,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:52,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:52,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:52,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:52,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:52,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:52,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:52,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:52,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:52,115 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:52,115 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:52,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:52,117 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:52,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:52,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:52,118 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:52,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:52,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:52,122 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:52,122 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:52,122 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:52,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:52,122 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:52,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:52,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:52,123 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:52,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:52,131 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:52,131 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:52,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:52,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:52,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:52,243 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:52,244 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:15:52,244 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:52,244 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 02:15:52,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:52,244 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:52,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2022-12-13 02:15:52,244 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 02:15:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:52,244 INFO L85 PathProgramCache]: Analyzing trace with hash 327634393, now seen corresponding path program 1 times [2022-12-13 02:15:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:52,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020394727] [2022-12-13 02:15:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:52,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:15:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:52,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020394727] [2022-12-13 02:15:52,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020394727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:52,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:52,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:52,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203549282] [2022-12-13 02:15:52,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:52,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:52,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:52,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:52,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:52,293 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:52,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:52,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:52,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:52,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:52,376 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:52,377 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:52,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:52,378 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:52,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:52,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:52,378 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:52,378 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:52,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:52,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:52,381 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:52,381 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:52,381 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:52,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:52,381 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:52,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:52,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:52,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:52,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:52,388 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:52,388 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:52,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:52,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:52,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:52,476 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:52,477 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:15:52,477 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:52,477 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 02:15:52,477 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:52,477 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:52,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2022-12-13 02:15:52,477 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 02:15:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:52,477 INFO L85 PathProgramCache]: Analyzing trace with hash 356263544, now seen corresponding path program 1 times [2022-12-13 02:15:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:52,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445173783] [2022-12-13 02:15:52,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:52,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:52,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:15:52,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:52,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445173783] [2022-12-13 02:15:52,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445173783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:52,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:52,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:52,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368478353] [2022-12-13 02:15:52,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:52,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:52,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:52,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:52,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:52,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:52,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:52,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:52,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:52,600 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:52,600 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:52,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:52,601 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:52,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:52,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:52,601 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:52,601 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:52,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:52,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:52,604 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:52,604 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:52,604 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:52,604 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:52,604 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:52,605 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:52,605 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:52,605 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:52,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:52,612 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:52,612 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:52,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:52,613 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:52,613 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:52,702 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:52,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:15:52,703 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:52,703 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 02:15:52,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:52,703 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:52,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2022-12-13 02:15:52,704 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 02:15:52,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:52,704 INFO L85 PathProgramCache]: Analyzing trace with hash 384892695, now seen corresponding path program 1 times [2022-12-13 02:15:52,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:52,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619265778] [2022-12-13 02:15:52,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:52,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:52,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:15:52,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:52,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619265778] [2022-12-13 02:15:52,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619265778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:52,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:52,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:52,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160461419] [2022-12-13 02:15:52,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:52,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:52,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:52,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:52,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:52,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:52,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:52,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:52,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:52,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:52,821 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:52,822 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:52,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:52,823 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:52,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:52,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:52,824 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:52,824 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:52,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:52,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:52,826 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:52,826 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:52,827 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:52,827 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:52,827 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:52,827 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:52,827 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:52,827 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:52,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:52,833 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:52,833 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:52,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:52,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:52,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:52,922 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:52,923 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:15:52,923 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:52,923 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 02:15:52,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:52,923 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:52,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2022-12-13 02:15:52,923 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 02:15:52,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:52,923 INFO L85 PathProgramCache]: Analyzing trace with hash 413521846, now seen corresponding path program 1 times [2022-12-13 02:15:52,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:52,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056346837] [2022-12-13 02:15:52,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:52,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:52,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:15:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:52,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056346837] [2022-12-13 02:15:52,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056346837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:52,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:52,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:52,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869843802] [2022-12-13 02:15:52,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:52,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:52,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:52,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:52,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:52,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:52,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:52,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:52,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:52,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:53,042 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:53,042 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:53,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:53,043 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:53,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:53,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:53,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:53,044 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:53,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:53,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:53,046 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:53,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:53,047 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:53,047 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:53,047 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:53,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:53,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:53,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:53,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:53,053 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:53,053 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:53,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:53,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:53,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:53,140 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:53,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:15:53,141 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:53,141 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 02:15:53,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:53,141 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:53,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2022-12-13 02:15:53,141 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 02:15:53,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:53,141 INFO L85 PathProgramCache]: Analyzing trace with hash 442150997, now seen corresponding path program 1 times [2022-12-13 02:15:53,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:53,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737208747] [2022-12-13 02:15:53,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:53,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:53,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:15:53,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:53,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737208747] [2022-12-13 02:15:53,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737208747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:53,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:53,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:53,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775138881] [2022-12-13 02:15:53,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:53,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:53,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:53,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:53,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:53,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:53,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:53,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:53,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:53,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:53,263 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:53,263 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:53,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:53,264 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:53,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:53,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:53,265 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:53,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:53,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:53,268 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:53,268 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:53,268 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:53,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:53,268 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:53,268 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:53,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:53,269 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:53,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:53,277 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:53,277 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:53,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:53,278 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:53,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:53,449 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:53,450 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-13 02:15:53,450 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:53,450 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 02:15:53,450 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:53,450 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:53,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2022-12-13 02:15:53,450 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 02:15:53,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:53,451 INFO L85 PathProgramCache]: Analyzing trace with hash 470780148, now seen corresponding path program 1 times [2022-12-13 02:15:53,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:53,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048231910] [2022-12-13 02:15:53,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:53,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:15:53,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:53,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048231910] [2022-12-13 02:15:53,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048231910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:53,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:53,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:53,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639037066] [2022-12-13 02:15:53,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:53,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:53,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:53,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:53,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:53,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:53,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:53,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:53,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:53,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:53,576 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:53,576 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:53,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:53,578 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:53,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:53,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:53,578 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:53,578 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:53,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:53,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:53,581 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:53,581 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:53,581 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:53,581 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:53,581 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:53,582 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:53,582 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:53,582 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:53,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:53,588 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:53,588 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:53,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:53,589 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:53,590 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:53,692 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:53,693 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 02:15:53,693 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:53,693 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 02:15:53,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:53,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:53,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2022-12-13 02:15:53,693 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 02:15:53,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:53,693 INFO L85 PathProgramCache]: Analyzing trace with hash 499409299, now seen corresponding path program 1 times [2022-12-13 02:15:53,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:53,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750205155] [2022-12-13 02:15:53,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:53,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:53,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:15:53,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:53,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750205155] [2022-12-13 02:15:53,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750205155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:53,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:53,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:53,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837219430] [2022-12-13 02:15:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:53,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:53,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:53,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:53,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:53,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:53,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:53,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:53,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:53,832 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:53,832 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:53,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:53,833 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:53,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:53,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:53,834 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:53,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:53,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:53,836 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:53,836 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:53,836 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:53,837 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:53,837 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:53,839 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:53,839 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:53,839 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:53,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:53,847 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:53,847 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:53,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:53,848 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:53,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:53,955 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:53,955 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:15:53,955 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:53,955 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 02:15:53,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:53,956 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:53,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2022-12-13 02:15:53,956 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 02:15:53,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash 528038450, now seen corresponding path program 1 times [2022-12-13 02:15:53,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:53,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616491756] [2022-12-13 02:15:53,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:53,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:54,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:15:54,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:54,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616491756] [2022-12-13 02:15:54,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616491756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:54,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:54,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:54,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393474829] [2022-12-13 02:15:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:54,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:54,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:54,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:54,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:54,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:54,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:54,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:54,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:54,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:54,083 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:54,083 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:54,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:54,084 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:54,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:54,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:54,084 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:54,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:54,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:54,087 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:54,087 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:54,087 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:54,087 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:54,087 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:54,088 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:54,088 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:54,088 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:54,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:54,093 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:54,093 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:15:54,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:54,094 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:54,094 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:54,181 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:54,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:15:54,181 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:54,181 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 02:15:54,181 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:54,182 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:54,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2022-12-13 02:15:54,182 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 02:15:54,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash 556667601, now seen corresponding path program 1 times [2022-12-13 02:15:54,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:54,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048206883] [2022-12-13 02:15:54,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:54,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:15:54,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:54,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048206883] [2022-12-13 02:15:54,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048206883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:54,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:54,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:54,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714562886] [2022-12-13 02:15:54,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:54,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:54,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:54,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:54,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:54,238 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:54,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:54,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:54,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:54,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:54,329 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:54,329 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:54,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:54,330 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:54,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:54,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:54,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:54,331 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:54,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:54,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:54,335 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:54,335 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:54,336 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:54,336 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:54,336 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:54,336 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:54,336 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:54,336 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:54,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:54,344 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:54,344 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:54,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:54,345 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:54,345 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:54,459 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:54,460 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:15:54,460 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:54,460 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 02:15:54,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:54,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:54,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2022-12-13 02:15:54,460 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 02:15:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash 585296752, now seen corresponding path program 1 times [2022-12-13 02:15:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:54,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506272622] [2022-12-13 02:15:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:54,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:54,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:15:54,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:54,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506272622] [2022-12-13 02:15:54,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506272622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:54,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:54,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:54,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378344502] [2022-12-13 02:15:54,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:54,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:54,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:54,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:54,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:54,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:54,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:54,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:54,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:54,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:54,593 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:54,593 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:54,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:54,594 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:54,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:54,595 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:54,595 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:54,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:54,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:54,597 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:54,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:54,598 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:54,598 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:54,598 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:54,598 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:54,598 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:54,598 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:54,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:54,604 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:54,604 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:54,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:54,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:54,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:54,709 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:54,709 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 02:15:54,709 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:54,710 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 02:15:54,710 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:54,710 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:54,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2022-12-13 02:15:54,710 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 02:15:54,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:54,710 INFO L85 PathProgramCache]: Analyzing trace with hash 613925903, now seen corresponding path program 1 times [2022-12-13 02:15:54,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:54,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128555790] [2022-12-13 02:15:54,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:54,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:54,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 02:15:54,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:54,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128555790] [2022-12-13 02:15:54,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128555790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:54,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:54,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:54,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860548773] [2022-12-13 02:15:54,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:54,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:54,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:54,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:54,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:54,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:54,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:54,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:54,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:54,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:54,852 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:54,852 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:54,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:54,853 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:54,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:54,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:54,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:54,854 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:54,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:54,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:54,856 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:54,856 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:54,856 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:54,856 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:54,857 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:54,857 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:54,857 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:54,857 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:54,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:54,865 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:54,865 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:54,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:54,866 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:54,866 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:54,959 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:54,959 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:15:54,959 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:54,959 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 02:15:54,959 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:54,959 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:54,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2022-12-13 02:15:54,959 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 02:15:54,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:54,960 INFO L85 PathProgramCache]: Analyzing trace with hash 642555054, now seen corresponding path program 1 times [2022-12-13 02:15:54,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:54,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641410401] [2022-12-13 02:15:54,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:54,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:55,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:55,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641410401] [2022-12-13 02:15:55,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641410401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:55,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:55,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:55,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712917966] [2022-12-13 02:15:55,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:55,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:55,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:55,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:55,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:55,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:55,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:55,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:55,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:55,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:55,094 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:55,094 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:55,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:55,095 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:55,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:55,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:55,096 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:55,096 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:55,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:55,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:55,098 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:55,098 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:55,099 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:55,099 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:55,099 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:55,099 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:55,099 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:55,099 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:55,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:55,105 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:55,105 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:55,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:55,105 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:55,105 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:55,191 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:55,192 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:15:55,192 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:55,192 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 02:15:55,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:55,193 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:55,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2022-12-13 02:15:55,193 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 02:15:55,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:55,193 INFO L85 PathProgramCache]: Analyzing trace with hash 671184205, now seen corresponding path program 1 times [2022-12-13 02:15:55,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:55,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551603711] [2022-12-13 02:15:55,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:55,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:55,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:15:55,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:55,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551603711] [2022-12-13 02:15:55,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551603711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:55,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:55,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:55,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108916645] [2022-12-13 02:15:55,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:55,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:55,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:55,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:55,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:55,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:55,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:55,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:55,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:55,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:55,328 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:55,328 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:55,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:55,329 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:55,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:55,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:55,330 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:55,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:55,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:55,333 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:55,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:55,333 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:55,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:55,333 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:55,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:55,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:55,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:55,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:55,341 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:55,341 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:55,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:55,342 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:55,342 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:55,433 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:55,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:15:55,433 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:55,434 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 02:15:55,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:55,434 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:55,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2022-12-13 02:15:55,434 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 02:15:55,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash 699813356, now seen corresponding path program 1 times [2022-12-13 02:15:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:55,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209626339] [2022-12-13 02:15:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:55,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:15:55,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:55,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209626339] [2022-12-13 02:15:55,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209626339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:55,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:55,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:55,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545334684] [2022-12-13 02:15:55,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:55,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:55,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:55,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:55,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:55,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:55,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:55,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:55,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:55,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:55,565 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:55,565 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:55,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:55,566 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:55,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:55,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:55,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:55,566 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:55,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:55,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:55,569 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:55,569 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:55,569 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:55,569 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:55,569 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:55,570 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:55,570 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:55,570 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:55,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:55,575 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:55,575 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:55,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:55,576 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:55,576 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:55,663 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:55,663 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:15:55,664 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:55,664 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 02:15:55,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:55,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:55,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2022-12-13 02:15:55,664 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 02:15:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash 728442507, now seen corresponding path program 1 times [2022-12-13 02:15:55,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:55,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396297903] [2022-12-13 02:15:55,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:55,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15: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:15:55,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:55,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396297903] [2022-12-13 02:15:55,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396297903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:55,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:55,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:55,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286299629] [2022-12-13 02:15:55,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:55,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:55,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:55,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:55,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:55,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:55,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:55,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:55,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:55,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:55,788 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:55,788 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:55,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:55,790 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:55,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:55,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:55,790 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:55,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:55,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:55,793 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:55,793 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:55,793 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:55,793 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:55,793 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:55,793 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:55,793 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:55,793 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:55,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:55,799 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:55,799 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:55,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:55,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:55,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:55,886 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:55,887 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:15:55,887 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:55,887 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 02:15:55,887 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:55,887 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:55,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2022-12-13 02:15:55,887 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 02:15:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash 757071658, now seen corresponding path program 1 times [2022-12-13 02:15:55,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:55,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830593560] [2022-12-13 02:15:55,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:55,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:55,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:15:55,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:55,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830593560] [2022-12-13 02:15:55,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830593560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:55,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:55,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:55,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482397673] [2022-12-13 02:15:55,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:55,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:55,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:55,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:55,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:55,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:55,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:55,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:55,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:55,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:56,046 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:56,047 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:56,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:56,048 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:56,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:56,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:56,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:56,048 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:56,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:56,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:56,051 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:56,051 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:56,051 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:56,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:56,052 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:56,052 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:56,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:56,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:56,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:56,058 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:56,058 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:56,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:56,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:56,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:56,145 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:56,145 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:15:56,146 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:56,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:56,146 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:56,146 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:56,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2022-12-13 02:15:56,146 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 02:15:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash 785700809, now seen corresponding path program 1 times [2022-12-13 02:15:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:56,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190184304] [2022-12-13 02:15:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:56,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:15:56,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:56,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190184304] [2022-12-13 02:15:56,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190184304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:56,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:56,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:56,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503942858] [2022-12-13 02:15:56,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:56,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:56,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:56,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:56,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:56,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:56,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:56,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:56,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:56,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:56,256 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:56,256 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:56,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:56,257 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:56,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:56,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:56,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:56,258 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:56,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:56,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:56,260 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:56,261 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:56,261 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:56,261 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:56,261 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:56,261 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:56,261 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:56,261 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:56,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:56,270 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:56,270 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:56,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:56,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:56,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:56,365 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:56,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:15:56,365 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:56,365 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 02:15:56,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:56,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:56,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2022-12-13 02:15:56,366 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 02:15:56,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:56,366 INFO L85 PathProgramCache]: Analyzing trace with hash 814329960, now seen corresponding path program 1 times [2022-12-13 02:15:56,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:56,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670707124] [2022-12-13 02:15:56,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:56,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:56,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:15:56,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:56,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670707124] [2022-12-13 02:15:56,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670707124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:56,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:56,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:56,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402663196] [2022-12-13 02:15:56,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:56,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:56,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:56,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:56,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:56,412 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:56,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:56,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:56,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:56,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:56,478 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:56,478 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:56,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:56,479 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:56,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:56,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:56,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:56,480 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:56,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:56,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:56,482 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:56,482 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:56,482 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:56,482 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:56,483 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:56,483 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:56,483 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:56,483 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:56,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:56,495 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:56,495 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:15:56,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:56,496 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:56,496 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:56,582 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:56,583 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:15:56,583 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:56,583 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 02:15:56,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:56,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:56,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2022-12-13 02:15:56,583 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 02:15:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:56,584 INFO L85 PathProgramCache]: Analyzing trace with hash 842959111, now seen corresponding path program 1 times [2022-12-13 02:15:56,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:56,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228363781] [2022-12-13 02:15:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:56,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:56,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 02:15:56,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:56,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228363781] [2022-12-13 02:15:56,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228363781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:56,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:56,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:56,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526133791] [2022-12-13 02:15:56,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:56,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:56,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:56,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:56,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:56,628 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:56,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:56,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:56,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:56,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:56,700 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:56,700 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:15:56,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:56,702 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:56,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:56,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:56,703 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:56,703 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:56,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:56,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:56,706 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:56,706 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:56,707 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:56,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:56,707 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:56,707 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:56,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:56,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:56,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:56,715 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:56,715 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:15:56,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:56,718 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:56,718 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:56,827 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:56,828 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:15:56,828 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:56,828 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 02:15:56,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:56,828 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:56,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2022-12-13 02:15:56,828 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 02:15:56,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:56,828 INFO L85 PathProgramCache]: Analyzing trace with hash 871588262, now seen corresponding path program 1 times [2022-12-13 02:15:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:56,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35881244] [2022-12-13 02:15:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:56,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:15:56,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:56,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35881244] [2022-12-13 02:15:56,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35881244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:56,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:56,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:56,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859743348] [2022-12-13 02:15:56,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:56,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:56,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:56,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:56,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:56,913 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:56,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:56,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:56,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:56,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:57,011 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:57,011 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:57,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:57,013 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:57,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:57,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:57,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:57,014 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:57,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:57,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:57,018 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,018 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:57,019 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:57,019 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:57,019 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,019 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:57,019 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:57,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:57,027 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:57,027 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:15:57,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:57,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:57,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:57,133 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:57,134 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:15:57,134 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:57,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:57,134 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:57,134 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:57,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2022-12-13 02:15:57,134 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 02:15:57,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash 900217413, now seen corresponding path program 1 times [2022-12-13 02:15:57,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:57,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907753947] [2022-12-13 02:15:57,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:57,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:57,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:15:57,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:57,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907753947] [2022-12-13 02:15:57,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907753947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:57,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:57,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:57,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017180206] [2022-12-13 02:15:57,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:57,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:57,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:57,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:57,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:57,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:57,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:57,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:57,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:57,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:57,272 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:57,272 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:15:57,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:57,274 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:57,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:57,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:57,274 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:57,274 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:57,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:57,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:57,278 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:57,279 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:57,279 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:57,279 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,279 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:57,279 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:57,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:57,287 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:57,287 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:15:57,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:57,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:57,288 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:57,395 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:57,396 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:15:57,396 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:57,396 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 02:15:57,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:57,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:57,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2022-12-13 02:15:57,396 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 02:15:57,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:57,397 INFO L85 PathProgramCache]: Analyzing trace with hash 928846564, now seen corresponding path program 1 times [2022-12-13 02:15:57,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:57,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769464169] [2022-12-13 02:15:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:57,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:57,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:15:57,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:57,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769464169] [2022-12-13 02:15:57,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769464169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:57,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:57,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:57,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557593899] [2022-12-13 02:15:57,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:57,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:57,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:57,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:57,451 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:57,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:57,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:57,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:57,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:57,516 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:57,516 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:57,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:57,517 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:57,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:57,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:57,518 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:57,518 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:57,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:57,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:57,521 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:57,521 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:57,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:57,521 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,521 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:57,521 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:57,521 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:57,527 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:57,527 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:15:57,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:57,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:57,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:57,613 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:57,614 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:15:57,614 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:57,614 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 02:15:57,614 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:57,614 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:57,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2022-12-13 02:15:57,614 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 02:15:57,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash 957475715, now seen corresponding path program 1 times [2022-12-13 02:15:57,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:57,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718003250] [2022-12-13 02:15:57,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:57,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:57,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:15:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:57,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718003250] [2022-12-13 02:15:57,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718003250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:57,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:57,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:57,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389377980] [2022-12-13 02:15:57,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:57,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:57,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:57,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:57,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:57,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:57,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:57,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:57,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:57,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:57,748 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:57,749 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:57,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1125 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:57,750 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:57,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:57,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:57,750 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:57,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:57,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:57,753 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:57,753 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:57,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:57,753 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:57,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:57,754 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:57,759 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:57,759 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:57,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:57,760 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:57,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:57,844 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:57,844 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:15:57,845 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:57,845 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 02:15:57,845 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:57,845 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:57,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2022-12-13 02:15:57,845 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 02:15:57,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:57,845 INFO L85 PathProgramCache]: Analyzing trace with hash 986104866, now seen corresponding path program 1 times [2022-12-13 02:15:57,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:57,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599943429] [2022-12-13 02:15:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:57,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:57,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:15:57,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:57,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599943429] [2022-12-13 02:15:57,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599943429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:57,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:57,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:57,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894166388] [2022-12-13 02:15:57,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:57,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:57,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:57,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:57,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:57,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:57,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:57,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:57,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:57,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:57,966 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:57,966 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:15:57,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:57,967 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:57,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:57,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:57,968 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:57,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:57,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:57,970 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,970 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:57,971 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:57,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:57,971 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:57,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:57,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:57,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:57,978 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:57,978 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:15:57,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:57,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:57,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:58,068 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:58,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:15:58,069 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:58,069 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 02:15:58,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:58,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:58,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2022-12-13 02:15:58,069 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 02:15:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:58,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1014734017, now seen corresponding path program 1 times [2022-12-13 02:15:58,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:58,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205267423] [2022-12-13 02:15:58,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:58,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:58,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:15:58,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:58,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205267423] [2022-12-13 02:15:58,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205267423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:58,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:58,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:58,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040147237] [2022-12-13 02:15:58,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:58,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:58,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:58,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:58,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:58,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:58,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:58,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:58,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:58,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:58,217 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:58,217 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:58,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:58,218 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:58,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:58,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:58,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:58,219 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:58,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:58,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:58,222 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:58,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:58,222 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:58,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:58,222 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:58,222 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:58,222 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:58,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:58,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:58,228 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:58,228 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:58,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:58,229 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:58,229 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:58,316 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:58,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:15:58,317 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:58,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:58,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:58,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:58,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2022-12-13 02:15:58,317 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 02:15:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1043363168, now seen corresponding path program 1 times [2022-12-13 02:15:58,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:58,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985268962] [2022-12-13 02:15:58,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:58,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:58,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:15:58,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:58,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985268962] [2022-12-13 02:15:58,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985268962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:58,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:58,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:58,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133344085] [2022-12-13 02:15:58,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:58,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:58,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:58,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:58,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:58,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:58,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:58,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:58,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:58,438 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:58,438 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:58,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:58,439 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:58,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:58,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:58,440 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:58,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:58,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:58,443 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:58,443 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:58,443 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:58,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:58,443 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:58,443 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:58,443 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:58,443 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:58,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:58,449 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:58,449 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:58,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:58,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:58,450 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:58,536 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:58,537 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:15:58,537 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:58,537 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 02:15:58,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:58,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:58,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2022-12-13 02:15:58,537 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 02:15:58,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:58,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1071992319, now seen corresponding path program 1 times [2022-12-13 02:15:58,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:58,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047415160] [2022-12-13 02:15:58,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:58,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:58,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:15:58,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:58,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047415160] [2022-12-13 02:15:58,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047415160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:58,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:58,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:58,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842226442] [2022-12-13 02:15:58,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:58,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:58,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:58,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:58,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:58,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:58,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:58,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:58,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:58,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:58,692 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:58,693 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:58,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:58,694 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:58,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:58,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:58,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:58,694 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:58,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:58,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:58,697 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:58,697 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:58,697 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:58,697 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:58,697 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:58,698 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:58,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:58,698 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:58,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:58,705 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:58,705 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:58,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:58,706 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:58,706 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:58,792 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:58,792 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:15:58,792 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:58,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:58,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:58,793 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:58,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2022-12-13 02:15:58,793 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 02:15:58,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1100621470, now seen corresponding path program 1 times [2022-12-13 02:15:58,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:58,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701159953] [2022-12-13 02:15:58,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:58,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:58,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:15:58,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:58,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701159953] [2022-12-13 02:15:58,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701159953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:58,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:58,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:58,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017602804] [2022-12-13 02:15:58,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:58,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:58,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:58,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:58,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:58,839 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:58,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:58,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:58,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:58,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:58,920 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:58,920 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:58,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:58,921 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:58,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:58,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:58,921 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:58,921 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:58,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:58,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:58,924 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:58,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:58,924 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:58,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:58,924 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:58,925 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:58,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:58,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:58,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:58,930 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:58,931 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:58,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:58,931 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:58,931 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:59,046 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:59,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:15:59,046 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:59,047 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 02:15:59,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:59,047 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:59,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2022-12-13 02:15:59,047 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 02:15:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:59,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1129250621, now seen corresponding path program 1 times [2022-12-13 02:15:59,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:59,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233154564] [2022-12-13 02:15:59,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:59,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:15:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:59,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233154564] [2022-12-13 02:15:59,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233154564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:59,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:59,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:59,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065914766] [2022-12-13 02:15:59,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:59,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:59,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:59,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:59,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:59,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:59,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:59,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:59,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:59,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:59,177 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:59,177 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:59,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:59,178 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:59,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:59,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:59,179 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:59,179 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:59,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:59,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:59,181 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:59,182 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:59,182 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:59,182 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:59,182 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:59,182 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:59,182 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:59,182 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:59,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:59,190 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:59,190 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:59,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:59,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:59,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:59,279 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:59,280 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:15:59,280 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:59,280 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 02:15:59,280 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:59,280 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:59,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2022-12-13 02:15:59,280 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 02:15:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1157879772, now seen corresponding path program 1 times [2022-12-13 02:15:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:59,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329899743] [2022-12-13 02:15:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:59,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 02:15:59,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:59,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329899743] [2022-12-13 02:15:59,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329899743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:59,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:59,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:15:59,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697337185] [2022-12-13 02:15:59,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:59,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:15:59,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:59,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:15:59,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:15:59,342 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:59,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:59,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:59,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:59,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:59,409 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:59,410 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:59,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:59,411 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:59,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:59,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:59,411 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:59,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:59,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:59,414 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:59,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:59,414 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:59,414 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:59,414 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:59,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:59,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:59,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:59,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:59,421 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:59,421 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:59,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:59,422 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:59,422 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:59,532 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:59,532 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:15:59,532 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:59,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:15:59,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:59,533 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:59,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2022-12-13 02:15:59,533 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 02:15:59,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:59,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1186508923, now seen corresponding path program 1 times [2022-12-13 02:15:59,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:59,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234346589] [2022-12-13 02:15:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:59,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:15:59,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:59,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234346589] [2022-12-13 02:15:59,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234346589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:59,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:59,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:59,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407676469] [2022-12-13 02:15:59,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:59,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:59,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:59,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:59,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:59,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:59,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:59,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:59,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:59,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:59,655 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:59,656 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:15:59,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:59,657 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:59,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:59,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:59,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:59,657 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:59,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:59,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:59,667 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:59,667 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:59,668 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:59,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:59,668 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:59,668 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:59,668 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:59,668 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:59,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:59,674 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:59,674 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:15:59,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:59,675 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:59,675 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:59,761 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:59,761 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:15:59,761 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:59,762 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 02:15:59,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:59,762 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:59,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2022-12-13 02:15:59,762 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 02:15:59,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:59,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1215138074, now seen corresponding path program 1 times [2022-12-13 02:15:59,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:59,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388838813] [2022-12-13 02:15:59,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:59,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:15:59,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:15:59,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:15:59,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388838813] [2022-12-13 02:15:59,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388838813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:15:59,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:15:59,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:15:59,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791080225] [2022-12-13 02:15:59,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:15:59,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:15:59,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:15:59,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:15:59,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:15:59,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:15:59,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:15:59,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:15:59,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:15:59,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:15:59,884 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:15:59,884 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:15:59,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:15:59,885 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:15:59,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:15:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:15:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:15:59,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:15:59,886 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:15:59,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:15:59,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:15:59,888 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:59,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:15:59,889 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:15:59,889 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:15:59,889 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:59,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:15:59,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:15:59,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:15:59,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:59,895 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:15:59,895 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:15:59,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:15:59,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:15:59,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:15:59,983 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:15:59,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:15:59,983 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:15:59,984 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 02:15:59,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:15:59,984 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:15:59,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2022-12-13 02:15:59,984 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 02:15:59,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:15:59,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1243767225, now seen corresponding path program 1 times [2022-12-13 02:15:59,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:15:59,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487893885] [2022-12-13 02:15:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:15:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:15:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:00,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:16:00,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:00,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487893885] [2022-12-13 02:16:00,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487893885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:00,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:00,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:00,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454711854] [2022-12-13 02:16:00,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:00,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:00,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:00,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:00,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:00,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:00,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:00,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:00,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:00,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:00,130 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:00,131 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:00,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:00,132 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:00,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:00,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:00,132 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:00,133 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:00,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:00,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:00,135 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:00,135 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:00,135 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:00,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:00,136 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:00,136 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:00,136 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:00,136 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:00,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:00,144 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:00,144 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:00,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:00,145 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:00,145 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:00,241 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:00,242 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:16:00,242 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:00,242 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 02:16:00,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:00,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:00,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2022-12-13 02:16:00,242 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 02:16:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1272396376, now seen corresponding path program 1 times [2022-12-13 02:16:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:00,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122117209] [2022-12-13 02:16:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:00,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:16:00,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:00,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122117209] [2022-12-13 02:16:00,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122117209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:00,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:00,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:00,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442678698] [2022-12-13 02:16:00,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:00,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:00,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:00,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:00,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:00,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:00,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:00,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:00,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:00,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:00,389 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:00,390 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:00,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:00,391 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:00,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:00,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:00,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:00,391 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:00,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:00,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:00,395 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:00,395 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:00,395 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:00,395 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:00,395 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:00,395 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:00,395 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:00,396 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:00,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:00,401 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:00,401 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:00,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:00,402 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:00,402 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:00,527 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:00,527 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:16:00,527 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:00,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:00,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:00,528 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:00,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2022-12-13 02:16:00,528 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 02:16:00,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:00,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1301025527, now seen corresponding path program 1 times [2022-12-13 02:16:00,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:00,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151023938] [2022-12-13 02:16:00,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:00,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:00,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:16:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:00,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151023938] [2022-12-13 02:16:00,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151023938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:00,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:00,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:00,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25992542] [2022-12-13 02:16:00,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:00,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:00,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:00,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:00,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:00,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:00,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:00,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:00,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:00,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:00,639 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:00,640 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:00,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:00,641 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:00,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:00,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:00,641 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:00,641 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:00,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:00,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:00,644 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:00,644 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:00,644 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:00,644 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:00,644 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:00,645 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:00,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:00,645 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:00,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:00,650 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:00,650 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:00,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:00,651 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:00,651 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:00,736 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:00,736 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:16:00,737 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:00,737 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 02:16:00,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:00,737 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:00,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2022-12-13 02:16:00,737 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 02:16:00,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:00,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1329654678, now seen corresponding path program 1 times [2022-12-13 02:16:00,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:00,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199715404] [2022-12-13 02:16:00,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:00,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:00,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 02:16:00,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:00,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199715404] [2022-12-13 02:16:00,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199715404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:00,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:00,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:00,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229371810] [2022-12-13 02:16:00,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:00,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:00,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:00,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:00,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:00,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:00,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:00,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:00,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:00,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:00,874 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:00,874 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:00,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:00,875 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:00,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:00,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:00,875 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:00,875 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:00,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:00,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:00,878 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:00,878 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:00,878 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:00,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:00,878 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:00,878 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:00,878 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:00,879 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:00,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:00,884 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:00,884 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:16:00,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:00,885 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:00,885 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:00,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:00,969 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:16:00,970 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:00,970 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 02:16:00,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:00,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:00,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2022-12-13 02:16:00,970 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 02:16:00,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:00,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1358283829, now seen corresponding path program 1 times [2022-12-13 02:16:00,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:00,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251058042] [2022-12-13 02:16:00,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:00,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16: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:16:01,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:01,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251058042] [2022-12-13 02:16:01,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251058042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:01,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:01,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:01,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214320206] [2022-12-13 02:16:01,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:01,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:01,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:01,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:01,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:01,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:01,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:01,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:01,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:01,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:01,081 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:01,081 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:01,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:01,082 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:01,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:01,083 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:01,083 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:01,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:01,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:01,085 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:01,086 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:01,086 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:01,086 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,086 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:01,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:01,086 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:01,092 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:01,092 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:01,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:01,093 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:01,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:01,178 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:01,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:01,179 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:01,179 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 02:16:01,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:01,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:01,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2022-12-13 02:16:01,179 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 02:16:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:01,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1386912980, now seen corresponding path program 1 times [2022-12-13 02:16:01,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:01,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929164450] [2022-12-13 02:16:01,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:01,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:01,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:16:01,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:01,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929164450] [2022-12-13 02:16:01,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929164450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:01,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:01,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:01,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799432761] [2022-12-13 02:16:01,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:01,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:01,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:01,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:01,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:01,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:01,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:01,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:01,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:01,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:01,288 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:01,288 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:01,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:01,289 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:01,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:01,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:01,290 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:01,290 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:01,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:01,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:01,293 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,293 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:01,293 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:01,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:01,293 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:01,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:01,294 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:01,300 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:01,300 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:01,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:01,301 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:01,301 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:01,392 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:01,392 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:16:01,392 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:01,392 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 02:16:01,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:01,392 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:01,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2022-12-13 02:16:01,393 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 02:16:01,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:01,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1415542131, now seen corresponding path program 1 times [2022-12-13 02:16:01,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:01,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064852051] [2022-12-13 02:16:01,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:01,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:16:01,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:01,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064852051] [2022-12-13 02:16:01,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064852051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:01,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:01,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:01,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217946322] [2022-12-13 02:16:01,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:01,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:01,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:01,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:01,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:01,442 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:01,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:01,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:01,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:01,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:01,507 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:01,507 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:01,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:01,508 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:01,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:01,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:01,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:01,509 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:01,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:01,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:01,511 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:01,512 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:01,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:01,512 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:01,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:01,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:01,519 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:01,519 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:01,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:01,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:01,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:01,606 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:01,607 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:01,607 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:01,607 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 02:16:01,607 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:01,607 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:01,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2022-12-13 02:16:01,607 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 02:16:01,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:01,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1444171282, now seen corresponding path program 1 times [2022-12-13 02:16:01,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:01,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019116555] [2022-12-13 02:16:01,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:01,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:01,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:16:01,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:01,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019116555] [2022-12-13 02:16:01,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019116555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:01,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:01,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:01,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519491661] [2022-12-13 02:16:01,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:01,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:01,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:01,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:01,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:01,665 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:01,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:01,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:01,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:01,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:01,758 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:01,758 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:01,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:01,760 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:01,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:01,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:01,760 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:01,760 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:01,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:01,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:01,763 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,763 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:01,763 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:01,763 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:01,763 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:01,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:01,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:01,770 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:01,770 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:01,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:01,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:01,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:01,856 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:01,856 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:01,857 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:01,857 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 02:16:01,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:01,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:01,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2022-12-13 02:16:01,857 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 02:16:01,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:01,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1472800433, now seen corresponding path program 1 times [2022-12-13 02:16:01,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:01,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802145156] [2022-12-13 02:16:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:01,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:01,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802145156] [2022-12-13 02:16:01,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802145156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:01,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:01,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:01,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962764090] [2022-12-13 02:16:01,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:01,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:01,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:01,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:01,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:01,915 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:01,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:01,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:01,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:01,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:01,980 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:01,980 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:01,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:01,981 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:01,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:01,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:01,981 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:01,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:01,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:01,984 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:01,984 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:01,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:01,984 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,985 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:01,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:01,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:01,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:01,990 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:01,991 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:01,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:01,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:01,991 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:02,076 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:02,077 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:02,077 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:02,077 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 02:16:02,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:02,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:02,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2022-12-13 02:16:02,077 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 02:16:02,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:02,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1501429584, now seen corresponding path program 1 times [2022-12-13 02:16:02,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:02,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668412174] [2022-12-13 02:16:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:02,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:02,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 02:16:02,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:02,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668412174] [2022-12-13 02:16:02,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668412174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:02,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:02,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:02,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668181403] [2022-12-13 02:16:02,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:02,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:02,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:02,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:02,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:02,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:02,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:02,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:02,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:02,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:02,185 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:02,185 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:02,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:02,186 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:02,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:02,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:02,187 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:02,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:02,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:02,190 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:02,190 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:02,190 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:02,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:02,190 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:02,190 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:02,190 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:02,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:02,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:02,196 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:02,196 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:02,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:02,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:02,196 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:02,283 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:02,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:02,283 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:02,283 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 02:16:02,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:02,283 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:02,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2022-12-13 02:16:02,283 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 02:16:02,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:02,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1530058735, now seen corresponding path program 1 times [2022-12-13 02:16:02,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:02,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929884658] [2022-12-13 02:16:02,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:02,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:02,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:16:02,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:02,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929884658] [2022-12-13 02:16:02,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929884658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:02,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:02,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:02,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034716112] [2022-12-13 02:16:02,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:02,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:02,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:02,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:02,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:02,329 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:02,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:02,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:02,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:02,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:02,395 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:02,396 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:02,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:02,397 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:02,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:02,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:02,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:02,398 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:02,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:02,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:02,400 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:02,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:02,401 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:02,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:02,401 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:02,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:02,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:02,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:02,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:02,407 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:02,407 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:02,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:02,408 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:02,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:02,493 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:02,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:16:02,494 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:02,494 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 02:16:02,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:02,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:02,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2022-12-13 02:16:02,494 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 02:16:02,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1558687886, now seen corresponding path program 1 times [2022-12-13 02:16:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:02,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971450128] [2022-12-13 02:16:02,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:02,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:16:02,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:02,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971450128] [2022-12-13 02:16:02,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971450128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:02,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:02,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:02,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216661184] [2022-12-13 02:16:02,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:02,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:02,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:02,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:02,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:02,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:02,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:02,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:02,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:02,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:02,625 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:02,625 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:02,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:02,626 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:02,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:02,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:02,627 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:02,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:02,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:02,629 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:02,630 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:02,630 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:02,630 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:02,630 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:02,630 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:02,630 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:02,630 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:02,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:02,636 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:02,636 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:02,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:02,637 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:02,637 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:02,731 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:02,732 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:16:02,732 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:02,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:02,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:02,732 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:02,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2022-12-13 02:16:02,732 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 02:16:02,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:02,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1587317037, now seen corresponding path program 1 times [2022-12-13 02:16:02,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:02,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020637213] [2022-12-13 02:16:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:02,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:02,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:16:02,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:02,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020637213] [2022-12-13 02:16:02,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020637213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:02,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:02,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:02,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720522844] [2022-12-13 02:16:02,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:02,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:02,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:02,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:02,785 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:02,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:02,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:02,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:02,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:02,864 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:02,865 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:02,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:02,866 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:02,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:02,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:02,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:02,867 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:02,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:02,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:02,871 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:02,871 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:02,871 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:02,871 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:02,871 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:02,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:02,871 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:02,871 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:02,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:02,877 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:02,877 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:02,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:02,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:02,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:02,966 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:02,966 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:02,966 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:02,966 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 02:16:02,966 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:02,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:02,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2022-12-13 02:16:02,967 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 02:16:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:02,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1615946188, now seen corresponding path program 1 times [2022-12-13 02:16:02,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:02,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859616415] [2022-12-13 02:16:02,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:02,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:03,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 02:16:03,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:03,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859616415] [2022-12-13 02:16:03,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859616415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:03,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:03,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:03,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875242251] [2022-12-13 02:16:03,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:03,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:03,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:03,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:03,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:03,031 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:03,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:03,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:03,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:03,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:03,107 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:03,107 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:03,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:03,109 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:03,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:03,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:03,109 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:03,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:03,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:03,112 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:03,112 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:03,112 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:03,112 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:03,112 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:03,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:03,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:03,113 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:03,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:03,118 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:03,118 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:03,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:03,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:03,119 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:03,206 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:03,207 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:03,207 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:03,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:03,207 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:03,207 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:03,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2022-12-13 02:16:03,208 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 02:16:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1644575339, now seen corresponding path program 1 times [2022-12-13 02:16:03,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:03,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356759926] [2022-12-13 02:16:03,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:03,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:03,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 02:16:03,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:03,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356759926] [2022-12-13 02:16:03,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356759926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:03,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:03,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:03,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145855681] [2022-12-13 02:16:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:03,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:03,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:03,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:03,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:03,268 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:03,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:03,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:03,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:03,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:03,350 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:03,350 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:03,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:03,352 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:03,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:03,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:03,352 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:03,353 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:03,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:03,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:03,356 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:03,356 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:03,357 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:03,357 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:03,357 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:03,357 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:03,357 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:03,357 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:03,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:03,365 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:03,365 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:03,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:03,366 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:03,366 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:03,469 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:03,469 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 02:16:03,469 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:03,469 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 02:16:03,469 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:03,469 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:03,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2022-12-13 02:16:03,470 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 02:16:03,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:03,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1673204490, now seen corresponding path program 1 times [2022-12-13 02:16:03,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:03,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257773716] [2022-12-13 02:16:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:03,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:03,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:16:03,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:03,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257773716] [2022-12-13 02:16:03,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257773716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:03,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:03,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:03,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131129414] [2022-12-13 02:16:03,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:03,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:03,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:03,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:03,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:03,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:03,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:03,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:03,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:03,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:03,611 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:03,611 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:03,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:03,613 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:03,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:03,614 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:03,614 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:03,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:03,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:03,617 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:03,617 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:03,618 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:03,618 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:03,618 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:03,618 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:03,618 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:03,618 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:03,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:03,626 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:03,626 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:03,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:03,627 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:03,627 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:03,730 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:03,731 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:16:03,731 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:03,731 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 02:16:03,731 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:03,731 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:03,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2022-12-13 02:16:03,731 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 02:16:03,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:03,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1701833641, now seen corresponding path program 1 times [2022-12-13 02:16:03,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:03,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904221012] [2022-12-13 02:16:03,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:03,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:03,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:03,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904221012] [2022-12-13 02:16:03,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904221012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:03,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:03,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:03,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515206408] [2022-12-13 02:16:03,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:03,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:03,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:03,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:03,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:03,813 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:03,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:03,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:03,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:03,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:03,901 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:03,901 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:03,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:03,903 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:03,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:03,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:03,904 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:03,904 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:03,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:03,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:03,908 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:03,908 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:03,908 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:03,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:03,908 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:03,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:03,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:03,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:03,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:03,916 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:03,916 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:03,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:03,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:03,917 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:04,028 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:04,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:16:04,029 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:04,029 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 02:16:04,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:04,029 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:04,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2022-12-13 02:16:04,030 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 02:16:04,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:04,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1730462792, now seen corresponding path program 1 times [2022-12-13 02:16:04,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:04,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734470339] [2022-12-13 02:16:04,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:04,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:04,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:16:04,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:04,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734470339] [2022-12-13 02:16:04,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734470339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:04,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:04,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:04,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351498452] [2022-12-13 02:16:04,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:04,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:04,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:04,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:04,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:04,090 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:04,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:04,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:04,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:04,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:04,179 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:04,179 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:04,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:04,180 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:04,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:04,181 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:04,181 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:04,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:04,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:04,183 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:04,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:04,184 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:04,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:04,184 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:04,184 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:04,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:04,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:04,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:04,190 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:04,190 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:04,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:04,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:04,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:04,276 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:04,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:16:04,277 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:04,277 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 02:16:04,277 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:04,277 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:04,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2022-12-13 02:16:04,277 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 02:16:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1759091943, now seen corresponding path program 1 times [2022-12-13 02:16:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:04,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485897946] [2022-12-13 02:16:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:04,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:16:04,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:04,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485897946] [2022-12-13 02:16:04,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485897946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:04,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:04,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:04,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494629335] [2022-12-13 02:16:04,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:04,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:04,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:04,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:04,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:04,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:04,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:04,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:04,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:04,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:04,408 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:04,408 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:04,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:04,409 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:04,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:04,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:04,410 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:04,410 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:04,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:04,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:04,413 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:04,413 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:04,413 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:04,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:04,413 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:04,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:04,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:04,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:04,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:04,420 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:04,420 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:04,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:04,420 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:04,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:04,511 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:04,511 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:16:04,511 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:04,511 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 02:16:04,512 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:04,512 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:04,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2022-12-13 02:16:04,512 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 02:16:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:04,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1787721094, now seen corresponding path program 1 times [2022-12-13 02:16:04,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:04,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609732245] [2022-12-13 02:16:04,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:04,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:16:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:04,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609732245] [2022-12-13 02:16:04,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609732245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:04,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:04,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:04,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795064528] [2022-12-13 02:16:04,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:04,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:04,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:04,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:04,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:04,558 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:04,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:04,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:04,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:04,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:04,648 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:04,648 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:04,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:04,650 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:04,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:04,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:04,651 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:04,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:04,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:04,655 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:04,655 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:04,655 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:04,655 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:04,655 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:04,655 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:04,656 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:04,656 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:04,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:04,664 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:04,664 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:04,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:04,665 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:04,665 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:04,777 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:04,778 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:16:04,778 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:04,778 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 02:16:04,778 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:04,778 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:04,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2022-12-13 02:16:04,778 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 02:16:04,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:04,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1816350245, now seen corresponding path program 1 times [2022-12-13 02:16:04,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:04,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349491200] [2022-12-13 02:16:04,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:04,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:04,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:16:04,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:04,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349491200] [2022-12-13 02:16:04,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349491200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:04,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:04,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:04,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101148230] [2022-12-13 02:16:04,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:04,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:04,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:04,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:04,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:04,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:04,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:04,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:04,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:04,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:04,925 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:04,925 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:04,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:04,927 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:04,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:04,927 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:04,927 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:04,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:04,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:04,939 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:04,939 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:04,939 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:04,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:04,939 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:04,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:04,940 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:04,940 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:04,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:04,948 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:04,948 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:16:04,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:04,949 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:04,949 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:05,037 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:05,037 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:16:05,037 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:05,038 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 02:16:05,038 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:05,038 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:05,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2022-12-13 02:16:05,038 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 02:16:05,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:05,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1844979396, now seen corresponding path program 1 times [2022-12-13 02:16:05,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:05,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179881040] [2022-12-13 02:16:05,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:05,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:05,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:16:05,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:05,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179881040] [2022-12-13 02:16:05,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179881040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:05,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:05,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:05,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982195168] [2022-12-13 02:16:05,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:05,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:05,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:05,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:05,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:05,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:05,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:05,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:05,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:05,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:05,151 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:05,151 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:05,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:05,152 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:05,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:05,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:05,153 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:05,153 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:05,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:05,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:05,155 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:05,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:05,155 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:05,156 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:05,156 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:05,156 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:05,156 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:05,156 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:05,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:05,161 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:05,161 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:16:05,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:05,162 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:05,162 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:05,246 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:05,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:16:05,247 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:05,247 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 02:16:05,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:05,247 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:05,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2022-12-13 02:16:05,247 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 02:16:05,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:05,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1873608547, now seen corresponding path program 1 times [2022-12-13 02:16:05,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:05,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077525222] [2022-12-13 02:16:05,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:05,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:05,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:16:05,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:05,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077525222] [2022-12-13 02:16:05,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077525222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:05,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:05,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:05,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905930035] [2022-12-13 02:16:05,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:05,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:05,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:05,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:05,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:05,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:05,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:05,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:05,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:05,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:05,378 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:05,378 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:05,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:05,379 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:05,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:05,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:05,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:05,380 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:05,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:05,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:05,383 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:05,383 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:05,383 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:05,383 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:05,383 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:05,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:05,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:05,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:05,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:05,389 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:05,389 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:05,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:05,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:05,390 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:05,474 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:05,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:16:05,474 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:05,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:05,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:05,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:05,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2022-12-13 02:16:05,475 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 02:16:05,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:05,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1902237698, now seen corresponding path program 1 times [2022-12-13 02:16:05,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:05,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935772376] [2022-12-13 02:16:05,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:05,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:05,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:16:05,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:05,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935772376] [2022-12-13 02:16:05,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935772376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:05,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:05,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:05,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856094680] [2022-12-13 02:16:05,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:05,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:05,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:05,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:05,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:05,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:05,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:05,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:05,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:05,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:05,602 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:05,603 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:05,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:05,604 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:05,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:05,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:05,605 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:05,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:05,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:05,608 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:05,608 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:05,608 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:05,608 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:05,608 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:05,609 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:05,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:05,609 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:05,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:05,616 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:05,616 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:05,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:05,616 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:05,616 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:05,701 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:05,701 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:05,701 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:05,701 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 02:16:05,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:05,701 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:05,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2022-12-13 02:16:05,702 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 02:16:05,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:05,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1930866849, now seen corresponding path program 1 times [2022-12-13 02:16:05,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:05,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230237953] [2022-12-13 02:16:05,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:05,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:05,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:16:05,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:05,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230237953] [2022-12-13 02:16:05,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230237953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:05,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:05,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:05,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856370850] [2022-12-13 02:16:05,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:05,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:05,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:05,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:05,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:05,769 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:05,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:05,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:05,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:05,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:05,852 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:05,852 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:05,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:05,853 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:05,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:05,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:05,854 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:05,854 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:05,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:05,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:05,856 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:05,856 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:05,857 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:05,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:05,857 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:05,857 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:05,857 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:05,857 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:05,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:05,863 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:05,863 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:05,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:05,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:05,863 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:05,957 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:05,958 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:16:05,958 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:05,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:05,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:05,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:05,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2022-12-13 02:16:05,958 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 02:16:05,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:05,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1959496000, now seen corresponding path program 1 times [2022-12-13 02:16:05,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:05,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393927483] [2022-12-13 02:16:05,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:05,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:06,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:16:06,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:06,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393927483] [2022-12-13 02:16:06,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393927483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:06,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:06,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:06,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223055462] [2022-12-13 02:16:06,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:06,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:06,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:06,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:06,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:06,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:06,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:06,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:06,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:06,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:06,070 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:06,071 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:06,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:06,072 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:06,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:06,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:06,072 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:06,072 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:06,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:06,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:06,075 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:06,075 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:06,075 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:06,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:06,075 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:06,075 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:06,075 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:06,076 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:06,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:06,081 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:06,081 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:06,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:06,082 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:06,082 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:06,167 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:06,167 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:16:06,167 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:06,167 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 02:16:06,167 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:06,167 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:06,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2022-12-13 02:16:06,168 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 02:16:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:06,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1988125151, now seen corresponding path program 1 times [2022-12-13 02:16:06,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:06,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888084061] [2022-12-13 02:16:06,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:06,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:06,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:16:06,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:06,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888084061] [2022-12-13 02:16:06,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888084061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:06,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:06,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778261095] [2022-12-13 02:16:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:06,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:06,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:06,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:06,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:06,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:06,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:06,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:06,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:06,318 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:06,319 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:06,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:06,320 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:06,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:06,320 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:06,321 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:06,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:06,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:06,323 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:06,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:06,324 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:06,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:06,324 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:06,324 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:06,324 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:06,324 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:06,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:06,330 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:06,330 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:06,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:06,331 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:06,331 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:06,419 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:06,419 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:06,419 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:06,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:06,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:06,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:06,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2022-12-13 02:16:06,419 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 02:16:06,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:06,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2016754302, now seen corresponding path program 1 times [2022-12-13 02:16:06,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:06,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527431931] [2022-12-13 02:16:06,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:06,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:06,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:06,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:06,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527431931] [2022-12-13 02:16:06,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527431931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:06,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:06,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:06,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338395691] [2022-12-13 02:16:06,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:06,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:06,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:06,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:06,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:06,486 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:06,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:06,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:06,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:06,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:06,562 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:06,562 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:06,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:06,564 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:06,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:06,564 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:06,564 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:06,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:06,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:06,567 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:06,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:06,568 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:06,568 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:06,568 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:06,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:06,568 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:06,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:06,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:06,574 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:06,574 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:06,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:06,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:06,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:06,663 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:06,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:06,664 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:06,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:06,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:06,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:06,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2022-12-13 02:16:06,664 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 02:16:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2045383453, now seen corresponding path program 1 times [2022-12-13 02:16:06,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:06,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575712633] [2022-12-13 02:16:06,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:06,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:06,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:16:06,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:06,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575712633] [2022-12-13 02:16:06,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575712633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:06,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:06,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:06,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520422016] [2022-12-13 02:16:06,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:06,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:06,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:06,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:06,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:06,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:06,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:06,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:06,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:06,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:06,800 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:06,800 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:06,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:06,801 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:06,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:06,802 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:06,802 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:06,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:06,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:06,804 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:06,804 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:06,805 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:06,805 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:06,805 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:06,805 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:06,805 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:06,805 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:06,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:06,811 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:06,811 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:06,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:06,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:06,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:06,899 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:06,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:06,900 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:06,900 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 02:16:06,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:06,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:06,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2022-12-13 02:16:06,900 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 02:16:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:06,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2074012604, now seen corresponding path program 1 times [2022-12-13 02:16:06,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:06,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774346176] [2022-12-13 02:16:06,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:06,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:06,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:16:06,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:06,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774346176] [2022-12-13 02:16:06,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774346176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:06,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:06,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337519259] [2022-12-13 02:16:06,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:06,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:06,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:06,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:06,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:06,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:06,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:06,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:06,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:06,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:07,036 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:07,036 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:07,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:07,038 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:07,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:07,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:07,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:07,038 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:07,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:07,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:07,041 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,041 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:07,041 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:07,041 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:07,041 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,042 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:07,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:07,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:07,047 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:07,048 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:07,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:07,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:07,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:07,135 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:07,135 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:07,135 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:07,135 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 02:16:07,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:07,136 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:07,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2022-12-13 02:16:07,136 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 02:16:07,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:07,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2102641755, now seen corresponding path program 1 times [2022-12-13 02:16:07,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:07,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366451952] [2022-12-13 02:16:07,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:07,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:07,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:07,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366451952] [2022-12-13 02:16:07,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366451952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:07,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:07,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:07,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98322665] [2022-12-13 02:16:07,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:07,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:07,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:07,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:07,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:07,182 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:07,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:07,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:07,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:07,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:07,250 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:07,250 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:16:07,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:07,251 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:07,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:07,252 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:07,252 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:07,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:07,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:07,254 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,254 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:07,254 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:07,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:07,255 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,255 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:07,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:07,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:07,261 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:07,261 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:16:07,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:07,261 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:07,262 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:07,349 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:07,349 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:07,350 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:07,350 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 02:16:07,350 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:07,350 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:07,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2022-12-13 02:16:07,350 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 02:16:07,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2131270906, now seen corresponding path program 1 times [2022-12-13 02:16:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:07,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133242974] [2022-12-13 02:16:07,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:07,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:07,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:16:07,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:07,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133242974] [2022-12-13 02:16:07,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133242974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:07,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:07,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:07,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709300006] [2022-12-13 02:16:07,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:07,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:07,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:07,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:07,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:07,418 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:07,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:07,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:07,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:07,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:07,495 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:07,495 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:07,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:07,496 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:07,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:07,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:07,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:07,497 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:07,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:07,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:07,499 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,500 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:07,500 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:07,500 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:07,500 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:07,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:07,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:07,509 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:07,509 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:16:07,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:07,510 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:07,510 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:07,609 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:07,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 02:16:07,610 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:07,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:07,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:07,610 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:07,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2022-12-13 02:16:07,610 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 02:16:07,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:07,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2135067239, now seen corresponding path program 1 times [2022-12-13 02:16:07,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:07,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747292771] [2022-12-13 02:16:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:07,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:07,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 02:16:07,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:07,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747292771] [2022-12-13 02:16:07,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747292771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:07,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:07,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:07,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152300256] [2022-12-13 02:16:07,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:07,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:07,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:07,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:07,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:07,658 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:07,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:07,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:07,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:07,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:07,725 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:07,725 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:07,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:07,726 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:07,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:07,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:07,727 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:07,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:07,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:07,731 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,731 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:07,732 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:07,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:07,732 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:07,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:07,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:07,739 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:07,739 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:07,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:07,739 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:07,739 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:07,826 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:07,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:07,827 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:07,827 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 02:16:07,827 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:07,827 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:07,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2022-12-13 02:16:07,827 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 02:16:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2106438088, now seen corresponding path program 1 times [2022-12-13 02:16:07,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:07,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684813767] [2022-12-13 02:16:07,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:07,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:07,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:16:07,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:07,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684813767] [2022-12-13 02:16:07,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684813767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:07,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:07,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931105942] [2022-12-13 02:16:07,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:07,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:07,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:07,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:07,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:07,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:07,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:07,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:07,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:07,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:07,965 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:07,965 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:07,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:07,966 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:07,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:07,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:07,967 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:07,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:07,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:07,970 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,970 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:07,971 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:07,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:07,971 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:07,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:07,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:07,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:07,977 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:07,977 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:07,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:07,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:07,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:08,063 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:08,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:08,064 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:08,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:08,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:08,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:08,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223 [2022-12-13 02:16:08,064 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 02:16:08,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2077808937, now seen corresponding path program 1 times [2022-12-13 02:16:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:08,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354162248] [2022-12-13 02:16:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:08,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:08,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:08,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354162248] [2022-12-13 02:16:08,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354162248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:08,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:08,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:08,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333833716] [2022-12-13 02:16:08,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:08,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:08,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:08,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:08,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:08,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:08,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:08,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:08,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:08,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:08,185 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:08,185 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:08,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:08,186 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:08,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:08,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:08,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:08,187 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:08,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:08,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:08,191 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:08,191 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:08,191 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:08,191 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:08,191 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:08,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:08,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:08,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:08,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:08,200 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:08,200 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:08,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:08,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:08,201 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:08,289 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:08,289 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:16:08,289 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:08,289 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 02:16:08,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:08,290 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:08,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2022-12-13 02:16:08,290 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 02:16:08,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:08,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2049179786, now seen corresponding path program 1 times [2022-12-13 02:16:08,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:08,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865605545] [2022-12-13 02:16:08,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:08,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:08,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:16:08,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:08,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865605545] [2022-12-13 02:16:08,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865605545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:08,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:08,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:08,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594245708] [2022-12-13 02:16:08,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:08,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:08,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:08,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:08,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:08,338 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:08,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:08,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:08,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:08,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:08,409 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:08,409 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:08,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:08,410 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:08,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:08,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:08,411 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:08,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:08,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:08,414 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:08,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:08,414 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:08,414 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:08,414 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:08,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:08,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:08,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:08,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:08,420 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:08,420 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:16:08,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:08,421 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:08,421 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:08,508 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:08,508 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:08,508 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:08,508 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 02:16:08,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:08,509 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:08,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2022-12-13 02:16:08,509 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 02:16:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2020550635, now seen corresponding path program 1 times [2022-12-13 02:16:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:08,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702844603] [2022-12-13 02:16:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:08,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:16:08,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:08,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702844603] [2022-12-13 02:16:08,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702844603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:08,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:08,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:08,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140450835] [2022-12-13 02:16:08,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:08,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:08,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:08,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:08,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:08,600 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:08,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:08,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:08,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:08,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:08,704 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:08,704 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:08,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:08,705 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:08,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:08,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:08,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:08,706 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:08,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:08,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:08,708 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:08,708 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:08,709 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:08,709 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:08,709 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:08,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:08,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:08,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:08,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:08,715 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:08,716 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:16:08,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:08,716 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:08,716 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:08,803 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:08,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:08,804 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:08,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:08,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:08,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:08,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2022-12-13 02:16:08,804 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 02:16:08,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:08,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1991921484, now seen corresponding path program 1 times [2022-12-13 02:16:08,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:08,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419951227] [2022-12-13 02:16:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:08,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:08,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:16:08,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:08,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419951227] [2022-12-13 02:16:08,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419951227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:08,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:08,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623722293] [2022-12-13 02:16:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:08,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:08,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:08,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:08,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:08,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:08,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:08,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:08,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:08,936 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:08,936 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:08,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:08,937 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:08,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:08,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:08,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:08,938 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:08,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:08,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:08,940 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:08,941 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:08,941 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:08,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:08,941 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:08,941 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:08,941 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:08,942 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:08,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:08,953 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:08,953 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:08,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:08,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:08,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:09,040 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:09,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:16:09,041 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:09,041 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 02:16:09,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:09,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:09,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2022-12-13 02:16:09,041 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 02:16:09,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1963292333, now seen corresponding path program 1 times [2022-12-13 02:16:09,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:09,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19790062] [2022-12-13 02:16:09,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:09,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:09,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:16:09,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:09,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19790062] [2022-12-13 02:16:09,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19790062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:09,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:09,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:09,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177510466] [2022-12-13 02:16:09,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:09,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:09,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:09,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:09,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:09,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:09,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:09,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:09,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:09,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:09,154 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:09,154 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:09,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:09,155 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:09,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:09,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:09,156 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:09,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:09,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:09,159 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:09,159 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:09,159 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:09,159 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:09,159 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:09,159 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:09,159 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:09,160 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:09,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:09,165 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:09,165 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:16:09,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:09,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:09,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:09,251 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:09,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:09,252 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:09,252 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 02:16:09,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:09,252 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:09,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2022-12-13 02:16:09,252 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 02:16:09,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1934663182, now seen corresponding path program 1 times [2022-12-13 02:16:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:09,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549713168] [2022-12-13 02:16:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:09,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:09,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:16:09,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:09,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549713168] [2022-12-13 02:16:09,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549713168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:09,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:09,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745886771] [2022-12-13 02:16:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:09,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:09,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:09,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:09,297 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:09,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:09,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:09,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:09,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:09,363 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:09,363 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:09,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:09,364 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:09,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:09,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:09,365 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:09,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:09,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:09,368 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:09,368 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:09,368 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:09,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:09,369 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:09,369 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:09,369 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:09,369 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:09,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:09,375 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:09,375 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:09,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:09,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:09,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:09,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:09,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:16:09,465 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:09,465 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 02:16:09,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:09,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:09,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2022-12-13 02:16:09,465 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 02:16:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1906034031, now seen corresponding path program 1 times [2022-12-13 02:16:09,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:09,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328322799] [2022-12-13 02:16:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:09,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:16:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328322799] [2022-12-13 02:16:09,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328322799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:09,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:09,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048584610] [2022-12-13 02:16:09,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:09,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:09,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:09,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:09,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:09,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:09,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:09,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:09,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:09,604 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:09,604 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:09,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:09,606 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:09,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:09,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:09,606 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:09,606 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:09,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:09,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:09,610 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:09,611 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:09,611 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:09,611 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:09,611 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:09,611 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:09,611 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:09,612 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:09,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:09,620 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:09,620 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:09,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:09,621 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:09,621 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:09,714 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:09,715 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:16:09,715 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:09,715 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 02:16:09,715 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:09,715 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:09,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2022-12-13 02:16:09,715 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 02:16:09,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:09,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1877404880, now seen corresponding path program 1 times [2022-12-13 02:16:09,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:09,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155774792] [2022-12-13 02:16:09,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:09,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:09,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:16:09,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:09,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155774792] [2022-12-13 02:16:09,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155774792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:09,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:09,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:09,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933303470] [2022-12-13 02:16:09,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:09,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:09,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:09,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:09,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:09,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:09,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:09,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:09,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:09,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:09,833 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:09,833 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:09,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:09,834 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:09,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:09,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:09,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:09,835 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:09,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:09,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:09,839 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:09,839 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:09,839 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:09,839 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:09,839 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:09,839 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:09,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:09,840 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:09,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:09,849 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:09,849 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:09,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:09,850 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:09,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:09,951 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:09,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 02:16:09,951 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:09,952 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 02:16:09,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:09,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:09,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2022-12-13 02:16:09,952 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 02:16:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1848775729, now seen corresponding path program 1 times [2022-12-13 02:16:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:09,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004807397] [2022-12-13 02:16:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:09,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:10,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:16:10,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:10,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004807397] [2022-12-13 02:16:10,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004807397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:10,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:10,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:10,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432176146] [2022-12-13 02:16:10,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:10,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:10,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:10,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:10,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:10,020 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:10,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:10,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:10,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:10,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:10,108 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:10,108 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:10,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:10,110 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:10,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:10,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:10,111 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:10,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:10,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:10,114 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:10,114 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:10,115 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:10,115 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:10,115 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:10,115 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:10,115 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:10,115 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:10,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:10,123 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:10,123 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:16:10,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:10,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:10,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:10,235 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:10,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:16:10,236 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:10,236 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 02:16:10,236 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:10,236 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:10,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2022-12-13 02:16:10,236 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 02:16:10,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:10,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1820146578, now seen corresponding path program 1 times [2022-12-13 02:16:10,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:10,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633863229] [2022-12-13 02:16:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:10,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:16:10,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:10,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633863229] [2022-12-13 02:16:10,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633863229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:10,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:10,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:10,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637747746] [2022-12-13 02:16:10,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:10,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:10,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:10,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:10,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:10,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:10,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:10,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:10,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:10,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:10,422 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:10,422 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:10,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:10,424 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:10,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:10,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:10,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:10,425 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:10,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:10,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:10,429 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:10,429 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:10,429 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:10,429 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:10,429 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:10,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:10,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:10,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:10,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:10,437 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:10,438 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:10,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:10,438 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:10,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:10,545 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:10,546 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:16:10,546 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:10,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:10,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:10,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:10,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2022-12-13 02:16:10,546 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 02:16:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1791517427, now seen corresponding path program 1 times [2022-12-13 02:16:10,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:10,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096956572] [2022-12-13 02:16:10,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:10,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:16:10,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:10,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096956572] [2022-12-13 02:16:10,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096956572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:10,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:10,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:10,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030413127] [2022-12-13 02:16:10,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:10,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:10,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:10,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:10,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:10,604 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:10,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:10,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:10,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:10,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:10,694 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:10,695 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:10,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:10,697 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:10,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:10,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:10,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:10,698 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:10,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:10,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:10,702 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:10,702 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:10,702 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:10,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:10,703 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:10,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:10,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:10,703 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:10,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:10,711 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:10,711 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:10,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:10,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:10,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:10,818 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:10,818 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:16:10,819 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:10,819 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 02:16:10,819 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:10,819 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:10,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2022-12-13 02:16:10,819 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 02:16:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:10,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1762888276, now seen corresponding path program 1 times [2022-12-13 02:16:10,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:10,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066347233] [2022-12-13 02:16:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:10,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:16:10,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:10,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066347233] [2022-12-13 02:16:10,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066347233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:10,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:10,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135090571] [2022-12-13 02:16:10,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:10,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:10,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:10,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:10,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:10,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:10,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:10,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:10,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:10,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:10,972 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:10,973 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:10,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:10,974 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:10,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:10,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:10,974 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:10,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:10,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:10,977 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:10,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:10,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:10,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:10,978 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:10,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:10,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:10,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:10,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:10,984 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:10,984 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:10,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:10,985 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:10,985 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:11,072 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:11,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:11,073 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:11,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:11,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:11,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:11,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2022-12-13 02:16:11,073 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 02:16:11,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1734259125, now seen corresponding path program 1 times [2022-12-13 02:16:11,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:11,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539662275] [2022-12-13 02:16:11,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:11,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:11,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:16:11,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:11,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539662275] [2022-12-13 02:16:11,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539662275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:11,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:11,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:11,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315946355] [2022-12-13 02:16:11,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:11,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:11,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:11,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:11,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:11,130 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:11,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:11,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:11,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:11,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:11,220 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:11,220 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:11,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:11,221 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:11,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:11,222 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:11,222 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:11,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:11,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:11,224 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:11,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:11,225 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:11,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:11,225 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:11,225 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:11,225 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:11,225 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:11,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:11,231 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:11,231 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:16:11,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:11,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:11,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:11,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:11,319 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:11,319 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:11,319 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 02:16:11,319 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:11,319 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:11,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2022-12-13 02:16:11,320 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 02:16:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:11,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1705629974, now seen corresponding path program 1 times [2022-12-13 02:16:11,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:11,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528242000] [2022-12-13 02:16:11,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:11,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:11,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:11,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528242000] [2022-12-13 02:16:11,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528242000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:11,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:11,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071673316] [2022-12-13 02:16:11,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:11,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:11,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:11,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:11,371 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:11,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:11,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:11,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:11,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:11,438 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:11,438 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:11,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:11,439 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:11,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:11,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:11,440 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:11,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:11,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:11,443 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:11,443 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:11,443 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:11,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:11,443 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:11,444 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:11,444 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:11,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:11,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:11,450 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:11,450 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:11,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:11,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:11,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:11,538 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:11,538 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:11,538 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:11,539 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 02:16:11,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:11,539 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:11,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2022-12-13 02:16:11,539 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 02:16:11,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:11,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1677000823, now seen corresponding path program 1 times [2022-12-13 02:16:11,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:11,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681873258] [2022-12-13 02:16:11,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:11,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:11,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:16:11,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:11,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681873258] [2022-12-13 02:16:11,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681873258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:11,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:11,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:11,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395166708] [2022-12-13 02:16:11,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:11,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:11,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:11,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:11,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:11,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:11,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:11,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:11,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:11,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:11,654 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:11,654 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:11,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:11,655 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:11,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:11,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:11,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:11,656 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:11,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:11,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:11,658 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:11,658 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:11,659 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:11,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:11,659 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:11,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:11,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:11,659 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:11,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:11,665 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:11,665 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:11,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:11,665 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:11,665 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:11,753 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:11,753 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:11,753 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:11,753 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 02:16:11,753 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:11,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:11,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2022-12-13 02:16:11,754 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 02:16:11,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:11,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1648371672, now seen corresponding path program 1 times [2022-12-13 02:16:11,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:11,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906741307] [2022-12-13 02:16:11,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:11,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:11,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:16:11,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:11,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906741307] [2022-12-13 02:16:11,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906741307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:11,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:11,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:11,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826099278] [2022-12-13 02:16:11,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:11,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:11,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:11,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:11,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:11,801 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:11,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:11,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:11,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:11,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:11,869 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:11,869 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:11,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:11,871 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:11,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:11,871 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:11,871 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:11,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:11,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:11,874 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:11,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:11,874 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:11,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:11,874 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:11,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:11,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:11,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:11,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:11,880 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:11,880 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:16:11,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:11,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:11,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:11,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:11,969 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:11,969 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:11,970 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 02:16:11,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:11,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:11,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2022-12-13 02:16:11,970 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 02:16:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1619742521, now seen corresponding path program 1 times [2022-12-13 02:16:11,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:11,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984248752] [2022-12-13 02:16:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:12,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:16:12,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:12,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984248752] [2022-12-13 02:16:12,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984248752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:12,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:12,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:12,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822534716] [2022-12-13 02:16:12,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:12,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:12,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:12,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:12,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:12,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:12,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:12,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:12,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:12,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:12,082 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:12,082 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:12,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:12,083 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:12,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:12,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:12,084 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:12,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:12,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:12,087 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:12,087 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:12,087 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:12,087 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:12,087 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:12,088 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:12,088 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:12,088 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:12,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:12,093 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:12,093 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:12,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:12,094 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:12,094 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:12,188 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:12,189 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:16:12,189 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:12,189 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 02:16:12,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:12,189 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:12,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2022-12-13 02:16:12,189 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 02:16:12,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1591113370, now seen corresponding path program 1 times [2022-12-13 02:16:12,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:12,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895154924] [2022-12-13 02:16:12,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:12,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:12,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:16:12,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:12,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895154924] [2022-12-13 02:16:12,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895154924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:12,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:12,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:12,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051853483] [2022-12-13 02:16:12,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:12,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:12,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:12,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:12,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:12,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:12,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:12,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:12,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:12,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:12,311 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:12,311 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:12,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:12,312 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:12,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:12,313 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:12,313 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:12,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:12,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:12,316 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:12,316 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:12,316 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:12,316 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:12,316 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:12,316 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:12,316 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:12,316 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:12,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:12,322 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:12,322 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:12,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:12,323 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:12,323 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:12,411 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:12,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:12,411 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:12,411 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 02:16:12,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:12,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:12,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2022-12-13 02:16:12,411 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 02:16:12,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1562484219, now seen corresponding path program 1 times [2022-12-13 02:16:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:12,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492715582] [2022-12-13 02:16:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:12,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:12,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:16:12,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:12,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492715582] [2022-12-13 02:16:12,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492715582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:12,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:12,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:12,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973024132] [2022-12-13 02:16:12,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:12,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:12,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:12,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:12,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:12,474 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:12,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:12,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:12,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:12,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:12,560 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:12,561 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:12,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:12,562 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:12,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:12,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:12,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:12,563 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:12,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:12,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:12,567 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:12,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:12,567 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:12,567 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:12,567 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:12,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:12,568 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:12,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:12,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:12,576 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:12,576 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:12,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:12,577 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:12,577 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:12,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:12,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:16:12,682 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:12,682 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 02:16:12,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:12,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:12,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2022-12-13 02:16:12,682 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 02:16:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:12,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1533855068, now seen corresponding path program 1 times [2022-12-13 02:16:12,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:12,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838920327] [2022-12-13 02:16:12,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:12,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:12,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:16:12,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:12,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838920327] [2022-12-13 02:16:12,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838920327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:12,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:12,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:12,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759211988] [2022-12-13 02:16:12,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:12,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:12,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:12,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:12,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:12,746 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:12,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:12,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:12,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:12,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:12,822 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:12,823 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:12,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:12,824 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:12,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:12,824 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:12,824 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:12,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:12,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:12,827 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:12,827 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:12,827 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:12,827 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:12,827 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:12,828 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:12,828 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:12,828 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:12,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:12,836 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:12,836 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:12,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:12,837 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:12,837 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:12,923 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:12,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:16:12,924 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:12,924 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 02:16:12,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:12,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:12,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2022-12-13 02:16:12,924 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 02:16:12,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1505225917, now seen corresponding path program 1 times [2022-12-13 02:16:12,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:12,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932424856] [2022-12-13 02:16:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:12,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:16:12,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:12,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932424856] [2022-12-13 02:16:12,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932424856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:12,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:12,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:12,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182621354] [2022-12-13 02:16:12,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:12,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:12,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:12,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:12,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:12,972 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:12,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:12,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:12,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:12,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:13,039 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:13,039 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:13,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:13,040 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:13,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:13,041 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:13,041 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:13,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:13,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:13,044 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:13,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:13,044 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:13,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:13,044 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:13,044 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:13,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:13,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:13,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:13,050 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:13,050 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:13,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:13,050 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:13,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:13,137 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:13,137 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:13,137 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:13,137 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 02:16:13,137 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:13,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:13,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2022-12-13 02:16:13,138 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 02:16:13,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1476596766, now seen corresponding path program 1 times [2022-12-13 02:16:13,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:13,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35288843] [2022-12-13 02:16:13,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:13,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:13,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:16:13,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:13,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35288843] [2022-12-13 02:16:13,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35288843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:13,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:13,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:13,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506186352] [2022-12-13 02:16:13,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:13,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:13,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:13,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:13,190 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:13,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:13,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:13,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:13,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:13,266 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:13,266 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:13,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:13,267 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:13,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:13,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:13,268 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:13,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:13,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:13,271 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:13,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:13,271 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:13,271 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:13,271 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:13,271 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:13,271 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:13,271 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:13,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:13,277 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:13,277 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:13,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:13,278 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:13,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:13,376 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:13,377 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:16:13,377 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:13,377 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 02:16:13,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:13,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:13,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2022-12-13 02:16:13,377 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 02:16:13,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:13,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1447967615, now seen corresponding path program 1 times [2022-12-13 02:16:13,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:13,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018818804] [2022-12-13 02:16:13,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:13,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:13,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:16:13,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:13,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018818804] [2022-12-13 02:16:13,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018818804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:13,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:13,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:13,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271465256] [2022-12-13 02:16:13,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:13,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:13,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:13,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:13,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:13,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:13,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:13,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:13,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:13,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:13,522 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:13,522 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:13,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:13,524 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:13,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:13,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:13,525 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:13,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:13,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:13,529 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:13,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:13,529 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:13,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:13,529 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:13,530 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:13,530 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:13,530 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:13,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:13,538 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:13,538 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:13,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:13,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:13,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:13,647 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:13,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:16:13,647 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:13,647 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 02:16:13,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:13,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:13,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2022-12-13 02:16:13,648 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 02:16:13,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1419338464, now seen corresponding path program 1 times [2022-12-13 02:16:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:13,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151840159] [2022-12-13 02:16:13,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:13,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:16:13,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:13,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151840159] [2022-12-13 02:16:13,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151840159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:13,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:13,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:13,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594621464] [2022-12-13 02:16:13,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:13,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:13,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:13,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:13,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:13,708 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:13,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:13,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:13,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:13,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:13,793 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:13,794 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:13,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:13,795 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:13,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:13,795 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:13,795 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:13,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:13,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:13,798 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:13,798 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:13,799 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:13,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:13,799 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:13,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:13,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:13,799 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:13,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:13,806 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:13,806 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:13,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:13,807 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:13,807 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:13,898 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:13,899 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:16:13,899 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:13,899 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 02:16:13,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:13,899 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:13,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247 [2022-12-13 02:16:13,899 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 02:16:13,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:13,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1390709313, now seen corresponding path program 1 times [2022-12-13 02:16:13,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:13,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012171061] [2022-12-13 02:16:13,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:13,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16: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:16:13,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:13,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012171061] [2022-12-13 02:16:13,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012171061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:13,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:13,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093423966] [2022-12-13 02:16:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:13,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:13,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:13,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:13,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:13,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:13,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:13,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:13,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:14,029 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:14,030 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:14,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:14,031 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:14,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:14,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:14,032 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:14,032 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:14,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:14,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:14,034 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,034 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:14,034 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:14,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:14,035 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,035 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:14,035 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:14,035 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:14,040 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:14,041 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:14,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:14,041 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:14,041 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:14,131 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:14,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:16:14,132 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:14,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 02:16:14,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:14,132 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:14,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2022-12-13 02:16:14,132 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 02:16:14,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:14,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1362080162, now seen corresponding path program 1 times [2022-12-13 02:16:14,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:14,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303920342] [2022-12-13 02:16:14,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:14,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:14,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:16:14,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:14,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303920342] [2022-12-13 02:16:14,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303920342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:14,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:14,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:14,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547068452] [2022-12-13 02:16:14,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:14,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:14,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:14,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:14,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:14,199 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:14,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:14,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:14,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:14,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:14,277 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:14,278 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:14,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:14,279 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:14,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:14,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:14,279 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:14,279 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:14,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:14,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:14,282 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,282 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:14,282 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:14,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:14,282 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:14,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:14,283 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:14,288 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:14,288 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:14,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:14,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:14,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:14,377 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:14,378 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:14,378 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:14,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:14,378 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:14,378 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:14,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2022-12-13 02:16:14,378 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 02:16:14,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:14,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1333451011, now seen corresponding path program 1 times [2022-12-13 02:16:14,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:14,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564448337] [2022-12-13 02:16:14,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:14,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:14,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:16:14,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:14,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564448337] [2022-12-13 02:16:14,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564448337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:14,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:14,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:14,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81537943] [2022-12-13 02:16:14,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:14,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:14,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:14,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:14,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:14,442 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:14,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:14,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:14,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:14,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:14,509 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:14,510 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:14,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:14,511 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:14,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:14,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:14,511 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:14,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:14,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:14,514 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,514 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:14,514 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:14,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:14,514 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:14,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:14,515 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:14,520 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:14,521 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:14,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:14,521 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:14,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:14,609 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:14,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:14,610 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:14,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:14,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:14,610 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:14,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2022-12-13 02:16:14,611 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 02:16:14,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1304821860, now seen corresponding path program 1 times [2022-12-13 02:16:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:14,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874017728] [2022-12-13 02:16:14,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:14,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:16:14,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:14,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874017728] [2022-12-13 02:16:14,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874017728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:14,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:14,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:14,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748237602] [2022-12-13 02:16:14,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:14,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:14,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:14,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:14,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:14,665 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:14,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:14,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:14,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:14,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:14,743 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:14,743 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:16:14,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:14,744 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:14,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:14,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:14,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:14,745 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:14,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:14,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:14,747 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,747 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:14,748 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:14,748 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:14,748 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:14,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:14,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:14,754 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:14,754 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:14,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:14,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:14,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:14,842 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:14,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:14,842 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:14,842 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 02:16:14,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:14,842 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:14,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2022-12-13 02:16:14,843 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 02:16:14,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:14,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1276192709, now seen corresponding path program 1 times [2022-12-13 02:16:14,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:14,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589283590] [2022-12-13 02:16:14,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:14,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:14,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:16:14,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:14,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589283590] [2022-12-13 02:16:14,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589283590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:14,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:14,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:14,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538914463] [2022-12-13 02:16:14,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:14,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:14,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:14,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:14,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:14,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:14,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:14,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:14,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:14,952 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:14,952 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:14,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:14,953 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:14,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:14,954 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:14,954 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:14,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:14,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:14,957 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,957 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:14,957 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:14,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:14,957 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:14,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:14,958 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:14,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:14,963 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:14,963 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:14,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:14,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:14,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:15,053 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:15,053 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:15,053 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:15,053 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 02:16:15,053 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:15,054 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:15,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2022-12-13 02:16:15,054 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 02:16:15,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:15,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1247563558, now seen corresponding path program 1 times [2022-12-13 02:16:15,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:15,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816338417] [2022-12-13 02:16:15,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:15,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:15,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:16:15,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:15,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816338417] [2022-12-13 02:16:15,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816338417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:15,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:15,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:15,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706106918] [2022-12-13 02:16:15,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:15,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:15,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:15,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:15,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:15,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:15,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:15,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:15,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:15,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:15,184 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:15,184 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:15,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:15,186 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:15,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:15,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:15,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:15,186 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:15,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:15,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:15,190 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:15,190 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:15,190 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:15,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:15,190 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:15,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:15,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:15,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:15,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:15,200 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:15,200 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:15,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:15,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:15,201 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:15,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:15,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:16:15,320 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:15,320 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 02:16:15,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:15,320 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:15,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253 [2022-12-13 02:16:15,321 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 02:16:15,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:15,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1218934407, now seen corresponding path program 1 times [2022-12-13 02:16:15,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:15,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605360506] [2022-12-13 02:16:15,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:15,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:16:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:15,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605360506] [2022-12-13 02:16:15,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605360506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:15,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:15,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:15,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521501097] [2022-12-13 02:16:15,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:15,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:15,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:15,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:15,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:15,399 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:15,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:15,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:15,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:15,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:15,493 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:15,493 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:15,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:15,495 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:15,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:15,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:15,496 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:15,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:15,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:15,500 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:15,500 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:15,500 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:15,500 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:15,500 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:15,501 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:15,501 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:15,501 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:15,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:15,509 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:15,509 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:15,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:15,514 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:15,514 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:15,615 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:15,616 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:16:15,616 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:15,616 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 02:16:15,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:15,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:15,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2022-12-13 02:16:15,616 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 02:16:15,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:15,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1190305256, now seen corresponding path program 1 times [2022-12-13 02:16:15,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:15,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002213938] [2022-12-13 02:16:15,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:15,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:15,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:16:15,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:15,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002213938] [2022-12-13 02:16:15,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002213938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:15,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:15,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:15,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518984003] [2022-12-13 02:16:15,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:15,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:15,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:15,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:15,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:15,669 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:15,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:15,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:15,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:15,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:15,735 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:15,736 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:15,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:15,737 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:15,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:15,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:15,738 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:15,738 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:15,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:15,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:15,742 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:15,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:15,742 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:15,742 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:15,742 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:15,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:15,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:15,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:15,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:15,751 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:15,751 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:15,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:15,752 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:15,752 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:15,840 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:15,841 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:16:15,841 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:15,841 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 02:16:15,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:15,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:15,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2022-12-13 02:16:15,842 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 02:16:15,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:15,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1161676105, now seen corresponding path program 1 times [2022-12-13 02:16:15,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:15,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061556645] [2022-12-13 02:16:15,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:15,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:15,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:16:15,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:15,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061556645] [2022-12-13 02:16:15,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061556645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:15,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:15,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:15,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50587128] [2022-12-13 02:16:15,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:15,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:15,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:15,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:15,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:15,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:15,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:15,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:15,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:15,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:15,995 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:15,995 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:15,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:15,996 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:15,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:15,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:15,997 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:15,997 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:15,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:15,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:16,000 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:16,000 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:16,000 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:16,000 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,000 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:16,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:16,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:16,006 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:16,006 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:16,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:16,007 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:16,007 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:16,095 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:16,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:16,095 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:16,095 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 02:16:16,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:16,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:16,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2022-12-13 02:16:16,096 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 02:16:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1133046954, now seen corresponding path program 1 times [2022-12-13 02:16:16,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:16,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795562349] [2022-12-13 02:16:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:16,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:16,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:16:16,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:16,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795562349] [2022-12-13 02:16:16,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795562349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:16,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:16,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:16,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335586415] [2022-12-13 02:16:16,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:16,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:16,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:16,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:16,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:16,147 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:16,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:16,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:16,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:16,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:16,237 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:16,237 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:16,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:16,238 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:16,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:16,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:16,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:16,239 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:16,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:16,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:16,242 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,242 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:16,242 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:16,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:16,242 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,242 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:16,242 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:16,242 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:16,248 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:16,248 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:16,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:16,249 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:16,249 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:16,336 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:16,337 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:16,337 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:16,337 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 02:16:16,337 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:16,337 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:16,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable257 [2022-12-13 02:16:16,338 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 02:16:16,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:16,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1104417803, now seen corresponding path program 1 times [2022-12-13 02:16:16,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:16,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052512519] [2022-12-13 02:16:16,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:16,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:16:16,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:16,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052512519] [2022-12-13 02:16:16,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052512519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:16,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:16,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435856860] [2022-12-13 02:16:16,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:16,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:16,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:16,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:16,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:16,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:16,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:16,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:16,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:16,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:16,454 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:16,454 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:16,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:16,455 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:16,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:16,456 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:16,456 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:16,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:16,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:16,458 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,458 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:16,458 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:16,459 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:16,459 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,459 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:16,459 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:16,459 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:16,464 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:16,465 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:16,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:16,465 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:16,465 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:16,553 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:16,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:16,553 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:16,553 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 02:16:16,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:16,553 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:16,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2022-12-13 02:16:16,554 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 02:16:16,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:16,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1075788652, now seen corresponding path program 1 times [2022-12-13 02:16:16,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:16,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871148975] [2022-12-13 02:16:16,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:16,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:16,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:16:16,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:16,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871148975] [2022-12-13 02:16:16,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871148975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:16,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:16,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:16,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004594643] [2022-12-13 02:16:16,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:16,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:16,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:16,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:16,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:16,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:16,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:16,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:16,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:16,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:16,663 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:16,663 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:16,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:16,664 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:16,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:16,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:16,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:16,665 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:16,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:16,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:16,667 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,667 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:16,667 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:16,667 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:16,667 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,668 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:16,668 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:16,668 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:16,673 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:16,673 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:16:16,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:16,674 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:16,674 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:16,761 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:16,761 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:16,761 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:16,761 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 02:16:16,761 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:16,761 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:16,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable259 [2022-12-13 02:16:16,762 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 02:16:16,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:16,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1047159501, now seen corresponding path program 1 times [2022-12-13 02:16:16,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:16,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776966812] [2022-12-13 02:16:16,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:16,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:16,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:16,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776966812] [2022-12-13 02:16:16,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776966812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:16,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:16,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:16,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883556767] [2022-12-13 02:16:16,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:16,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:16,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:16,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:16,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:16,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:16,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:16,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:16,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:16,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:16,877 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:16,877 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:16:16,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:16,879 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:16,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:16,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:16,879 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:16,879 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:16,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:16,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:16,882 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,882 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:16,882 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:16,882 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:16,882 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,882 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:16,882 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:16,883 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:16,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:16,888 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:16,888 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:16:16,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:16,889 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:16,889 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:16,976 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:16,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:16,977 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:16,977 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 02:16:16,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:16,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:16,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2022-12-13 02:16:16,977 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 02:16:16,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:16,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1018530350, now seen corresponding path program 1 times [2022-12-13 02:16:16,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:16,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351128127] [2022-12-13 02:16:16,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:16,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:17,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:16:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:17,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351128127] [2022-12-13 02:16:17,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351128127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:17,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:17,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961277975] [2022-12-13 02:16:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:17,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:17,038 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:17,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:17,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:17,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:17,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:17,133 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:17,133 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:17,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:17,134 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:17,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:17,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:17,135 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:17,135 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:17,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:17,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:17,139 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:17,139 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:17,139 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:17,139 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:17,139 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:17,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:17,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:17,140 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:17,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:17,147 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:17,147 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:17,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:17,148 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:17,148 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:17,252 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:17,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:16:17,252 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:17,253 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 02:16:17,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:17,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:17,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2022-12-13 02:16:17,253 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 02:16:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:17,253 INFO L85 PathProgramCache]: Analyzing trace with hash -989901199, now seen corresponding path program 1 times [2022-12-13 02:16:17,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:17,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563598620] [2022-12-13 02:16:17,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:17,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:16:17,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:17,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563598620] [2022-12-13 02:16:17,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563598620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:17,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:17,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849384168] [2022-12-13 02:16:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:17,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:17,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:17,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:17,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:17,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:17,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:17,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:17,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:17,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:17,445 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:17,446 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:17,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:17,470 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:17,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:17,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:17,471 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:17,471 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:17,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:17,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:17,474 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:17,474 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:17,474 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:17,475 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:17,475 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:17,475 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:17,475 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:17,475 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:17,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:17,483 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:17,483 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:17,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:17,484 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:17,484 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:17,584 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:17,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 02:16:17,586 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:17,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:17,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:17,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:17,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2022-12-13 02:16:17,586 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 02:16:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:17,586 INFO L85 PathProgramCache]: Analyzing trace with hash -961272048, now seen corresponding path program 1 times [2022-12-13 02:16:17,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:17,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768272549] [2022-12-13 02:16:17,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:17,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:17,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:16:17,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:17,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768272549] [2022-12-13 02:16:17,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768272549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:17,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:17,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:17,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6641503] [2022-12-13 02:16:17,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:17,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:17,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:17,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:17,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:17,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:17,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:17,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:17,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:17,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:17,753 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:17,753 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:17,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:17,754 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:17,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:17,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:17,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:17,755 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:17,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:17,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:17,758 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:17,758 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:17,758 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:17,758 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:17,758 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:17,759 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:17,759 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:17,759 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:17,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:17,764 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:17,765 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:17,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:17,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:17,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:17,852 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:17,853 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:17,853 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:17,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:17,853 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:17,853 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:17,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263 [2022-12-13 02:16:17,853 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 02:16:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash -932642897, now seen corresponding path program 1 times [2022-12-13 02:16:17,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:17,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649610899] [2022-12-13 02:16:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:17,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:17,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:16:17,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:17,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649610899] [2022-12-13 02:16:17,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649610899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:17,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:17,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:17,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239767488] [2022-12-13 02:16:17,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:17,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:17,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:17,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:17,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:17,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:17,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:17,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:17,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:17,966 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:17,966 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:17,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:17,968 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:17,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:17,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:17,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:17,968 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:17,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:17,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:17,971 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:17,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:17,972 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:17,972 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:17,972 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:17,972 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:17,972 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:17,972 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:17,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:17,978 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:17,978 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:17,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:17,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:17,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:18,067 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:18,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:18,067 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:18,067 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 02:16:18,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:18,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:18,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2022-12-13 02:16:18,068 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 02:16:18,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:18,068 INFO L85 PathProgramCache]: Analyzing trace with hash -904013746, now seen corresponding path program 1 times [2022-12-13 02:16:18,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:18,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932191952] [2022-12-13 02:16:18,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:18,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:18,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:18,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932191952] [2022-12-13 02:16:18,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932191952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:18,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:18,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:18,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029362605] [2022-12-13 02:16:18,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:18,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:18,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:18,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:18,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:18,115 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:18,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:18,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:18,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:18,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:18,193 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:18,193 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:18,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:18,195 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:18,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:18,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:18,195 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:18,195 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:18,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:18,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:18,198 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:18,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:18,198 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:18,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:18,199 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:18,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:18,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:18,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:18,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:18,205 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:18,205 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:18,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:18,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:18,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:18,293 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:18,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:18,293 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:18,293 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 02:16:18,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:18,293 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:18,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2022-12-13 02:16:18,294 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 02:16:18,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash -875384595, now seen corresponding path program 1 times [2022-12-13 02:16:18,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:18,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981045859] [2022-12-13 02:16:18,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:18,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:18,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:16:18,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:18,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981045859] [2022-12-13 02:16:18,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981045859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:18,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:18,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:18,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571532699] [2022-12-13 02:16:18,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:18,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:18,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:18,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:18,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:18,343 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:18,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:18,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:18,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:18,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:18,415 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:18,415 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:18,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:18,416 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:18,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:18,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:18,417 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:18,417 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:18,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:18,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:18,421 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:18,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:18,422 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:18,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:18,422 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:18,422 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:18,422 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:18,422 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:18,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:18,430 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:18,430 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:16:18,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:18,431 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:18,431 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:18,541 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:18,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:16:18,541 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:18,542 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 02:16:18,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:18,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:18,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2022-12-13 02:16:18,542 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 02:16:18,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash -846755444, now seen corresponding path program 1 times [2022-12-13 02:16:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:18,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309508660] [2022-12-13 02:16:18,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:18,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:18,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:18,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309508660] [2022-12-13 02:16:18,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309508660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:18,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:18,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:18,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731061265] [2022-12-13 02:16:18,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:18,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:18,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:18,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:18,618 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:18,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:18,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:18,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:18,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:18,698 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:18,698 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:18,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:18,699 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:18,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:18,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:18,700 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:18,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:18,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:18,702 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:18,702 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:18,702 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:18,702 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:18,703 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:18,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:18,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:18,703 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:18,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:18,709 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:18,709 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:16:18,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:18,709 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:18,709 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:18,797 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:18,798 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:18,798 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:18,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:18,798 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:18,798 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:18,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2022-12-13 02:16:18,798 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 02:16:18,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:18,798 INFO L85 PathProgramCache]: Analyzing trace with hash -818126293, now seen corresponding path program 1 times [2022-12-13 02:16:18,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:18,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834237421] [2022-12-13 02:16:18,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:18,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:18,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 02:16:18,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:18,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834237421] [2022-12-13 02:16:18,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834237421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:18,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:18,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:18,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305817729] [2022-12-13 02:16:18,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:18,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:18,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:18,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:18,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:18,863 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:18,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:18,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:18,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:18,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:18,950 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:18,951 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:18,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:18,952 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:18,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:18,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:18,953 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:18,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:18,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:18,956 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:18,957 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:18,957 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:18,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:18,957 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:18,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:18,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:18,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:18,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:18,965 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:18,965 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:16:18,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:18,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:18,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:19,074 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:19,075 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:16:19,075 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:19,075 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 02:16:19,075 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:19,075 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:19,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2022-12-13 02:16:19,076 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 02:16:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash -789497142, now seen corresponding path program 1 times [2022-12-13 02:16:19,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:19,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329102698] [2022-12-13 02:16:19,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:19,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:19,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 02:16:19,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:19,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329102698] [2022-12-13 02:16:19,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329102698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:19,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:19,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:19,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417882343] [2022-12-13 02:16:19,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:19,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:19,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:19,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:19,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:19,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:19,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:19,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:19,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:19,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:19,207 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:19,207 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:19,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:19,208 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:19,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:19,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:19,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:19,209 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:19,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:19,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:19,212 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:19,212 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:19,212 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:19,212 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:19,212 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:19,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:19,213 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:19,213 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:19,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:19,219 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:19,219 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:19,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:19,220 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:19,220 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:19,307 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:19,307 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:19,308 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:19,308 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 02:16:19,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:19,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:19,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2022-12-13 02:16:19,308 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 02:16:19,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash -760867991, now seen corresponding path program 1 times [2022-12-13 02:16:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:19,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167963791] [2022-12-13 02:16:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:19,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:19,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:16:19,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:19,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167963791] [2022-12-13 02:16:19,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167963791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:19,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:19,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:19,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235346348] [2022-12-13 02:16:19,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:19,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:19,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:19,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:19,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:19,361 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:19,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:19,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:19,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:19,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:19,449 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:19,450 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:19,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:19,451 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:19,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:19,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:19,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:19,452 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:19,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:19,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:19,454 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:19,454 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:19,454 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:19,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:19,455 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:19,455 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:19,455 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:19,455 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:19,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:19,461 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:19,461 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:19,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:19,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:19,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:19,549 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:19,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:19,549 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:19,549 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 02:16:19,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:19,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:19,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2022-12-13 02:16:19,549 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 02:16:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash -732238840, now seen corresponding path program 1 times [2022-12-13 02:16:19,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:19,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667915305] [2022-12-13 02:16:19,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:19,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:19,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:16:19,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:19,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667915305] [2022-12-13 02:16:19,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667915305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:19,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:19,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:19,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568109889] [2022-12-13 02:16:19,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:19,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:19,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:19,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:19,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:19,614 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:19,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:19,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:19,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:19,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:19,708 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:19,709 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:19,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:19,710 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:19,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:19,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:19,711 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:19,711 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:19,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:19,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:19,715 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:19,715 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:19,715 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:19,715 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:19,716 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:19,716 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:19,716 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:19,716 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:19,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:19,724 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:19,724 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:19,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:19,725 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:19,725 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:19,820 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:19,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:16:19,821 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:19,821 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 02:16:19,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:19,821 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:19,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2022-12-13 02:16:19,821 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 02:16:19,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:19,821 INFO L85 PathProgramCache]: Analyzing trace with hash -703609689, now seen corresponding path program 1 times [2022-12-13 02:16:19,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:19,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739265024] [2022-12-13 02:16:19,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:19,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:19,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:19,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739265024] [2022-12-13 02:16:19,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739265024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:19,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:19,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:19,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933117407] [2022-12-13 02:16:19,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:19,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:19,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:19,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:19,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:19,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:19,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:19,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:19,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:19,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:19,935 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:19,935 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:19,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:19,936 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:19,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:19,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:19,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:19,937 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:19,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:19,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:19,940 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:19,940 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:19,940 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:19,940 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:19,940 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:19,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:19,940 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:19,940 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:19,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:19,946 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:19,946 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:19,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:19,947 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:19,947 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:20,034 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:20,035 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:20,035 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:20,035 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 02:16:20,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:20,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:20,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2022-12-13 02:16:20,035 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 02:16:20,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:20,035 INFO L85 PathProgramCache]: Analyzing trace with hash -674980538, now seen corresponding path program 1 times [2022-12-13 02:16:20,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:20,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185881119] [2022-12-13 02:16:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:20,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:20,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 02:16:20,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:20,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185881119] [2022-12-13 02:16:20,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185881119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:20,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:20,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:20,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672188342] [2022-12-13 02:16:20,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:20,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:20,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:20,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:20,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:20,082 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:20,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:20,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:20,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:20,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:20,158 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:20,158 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:20,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:20,159 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:20,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:20,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:20,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:20,160 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:20,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:20,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:20,163 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:20,163 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:20,163 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:20,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:20,164 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:20,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:20,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:20,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:20,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:20,170 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:20,170 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:20,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:20,170 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:20,170 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:20,257 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:20,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:20,257 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:20,257 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 02:16:20,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:20,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:20,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2022-12-13 02:16:20,258 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 02:16:20,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:20,258 INFO L85 PathProgramCache]: Analyzing trace with hash -646351387, now seen corresponding path program 1 times [2022-12-13 02:16:20,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:20,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960042165] [2022-12-13 02:16:20,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:20,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:20,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:16:20,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:20,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960042165] [2022-12-13 02:16:20,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960042165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:20,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:20,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102478050] [2022-12-13 02:16:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:20,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:20,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:20,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:20,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:20,309 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:20,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:20,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:20,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:20,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:20,384 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:20,385 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:20,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:20,386 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:20,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:20,386 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:20,386 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:20,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:20,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:20,389 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:20,389 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:20,389 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:20,389 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:20,389 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:20,389 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:20,389 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:20,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:20,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:20,395 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:20,395 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:20,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:20,396 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:20,396 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:20,483 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:20,483 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:20,483 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:20,483 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 02:16:20,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:20,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:20,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2022-12-13 02:16:20,483 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 02:16:20,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash -617722236, now seen corresponding path program 1 times [2022-12-13 02:16:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:20,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930370332] [2022-12-13 02:16:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:20,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:20,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:16:20,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:20,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930370332] [2022-12-13 02:16:20,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930370332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:20,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:20,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:20,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433214044] [2022-12-13 02:16:20,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:20,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:20,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:20,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:20,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:20,546 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:20,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:20,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:20,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:20,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:20,621 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:20,622 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:20,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:20,623 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:20,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:20,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:20,623 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:20,623 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:20,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:20,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:20,626 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:20,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:20,626 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:20,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:20,626 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:20,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:20,627 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:20,627 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:20,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:20,632 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:20,632 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:20,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:20,633 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:20,633 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:20,720 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:20,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:20,720 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:20,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:20,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:20,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:20,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2022-12-13 02:16:20,721 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 02:16:20,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash -589093085, now seen corresponding path program 1 times [2022-12-13 02:16:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:20,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85964913] [2022-12-13 02:16:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:20,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:16:20,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:20,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85964913] [2022-12-13 02:16:20,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85964913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:20,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:20,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:20,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113473307] [2022-12-13 02:16:20,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:20,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:20,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:20,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:20,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:20,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:20,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:20,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:20,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:20,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:20,857 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:20,857 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:20,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:20,858 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:20,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:20,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:20,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:20,859 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:20,859 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:20,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:20,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:20,862 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:20,862 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:20,862 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:20,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:20,862 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:20,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:20,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:20,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:20,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:20,868 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:20,868 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:20,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:20,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:20,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:20,957 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:20,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:20,957 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:20,957 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 02:16:20,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:20,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:20,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2022-12-13 02:16:20,958 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 02:16:20,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:20,958 INFO L85 PathProgramCache]: Analyzing trace with hash -560463934, now seen corresponding path program 1 times [2022-12-13 02:16:20,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:20,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501397747] [2022-12-13 02:16:20,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:20,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:21,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:16:21,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:21,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501397747] [2022-12-13 02:16:21,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501397747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:21,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:21,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:21,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051096825] [2022-12-13 02:16:21,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:21,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:21,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:21,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:21,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:21,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:21,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:21,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:21,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:21,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:21,077 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:21,077 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:21,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:21,078 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:21,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:21,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:21,079 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:21,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:21,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:21,082 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:21,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:21,082 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:21,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:21,082 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:21,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:21,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:21,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:21,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:21,088 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:21,088 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:21,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:21,089 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:21,089 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:21,178 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:21,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:16:21,179 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:21,179 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 02:16:21,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:21,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:21,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2022-12-13 02:16:21,179 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 02:16:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:21,179 INFO L85 PathProgramCache]: Analyzing trace with hash -531834783, now seen corresponding path program 1 times [2022-12-13 02:16:21,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:21,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293508923] [2022-12-13 02:16:21,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:21,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:21,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:16:21,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:21,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293508923] [2022-12-13 02:16:21,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293508923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:21,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:21,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131847501] [2022-12-13 02:16:21,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:21,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:21,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:21,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:21,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:21,225 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:21,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:21,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:21,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:21,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:21,302 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:21,302 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:21,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:21,303 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:21,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:21,304 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:21,304 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:21,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:21,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:21,306 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:21,307 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:21,307 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:21,307 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:21,307 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:21,307 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:21,307 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:21,307 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:21,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:21,313 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:21,313 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:21,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:21,314 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:21,314 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:21,402 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:21,403 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:21,403 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:21,403 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 02:16:21,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:21,403 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:21,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2022-12-13 02:16:21,403 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 02:16:21,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash -503205632, now seen corresponding path program 1 times [2022-12-13 02:16:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:21,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129010230] [2022-12-13 02:16:21,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:21,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:21,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:16:21,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:21,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129010230] [2022-12-13 02:16:21,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129010230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:21,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:21,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154431106] [2022-12-13 02:16:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:21,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:21,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:21,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:21,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:21,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:21,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:21,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:21,553 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:21,553 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:21,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:21,554 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:21,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:21,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:21,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:21,555 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:21,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:21,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:21,559 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:21,559 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:21,560 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:21,560 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:21,560 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:21,560 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:21,560 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:21,560 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:21,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:21,568 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:21,569 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:21,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:21,569 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:21,570 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:21,665 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:21,665 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:16:21,665 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:21,665 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 02:16:21,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:21,665 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:21,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2022-12-13 02:16:21,666 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 02:16:21,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:21,666 INFO L85 PathProgramCache]: Analyzing trace with hash -474576481, now seen corresponding path program 1 times [2022-12-13 02:16:21,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:21,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816172759] [2022-12-13 02:16:21,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:21,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:21,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:16:21,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:21,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816172759] [2022-12-13 02:16:21,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816172759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:21,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:21,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:21,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705383700] [2022-12-13 02:16:21,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:21,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:21,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:21,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:21,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:21,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:21,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:21,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:21,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:21,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:21,780 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:21,780 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:21,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:21,781 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:21,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:21,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:21,782 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:21,782 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:21,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:21,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:21,784 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:21,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:21,785 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:21,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:21,785 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:21,785 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:21,785 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:21,785 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:21,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:21,794 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:21,794 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:21,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:21,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:21,796 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:21,905 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:21,906 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:16:21,906 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:21,906 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 02:16:21,906 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:21,906 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:21,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2022-12-13 02:16:21,906 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 02:16:21,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:21,907 INFO L85 PathProgramCache]: Analyzing trace with hash -445947330, now seen corresponding path program 1 times [2022-12-13 02:16:21,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:21,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557620600] [2022-12-13 02:16:21,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:21,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:21,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:16:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:21,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557620600] [2022-12-13 02:16:21,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557620600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:21,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:21,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:21,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147157915] [2022-12-13 02:16:21,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:21,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:21,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:21,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:21,984 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:21,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:21,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:21,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:21,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:22,055 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:22,055 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:22,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:22,056 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:22,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:22,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:22,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:22,057 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:22,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:22,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:22,060 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:22,060 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:22,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:22,060 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:22,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:22,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:22,066 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:22,066 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:22,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:22,067 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:22,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:22,154 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:22,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:22,155 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:22,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:22,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:22,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:22,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable281 [2022-12-13 02:16:22,155 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 02:16:22,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash -417318179, now seen corresponding path program 1 times [2022-12-13 02:16:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:22,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164179856] [2022-12-13 02:16:22,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:22,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:22,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:16:22,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:22,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164179856] [2022-12-13 02:16:22,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164179856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:22,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:22,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:22,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61476035] [2022-12-13 02:16:22,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:22,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:22,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:22,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:22,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:22,203 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:22,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:22,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:22,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:22,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:22,269 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:22,269 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:22,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:22,271 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:22,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:22,271 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:22,271 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:22,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:22,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:22,274 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,274 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:22,274 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:22,274 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:22,274 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,275 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:22,275 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:22,275 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:22,280 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:22,280 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:22,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:22,281 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:22,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:22,369 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:22,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:22,370 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:22,370 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 02:16:22,370 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:22,370 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:22,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282 [2022-12-13 02:16:22,370 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 02:16:22,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:22,370 INFO L85 PathProgramCache]: Analyzing trace with hash -388689028, now seen corresponding path program 1 times [2022-12-13 02:16:22,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:22,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056155869] [2022-12-13 02:16:22,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:22,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:16:22,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:22,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056155869] [2022-12-13 02:16:22,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056155869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:22,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:22,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782014850] [2022-12-13 02:16:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:22,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:22,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:22,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:22,422 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:22,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:22,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:22,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:22,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:22,500 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:22,500 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:22,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:22,501 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:22,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:22,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:22,502 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:22,502 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:22,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:22,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:22,504 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,505 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:22,505 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:22,505 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:22,505 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,505 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:22,505 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:22,505 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:22,511 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:22,511 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:22,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:22,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:22,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:22,600 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:22,600 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:22,600 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:22,600 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 02:16:22,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:22,600 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:22,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283 [2022-12-13 02:16:22,601 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 02:16:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:22,601 INFO L85 PathProgramCache]: Analyzing trace with hash -360059877, now seen corresponding path program 1 times [2022-12-13 02:16:22,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:22,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283418962] [2022-12-13 02:16:22,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:22,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:22,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:16:22,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:22,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283418962] [2022-12-13 02:16:22,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283418962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:22,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:22,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:22,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402752740] [2022-12-13 02:16:22,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:22,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:22,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:22,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:22,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:22,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:22,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:22,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:22,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:22,722 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:22,722 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:22,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:22,723 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:22,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:22,724 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:22,724 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:22,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:22,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:22,727 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,727 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:22,727 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:22,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:22,727 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:22,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:22,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:22,733 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:22,733 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:22,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:22,734 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:22,734 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:22,820 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:22,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:22,821 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:22,821 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 02:16:22,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:22,821 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:22,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284 [2022-12-13 02:16:22,821 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 02:16:22,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:22,821 INFO L85 PathProgramCache]: Analyzing trace with hash -331430726, now seen corresponding path program 1 times [2022-12-13 02:16:22,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:22,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693070776] [2022-12-13 02:16:22,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:22,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:22,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:16:22,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:22,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693070776] [2022-12-13 02:16:22,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693070776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:22,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:22,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225529637] [2022-12-13 02:16:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:22,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:22,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:22,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:22,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:22,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:22,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:22,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:22,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:22,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:22,943 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:22,943 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:22,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:22,944 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:22,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:22,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:22,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:22,945 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:22,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:22,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:22,947 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:22,947 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:22,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:22,948 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,948 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:22,948 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:22,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:22,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:22,953 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:22,954 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:22,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:22,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:22,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:23,043 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:23,043 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:23,043 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:23,044 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 02:16:23,044 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:23,044 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:23,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2022-12-13 02:16:23,044 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 02:16:23,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash -302801575, now seen corresponding path program 1 times [2022-12-13 02:16:23,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:23,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064368146] [2022-12-13 02:16:23,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:23,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:23,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:16:23,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:23,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064368146] [2022-12-13 02:16:23,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064368146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:23,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:23,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:23,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715710580] [2022-12-13 02:16:23,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:23,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:23,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:23,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:23,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:23,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:23,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:23,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:23,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:23,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:23,155 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:23,155 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:23,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:23,156 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:23,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:23,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:23,157 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:23,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:23,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:23,160 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:23,160 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:23,160 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:23,160 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:23,160 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:23,160 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:23,160 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:23,161 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:23,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:23,167 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:23,167 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:23,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:23,168 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:23,168 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:23,256 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:23,256 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:23,256 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:23,256 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 02:16:23,256 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:23,256 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:23,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2022-12-13 02:16:23,256 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 02:16:23,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:23,257 INFO L85 PathProgramCache]: Analyzing trace with hash -274172424, now seen corresponding path program 1 times [2022-12-13 02:16:23,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:23,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135138075] [2022-12-13 02:16:23,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:23,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:23,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:16:23,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:23,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135138075] [2022-12-13 02:16:23,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135138075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:23,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:23,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:23,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222383710] [2022-12-13 02:16:23,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:23,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:23,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:23,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:23,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:23,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:23,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:23,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:23,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:23,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:23,369 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:23,369 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:23,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:23,370 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:23,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:23,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:23,371 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:23,371 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:23,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:23,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:23,374 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:23,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:23,374 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:23,374 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:23,374 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:23,374 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:23,375 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:23,375 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:23,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:23,381 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:23,381 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:23,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:23,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:23,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:23,470 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:23,470 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:23,470 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:23,470 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 02:16:23,470 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:23,470 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:23,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287 [2022-12-13 02:16:23,470 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 02:16:23,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:23,471 INFO L85 PathProgramCache]: Analyzing trace with hash -245543273, now seen corresponding path program 1 times [2022-12-13 02:16:23,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:23,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15827408] [2022-12-13 02:16:23,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:23,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:23,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:16:23,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:23,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15827408] [2022-12-13 02:16:23,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15827408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:23,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:23,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:23,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634280863] [2022-12-13 02:16:23,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:23,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:23,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:23,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:23,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:23,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:23,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:23,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:23,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:23,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:23,581 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:23,581 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:23,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:23,582 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:23,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:23,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:23,583 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:23,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:23,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:23,585 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:23,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:23,586 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:23,586 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:23,586 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:23,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:23,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:23,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:23,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:23,598 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:23,598 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:23,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:23,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:23,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:23,685 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:23,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:16:23,686 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:23,686 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 02:16:23,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:23,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:23,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable288 [2022-12-13 02:16:23,686 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 02:16:23,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:23,686 INFO L85 PathProgramCache]: Analyzing trace with hash -216914122, now seen corresponding path program 1 times [2022-12-13 02:16:23,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:23,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90030184] [2022-12-13 02:16:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:23,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:23,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:16:23,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:23,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90030184] [2022-12-13 02:16:23,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90030184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:23,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:23,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:23,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458146341] [2022-12-13 02:16:23,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:23,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:23,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:23,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:23,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:23,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:23,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:23,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:23,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:23,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:23,800 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:23,800 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:23,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:23,801 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:23,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:23,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:23,802 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:23,802 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:23,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:23,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:23,804 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:23,804 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:23,805 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:23,805 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:23,805 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:23,805 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:23,805 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:23,805 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:23,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:23,811 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:23,811 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:23,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:23,811 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:23,811 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:23,897 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:23,898 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:23,898 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:23,898 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 02:16:23,898 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:23,898 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:23,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable289 [2022-12-13 02:16:23,898 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 02:16:23,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:23,899 INFO L85 PathProgramCache]: Analyzing trace with hash -188284971, now seen corresponding path program 1 times [2022-12-13 02:16:23,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:23,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834281959] [2022-12-13 02:16:23,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:23,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16: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 02:16:23,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:23,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834281959] [2022-12-13 02:16:23,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834281959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:23,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:23,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887990170] [2022-12-13 02:16:23,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:23,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:23,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:23,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:23,957 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:23,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:23,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:23,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:23,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:24,053 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:24,053 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:24,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:24,055 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:24,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:24,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:24,056 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:24,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:24,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:24,059 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:24,059 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:24,060 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:24,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:24,060 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:24,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:24,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:24,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:24,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:24,068 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:24,068 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:24,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:24,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:24,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:24,178 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:24,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:16:24,179 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:24,179 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 02:16:24,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:24,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:24,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2022-12-13 02:16:24,180 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 02:16:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash -159655820, now seen corresponding path program 1 times [2022-12-13 02:16:24,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:24,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890420900] [2022-12-13 02:16:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:24,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:24,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:16:24,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:24,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890420900] [2022-12-13 02:16:24,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890420900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:24,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:24,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:24,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286924914] [2022-12-13 02:16:24,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:24,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:24,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:24,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:24,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:24,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:24,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:24,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:24,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:24,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:24,329 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:24,329 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:24,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:24,331 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:24,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:24,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:24,332 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:24,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:24,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:24,335 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:24,335 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:24,336 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:24,336 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:24,336 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:24,336 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:24,336 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:24,336 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:24,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:24,344 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:24,344 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:24,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:24,345 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:24,345 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:24,444 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:24,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 02:16:24,445 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:24,445 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 02:16:24,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:24,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:24,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2022-12-13 02:16:24,445 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 02:16:24,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:24,445 INFO L85 PathProgramCache]: Analyzing trace with hash -131026669, now seen corresponding path program 1 times [2022-12-13 02:16:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:24,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418572405] [2022-12-13 02:16:24,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:24,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:24,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 02:16:24,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:24,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418572405] [2022-12-13 02:16:24,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418572405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:24,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:24,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:24,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125961329] [2022-12-13 02:16:24,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:24,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:24,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:24,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:24,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:24,518 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:24,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:24,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:24,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:24,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:24,586 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:24,586 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:24,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:24,587 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:24,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:24,588 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:24,588 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:24,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:24,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:24,591 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:24,591 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:24,591 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:24,591 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:24,591 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:24,591 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:24,591 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:24,591 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:24,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:24,597 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:24,597 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:24,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:24,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:24,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:24,684 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:24,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:24,684 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:24,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:24,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:24,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:24,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292 [2022-12-13 02:16:24,684 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 02:16:24,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash -102397518, now seen corresponding path program 1 times [2022-12-13 02:16:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:24,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78729889] [2022-12-13 02:16:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:24,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:16:24,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:24,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78729889] [2022-12-13 02:16:24,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78729889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:24,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:24,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:24,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953411647] [2022-12-13 02:16:24,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:24,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:24,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:24,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:24,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:24,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:24,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:24,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:24,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:24,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:24,849 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:24,849 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:24,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:24,850 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:24,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:24,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:24,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:24,851 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:24,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:24,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:24,854 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:24,854 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:24,854 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:24,854 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:24,854 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:24,854 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:24,854 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:24,854 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:24,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:24,860 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:24,860 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:24,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:24,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:24,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:24,948 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:24,949 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:24,949 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:24,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:24,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:24,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:24,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable293 [2022-12-13 02:16:24,949 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 02:16:24,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:24,949 INFO L85 PathProgramCache]: Analyzing trace with hash -73768367, now seen corresponding path program 1 times [2022-12-13 02:16:24,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:24,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646030816] [2022-12-13 02:16:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:24,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:25,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:16:25,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:25,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646030816] [2022-12-13 02:16:25,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646030816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:25,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:25,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:25,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114470960] [2022-12-13 02:16:25,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:25,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:25,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:25,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:25,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:25,018 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:25,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:25,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:25,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:25,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:25,112 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:25,112 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:25,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:25,115 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:25,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:25,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:25,116 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:25,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:25,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:25,120 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:25,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:25,120 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:25,120 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:25,121 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:25,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:25,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:25,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:25,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:25,128 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:25,129 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:25,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:25,129 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:25,130 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:25,237 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:25,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:16:25,237 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:25,237 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 02:16:25,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:25,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:25,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2022-12-13 02:16:25,238 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 02:16:25,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:25,238 INFO L85 PathProgramCache]: Analyzing trace with hash -45139216, now seen corresponding path program 1 times [2022-12-13 02:16:25,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:25,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988497206] [2022-12-13 02:16:25,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:25,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:25,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:16:25,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:25,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988497206] [2022-12-13 02:16:25,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988497206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:25,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:25,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:25,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706247418] [2022-12-13 02:16:25,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:25,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:25,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:25,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:25,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:25,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:25,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:25,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:25,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:25,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:25,379 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:25,379 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:25,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:25,381 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:25,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:25,381 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:25,381 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:25,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:25,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:25,386 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:25,386 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:25,386 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:25,386 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:25,386 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:25,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:25,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:25,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:25,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:25,395 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:25,395 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:25,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:25,396 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:25,396 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:25,489 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:25,490 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:16:25,490 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:25,490 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 02:16:25,490 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:25,490 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:25,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295 [2022-12-13 02:16:25,490 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 02:16:25,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:25,490 INFO L85 PathProgramCache]: Analyzing trace with hash -16510065, now seen corresponding path program 1 times [2022-12-13 02:16:25,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:25,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930728642] [2022-12-13 02:16:25,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:25,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:25,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:16:25,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:25,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930728642] [2022-12-13 02:16:25,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930728642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:25,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:25,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:25,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536169751] [2022-12-13 02:16:25,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:25,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:25,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:25,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:25,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:25,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:25,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:25,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:25,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:25,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:25,628 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:25,628 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:25,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:25,629 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:25,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:25,630 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:25,630 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:25,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:25,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:25,633 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:25,633 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:25,633 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:25,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:25,633 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:25,633 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:25,633 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:25,634 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:25,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:25,639 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:25,639 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:25,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:25,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:25,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:25,726 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:25,727 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:25,727 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:25,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:25,727 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:25,727 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:25,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2022-12-13 02:16:25,727 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 02:16:25,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:25,728 INFO L85 PathProgramCache]: Analyzing trace with hash 12119086, now seen corresponding path program 1 times [2022-12-13 02:16:25,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:25,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712010159] [2022-12-13 02:16:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:25,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:25,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:16:25,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:25,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712010159] [2022-12-13 02:16:25,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712010159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:25,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:25,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161838561] [2022-12-13 02:16:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:25,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:25,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:25,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:25,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:25,781 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:25,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:25,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:25,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:25,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:25,846 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:25,846 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:25,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:25,847 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:25,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:25,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:25,848 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:25,848 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:25,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:25,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:25,850 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:25,850 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:25,850 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:25,851 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:25,851 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:25,851 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:25,851 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:25,851 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:25,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:25,856 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:25,857 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:25,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:25,857 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:25,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:25,943 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:25,944 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:25,944 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:25,944 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 02:16:25,944 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:25,944 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:25,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2022-12-13 02:16:25,944 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 02:16:25,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:25,944 INFO L85 PathProgramCache]: Analyzing trace with hash 40748237, now seen corresponding path program 1 times [2022-12-13 02:16:25,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:25,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601435804] [2022-12-13 02:16:25,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:25,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:25,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:16:25,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:25,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601435804] [2022-12-13 02:16:25,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601435804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:25,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:25,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:25,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281351899] [2022-12-13 02:16:25,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:25,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:25,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:25,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:25,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:25,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:25,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:25,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:25,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:25,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:26,059 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:26,059 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:16:26,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:26,060 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:26,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:26,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:26,061 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:26,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:26,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:26,064 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:26,064 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:26,064 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:26,064 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:26,064 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:26,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:26,065 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:26,065 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:26,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:26,073 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:26,073 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:16:26,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:26,074 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:26,074 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:26,162 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:26,162 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:16:26,162 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:26,162 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 02:16:26,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:26,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:26,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2022-12-13 02:16:26,162 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 02:16:26,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:26,163 INFO L85 PathProgramCache]: Analyzing trace with hash 69377388, now seen corresponding path program 1 times [2022-12-13 02:16:26,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:26,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735584898] [2022-12-13 02:16:26,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:26,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:26,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:16:26,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:26,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735584898] [2022-12-13 02:16:26,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735584898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:26,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:26,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:26,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113784354] [2022-12-13 02:16:26,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:26,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:26,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:26,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:26,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:26,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:26,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:26,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:26,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:26,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:26,286 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:26,286 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:26,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:26,287 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:26,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:26,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:26,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:26,288 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:26,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:26,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:26,290 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:26,290 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:26,290 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:26,291 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:26,291 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:26,291 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:26,291 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:26,292 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:26,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:26,299 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:26,300 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:26,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:26,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:26,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:26,388 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:26,388 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:16:26,388 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:26,388 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 02:16:26,388 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:26,388 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:26,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable299 [2022-12-13 02:16:26,389 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 02:16:26,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:26,389 INFO L85 PathProgramCache]: Analyzing trace with hash 98006539, now seen corresponding path program 1 times [2022-12-13 02:16:26,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:26,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366274776] [2022-12-13 02:16:26,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:26,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:26,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:16:26,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:26,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366274776] [2022-12-13 02:16:26,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366274776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:26,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:26,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799993921] [2022-12-13 02:16:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:26,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:26,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:26,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:26,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:26,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:26,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:26,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:26,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:26,529 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:26,529 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:26,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:26,531 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:26,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:26,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:26,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:26,531 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:26,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:26,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:26,535 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:26,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:26,535 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:26,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:26,536 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:26,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:26,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:26,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:26,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:26,544 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:26,544 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:26,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:26,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:26,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:26,646 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:26,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 02:16:26,647 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:26,647 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 02:16:26,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:26,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:26,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2022-12-13 02:16:26,647 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 02:16:26,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash 126635690, now seen corresponding path program 1 times [2022-12-13 02:16:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:26,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804257463] [2022-12-13 02:16:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:26,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:16:26,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:26,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804257463] [2022-12-13 02:16:26,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804257463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:26,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:26,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:26,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63236279] [2022-12-13 02:16:26,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:26,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:26,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:26,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:26,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:26,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:26,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:26,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:26,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:26,784 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:26,784 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:26,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:26,793 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:26,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:26,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:26,794 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:26,794 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:26,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:26,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:26,796 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:26,797 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:26,797 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:26,797 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:26,797 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:26,797 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:26,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:26,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:26,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:26,803 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:26,803 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:26,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:26,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:26,804 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:26,891 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:26,891 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:26,891 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:26,892 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 02:16:26,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:26,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:26,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2022-12-13 02:16:26,892 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 02:16:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash 155264841, now seen corresponding path program 1 times [2022-12-13 02:16:26,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:26,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336474195] [2022-12-13 02:16:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:26,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:26,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:16:26,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:26,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336474195] [2022-12-13 02:16:26,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336474195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:26,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:26,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900811357] [2022-12-13 02:16:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:26,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:26,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:26,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:26,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:26,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:26,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:26,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:26,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:26,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:27,003 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:27,004 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:27,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:27,005 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:27,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:27,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:27,005 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:27,005 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:27,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:27,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:27,008 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,008 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:27,008 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:27,008 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:27,008 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,009 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:27,009 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:27,009 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:27,014 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:27,014 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:27,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:27,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:27,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:27,109 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:27,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:16:27,110 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:27,110 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 02:16:27,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:27,110 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:27,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2022-12-13 02:16:27,110 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 02:16:27,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:27,111 INFO L85 PathProgramCache]: Analyzing trace with hash 183893992, now seen corresponding path program 1 times [2022-12-13 02:16:27,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:27,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561728276] [2022-12-13 02:16:27,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:27,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:27,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:16:27,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:27,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561728276] [2022-12-13 02:16:27,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561728276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:27,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:27,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:27,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537642126] [2022-12-13 02:16:27,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:27,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:27,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:27,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:27,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:27,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:27,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:27,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:27,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:27,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:27,291 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:27,291 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:27,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:27,292 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:27,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:27,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:27,293 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:27,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:27,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:27,295 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:27,295 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:27,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:27,296 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,296 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:27,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:27,296 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:27,301 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:27,302 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:16:27,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:27,302 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:27,302 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:27,389 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:27,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:27,390 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:27,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:27,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:27,390 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:27,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2022-12-13 02:16:27,390 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 02:16:27,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash 212523143, now seen corresponding path program 1 times [2022-12-13 02:16:27,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:27,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330888816] [2022-12-13 02:16:27,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:27,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:27,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:27,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330888816] [2022-12-13 02:16:27,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330888816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:27,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:27,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:27,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829643086] [2022-12-13 02:16:27,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:27,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:27,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:27,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:27,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:27,437 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:27,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:27,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:27,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:27,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:27,515 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:27,516 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:27,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:27,517 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:27,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:27,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:27,517 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:27,517 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:27,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:27,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:27,520 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,520 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:27,521 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:27,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:27,521 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,521 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:27,521 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:27,521 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:27,527 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:27,527 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:27,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:27,527 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:27,527 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:27,614 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:27,614 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:27,614 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:27,614 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 02:16:27,614 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:27,614 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:27,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2022-12-13 02:16:27,614 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 02:16:27,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash 241152294, now seen corresponding path program 1 times [2022-12-13 02:16:27,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:27,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203801801] [2022-12-13 02:16:27,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:27,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:27,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:27,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203801801] [2022-12-13 02:16:27,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203801801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:27,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:27,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842503219] [2022-12-13 02:16:27,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:27,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:27,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:27,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:27,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:27,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:27,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:27,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:27,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:27,735 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:27,735 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:27,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:27,736 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:27,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:27,737 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:27,737 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:27,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:27,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:27,740 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,740 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:27,740 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:27,740 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:27,740 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:27,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:27,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:27,746 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:27,746 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:27,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:27,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:27,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:27,841 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:27,841 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:16:27,841 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:27,841 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 02:16:27,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:27,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:27,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable305 [2022-12-13 02:16:27,841 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 02:16:27,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:27,842 INFO L85 PathProgramCache]: Analyzing trace with hash 269781445, now seen corresponding path program 1 times [2022-12-13 02:16:27,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:27,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973742454] [2022-12-13 02:16:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:27,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:27,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973742454] [2022-12-13 02:16:27,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973742454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:27,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:27,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:27,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867920620] [2022-12-13 02:16:27,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:27,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:27,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:27,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:27,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:27,888 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:27,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:27,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:27,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:27,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:27,955 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:27,955 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:27,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:27,956 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:27,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:27,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:27,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:27,957 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:27,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:27,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:27,960 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,960 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:27,960 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:27,960 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:27,960 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:27,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:27,960 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:27,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:27,966 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:27,966 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:27,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:27,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:27,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:28,053 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:28,054 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:28,054 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:28,054 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 02:16:28,054 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:28,054 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:28,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2022-12-13 02:16:28,054 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 02:16:28,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:28,054 INFO L85 PathProgramCache]: Analyzing trace with hash 298410596, now seen corresponding path program 1 times [2022-12-13 02:16:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:28,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698108257] [2022-12-13 02:16:28,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:28,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:28,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:16:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:28,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698108257] [2022-12-13 02:16:28,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698108257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:28,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:28,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:28,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606716469] [2022-12-13 02:16:28,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:28,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:28,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:28,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:28,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:28,099 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:28,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:28,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:28,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:28,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:28,165 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:28,166 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:28,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:28,167 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:28,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:28,167 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:28,167 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:28,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:28,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:28,170 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:28,170 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:28,170 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:28,170 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:28,170 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:28,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:28,171 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:28,171 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:28,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:28,176 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:28,176 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:28,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:28,177 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:28,177 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:28,265 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:28,265 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:28,265 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:28,265 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 02:16:28,265 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:28,265 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:28,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2022-12-13 02:16:28,265 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 02:16:28,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:28,266 INFO L85 PathProgramCache]: Analyzing trace with hash 327039747, now seen corresponding path program 1 times [2022-12-13 02:16:28,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:28,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049624675] [2022-12-13 02:16:28,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:28,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:28,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:16:28,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:28,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049624675] [2022-12-13 02:16:28,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049624675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:28,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:28,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603937629] [2022-12-13 02:16:28,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:28,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:28,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:28,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:28,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:28,313 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:28,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:28,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:28,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:28,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:28,387 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:28,387 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:28,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:28,388 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:28,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:28,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:28,389 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:28,389 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:28,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:28,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:28,391 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:28,392 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:28,392 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:28,392 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:28,392 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:28,392 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:28,392 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:28,392 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:28,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:28,398 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:28,398 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:28,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:28,399 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:28,399 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:28,487 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:28,488 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:28,488 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:28,488 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 02:16:28,488 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:28,488 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:28,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2022-12-13 02:16:28,488 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 02:16:28,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash 355668898, now seen corresponding path program 1 times [2022-12-13 02:16:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:28,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462365488] [2022-12-13 02:16:28,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:28,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:28,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:16:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:28,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462365488] [2022-12-13 02:16:28,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462365488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:28,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:28,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:28,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571141462] [2022-12-13 02:16:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:28,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:28,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:28,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:28,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:28,550 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:28,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:28,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:28,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:28,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:28,628 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:28,628 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:28,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:28,630 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:28,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:28,630 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:28,630 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:28,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:28,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:28,633 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:28,633 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:28,633 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:28,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:28,633 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:28,633 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:28,633 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:28,633 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:28,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:28,639 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:28,639 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:28,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:28,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:28,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:28,725 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:28,726 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:28,726 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:28,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:28,726 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:28,726 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:28,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2022-12-13 02:16:28,726 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 02:16:28,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:28,727 INFO L85 PathProgramCache]: Analyzing trace with hash 384298049, now seen corresponding path program 1 times [2022-12-13 02:16:28,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:28,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247836845] [2022-12-13 02:16:28,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:28,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:28,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:16:28,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:28,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247836845] [2022-12-13 02:16:28,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247836845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:28,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:28,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:28,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345562193] [2022-12-13 02:16:28,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:28,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:28,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:28,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:28,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:28,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:28,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:28,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:28,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:28,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:28,876 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:28,876 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:28,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:28,877 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:28,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:28,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:28,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:28,878 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:28,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:28,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:28,881 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:28,881 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:28,881 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:28,881 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:28,881 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:28,882 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:28,882 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:28,882 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:28,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:28,890 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:28,890 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:28,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:28,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:28,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:28,979 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:28,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:16:28,979 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:28,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:28,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:28,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:28,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2022-12-13 02:16:28,980 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 02:16:28,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash 412927200, now seen corresponding path program 1 times [2022-12-13 02:16:28,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:28,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028721338] [2022-12-13 02:16:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:28,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:29,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:16:29,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:29,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028721338] [2022-12-13 02:16:29,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028721338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:29,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:29,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:29,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797824155] [2022-12-13 02:16:29,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:29,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:29,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:29,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:29,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:29,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:29,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:29,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:29,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:29,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:29,116 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:29,116 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:29,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:29,118 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:29,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:29,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:29,118 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:29,118 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:29,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:29,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:29,121 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:29,121 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:29,121 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:29,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:29,121 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:29,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:29,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:29,122 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:29,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:29,127 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:29,128 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:29,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:29,128 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:29,128 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:29,238 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:29,238 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:16:29,238 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:29,238 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 02:16:29,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:29,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:29,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2022-12-13 02:16:29,239 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 02:16:29,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash 441556351, now seen corresponding path program 1 times [2022-12-13 02:16:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:29,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304314140] [2022-12-13 02:16:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:29,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:16:29,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:29,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304314140] [2022-12-13 02:16:29,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304314140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:29,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:29,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:29,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817333325] [2022-12-13 02:16:29,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:29,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:29,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:29,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:29,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:29,292 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:29,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:29,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:29,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:29,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:29,368 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:29,368 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:29,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:29,369 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:29,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:29,369 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:29,370 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:29,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:29,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:29,372 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:29,372 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:29,373 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:29,373 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:29,373 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:29,373 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:29,373 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:29,373 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:29,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:29,379 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:29,379 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:29,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:29,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:29,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:29,469 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:29,469 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:29,469 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:29,469 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 02:16:29,470 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:29,470 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:29,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2022-12-13 02:16:29,470 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 02:16:29,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:29,470 INFO L85 PathProgramCache]: Analyzing trace with hash 470185502, now seen corresponding path program 1 times [2022-12-13 02:16:29,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:29,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857284386] [2022-12-13 02:16:29,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:29,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:29,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 02:16:29,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:29,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857284386] [2022-12-13 02:16:29,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857284386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:29,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:29,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:29,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425579377] [2022-12-13 02:16:29,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:29,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:29,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:29,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:29,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:29,513 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:29,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:29,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:29,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:29,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:29,579 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:29,579 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:29,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:29,581 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:29,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:29,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:29,581 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:29,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:29,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:29,584 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:29,584 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:29,584 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:29,585 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:29,585 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:29,585 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:29,585 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:29,585 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:29,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:29,590 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:29,591 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:29,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:29,591 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:29,591 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:29,682 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:29,683 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:16:29,683 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:29,683 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 02:16:29,683 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:29,683 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:29,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313 [2022-12-13 02:16:29,683 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 02:16:29,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash 498814653, now seen corresponding path program 1 times [2022-12-13 02:16:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:29,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722722944] [2022-12-13 02:16:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:29,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:16:29,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:29,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722722944] [2022-12-13 02:16:29,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722722944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:29,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:29,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:29,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266605217] [2022-12-13 02:16:29,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:29,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:29,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:29,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:29,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:29,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:29,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:29,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:29,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:29,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:29,865 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:29,865 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:29,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:29,866 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:29,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:29,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:29,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:29,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:29,867 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:29,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:29,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:29,870 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:29,870 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:29,870 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:29,870 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:29,870 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:29,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:29,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:29,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:29,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:29,876 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:29,876 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:29,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:29,877 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:29,877 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:29,964 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:29,965 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:29,965 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:29,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:29,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:29,965 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:29,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2022-12-13 02:16:29,965 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 02:16:29,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:29,965 INFO L85 PathProgramCache]: Analyzing trace with hash 527443804, now seen corresponding path program 1 times [2022-12-13 02:16:29,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:29,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519954847] [2022-12-13 02:16:29,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:29,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:30,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:16:30,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:30,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519954847] [2022-12-13 02:16:30,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519954847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:30,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:30,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:30,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158498680] [2022-12-13 02:16:30,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:30,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:30,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:30,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:30,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:30,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:30,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:30,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:30,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:30,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:30,080 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:30,080 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:30,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:30,081 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:30,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:30,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:30,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:30,082 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:30,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:30,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:30,085 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:30,085 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:30,085 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:30,085 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,085 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:30,085 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:30,085 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:30,091 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:30,091 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:30,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:30,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:30,092 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:30,179 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:30,180 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:30,180 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:30,180 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 02:16:30,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:30,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:30,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315 [2022-12-13 02:16:30,180 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 02:16:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash 556072955, now seen corresponding path program 1 times [2022-12-13 02:16:30,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:30,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134012309] [2022-12-13 02:16:30,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:30,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:30,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:16:30,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:30,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134012309] [2022-12-13 02:16:30,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134012309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:30,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:30,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:30,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729434014] [2022-12-13 02:16:30,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:30,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:30,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:30,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:30,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:30,226 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:30,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:30,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:30,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:30,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:30,292 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:30,293 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:30,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:30,294 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:30,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:30,294 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:30,294 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:30,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:30,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:30,297 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:30,297 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:30,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:30,297 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,298 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:30,298 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:30,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:30,303 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:30,304 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:30,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:30,304 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:30,304 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:30,393 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:30,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:30,393 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:30,393 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 02:16:30,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:30,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:30,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2022-12-13 02:16:30,394 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 02:16:30,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash 584702106, now seen corresponding path program 1 times [2022-12-13 02:16:30,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:30,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141823094] [2022-12-13 02:16:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:30,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:30,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:16:30,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:30,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141823094] [2022-12-13 02:16:30,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141823094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:30,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:30,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:30,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580175924] [2022-12-13 02:16:30,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:30,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:30,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:30,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:30,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:30,441 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:30,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:30,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:30,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:30,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:30,508 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:30,508 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:30,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:30,509 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:30,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:30,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:30,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:30,510 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:30,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:30,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:30,513 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,513 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:30,513 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:30,513 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:30,513 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:30,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:30,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:30,519 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:30,520 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:30,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 444 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:30,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:30,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:30,608 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:30,609 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:30,609 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:30,609 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 02:16:30,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:30,609 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:30,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable317 [2022-12-13 02:16:30,609 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 02:16:30,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash 613331257, now seen corresponding path program 1 times [2022-12-13 02:16:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:30,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585489711] [2022-12-13 02:16:30,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:30,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:30,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:16:30,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:30,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585489711] [2022-12-13 02:16:30,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585489711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:30,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:30,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:30,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80182971] [2022-12-13 02:16:30,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:30,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:30,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:30,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:30,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:30,660 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:30,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:30,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:30,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:30,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:30,737 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:30,737 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:30,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:30,738 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:30,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:30,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:30,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:30,739 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:30,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:30,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:30,742 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:30,742 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:30,742 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:30,742 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,742 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:30,742 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:30,742 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:30,748 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:30,748 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:30,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:30,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:30,749 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:30,844 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:30,844 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:16:30,844 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:30,845 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 02:16:30,845 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:30,845 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:30,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318 [2022-12-13 02:16:30,845 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 02:16:30,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:30,845 INFO L85 PathProgramCache]: Analyzing trace with hash 641960408, now seen corresponding path program 1 times [2022-12-13 02:16:30,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:30,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840058349] [2022-12-13 02:16:30,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:30,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16: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:16:30,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:30,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840058349] [2022-12-13 02:16:30,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840058349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:30,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:30,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:30,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692950918] [2022-12-13 02:16:30,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:30,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:30,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:30,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:30,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:30,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:30,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:30,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:30,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:30,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:30,989 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:30,989 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:30,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:30,990 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:30,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:30,991 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:30,991 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:30,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:30,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:30,993 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:30,994 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:30,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:30,994 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,994 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:30,994 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:30,994 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:30,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:31,000 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:31,000 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:16:31,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:31,000 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:31,000 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:31,087 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:31,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:31,088 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:31,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:31,088 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:31,088 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:31,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable319 [2022-12-13 02:16:31,088 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 02:16:31,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:31,088 INFO L85 PathProgramCache]: Analyzing trace with hash 670589559, now seen corresponding path program 1 times [2022-12-13 02:16:31,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:31,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50760199] [2022-12-13 02:16:31,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:31,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:31,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:31,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50760199] [2022-12-13 02:16:31,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50760199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:31,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:31,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:31,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555635599] [2022-12-13 02:16:31,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:31,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:31,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:31,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:31,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:31,138 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:31,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:31,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:31,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:31,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:31,214 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:31,214 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:31,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:31,216 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:31,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:31,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:31,216 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:31,216 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:31,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:31,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:31,219 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:31,219 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:31,219 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:31,219 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:31,219 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:31,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:31,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:31,220 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:31,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:31,225 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:31,225 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:31,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:31,226 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:31,226 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:31,311 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:31,312 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:31,312 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:31,312 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 02:16:31,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:31,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:31,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable320 [2022-12-13 02:16:31,312 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 02:16:31,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:31,312 INFO L85 PathProgramCache]: Analyzing trace with hash 699218710, now seen corresponding path program 1 times [2022-12-13 02:16:31,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:31,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661633473] [2022-12-13 02:16:31,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:31,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:16:31,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:31,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661633473] [2022-12-13 02:16:31,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661633473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:31,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:31,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:31,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522604104] [2022-12-13 02:16:31,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:31,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:31,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:31,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:31,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:31,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:31,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:31,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:31,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:31,431 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:31,431 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:31,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:31,432 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:31,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:31,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:31,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:31,433 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:31,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:31,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:31,436 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:31,436 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:31,436 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:31,436 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:31,436 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:31,436 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:31,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:31,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:31,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:31,442 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:31,442 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:31,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:31,443 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:31,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:31,529 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:31,529 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:31,530 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:31,530 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 02:16:31,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:31,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:31,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321 [2022-12-13 02:16:31,530 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 02:16:31,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:31,530 INFO L85 PathProgramCache]: Analyzing trace with hash 727847861, now seen corresponding path program 1 times [2022-12-13 02:16:31,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:31,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391509452] [2022-12-13 02:16:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:31,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:16:31,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:31,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391509452] [2022-12-13 02:16:31,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391509452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:31,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:31,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:31,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542036227] [2022-12-13 02:16:31,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:31,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:31,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:31,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:31,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:31,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:31,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:31,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:31,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:31,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:31,640 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:31,640 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:31,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:31,641 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:31,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:31,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:31,642 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:31,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:31,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:31,644 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:31,645 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:31,645 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:31,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:31,645 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:31,645 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:31,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:31,645 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:31,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:31,651 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:31,651 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:31,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:31,652 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:31,652 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:31,743 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:31,744 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:16:31,744 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:31,744 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 02:16:31,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:31,744 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:31,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable322 [2022-12-13 02:16:31,744 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 02:16:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash 756477012, now seen corresponding path program 1 times [2022-12-13 02:16:31,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:31,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159546523] [2022-12-13 02:16:31,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:31,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:31,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:16:31,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:31,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159546523] [2022-12-13 02:16:31,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159546523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:31,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:31,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600802970] [2022-12-13 02:16:31,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:31,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:31,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:31,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:31,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:31,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:31,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:31,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:31,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:31,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:31,871 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:31,871 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:31,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:31,872 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:31,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:31,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:31,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:31,873 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:31,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:31,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:31,876 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:31,876 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:31,876 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:31,876 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:31,876 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:31,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:31,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:31,877 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:31,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:31,882 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:31,882 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:31,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:31,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:31,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:31,970 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:31,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:31,970 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:31,970 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 02:16:31,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:31,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:31,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable323 [2022-12-13 02:16:31,971 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 02:16:31,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash 785106163, now seen corresponding path program 1 times [2022-12-13 02:16:31,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:31,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789420396] [2022-12-13 02:16:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:31,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:32,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:16:32,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:32,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789420396] [2022-12-13 02:16:32,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789420396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:32,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:32,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:32,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704583025] [2022-12-13 02:16:32,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:32,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:32,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:32,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:32,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:32,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:32,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:32,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:32,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:32,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:32,149 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:32,149 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:32,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:32,150 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:32,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:32,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:32,151 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:32,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:32,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:32,154 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:32,154 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:32,154 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:32,154 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:32,154 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:32,154 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:32,154 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:32,154 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:32,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:32,160 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:32,160 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:32,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:32,161 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:32,161 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:32,247 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:32,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:32,247 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:32,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:32,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:32,248 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:32,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable324 [2022-12-13 02:16:32,248 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 02:16:32,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash 813735314, now seen corresponding path program 1 times [2022-12-13 02:16:32,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:32,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81014270] [2022-12-13 02:16:32,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:32,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:32,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:16:32,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:32,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81014270] [2022-12-13 02:16:32,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81014270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:32,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:32,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:32,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881772262] [2022-12-13 02:16:32,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:32,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:32,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:32,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:32,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:32,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:32,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:32,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:32,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:32,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:32,360 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:32,360 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:32,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:32,362 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:32,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:32,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:32,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:32,362 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:32,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:32,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:32,365 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:32,365 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:32,366 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:32,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:32,366 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:32,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:32,366 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:32,366 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:32,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:32,374 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:32,375 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:32,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:32,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:32,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:32,465 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:32,466 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:16:32,466 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:32,466 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 02:16:32,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:32,466 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:32,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable325 [2022-12-13 02:16:32,466 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 02:16:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash 842364465, now seen corresponding path program 1 times [2022-12-13 02:16:32,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:32,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939506023] [2022-12-13 02:16:32,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:32,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:32,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:16:32,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:32,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939506023] [2022-12-13 02:16:32,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939506023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:32,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:32,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:32,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958635062] [2022-12-13 02:16:32,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:32,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:32,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:32,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:32,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:32,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:32,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:32,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:32,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:32,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:32,597 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:32,597 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:32,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:32,598 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:32,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:32,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:32,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:32,599 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:32,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:32,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:32,602 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:32,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:32,602 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:32,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:32,602 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:32,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:32,602 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:32,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:32,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:32,608 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:32,608 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:32,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:32,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:32,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:32,695 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:32,695 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:32,695 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:32,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:32,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:32,696 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:32,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326 [2022-12-13 02:16:32,696 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 02:16:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash 870993616, now seen corresponding path program 1 times [2022-12-13 02:16:32,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:32,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726842797] [2022-12-13 02:16:32,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:32,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:32,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:16:32,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:32,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726842797] [2022-12-13 02:16:32,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726842797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:32,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:32,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432398571] [2022-12-13 02:16:32,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:32,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:32,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:32,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:32,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:32,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:32,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:32,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:32,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:32,814 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:32,814 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:32,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:32,815 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:32,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:32,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:32,816 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:32,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:32,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:32,818 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:32,818 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:32,818 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:32,819 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:32,819 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:32,819 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:32,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:32,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:32,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:32,825 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:32,825 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:32,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:32,825 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:32,825 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:32,911 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:32,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:32,912 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:32,912 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 02:16:32,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:32,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:32,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable327 [2022-12-13 02:16:32,912 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 02:16:32,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash 899622767, now seen corresponding path program 1 times [2022-12-13 02:16:32,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:32,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246494663] [2022-12-13 02:16:32,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:32,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:32,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:16:32,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:32,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246494663] [2022-12-13 02:16:32,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246494663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:32,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:32,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:32,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607173006] [2022-12-13 02:16:32,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:32,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:32,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:32,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:32,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:32,957 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:32,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:32,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:32,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:32,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:33,025 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:33,025 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:33,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:33,026 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:33,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:33,027 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:33,027 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:33,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:33,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:33,030 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,030 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:33,030 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:33,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:33,030 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:33,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:33,031 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:33,036 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:33,036 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:16:33,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:33,037 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:33,037 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:33,134 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:33,134 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:16:33,134 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:33,134 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 02:16:33,134 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:33,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:33,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328 [2022-12-13 02:16:33,135 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 02:16:33,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:33,135 INFO L85 PathProgramCache]: Analyzing trace with hash 928251918, now seen corresponding path program 1 times [2022-12-13 02:16:33,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:33,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365201083] [2022-12-13 02:16:33,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:33,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:33,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:16:33,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:33,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365201083] [2022-12-13 02:16:33,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365201083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:33,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:33,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:33,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101217976] [2022-12-13 02:16:33,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:33,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:33,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:33,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:33,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:33,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:33,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:33,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:33,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:33,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:33,257 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:33,258 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:16:33,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:33,259 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:33,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:33,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:33,260 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:33,260 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:33,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:33,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:33,262 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,262 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:33,263 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:33,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:33,263 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:33,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:33,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:33,269 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:33,269 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:33,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:33,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:33,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:33,356 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:33,357 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:33,357 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:33,357 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 02:16:33,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:33,357 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:33,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable329 [2022-12-13 02:16:33,357 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 02:16:33,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:33,358 INFO L85 PathProgramCache]: Analyzing trace with hash 956881069, now seen corresponding path program 1 times [2022-12-13 02:16:33,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:33,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488552807] [2022-12-13 02:16:33,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:33,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:33,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:16:33,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:33,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488552807] [2022-12-13 02:16:33,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488552807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:33,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:33,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038057829] [2022-12-13 02:16:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:33,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:33,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:33,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:33,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:33,413 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:33,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:33,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:33,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:33,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:33,489 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:33,489 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:33,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:33,490 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:33,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:33,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:33,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:33,491 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:33,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:33,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:33,494 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,494 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:33,494 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:33,494 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:33,494 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,494 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:33,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:33,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:33,500 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:33,500 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:33,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:33,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:33,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:33,588 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:33,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:33,588 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:33,588 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 02:16:33,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:33,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:33,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2022-12-13 02:16:33,589 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 02:16:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:33,589 INFO L85 PathProgramCache]: Analyzing trace with hash 985510220, now seen corresponding path program 1 times [2022-12-13 02:16:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:33,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199864183] [2022-12-13 02:16:33,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16: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:16:33,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:33,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199864183] [2022-12-13 02:16:33,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199864183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:33,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:33,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:33,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608686227] [2022-12-13 02:16:33,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:33,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:33,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:33,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:33,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:33,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:33,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:33,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:33,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:33,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:33,702 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:33,702 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:33,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:33,703 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:33,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:33,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:33,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:33,704 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:33,704 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:33,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:33,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:33,707 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:33,707 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:33,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:33,707 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,707 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:33,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:33,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:33,719 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:33,719 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:33,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:33,720 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:33,720 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:33,807 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:33,807 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:16:33,807 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:33,807 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 02:16:33,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:33,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:33,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2022-12-13 02:16:33,808 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 02:16:33,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:33,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1014139371, now seen corresponding path program 1 times [2022-12-13 02:16:33,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:33,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63557] [2022-12-13 02:16:33,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:33,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:33,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:16:33,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:33,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63557] [2022-12-13 02:16:33,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:33,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:33,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:33,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579992376] [2022-12-13 02:16:33,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:33,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:33,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:33,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:33,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:33,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:33,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:33,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:33,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:33,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:33,927 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:33,927 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:33,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:33,928 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:33,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:33,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:33,929 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:33,929 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:33,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:33,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:33,931 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,932 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:33,932 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:33,932 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:33,932 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:33,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:33,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:33,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:33,938 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:33,938 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:33,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:33,938 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:33,938 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:34,027 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:34,027 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:34,027 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:34,027 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 02:16:34,027 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:34,027 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:34,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2022-12-13 02:16:34,028 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 02:16:34,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1042768522, now seen corresponding path program 1 times [2022-12-13 02:16:34,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:34,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220593073] [2022-12-13 02:16:34,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:34,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:34,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:16:34,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:34,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220593073] [2022-12-13 02:16:34,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220593073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:34,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:34,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:34,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007041956] [2022-12-13 02:16:34,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:34,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:34,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:34,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:34,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:34,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:34,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:34,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:34,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:34,137 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:34,137 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:34,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:34,138 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:34,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:34,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:34,139 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:34,139 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:34,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:34,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:34,142 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:34,142 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:34,142 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:34,142 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:34,142 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:34,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:34,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:34,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:34,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:34,148 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:34,148 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:34,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:34,149 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:34,149 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:34,236 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:34,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:34,236 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:34,236 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 02:16:34,236 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:34,236 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:34,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2022-12-13 02:16:34,237 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 02:16:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1071397673, now seen corresponding path program 1 times [2022-12-13 02:16:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:34,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311142268] [2022-12-13 02:16:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:34,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:34,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:34,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311142268] [2022-12-13 02:16:34,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311142268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:34,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:34,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:34,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554077693] [2022-12-13 02:16:34,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:34,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:34,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:34,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:34,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:34,290 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:34,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:34,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:34,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:34,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:34,364 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:34,365 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:34,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:34,366 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:34,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:34,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:34,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:34,366 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:34,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:34,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:34,369 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:34,369 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:34,369 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:34,369 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:34,369 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:34,369 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:34,370 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:34,370 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:34,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:34,375 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:34,375 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:34,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:34,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:34,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:34,463 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:34,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:34,463 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:34,464 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 02:16:34,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:34,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:34,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2022-12-13 02:16:34,464 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 02:16:34,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:34,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1100026824, now seen corresponding path program 1 times [2022-12-13 02:16:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:34,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332824919] [2022-12-13 02:16:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:34,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:16:34,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:34,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332824919] [2022-12-13 02:16:34,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332824919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:34,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:34,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:34,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573350921] [2022-12-13 02:16:34,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:34,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:34,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:34,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:34,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:34,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:34,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:34,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:34,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:34,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:34,596 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:34,596 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:34,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:34,598 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:34,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:34,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:34,598 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:34,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:34,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:34,601 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:34,601 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:34,601 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:34,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:34,601 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:34,601 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:34,601 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:34,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:34,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:34,607 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:34,607 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:16:34,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:34,608 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:34,608 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:34,694 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:34,695 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:34,695 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:34,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:34,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:34,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:34,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable335 [2022-12-13 02:16:34,695 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 02:16:34,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1128655975, now seen corresponding path program 1 times [2022-12-13 02:16:34,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:34,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277202554] [2022-12-13 02:16:34,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:34,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:34,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 02:16:34,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:34,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277202554] [2022-12-13 02:16:34,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277202554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:34,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:34,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:34,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040948286] [2022-12-13 02:16:34,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:34,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:34,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:34,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:34,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:34,748 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:34,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:34,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:34,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:34,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:34,824 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:34,824 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:34,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:34,825 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:34,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:34,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:34,826 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:34,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:34,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:34,828 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:34,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:34,828 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:34,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:34,828 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:34,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:34,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:34,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:34,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:34,834 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:34,834 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:34,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:34,835 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:34,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:34,921 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:34,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:34,922 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:34,922 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 02:16:34,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:34,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:34,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336 [2022-12-13 02:16:34,922 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 02:16:34,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:34,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1157285126, now seen corresponding path program 1 times [2022-12-13 02:16:34,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:34,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824921025] [2022-12-13 02:16:34,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:34,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:34,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:16:34,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:35,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824921025] [2022-12-13 02:16:35,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824921025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:35,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:35,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:35,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440744468] [2022-12-13 02:16:35,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:35,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:35,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:35,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:35,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:35,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:35,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:35,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:35,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:35,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:35,094 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:35,095 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:35,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:35,096 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:35,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:35,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:35,097 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:35,097 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:35,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:35,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:35,100 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:35,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:35,101 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:35,101 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:35,101 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:35,101 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:35,101 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:35,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:35,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:35,109 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:35,109 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:16:35,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:35,110 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:35,110 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:35,211 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:35,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 02:16:35,212 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:35,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:35,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:35,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:35,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable337 [2022-12-13 02:16:35,212 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 02:16:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1185914277, now seen corresponding path program 1 times [2022-12-13 02:16:35,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:35,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875451351] [2022-12-13 02:16:35,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:35,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:35,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:16:35,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:35,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875451351] [2022-12-13 02:16:35,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875451351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:35,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:35,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:35,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207223959] [2022-12-13 02:16:35,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:35,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:35,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:35,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:35,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:35,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:35,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:35,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:35,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:35,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:35,360 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:35,360 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:35,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:35,362 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:35,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:35,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:35,363 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:35,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:35,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:35,367 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:35,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:35,367 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:35,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:35,367 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:35,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:35,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:35,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:35,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:35,375 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:35,376 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:35,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:35,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:35,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:35,478 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:35,478 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 02:16:35,478 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:35,479 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 02:16:35,479 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:35,479 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:35,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2022-12-13 02:16:35,479 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 02:16:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1214543428, now seen corresponding path program 1 times [2022-12-13 02:16:35,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:35,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469056993] [2022-12-13 02:16:35,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16: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:16:35,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:35,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469056993] [2022-12-13 02:16:35,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469056993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:35,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:35,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:35,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286688860] [2022-12-13 02:16:35,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:35,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:35,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:35,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:35,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:35,544 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:35,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:35,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:35,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:35,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:35,613 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:35,613 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:35,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:35,614 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:35,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:35,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:35,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:35,615 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:35,615 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:35,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:35,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:35,617 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:35,618 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:35,618 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:35,618 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:35,618 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:35,618 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:35,618 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:35,618 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:35,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:35,624 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:35,624 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:35,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:35,624 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:35,624 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:35,711 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:35,711 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:35,711 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:35,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:35,711 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:35,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:35,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable339 [2022-12-13 02:16:35,712 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 02:16:35,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:35,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1243172579, now seen corresponding path program 1 times [2022-12-13 02:16:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:35,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189918595] [2022-12-13 02:16:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:35,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:35,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:16:35,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:35,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189918595] [2022-12-13 02:16:35,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189918595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:35,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:35,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:35,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713269137] [2022-12-13 02:16:35,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:35,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:35,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:35,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:35,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:35,768 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:35,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:35,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:35,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:35,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:35,835 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:35,835 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:16:35,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:35,836 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:35,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:35,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:35,837 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:35,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:35,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:35,840 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:35,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:35,840 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:35,840 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:35,840 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:35,840 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:35,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:35,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:35,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:35,846 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:35,846 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:35,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:35,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:35,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:35,934 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:35,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:35,935 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:35,935 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 02:16:35,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:35,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:35,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2022-12-13 02:16:35,935 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 02:16:35,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:35,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1271801730, now seen corresponding path program 1 times [2022-12-13 02:16:35,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:35,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284086678] [2022-12-13 02:16:35,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:35,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:35,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:16:35,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:35,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284086678] [2022-12-13 02:16:35,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284086678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:35,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:35,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:35,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465054500] [2022-12-13 02:16:35,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:35,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:35,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:35,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:35,983 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:35,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:35,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:35,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:35,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:36,059 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:36,059 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:36,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:36,060 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:36,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:36,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:36,061 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:36,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:36,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:36,063 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,063 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:36,064 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:36,064 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:36,064 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:36,064 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:36,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:36,070 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:36,070 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:36,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:36,070 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:36,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:36,157 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:36,157 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:36,157 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:36,157 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 02:16:36,157 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:36,157 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:36,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341 [2022-12-13 02:16:36,157 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 02:16:36,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1300430881, now seen corresponding path program 1 times [2022-12-13 02:16:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:36,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239618347] [2022-12-13 02:16:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:36,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:36,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:16:36,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:36,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239618347] [2022-12-13 02:16:36,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239618347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:36,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:36,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:36,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162518063] [2022-12-13 02:16:36,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:36,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:36,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:36,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:36,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:36,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:36,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:36,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:36,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:36,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:36,273 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:36,273 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:36,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:36,275 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:36,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:36,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:36,275 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:36,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:36,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:36,278 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:36,278 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:36,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:36,278 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:36,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:36,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:36,284 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:36,284 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:36,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:36,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:36,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:36,373 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:36,373 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:36,373 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:36,373 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 02:16:36,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:36,374 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:36,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable342 [2022-12-13 02:16:36,374 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 02:16:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:36,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1329060032, now seen corresponding path program 1 times [2022-12-13 02:16:36,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:36,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247091518] [2022-12-13 02:16:36,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:36,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:36,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:16:36,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:36,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247091518] [2022-12-13 02:16:36,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247091518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:36,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:36,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:36,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394287099] [2022-12-13 02:16:36,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:36,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:36,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:36,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:36,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:36,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:36,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:36,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:36,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:36,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:36,486 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:36,486 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:36,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:36,487 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:36,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:36,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:36,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:36,488 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:36,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:36,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:36,491 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,491 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:36,491 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:36,491 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:36,491 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,491 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:36,491 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:36,491 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:36,497 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:36,497 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:36,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:36,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:36,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:36,585 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:36,585 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:36,586 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:36,586 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 02:16:36,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:36,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:36,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable343 [2022-12-13 02:16:36,586 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 02:16:36,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1357689183, now seen corresponding path program 1 times [2022-12-13 02:16:36,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:36,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588585076] [2022-12-13 02:16:36,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:36,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:16:36,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:36,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588585076] [2022-12-13 02:16:36,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588585076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:36,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:36,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:36,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429810995] [2022-12-13 02:16:36,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:36,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:36,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:36,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:36,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:36,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:36,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:36,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:36,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:36,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:36,708 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:36,708 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:36,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:36,717 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:36,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:36,718 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:36,718 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:36,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:36,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:36,721 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,721 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:36,721 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:36,721 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:36,721 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,721 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:36,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:36,722 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:36,727 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:36,727 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:36,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:36,728 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:36,728 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:36,815 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:36,816 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:36,816 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:36,816 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 02:16:36,816 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:36,816 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:36,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2022-12-13 02:16:36,816 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 02:16:36,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:36,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1386318334, now seen corresponding path program 1 times [2022-12-13 02:16:36,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:36,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188688436] [2022-12-13 02:16:36,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:36,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:36,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:16:36,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:36,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188688436] [2022-12-13 02:16:36,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188688436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:36,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:36,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890546966] [2022-12-13 02:16:36,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:36,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:36,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:36,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:36,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:36,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:36,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:36,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:36,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:36,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:36,947 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:36,947 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:36,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:36,948 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:36,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:36,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:36,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:36,949 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:36,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:36,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:36,951 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,951 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:36,951 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:36,951 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:36,952 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,952 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:36,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:36,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:36,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:36,957 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:36,958 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:36,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:36,958 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:36,958 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:37,046 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:37,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:37,046 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:37,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:37,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:37,046 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:37,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable345 [2022-12-13 02:16:37,047 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 02:16:37,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:37,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1414947485, now seen corresponding path program 1 times [2022-12-13 02:16:37,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:37,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481385058] [2022-12-13 02:16:37,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:37,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:37,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:16:37,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:37,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481385058] [2022-12-13 02:16:37,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481385058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:37,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:37,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:37,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387349882] [2022-12-13 02:16:37,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:37,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:37,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:37,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:37,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:37,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:37,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:37,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:37,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:37,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:37,164 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:37,164 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:37,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:37,166 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:37,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:37,166 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:37,166 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:37,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:37,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:37,169 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:37,169 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:37,169 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:37,169 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:37,169 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:37,170 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:37,170 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:37,170 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:37,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:37,176 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:37,176 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:37,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:37,177 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:37,177 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:37,265 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:37,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:16:37,266 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:37,266 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 02:16:37,266 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:37,266 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:37,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2022-12-13 02:16:37,266 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 02:16:37,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:37,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1443576636, now seen corresponding path program 1 times [2022-12-13 02:16:37,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:37,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238344362] [2022-12-13 02:16:37,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:37,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:37,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:16:37,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:37,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238344362] [2022-12-13 02:16:37,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238344362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:37,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:37,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:37,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001751189] [2022-12-13 02:16:37,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:37,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:37,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:37,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:37,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:37,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:37,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:37,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:37,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:37,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:37,383 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:37,383 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:37,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:37,384 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:37,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:37,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:37,385 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:37,385 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:37,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:37,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:37,387 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:37,387 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:37,387 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:37,388 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:37,388 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:37,388 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:37,388 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:37,388 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:37,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:37,393 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:37,394 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:37,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:37,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:37,394 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:37,482 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:37,483 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:37,483 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:37,483 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 02:16:37,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:37,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:37,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable347 [2022-12-13 02:16:37,483 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 02:16:37,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:37,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1472205787, now seen corresponding path program 1 times [2022-12-13 02:16:37,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:37,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901874658] [2022-12-13 02:16:37,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:37,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:37,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:16:37,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:37,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901874658] [2022-12-13 02:16:37,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901874658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:37,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:37,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:37,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090668618] [2022-12-13 02:16:37,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:37,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:37,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:37,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:37,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:37,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:37,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:37,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:37,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:37,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:37,604 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:37,605 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:37,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:37,606 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:37,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:37,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:37,606 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:37,606 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:37,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:37,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:37,609 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:37,609 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:37,609 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:37,609 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:37,609 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:37,610 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:37,610 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:37,610 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:37,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:37,615 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:37,615 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:37,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:37,616 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:37,616 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:37,710 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:37,711 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:16:37,711 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:37,711 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 02:16:37,711 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:37,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:37,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2022-12-13 02:16:37,711 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 02:16:37,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:37,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1500834938, now seen corresponding path program 1 times [2022-12-13 02:16:37,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:37,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718377660] [2022-12-13 02:16:37,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:37,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:37,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:16:37,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:37,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718377660] [2022-12-13 02:16:37,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718377660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:37,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:37,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:37,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968565630] [2022-12-13 02:16:37,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:37,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:37,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:37,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:37,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:37,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:37,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:37,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:37,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:37,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:37,833 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:37,834 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:37,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:37,835 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:37,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:37,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:37,835 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:37,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:37,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:37,838 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:37,838 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:37,838 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:37,839 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:37,839 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:37,839 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:37,839 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:37,839 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:37,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:37,845 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:37,845 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:37,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:37,845 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:37,845 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:37,931 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:37,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:37,932 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:37,932 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 02:16:37,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:37,932 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:37,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349 [2022-12-13 02:16:37,932 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 02:16:37,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:37,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1529464089, now seen corresponding path program 1 times [2022-12-13 02:16:37,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:37,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541868027] [2022-12-13 02:16:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:37,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:37,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:16:37,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:37,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541868027] [2022-12-13 02:16:37,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541868027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:37,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:37,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:37,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545207380] [2022-12-13 02:16:37,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:37,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:37,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:37,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:37,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:37,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:37,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:37,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:37,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:37,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:38,057 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:38,057 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:38,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1131 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:38,058 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:38,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:38,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:38,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:38,059 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:38,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:38,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:38,061 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,061 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:38,061 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:38,062 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:38,062 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,062 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:38,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:38,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:38,068 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:38,068 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:16:38,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:38,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:38,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:38,155 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:38,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:38,156 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:38,156 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 02:16:38,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:38,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:38,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2022-12-13 02:16:38,156 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 02:16:38,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:38,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1558093240, now seen corresponding path program 1 times [2022-12-13 02:16:38,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:38,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137811477] [2022-12-13 02:16:38,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:38,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:38,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:16:38,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:38,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137811477] [2022-12-13 02:16:38,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137811477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:38,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:38,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:38,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522274876] [2022-12-13 02:16:38,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:38,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:38,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:38,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:38,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:38,204 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:38,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:38,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:38,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:38,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:38,270 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:38,270 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:38,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:38,271 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:38,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:38,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:38,271 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:38,272 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:38,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:38,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:38,274 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,274 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:38,274 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:38,274 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:38,274 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,275 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:38,275 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:38,275 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:38,281 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:38,281 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:38,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:38,281 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:38,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:38,367 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:38,368 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:38,368 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:38,368 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 02:16:38,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:38,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:38,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351 [2022-12-13 02:16:38,368 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 02:16:38,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1586722391, now seen corresponding path program 1 times [2022-12-13 02:16:38,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:38,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130623283] [2022-12-13 02:16:38,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:38,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:38,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:16:38,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:38,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130623283] [2022-12-13 02:16:38,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130623283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:38,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:38,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:38,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070063225] [2022-12-13 02:16:38,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:38,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:38,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:38,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:38,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:38,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:38,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:38,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:38,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:38,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:38,491 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:38,491 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:38,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:38,492 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:38,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:38,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:38,493 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:38,493 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:38,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:38,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:38,495 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,496 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:38,496 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:38,496 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:38,496 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,496 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:38,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:38,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:38,502 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:38,502 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:38,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:38,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:38,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:38,588 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:38,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:16:38,588 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:38,588 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 02:16:38,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:38,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:38,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2022-12-13 02:16:38,588 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 02:16:38,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:38,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1615351542, now seen corresponding path program 1 times [2022-12-13 02:16:38,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:38,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195295448] [2022-12-13 02:16:38,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:38,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:38,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:16:38,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:38,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195295448] [2022-12-13 02:16:38,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195295448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:38,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:38,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:38,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959875983] [2022-12-13 02:16:38,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:38,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:38,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:38,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:38,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:38,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:38,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:38,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:38,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:38,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:38,734 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:38,734 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:38,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:38,735 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:38,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:38,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:38,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:38,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:38,736 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:38,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:38,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:38,739 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,739 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:38,739 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:38,739 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:38,739 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:38,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:38,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:38,745 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:38,745 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:38,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:38,746 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:38,746 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:38,833 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:38,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:38,833 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:38,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:38,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:38,833 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:38,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353 [2022-12-13 02:16:38,834 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 02:16:38,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:38,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1643980693, now seen corresponding path program 1 times [2022-12-13 02:16:38,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:38,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6697672] [2022-12-13 02:16:38,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:38,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:38,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:16:38,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:38,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6697672] [2022-12-13 02:16:38,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6697672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:38,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:38,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:38,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317225459] [2022-12-13 02:16:38,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:38,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:38,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:38,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:38,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:38,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:38,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:38,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:38,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:38,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:38,943 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:38,943 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:38,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:38,944 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:38,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:38,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:38,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:38,945 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:38,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:38,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:38,947 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:38,947 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:38,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:38,947 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,948 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:38,948 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:38,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:38,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:38,954 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:38,954 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:38,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:38,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:38,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:39,040 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:39,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:39,041 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:39,041 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 02:16:39,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:39,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:39,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable354 [2022-12-13 02:16:39,041 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 02:16:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:39,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1672609844, now seen corresponding path program 1 times [2022-12-13 02:16:39,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:39,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282884196] [2022-12-13 02:16:39,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:39,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:39,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:16:39,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:39,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282884196] [2022-12-13 02:16:39,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282884196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:39,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:39,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:39,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952953501] [2022-12-13 02:16:39,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:39,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:39,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:39,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:39,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:39,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:39,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:39,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:39,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:39,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:39,166 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:39,166 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:39,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:39,167 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:39,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:39,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:39,168 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:39,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:39,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:39,171 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:39,171 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:39,171 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:39,171 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:39,171 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:39,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:39,172 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:39,172 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:39,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:39,177 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:39,177 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:39,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:39,178 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:39,178 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:39,264 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:39,264 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:39,265 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:39,265 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 02:16:39,265 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:39,265 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:39,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable355 [2022-12-13 02:16:39,265 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 02:16:39,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1701238995, now seen corresponding path program 1 times [2022-12-13 02:16:39,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:39,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021744044] [2022-12-13 02:16:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:39,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:16:39,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:39,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021744044] [2022-12-13 02:16:39,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021744044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:39,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:39,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:39,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907626043] [2022-12-13 02:16:39,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:39,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:39,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:39,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:39,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:39,312 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:39,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:39,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:39,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:39,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:39,387 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:39,387 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:39,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:39,388 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:39,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:39,389 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:39,389 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:39,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:39,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:39,391 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:39,391 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:39,392 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:39,392 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:39,392 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:39,392 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:39,392 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:39,392 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:39,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:39,398 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:39,398 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:39,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:39,398 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:39,398 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:39,485 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:39,485 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:39,485 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:39,485 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 02:16:39,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:39,485 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:39,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2022-12-13 02:16:39,485 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 02:16:39,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1729868146, now seen corresponding path program 1 times [2022-12-13 02:16:39,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:39,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239403820] [2022-12-13 02:16:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:39,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:39,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:16:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:39,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239403820] [2022-12-13 02:16:39,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239403820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:39,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:39,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540269133] [2022-12-13 02:16:39,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:39,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:39,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:39,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:39,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:39,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:39,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:39,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:39,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:39,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:39,617 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:39,617 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:39,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:39,618 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:39,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:39,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:39,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:39,619 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:39,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:39,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:39,621 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:39,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:39,622 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:39,622 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:39,622 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:39,622 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:39,622 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:39,622 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:39,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:39,628 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:39,628 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:16:39,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:39,628 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:39,628 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:39,715 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:39,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:39,716 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:39,716 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 02:16:39,716 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:39,716 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:39,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357 [2022-12-13 02:16:39,716 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 02:16:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:39,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1758497297, now seen corresponding path program 1 times [2022-12-13 02:16:39,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:39,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754549306] [2022-12-13 02:16:39,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:39,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:39,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:16:39,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:39,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754549306] [2022-12-13 02:16:39,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754549306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:39,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:39,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:39,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527849451] [2022-12-13 02:16:39,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:39,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:39,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:39,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:39,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:39,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:39,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:39,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:39,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:39,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:39,838 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:39,838 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:39,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:39,839 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:39,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:39,840 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:39,840 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:39,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:39,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:39,843 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:39,843 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:39,843 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:39,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:39,843 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:39,843 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:39,843 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:39,843 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:39,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:39,849 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:39,849 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:39,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:39,850 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:39,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:39,937 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:39,937 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:39,937 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:39,937 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 02:16:39,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:39,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:39,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable358 [2022-12-13 02:16:39,938 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 02:16:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1787126448, now seen corresponding path program 1 times [2022-12-13 02:16:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:39,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627474624] [2022-12-13 02:16:39,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:39,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:39,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:16:39,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:39,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627474624] [2022-12-13 02:16:39,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627474624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:39,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:39,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498776398] [2022-12-13 02:16:39,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:39,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:39,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:39,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:39,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:39,983 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:39,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:39,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:39,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:39,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:40,058 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:40,058 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:40,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:40,059 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:40,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:40,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:40,060 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:40,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:40,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:40,062 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:40,062 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:40,062 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:40,062 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:40,062 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:40,063 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:40,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:40,063 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:40,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:40,068 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:40,068 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:40,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:40,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:40,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:40,156 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:40,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:40,156 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:40,157 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 02:16:40,157 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:40,157 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:40,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable359 [2022-12-13 02:16:40,157 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 02:16:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1815755599, now seen corresponding path program 1 times [2022-12-13 02:16:40,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:40,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562650946] [2022-12-13 02:16:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:40,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:40,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:16:40,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:40,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562650946] [2022-12-13 02:16:40,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562650946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:40,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:40,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:40,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874657492] [2022-12-13 02:16:40,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:40,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:40,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:40,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:40,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:40,204 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:40,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:40,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:40,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:40,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:40,270 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:40,270 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:40,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:40,271 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:40,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:40,271 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:40,272 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:40,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:40,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:40,274 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:40,274 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:40,274 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:40,274 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:40,274 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:40,275 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:40,275 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:40,275 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:40,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:40,280 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:40,281 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:40,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:40,281 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:40,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:40,369 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:40,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:40,370 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:40,370 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 02:16:40,370 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:40,370 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:40,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2022-12-13 02:16:40,370 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 02:16:40,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1844384750, now seen corresponding path program 1 times [2022-12-13 02:16:40,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:40,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219752324] [2022-12-13 02:16:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:40,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:40,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:16:40,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:40,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219752324] [2022-12-13 02:16:40,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219752324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:40,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:40,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:40,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422791921] [2022-12-13 02:16:40,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:40,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:40,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:40,418 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:40,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:40,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:40,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:40,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:40,494 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:40,495 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:40,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:40,496 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:40,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:40,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:40,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:40,497 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:40,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:40,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:40,499 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:40,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:40,500 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:40,500 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:40,500 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:40,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:40,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:40,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:40,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:40,506 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:40,506 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:40,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:40,506 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:40,507 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:40,628 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:40,628 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:16:40,628 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:40,628 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 02:16:40,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:40,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:40,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2022-12-13 02:16:40,628 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 02:16:40,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:40,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1873013901, now seen corresponding path program 1 times [2022-12-13 02:16:40,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:40,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673706944] [2022-12-13 02:16:40,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:40,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:40,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:16:40,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:40,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673706944] [2022-12-13 02:16:40,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673706944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:40,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:40,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:40,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104803212] [2022-12-13 02:16:40,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:40,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:40,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:40,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:40,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:40,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:40,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:40,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:40,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:40,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:40,753 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:40,753 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:16:40,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:40,754 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:40,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:40,754 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:40,755 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:40,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:40,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:40,757 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:40,757 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:40,757 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:40,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:40,757 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:40,758 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:40,758 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:40,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:40,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:40,763 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:40,764 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:40,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:40,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:40,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:40,850 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:40,851 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:40,851 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:40,851 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 02:16:40,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:40,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:40,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2022-12-13 02:16:40,851 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 02:16:40,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:40,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1901643052, now seen corresponding path program 1 times [2022-12-13 02:16:40,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:40,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718553074] [2022-12-13 02:16:40,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:40,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:40,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:16:40,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:40,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718553074] [2022-12-13 02:16:40,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718553074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:40,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:40,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:40,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208648687] [2022-12-13 02:16:40,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:40,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:40,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:40,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:40,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:40,925 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:40,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:40,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:40,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:40,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:41,022 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:41,022 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:41,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1125 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:41,024 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:41,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:41,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:41,024 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:41,024 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:41,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:41,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:41,028 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,028 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:41,029 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:41,029 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:41,029 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,029 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:41,029 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:41,029 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:41,037 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:41,037 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:41,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:41,038 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:41,038 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:41,126 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:41,126 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:16:41,126 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:41,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:41,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:41,127 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:41,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2022-12-13 02:16:41,127 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 02:16:41,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:41,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1930272203, now seen corresponding path program 1 times [2022-12-13 02:16:41,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:41,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210722067] [2022-12-13 02:16:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:41,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:41,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:16:41,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:41,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210722067] [2022-12-13 02:16:41,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210722067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:41,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:41,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:41,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449082634] [2022-12-13 02:16:41,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:41,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:41,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:41,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:41,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:41,171 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:41,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:41,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:41,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:41,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:41,238 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:41,238 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:41,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:41,239 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:41,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:41,240 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:41,240 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:41,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:41,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:41,243 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,243 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:41,243 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:41,243 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:41,243 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:41,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:41,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:41,249 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:41,249 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:41,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:41,250 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:41,250 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:41,338 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:41,339 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:41,339 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:41,339 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 02:16:41,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:41,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:41,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2022-12-13 02:16:41,339 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 02:16:41,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:41,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1958901354, now seen corresponding path program 1 times [2022-12-13 02:16:41,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:41,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786851421] [2022-12-13 02:16:41,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:41,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:16:41,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:41,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786851421] [2022-12-13 02:16:41,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786851421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:41,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:41,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:41,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835418940] [2022-12-13 02:16:41,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:41,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:41,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:41,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:41,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:41,387 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:41,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:41,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:41,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:41,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:41,472 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:41,473 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:41,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:41,474 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:41,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:41,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:41,474 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:41,474 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:41,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:41,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:41,477 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,477 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:41,477 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:41,477 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:41,477 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,478 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:41,478 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:41,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:41,485 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:41,485 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:41,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:41,485 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:41,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:41,573 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:41,573 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:41,573 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:41,573 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 02:16:41,573 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:41,573 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:41,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable365 [2022-12-13 02:16:41,574 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 02:16:41,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:41,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1987530505, now seen corresponding path program 1 times [2022-12-13 02:16:41,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:41,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268703663] [2022-12-13 02:16:41,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:41,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:41,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:16:41,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:41,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268703663] [2022-12-13 02:16:41,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268703663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:41,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:41,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:41,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050239788] [2022-12-13 02:16:41,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:41,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:41,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:41,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:41,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:41,644 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:41,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:41,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:41,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:41,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:41,726 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:41,727 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:41,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:41,728 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:41,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:41,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:41,728 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:41,728 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:41,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:41,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:41,731 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,731 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:41,731 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:41,731 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:41,731 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:41,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:41,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:41,737 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:41,737 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:41,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:41,738 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:41,738 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:41,827 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:41,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:41,827 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:41,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:41,827 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:41,828 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:41,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable366 [2022-12-13 02:16:41,828 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 02:16:41,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:41,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2016159656, now seen corresponding path program 1 times [2022-12-13 02:16:41,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:41,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118267907] [2022-12-13 02:16:41,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:41,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:41,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 02:16:41,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:41,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118267907] [2022-12-13 02:16:41,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118267907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:41,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:41,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:41,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869136765] [2022-12-13 02:16:41,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:41,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:41,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:41,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:41,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:41,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:41,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:41,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:41,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:41,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:41,951 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:41,951 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:41,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:41,952 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:41,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:41,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:41,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:41,953 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:41,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:41,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:41,956 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,956 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:41,956 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:41,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:41,956 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,956 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:41,956 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:41,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:41,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:41,962 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:41,962 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:16:41,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:41,963 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:41,963 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:42,050 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:42,051 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:42,051 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:42,051 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 02:16:42,051 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:42,051 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:42,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable367 [2022-12-13 02:16:42,051 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 02:16:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2044788807, now seen corresponding path program 1 times [2022-12-13 02:16:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:42,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245837272] [2022-12-13 02:16:42,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:42,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:42,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:16:42,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:42,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245837272] [2022-12-13 02:16:42,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245837272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:42,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:42,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:42,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947910503] [2022-12-13 02:16:42,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:42,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:42,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:42,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:42,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:42,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:42,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:42,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:42,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:42,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:42,164 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:42,164 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:42,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:42,165 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:42,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:42,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:42,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:42,165 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:42,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:42,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:42,168 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:42,168 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:42,168 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:42,169 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:42,169 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:42,169 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:42,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:42,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:42,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:42,175 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:42,175 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:42,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:42,175 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:42,175 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:42,264 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:42,264 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:42,264 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:42,264 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 02:16:42,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:42,264 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:42,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2022-12-13 02:16:42,264 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 02:16:42,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:42,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2073417958, now seen corresponding path program 1 times [2022-12-13 02:16:42,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:42,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709179489] [2022-12-13 02:16:42,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:42,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16: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:16:42,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:42,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709179489] [2022-12-13 02:16:42,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709179489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:42,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:42,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737448315] [2022-12-13 02:16:42,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:42,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:42,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:42,313 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:42,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:42,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:42,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:42,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:42,389 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:42,389 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:42,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:42,390 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:42,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:42,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:42,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:42,391 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:42,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:42,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:42,394 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:42,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:42,394 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:42,394 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:42,394 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:42,394 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:42,394 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:42,394 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:42,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:42,400 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:42,400 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:42,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:42,401 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:42,401 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:42,487 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:42,488 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:42,488 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:42,488 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 02:16:42,488 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:42,488 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:42,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable369 [2022-12-13 02:16:42,488 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 02:16:42,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2102047109, now seen corresponding path program 1 times [2022-12-13 02:16:42,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:42,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24198188] [2022-12-13 02:16:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:42,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:42,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:16:42,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:42,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24198188] [2022-12-13 02:16:42,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24198188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:42,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:42,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:42,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588718729] [2022-12-13 02:16:42,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:42,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:42,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:42,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:42,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:42,532 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:42,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:42,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:42,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:42,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:42,615 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:42,615 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:42,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:42,617 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:42,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:42,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:42,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:42,617 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:42,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:42,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:42,620 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:42,620 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:42,620 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:42,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:42,620 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:42,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:42,620 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:42,621 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:42,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:42,626 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:42,626 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:42,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:42,627 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:42,627 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:42,713 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:42,714 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:42,714 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:42,714 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 02:16:42,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:42,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:42,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370 [2022-12-13 02:16:42,714 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 02:16:42,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:42,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2130676260, now seen corresponding path program 1 times [2022-12-13 02:16:42,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:42,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152440655] [2022-12-13 02:16:42,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:42,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:42,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:16:42,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:42,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152440655] [2022-12-13 02:16:42,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152440655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:42,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:42,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:42,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407810447] [2022-12-13 02:16:42,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:42,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:42,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:42,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:42,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:42,761 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:42,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:42,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:42,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:42,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:42,828 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:42,828 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:16:42,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:42,830 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:42,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:42,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:42,830 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:42,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:42,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:42,833 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:42,833 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:42,833 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:42,833 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:42,833 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:42,833 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:42,833 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:42,834 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:42,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:42,839 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:42,839 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:42,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:42,840 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:42,840 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:42,943 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:42,943 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 02:16:42,943 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:42,944 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 02:16:42,944 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:42,944 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:42,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371 [2022-12-13 02:16:42,944 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 02:16:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2135661885, now seen corresponding path program 1 times [2022-12-13 02:16:42,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:42,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766592224] [2022-12-13 02:16:42,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:42,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:42,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:16:42,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:42,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766592224] [2022-12-13 02:16:42,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766592224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:42,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:42,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:42,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895501978] [2022-12-13 02:16:42,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:42,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:42,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:42,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:42,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:42,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:42,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:42,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:42,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:42,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:43,063 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:43,063 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:43,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:43,064 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:43,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:43,065 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:43,065 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:43,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:43,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:43,068 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,068 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:43,068 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:43,068 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:43,068 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:43,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:43,069 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:43,074 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:43,074 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:43,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:43,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:43,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:43,161 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:43,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:43,162 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:43,162 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 02:16:43,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:43,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:43,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable372 [2022-12-13 02:16:43,162 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 02:16:43,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:43,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2107032734, now seen corresponding path program 1 times [2022-12-13 02:16:43,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:43,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308421490] [2022-12-13 02:16:43,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:43,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:43,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:16:43,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:43,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308421490] [2022-12-13 02:16:43,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308421490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:43,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:43,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:43,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163172747] [2022-12-13 02:16:43,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:43,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:43,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:43,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:43,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:43,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:43,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:43,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:43,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:43,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:43,276 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:43,277 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:43,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:43,278 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:43,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:43,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:43,278 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:43,278 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:43,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:43,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:43,281 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:43,281 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:43,281 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:43,281 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:43,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:43,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:43,287 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:43,287 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:43,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:43,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:43,288 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:43,374 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:43,374 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:43,374 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:43,374 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 02:16:43,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:43,374 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:43,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373 [2022-12-13 02:16:43,375 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 02:16:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2078403583, now seen corresponding path program 1 times [2022-12-13 02:16:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:43,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134688480] [2022-12-13 02:16:43,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:43,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:43,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:43,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134688480] [2022-12-13 02:16:43,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134688480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:43,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:43,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:43,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363047350] [2022-12-13 02:16:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:43,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:43,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:43,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:43,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:43,437 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:43,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:43,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:43,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:43,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:43,507 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:43,507 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:43,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:43,508 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:43,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:43,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:43,509 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:43,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:43,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:43,520 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:43,521 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:43,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:43,521 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,521 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:43,521 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:43,521 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:43,527 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:43,527 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:43,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:43,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:43,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:43,615 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:43,616 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:43,616 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:43,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:43,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:43,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:43,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable374 [2022-12-13 02:16:43,616 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 02:16:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2049774432, now seen corresponding path program 1 times [2022-12-13 02:16:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:43,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704977147] [2022-12-13 02:16:43,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:43,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:16:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:43,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704977147] [2022-12-13 02:16:43,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704977147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:43,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:43,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468495582] [2022-12-13 02:16:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:43,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:43,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:43,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:43,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:43,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:43,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:43,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:43,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:43,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:43,740 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:43,740 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:43,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:43,741 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:43,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:43,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:43,742 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:43,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:43,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:43,744 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,744 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:43,745 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:43,745 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:43,745 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,745 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:43,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:43,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:43,751 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:43,751 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:16:43,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:43,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:43,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:43,838 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:43,839 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:43,839 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:43,839 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 02:16:43,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:43,839 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:43,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable375 [2022-12-13 02:16:43,839 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 02:16:43,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:43,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2021145281, now seen corresponding path program 1 times [2022-12-13 02:16:43,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:43,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453716997] [2022-12-13 02:16:43,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:43,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:43,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:16:43,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:43,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453716997] [2022-12-13 02:16:43,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453716997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:43,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:43,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719742625] [2022-12-13 02:16:43,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:43,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:43,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:43,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:43,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:43,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:43,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:43,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:43,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:43,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:43,959 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:43,959 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:43,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:43,960 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:43,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:43,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:43,961 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:43,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:43,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:43,963 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,963 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:43,964 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:43,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:43,964 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:43,964 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:43,964 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:43,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:43,970 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:43,970 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:43,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:43,970 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:43,970 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:44,058 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:44,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:44,058 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:44,059 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 02:16:44,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:44,059 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:44,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable376 [2022-12-13 02:16:44,059 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 02:16:44,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:44,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1992516130, now seen corresponding path program 1 times [2022-12-13 02:16:44,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:44,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193382188] [2022-12-13 02:16:44,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:44,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:44,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:16:44,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:44,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193382188] [2022-12-13 02:16:44,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193382188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:44,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:44,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:44,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594109463] [2022-12-13 02:16:44,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:44,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:44,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:44,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:44,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:44,104 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:44,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:44,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:44,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:44,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:44,168 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:44,169 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:44,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:44,170 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:44,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:44,170 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:44,170 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:44,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:44,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:44,173 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:44,173 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:44,173 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:44,173 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:44,173 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:44,173 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:44,173 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:44,174 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:44,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:44,179 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:44,179 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:44,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:44,180 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:44,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:44,266 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:44,267 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:44,267 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:44,267 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 02:16:44,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:44,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:44,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377 [2022-12-13 02:16:44,267 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 02:16:44,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:44,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1963886979, now seen corresponding path program 1 times [2022-12-13 02:16:44,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:44,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456716515] [2022-12-13 02:16:44,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:44,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:44,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:16:44,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:44,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456716515] [2022-12-13 02:16:44,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456716515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:44,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:44,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:44,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815415847] [2022-12-13 02:16:44,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:44,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:44,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:44,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:44,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:44,312 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:44,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:44,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:44,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:44,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:44,389 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:44,389 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:44,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:44,390 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:44,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:44,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:44,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:44,391 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:44,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:44,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:44,393 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:44,393 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:44,393 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:44,394 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:44,394 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:44,394 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:44,394 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:44,394 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:44,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:44,400 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:44,400 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:44,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:44,400 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:44,400 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:44,513 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:44,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:16:44,514 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:44,514 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 02:16:44,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:44,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:44,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable378 [2022-12-13 02:16:44,514 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 02:16:44,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:44,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1935257828, now seen corresponding path program 1 times [2022-12-13 02:16:44,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:44,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116041412] [2022-12-13 02:16:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:44,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:16:44,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:44,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116041412] [2022-12-13 02:16:44,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116041412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:44,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:44,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:44,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859411997] [2022-12-13 02:16:44,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:44,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:44,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:44,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:44,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:44,620 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:44,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:44,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:44,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:44,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:44,722 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:44,722 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:44,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:44,724 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:44,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:44,724 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:44,724 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:44,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:44,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:44,728 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:44,728 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:44,728 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:44,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:44,728 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:44,729 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:44,729 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:44,729 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:44,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:44,737 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:44,737 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:16:44,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:44,738 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:44,738 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:44,836 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:44,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:16:44,836 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:44,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:44,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:44,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:44,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable379 [2022-12-13 02:16:44,837 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 02:16:44,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:44,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1906628677, now seen corresponding path program 1 times [2022-12-13 02:16:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:44,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362073947] [2022-12-13 02:16:44,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:44,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:16:44,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:44,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362073947] [2022-12-13 02:16:44,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362073947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:44,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:44,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:44,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842932443] [2022-12-13 02:16:44,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:44,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:44,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:44,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:44,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:44,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:44,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:44,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:44,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:44,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:44,949 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:44,949 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:44,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:44,950 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:44,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:44,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:44,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:44,951 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:44,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:44,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:44,954 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:44,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:44,954 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:44,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:44,954 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:44,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:44,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:44,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:44,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:44,960 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:44,960 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:44,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:44,961 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:44,961 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:45,047 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:45,047 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:45,047 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:45,047 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 02:16:45,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:45,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:45,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380 [2022-12-13 02:16:45,048 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 02:16:45,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:45,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1877999526, now seen corresponding path program 1 times [2022-12-13 02:16:45,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:45,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898429195] [2022-12-13 02:16:45,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:45,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16: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:16:45,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:45,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898429195] [2022-12-13 02:16:45,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898429195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:45,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:45,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:45,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624391347] [2022-12-13 02:16:45,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:45,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:45,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:45,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:45,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:45,099 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:45,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:45,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:45,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:45,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:45,163 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:45,164 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:45,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:45,165 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:45,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:45,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:45,165 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:45,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:45,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:45,168 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:45,168 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:45,168 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:45,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:45,168 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:45,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:45,168 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:45,168 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:45,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:45,174 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:45,175 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:45,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:45,175 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:45,175 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:45,262 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:45,262 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:45,263 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:45,263 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 02:16:45,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:45,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:45,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381 [2022-12-13 02:16:45,263 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 02:16:45,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1849370375, now seen corresponding path program 1 times [2022-12-13 02:16:45,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:45,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300031218] [2022-12-13 02:16:45,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:45,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:45,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:16:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:45,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300031218] [2022-12-13 02:16:45,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300031218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:45,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:45,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:45,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061819840] [2022-12-13 02:16:45,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:45,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:45,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:45,315 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:45,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:45,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:45,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:45,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:45,380 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:45,380 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:45,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:45,381 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:45,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:45,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:45,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:45,381 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:45,381 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:45,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:45,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:45,384 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:45,384 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:45,384 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:45,384 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:45,384 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:45,385 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:45,385 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:45,385 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:45,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:45,391 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:45,391 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:45,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:45,392 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:45,392 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:45,480 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:45,480 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:45,480 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:45,480 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 02:16:45,480 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:45,481 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:45,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382 [2022-12-13 02:16:45,481 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 02:16:45,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:45,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1820741224, now seen corresponding path program 1 times [2022-12-13 02:16:45,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:45,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861169566] [2022-12-13 02:16:45,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:45,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:45,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 02:16:45,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:45,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861169566] [2022-12-13 02:16:45,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861169566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:45,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:45,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:45,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930449169] [2022-12-13 02:16:45,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:45,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:45,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:45,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:45,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:45,550 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:45,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:45,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:45,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:45,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:45,617 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:45,618 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:45,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:45,619 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:45,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:45,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:45,620 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:45,620 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:45,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:45,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:45,623 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:45,624 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:45,624 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:45,624 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:45,624 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:45,624 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:45,624 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:45,625 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:45,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:45,630 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:45,631 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:45,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:45,631 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:45,631 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:45,718 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:45,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:45,719 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:45,719 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 02:16:45,719 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:45,719 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:45,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable383 [2022-12-13 02:16:45,719 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 02:16:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:45,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1792112073, now seen corresponding path program 1 times [2022-12-13 02:16:45,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:45,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691256416] [2022-12-13 02:16:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:45,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:45,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 02:16:45,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:45,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691256416] [2022-12-13 02:16:45,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691256416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:45,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:45,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:45,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956849127] [2022-12-13 02:16:45,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:45,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:45,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:45,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:45,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:45,767 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:45,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:45,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:45,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:45,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:45,843 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:45,843 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:45,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:45,844 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:45,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:45,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:45,845 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:45,845 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:45,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:45,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:45,848 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:45,848 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:45,848 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:45,848 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:45,849 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:45,849 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:45,849 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:45,849 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:45,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:45,855 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:45,855 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:45,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:45,855 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:45,855 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:45,945 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:45,946 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:16:45,946 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:45,946 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 02:16:45,946 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:45,946 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:45,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable384 [2022-12-13 02:16:45,946 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 02:16:45,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:45,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1763482922, now seen corresponding path program 1 times [2022-12-13 02:16:45,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:45,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795515898] [2022-12-13 02:16:45,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:45,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:46,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:46,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795515898] [2022-12-13 02:16:46,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795515898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:46,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:46,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313727704] [2022-12-13 02:16:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:46,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:46,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:46,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:46,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:46,008 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:46,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:46,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:46,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:46,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:46,086 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:46,086 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:46,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:46,087 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:46,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:46,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:46,088 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:46,088 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:46,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:46,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:46,091 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:46,091 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:46,091 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:46,091 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:46,091 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:46,091 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:46,091 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:46,091 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:46,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:46,098 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:46,098 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:46,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:46,099 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:46,099 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:46,186 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:46,186 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:46,187 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:46,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:46,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:46,187 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:46,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385 [2022-12-13 02:16:46,187 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 02:16:46,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:46,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1734853771, now seen corresponding path program 1 times [2022-12-13 02:16:46,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:46,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391807717] [2022-12-13 02:16:46,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:46,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:46,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:16:46,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:46,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391807717] [2022-12-13 02:16:46,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391807717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:46,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:46,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:46,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074826502] [2022-12-13 02:16:46,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:46,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:46,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:46,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:46,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:46,242 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:46,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:46,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:46,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:46,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:46,309 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:46,309 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:46,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:46,310 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:46,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:46,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:46,311 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:46,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:46,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:46,313 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:46,313 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:46,313 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:46,314 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:46,314 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:46,314 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:46,314 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:46,314 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:46,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:46,319 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:46,320 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:46,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:46,320 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:46,320 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:46,408 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:46,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:46,408 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:46,409 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 02:16:46,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:46,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:46,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable386 [2022-12-13 02:16:46,409 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 02:16:46,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:46,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1706224620, now seen corresponding path program 1 times [2022-12-13 02:16:46,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:46,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597593793] [2022-12-13 02:16:46,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:46,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:16:46,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:46,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597593793] [2022-12-13 02:16:46,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597593793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:46,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:46,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:46,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450425721] [2022-12-13 02:16:46,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:46,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:46,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:46,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:46,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:46,486 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:46,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:46,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:46,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:46,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:46,582 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:46,582 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:16:46,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:46,583 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:46,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:46,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:46,584 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:46,584 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:46,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:46,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:46,586 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:46,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:46,587 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:46,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:46,587 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:46,587 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:46,587 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:46,587 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:46,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:46,593 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:46,593 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:46,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:46,593 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:46,593 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:46,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:46,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:46,682 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:46,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:46,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:46,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:46,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable387 [2022-12-13 02:16:46,682 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 02:16:46,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:46,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1677595469, now seen corresponding path program 1 times [2022-12-13 02:16:46,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:46,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270398681] [2022-12-13 02:16:46,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:46,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:46,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:16:46,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:46,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270398681] [2022-12-13 02:16:46,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270398681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:46,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:46,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:46,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360896979] [2022-12-13 02:16:46,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:46,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:46,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:46,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:46,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:46,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:46,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:46,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:46,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:46,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:46,824 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:46,824 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:46,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:46,825 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:46,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:46,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:46,826 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:46,826 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:46,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:46,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:46,829 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:46,829 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:46,829 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:46,829 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:46,829 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:46,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:46,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:46,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:46,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:46,835 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:46,835 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:16:46,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:46,836 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:46,836 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:46,929 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:46,929 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:16:46,929 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:46,929 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 02:16:46,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:46,930 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:46,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable388 [2022-12-13 02:16:46,930 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 02:16:46,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1648966318, now seen corresponding path program 1 times [2022-12-13 02:16:46,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:46,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148944614] [2022-12-13 02:16:46,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:46,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:16:46,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:46,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148944614] [2022-12-13 02:16:46,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148944614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:46,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:46,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:46,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048199160] [2022-12-13 02:16:46,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:46,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:46,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:46,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:46,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:46,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:46,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:46,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:46,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:46,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:47,057 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:47,057 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:16:47,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:47,058 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:47,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:47,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:47,059 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:47,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:47,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:47,061 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,061 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:47,062 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:47,062 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:47,062 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,062 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:47,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:47,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:47,068 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:47,068 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:47,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:47,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:47,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:47,155 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:47,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:47,155 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:47,155 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 02:16:47,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:47,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:47,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable389 [2022-12-13 02:16:47,156 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 02:16:47,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1620337167, now seen corresponding path program 1 times [2022-12-13 02:16:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:47,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684325869] [2022-12-13 02:16:47,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:47,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:16:47,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:47,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684325869] [2022-12-13 02:16:47,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684325869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:47,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:47,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955125706] [2022-12-13 02:16:47,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:47,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:47,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:47,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:47,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:47,203 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:47,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:47,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:47,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:47,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:47,278 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:47,279 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:47,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:47,280 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:47,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:47,280 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:47,280 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:47,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:47,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:47,283 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,283 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:47,283 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:47,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:47,283 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,283 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:47,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:47,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:47,289 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:47,289 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:47,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:47,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:47,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:47,376 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:47,377 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:47,377 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:47,377 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 02:16:47,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:47,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:47,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390 [2022-12-13 02:16:47,377 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 02:16:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:47,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1591708016, now seen corresponding path program 1 times [2022-12-13 02:16:47,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:47,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145709025] [2022-12-13 02:16:47,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:47,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:47,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:16:47,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:47,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145709025] [2022-12-13 02:16:47,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145709025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:47,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:47,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:47,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786034713] [2022-12-13 02:16:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:47,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:47,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:47,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:47,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:47,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:47,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:47,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:47,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:47,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:47,503 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:47,504 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:16:47,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:47,505 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:47,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:47,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:47,506 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:47,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:47,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:47,508 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,508 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:47,508 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:47,508 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:47,508 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,509 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:47,509 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:47,509 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:47,514 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:47,514 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:47,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:47,515 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:47,515 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:47,609 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:47,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:16:47,610 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:47,610 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 02:16:47,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:47,610 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:47,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable391 [2022-12-13 02:16:47,610 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 02:16:47,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1563078865, now seen corresponding path program 1 times [2022-12-13 02:16:47,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:47,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613212295] [2022-12-13 02:16:47,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:47,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:47,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:16:47,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:47,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613212295] [2022-12-13 02:16:47,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613212295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:47,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:47,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:47,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194738214] [2022-12-13 02:16:47,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:47,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:47,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:47,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:47,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:47,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:47,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:47,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:47,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:47,738 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:47,738 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:47,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:47,739 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:47,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:47,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:47,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:47,740 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:47,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:47,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:47,742 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:47,742 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:47,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:47,743 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:47,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:47,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:47,749 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:47,749 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:47,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:47,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:47,749 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:47,836 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:47,837 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:47,837 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:47,837 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 02:16:47,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:47,837 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:47,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable392 [2022-12-13 02:16:47,837 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 02:16:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:47,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1534449714, now seen corresponding path program 1 times [2022-12-13 02:16:47,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:47,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265044830] [2022-12-13 02:16:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:47,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:47,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:16:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:47,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265044830] [2022-12-13 02:16:47,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265044830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:47,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:47,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:47,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789139688] [2022-12-13 02:16:47,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:47,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:47,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:47,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:47,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:47,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:47,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:47,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:47,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:47,960 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:47,960 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:47,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:47,961 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:47,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:47,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:47,962 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:47,962 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:47,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:47,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:47,964 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,964 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:47,964 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:47,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:47,965 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,965 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:47,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:47,965 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:47,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:47,970 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:47,970 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:47,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:47,971 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:47,971 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:48,058 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:48,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:48,058 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:48,059 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 02:16:48,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:48,059 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:48,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393 [2022-12-13 02:16:48,059 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 02:16:48,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:48,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1505820563, now seen corresponding path program 1 times [2022-12-13 02:16:48,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:48,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187748160] [2022-12-13 02:16:48,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:48,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:48,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:16:48,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:48,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187748160] [2022-12-13 02:16:48,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187748160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:48,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:48,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:48,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557366622] [2022-12-13 02:16:48,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:48,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:48,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:48,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:48,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:48,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:48,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:48,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:48,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:48,183 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:48,183 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:48,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:48,184 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:48,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:48,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:48,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:48,185 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:48,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:48,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:48,187 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:48,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:48,188 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:48,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:48,188 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:48,188 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:48,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:48,188 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:48,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:48,194 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:48,194 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:16:48,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:48,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:48,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:48,281 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:48,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:48,281 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:48,281 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 02:16:48,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:48,281 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:48,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable394 [2022-12-13 02:16:48,282 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 02:16:48,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:48,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1477191412, now seen corresponding path program 1 times [2022-12-13 02:16:48,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:48,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616674153] [2022-12-13 02:16:48,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:48,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:48,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:16:48,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:48,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616674153] [2022-12-13 02:16:48,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616674153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:48,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:48,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:48,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006619274] [2022-12-13 02:16:48,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:48,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:48,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:48,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:48,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:48,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:48,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:48,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:48,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:48,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:48,402 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:48,402 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:48,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:48,403 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:48,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:48,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:48,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:48,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:48,404 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:48,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:48,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:48,407 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:48,407 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:48,407 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:48,407 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:48,407 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:48,407 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:48,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:48,407 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:48,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:48,413 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:48,413 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:16:48,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:48,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:48,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:48,500 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:48,500 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:48,500 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:48,501 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 02:16:48,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:48,501 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:48,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2022-12-13 02:16:48,501 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 02:16:48,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1448562261, now seen corresponding path program 1 times [2022-12-13 02:16:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:48,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210735931] [2022-12-13 02:16:48,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:48,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:48,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:16:48,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:48,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210735931] [2022-12-13 02:16:48,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210735931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:48,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:48,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:48,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79783461] [2022-12-13 02:16:48,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:48,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:48,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:48,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:48,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:48,554 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:48,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:48,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:48,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:48,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:48,620 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:48,620 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:48,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:48,621 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:48,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:48,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:48,621 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:48,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:48,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:48,624 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:48,624 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:48,624 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:48,624 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:48,624 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:48,624 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:48,625 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:48,625 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:48,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:48,630 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:48,630 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:48,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:48,631 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:48,631 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:48,718 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:48,718 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:48,718 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:48,718 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 02:16:48,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:48,719 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:48,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396 [2022-12-13 02:16:48,719 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 02:16:48,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:48,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1419933110, now seen corresponding path program 1 times [2022-12-13 02:16:48,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:48,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072445482] [2022-12-13 02:16:48,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:48,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:48,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:16:48,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:48,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072445482] [2022-12-13 02:16:48,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072445482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:48,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:48,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751647183] [2022-12-13 02:16:48,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:48,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:48,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:48,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:48,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:48,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:48,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:48,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:48,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:48,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:48,839 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:48,839 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:48,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:48,840 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:48,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:48,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:48,841 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:48,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:48,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:48,844 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:48,844 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:48,844 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:48,844 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:48,844 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:48,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:48,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:48,845 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:48,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:48,850 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:48,850 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:48,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:48,851 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:48,851 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:48,937 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:48,937 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:48,937 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:48,937 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 02:16:48,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:48,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:48,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable397 [2022-12-13 02:16:48,937 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 02:16:48,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1391303959, now seen corresponding path program 1 times [2022-12-13 02:16:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:48,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062109826] [2022-12-13 02:16:48,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:48,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:48,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:16:48,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:48,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062109826] [2022-12-13 02:16:48,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062109826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:48,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:48,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:48,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602765075] [2022-12-13 02:16:48,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:48,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:48,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:48,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:48,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:48,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:48,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:48,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:48,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:48,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:49,063 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:49,063 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:49,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:49,064 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:49,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:49,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:49,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:49,065 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:49,065 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:49,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:49,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:49,067 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,068 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:49,068 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:49,068 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:49,068 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:49,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:49,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:49,074 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:49,074 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:49,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:49,074 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:49,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:49,159 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:49,159 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:16:49,159 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:49,160 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 02:16:49,160 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:49,160 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:49,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2022-12-13 02:16:49,160 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 02:16:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:49,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1362674808, now seen corresponding path program 1 times [2022-12-13 02:16:49,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:49,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462737832] [2022-12-13 02:16:49,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:49,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:49,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:16:49,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:49,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462737832] [2022-12-13 02:16:49,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462737832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:49,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:49,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:49,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860644164] [2022-12-13 02:16:49,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:49,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:49,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:49,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:49,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:49,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:49,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:49,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:49,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:49,279 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:49,280 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:49,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:49,281 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:49,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:49,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:49,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:49,281 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:49,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:49,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:49,284 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,284 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:49,284 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:49,284 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:49,284 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:49,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:49,285 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:49,290 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:49,290 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:49,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:49,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:49,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:49,375 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:49,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:16:49,375 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:49,375 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 02:16:49,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:49,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:49,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable399 [2022-12-13 02:16:49,376 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 02:16:49,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:49,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1334045657, now seen corresponding path program 1 times [2022-12-13 02:16:49,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:49,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538845120] [2022-12-13 02:16:49,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:49,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:49,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:16:49,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:49,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538845120] [2022-12-13 02:16:49,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538845120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:49,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:49,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:49,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182975800] [2022-12-13 02:16:49,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:49,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:49,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:49,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:49,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:49,423 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:49,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:49,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:49,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:49,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:49,496 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:49,496 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:49,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:49,497 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:49,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:49,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:49,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:49,498 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:49,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:49,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:49,500 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,500 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:49,501 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:49,501 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:49,501 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,501 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:49,501 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:49,501 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:49,507 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:49,507 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:49,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:49,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:49,507 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:49,593 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:49,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:49,594 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:49,594 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 02:16:49,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:49,594 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:49,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable400 [2022-12-13 02:16:49,594 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 02:16:49,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1305416506, now seen corresponding path program 1 times [2022-12-13 02:16:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:49,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973938302] [2022-12-13 02:16:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:49,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 02:16:49,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:49,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973938302] [2022-12-13 02:16:49,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973938302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:49,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:49,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:49,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140970146] [2022-12-13 02:16:49,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:49,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:49,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:49,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:49,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:49,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:49,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:49,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:49,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:49,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:49,706 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:49,707 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:49,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:49,708 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:49,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:49,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:49,708 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:49,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:49,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:49,711 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:49,711 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:49,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:49,711 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:49,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:49,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:49,717 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:49,717 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:49,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:49,718 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:49,718 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:49,805 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:49,805 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:49,805 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:49,805 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 02:16:49,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:49,805 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:49,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2022-12-13 02:16:49,806 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 02:16:49,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:49,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1276787355, now seen corresponding path program 1 times [2022-12-13 02:16:49,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:49,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314798825] [2022-12-13 02:16:49,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:49,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:49,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:16:49,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:49,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314798825] [2022-12-13 02:16:49,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314798825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:49,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:49,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:49,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022490619] [2022-12-13 02:16:49,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:49,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:49,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:49,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:49,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:49,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:49,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:49,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:49,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:49,917 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:49,918 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:49,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:49,919 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:49,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:49,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:49,919 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:49,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:49,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:49,922 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,922 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:49,922 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:49,922 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:49,922 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,923 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:49,923 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:49,923 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:49,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:49,928 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:49,928 INFO L131 PetriNetUnfolder]: For 435/453 co-relation queries the response was YES. [2022-12-13 02:16:49,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/453 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:49,929 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:49,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:50,016 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:50,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:50,017 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:50,017 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 02:16:50,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:50,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:50,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable402 [2022-12-13 02:16:50,017 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 02:16:50,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1248158204, now seen corresponding path program 1 times [2022-12-13 02:16:50,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:50,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561086540] [2022-12-13 02:16:50,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:50,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:50,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:50,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561086540] [2022-12-13 02:16:50,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561086540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:50,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:50,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56005844] [2022-12-13 02:16:50,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:50,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:50,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:50,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:50,064 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:50,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:50,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:50,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:50,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:50,131 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:50,132 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:50,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:50,133 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:50,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:50,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:50,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:50,133 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:50,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:50,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:50,136 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:50,136 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:50,136 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:50,136 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:50,136 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:50,137 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:50,137 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:50,137 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:50,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:50,142 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:50,142 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:16:50,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:50,143 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:50,143 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:50,230 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:50,230 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:50,230 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:50,230 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 02:16:50,230 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:50,230 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:50,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable403 [2022-12-13 02:16:50,230 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 02:16:50,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1219529053, now seen corresponding path program 1 times [2022-12-13 02:16:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:50,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633578305] [2022-12-13 02:16:50,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:50,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:50,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:16:50,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:50,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633578305] [2022-12-13 02:16:50,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633578305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:50,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:50,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:50,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984110903] [2022-12-13 02:16:50,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:50,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:50,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:50,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:50,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:50,278 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:50,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:50,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:50,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:50,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:50,345 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:50,346 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:50,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:50,347 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:50,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:50,347 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:50,347 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:50,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:50,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:50,350 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:50,350 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:50,350 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:50,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:50,351 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:50,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:50,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:50,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:50,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:50,357 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:50,357 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:50,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:50,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:50,357 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:50,452 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:50,452 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:16:50,452 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:50,453 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 02:16:50,453 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:50,453 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:50,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable404 [2022-12-13 02:16:50,453 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 02:16:50,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1190899902, now seen corresponding path program 1 times [2022-12-13 02:16:50,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:50,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076031355] [2022-12-13 02:16:50,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:50,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:50,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:16:50,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:50,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076031355] [2022-12-13 02:16:50,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076031355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:50,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:50,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:50,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141143913] [2022-12-13 02:16:50,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:50,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:50,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:50,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:50,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:50,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:50,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:50,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:50,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:50,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:50,577 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:50,577 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:50,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:50,579 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:50,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:50,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:50,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:50,579 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:50,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:50,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:50,582 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:50,582 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:50,582 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:50,582 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:50,582 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:50,582 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:50,582 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:50,582 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:50,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:50,588 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:50,588 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:50,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:50,589 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:50,589 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:50,675 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:50,676 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:50,676 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:50,676 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 02:16:50,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:50,676 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:50,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable405 [2022-12-13 02:16:50,676 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 02:16:50,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:50,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1162270751, now seen corresponding path program 1 times [2022-12-13 02:16:50,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:50,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128146716] [2022-12-13 02:16:50,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:50,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:50,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:16:50,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:50,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128146716] [2022-12-13 02:16:50,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128146716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:50,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:50,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618640727] [2022-12-13 02:16:50,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:50,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:50,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:50,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:50,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:50,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:50,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:50,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:50,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:50,798 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:50,799 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:50,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:50,800 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:50,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:50,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:50,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:50,801 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:50,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:50,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:50,803 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:50,803 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:50,804 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:50,804 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:50,804 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:50,804 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:50,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:50,804 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:50,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:50,810 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:50,810 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:50,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:50,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:50,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:50,896 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:50,897 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:50,897 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:50,897 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 02:16:50,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:50,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:50,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406 [2022-12-13 02:16:50,897 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 02:16:50,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:50,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1133641600, now seen corresponding path program 1 times [2022-12-13 02:16:50,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:50,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267742674] [2022-12-13 02:16:50,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:50,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:16:50,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:50,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267742674] [2022-12-13 02:16:50,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267742674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:50,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:50,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:50,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039646465] [2022-12-13 02:16:50,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:50,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:50,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:50,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:50,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:50,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:50,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:50,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:50,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:50,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:51,027 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:51,027 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:51,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:51,028 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:51,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:51,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:51,029 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:51,029 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:51,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:51,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:51,032 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:51,032 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:51,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:51,032 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,032 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:51,032 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:51,033 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:51,038 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:51,038 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:51,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:51,039 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:51,039 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:51,125 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:51,126 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:51,126 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:51,126 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 02:16:51,126 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:51,126 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:51,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable407 [2022-12-13 02:16:51,126 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 02:16:51,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:51,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1105012449, now seen corresponding path program 1 times [2022-12-13 02:16:51,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:51,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948795965] [2022-12-13 02:16:51,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:51,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:51,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:16:51,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:51,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948795965] [2022-12-13 02:16:51,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948795965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:51,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:51,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:51,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739595861] [2022-12-13 02:16:51,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:51,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:51,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:51,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:51,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:51,180 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:51,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:51,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:51,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:51,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:51,247 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:51,247 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:51,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:51,248 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:51,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:51,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:51,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:51,249 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:51,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:51,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:51,252 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,252 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:51,252 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:51,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:51,252 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,252 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:51,252 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:51,252 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:51,258 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:51,258 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:51,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:51,259 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:51,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:51,345 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:51,345 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:51,345 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:51,345 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 02:16:51,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:51,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:51,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable408 [2022-12-13 02:16:51,346 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 02:16:51,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:51,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1076383298, now seen corresponding path program 1 times [2022-12-13 02:16:51,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:51,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833403593] [2022-12-13 02:16:51,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:51,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:51,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 02:16:51,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:51,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833403593] [2022-12-13 02:16:51,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833403593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:51,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:51,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:51,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581150717] [2022-12-13 02:16:51,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:51,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:51,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:51,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:51,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:51,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:51,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:51,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:51,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:51,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:51,501 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:51,502 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:51,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:51,503 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:51,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:51,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:51,504 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:51,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:51,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:51,506 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,507 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:51,507 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:51,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:51,507 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,507 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:51,507 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:51,508 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:51,514 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:51,515 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:51,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:51,515 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:51,515 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:51,605 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:51,605 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:16:51,605 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:51,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:51,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:51,606 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:51,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409 [2022-12-13 02:16:51,606 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 02:16:51,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:51,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1047754147, now seen corresponding path program 1 times [2022-12-13 02:16:51,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:51,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136893675] [2022-12-13 02:16:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:51,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:51,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:16:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:51,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136893675] [2022-12-13 02:16:51,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136893675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:51,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:51,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:51,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271631132] [2022-12-13 02:16:51,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:51,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:51,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:51,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:51,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:51,654 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:51,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:51,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:51,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:51,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:51,721 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:51,721 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:51,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:51,722 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:51,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:51,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:51,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:51,723 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:51,723 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:51,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:51,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:51,727 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,728 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:51,728 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:51,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:51,728 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,729 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:51,729 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:51,729 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:51,737 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:51,737 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:51,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:51,738 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:51,738 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:51,834 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:51,835 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:16:51,835 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:51,835 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 02:16:51,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:51,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:51,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable410 [2022-12-13 02:16:51,835 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 02:16:51,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:51,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1019124996, now seen corresponding path program 1 times [2022-12-13 02:16:51,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:51,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463304847] [2022-12-13 02:16:51,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:51,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:51,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:16:51,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:51,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463304847] [2022-12-13 02:16:51,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463304847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:51,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:51,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:51,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781598796] [2022-12-13 02:16:51,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:51,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:51,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:51,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:51,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:51,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:51,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:51,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:51,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:51,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:51,976 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:51,976 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:51,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:51,977 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:51,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:51,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:51,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:51,978 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:51,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:51,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:51,980 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:51,981 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:51,981 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:51,981 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:51,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:51,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:51,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:51,986 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:51,987 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:51,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:51,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:51,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:52,074 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:52,074 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:52,075 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:52,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:52,075 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:52,075 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:52,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable411 [2022-12-13 02:16:52,075 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 02:16:52,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash -990495845, now seen corresponding path program 1 times [2022-12-13 02:16:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:52,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969425411] [2022-12-13 02:16:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:52,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 02:16:52,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:52,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969425411] [2022-12-13 02:16:52,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969425411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:52,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:52,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:52,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894844811] [2022-12-13 02:16:52,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:52,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:52,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:52,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:52,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:52,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:52,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:52,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:52,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:52,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:52,188 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:52,188 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:52,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:52,190 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:52,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:52,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:52,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:52,190 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:52,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:52,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:52,193 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:52,193 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:52,193 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:52,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:52,193 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:52,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:52,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:52,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:52,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:52,199 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:52,199 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:52,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:52,200 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:52,200 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:52,288 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:52,288 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:52,288 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:52,288 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 02:16:52,289 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:52,289 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:52,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable412 [2022-12-13 02:16:52,289 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 02:16:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:52,289 INFO L85 PathProgramCache]: Analyzing trace with hash -961866694, now seen corresponding path program 1 times [2022-12-13 02:16:52,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:52,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099159201] [2022-12-13 02:16:52,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:52,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:52,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:16:52,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:52,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099159201] [2022-12-13 02:16:52,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099159201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:52,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:52,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:52,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414822028] [2022-12-13 02:16:52,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:52,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:52,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:52,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:52,346 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:52,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:52,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:52,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:52,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:52,430 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:52,430 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:52,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:52,431 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:52,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:52,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:52,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:52,432 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:52,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:52,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:52,434 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:52,434 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:52,434 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:52,435 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:52,435 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:52,435 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:52,435 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:52,435 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:52,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:52,441 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:52,441 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:16:52,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:52,441 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:52,441 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:52,529 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:52,529 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:52,529 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:52,529 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 02:16:52,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:52,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:52,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable413 [2022-12-13 02:16:52,530 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 02:16:52,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash -933237543, now seen corresponding path program 1 times [2022-12-13 02:16:52,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:52,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608198791] [2022-12-13 02:16:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:52,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:16:52,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:52,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608198791] [2022-12-13 02:16:52,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608198791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:52,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:52,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:52,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880196354] [2022-12-13 02:16:52,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:52,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:52,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:52,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:52,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:52,584 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:52,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:52,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:52,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:52,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:52,648 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:52,649 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:52,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:52,650 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:52,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:52,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:52,650 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:52,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:52,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:52,653 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:52,653 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:52,653 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:52,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:52,653 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:52,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:52,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:52,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:52,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:52,659 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:52,659 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:52,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:52,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:52,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:52,745 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:52,746 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:52,746 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:52,746 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 02:16:52,746 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:52,746 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:52,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable414 [2022-12-13 02:16:52,746 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 02:16:52,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:52,746 INFO L85 PathProgramCache]: Analyzing trace with hash -904608392, now seen corresponding path program 1 times [2022-12-13 02:16:52,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:52,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059368787] [2022-12-13 02:16:52,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:52,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:52,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:16:52,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:52,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059368787] [2022-12-13 02:16:52,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059368787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:52,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:52,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:52,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995293846] [2022-12-13 02:16:52,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:52,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:52,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:52,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:52,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:52,792 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:52,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:52,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:52,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:52,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:52,867 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:52,868 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:52,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:52,869 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:52,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:52,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:52,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:52,869 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:52,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:52,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:52,872 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:52,872 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:52,872 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:52,872 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:52,872 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:52,873 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:52,873 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:52,873 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:52,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:52,878 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:52,878 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:52,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:52,879 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:52,879 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:52,965 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:52,965 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:52,965 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:52,965 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 02:16:52,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:52,965 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:52,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable415 [2022-12-13 02:16:52,966 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 02:16:52,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:52,966 INFO L85 PathProgramCache]: Analyzing trace with hash -875979241, now seen corresponding path program 1 times [2022-12-13 02:16:52,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:52,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872462262] [2022-12-13 02:16:52,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:52,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:53,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:16:53,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:53,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872462262] [2022-12-13 02:16:53,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872462262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:53,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:53,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:53,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959556367] [2022-12-13 02:16:53,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:53,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:53,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:53,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:53,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:53,013 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:53,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:53,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:53,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:53,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:53,088 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:53,088 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:53,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:53,089 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:53,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:53,090 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:53,090 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:53,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:53,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:53,092 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,092 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:53,093 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:53,093 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:53,093 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,093 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:53,093 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:53,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:53,099 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:53,099 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:53,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:53,099 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:53,099 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:53,187 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:53,188 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:53,188 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:53,188 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 02:16:53,188 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:53,188 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:53,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable416 [2022-12-13 02:16:53,188 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 02:16:53,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash -847350090, now seen corresponding path program 1 times [2022-12-13 02:16:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:53,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531270292] [2022-12-13 02:16:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:53,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:53,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:16:53,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:53,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531270292] [2022-12-13 02:16:53,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531270292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:53,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:53,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139576588] [2022-12-13 02:16:53,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:53,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:53,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:53,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:53,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:53,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:53,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:53,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:53,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:53,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:53,301 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:53,301 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:53,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:53,303 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:53,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:53,303 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:53,303 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:53,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:53,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:53,306 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,306 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:53,306 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:53,306 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:53,306 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,306 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:53,306 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:53,306 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:53,319 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:53,319 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:53,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:53,320 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:53,320 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:53,406 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:53,407 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:16:53,407 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:53,407 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 02:16:53,407 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:53,407 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:53,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable417 [2022-12-13 02:16:53,407 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 02:16:53,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:53,407 INFO L85 PathProgramCache]: Analyzing trace with hash -818720939, now seen corresponding path program 1 times [2022-12-13 02:16:53,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:53,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176179248] [2022-12-13 02:16:53,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:53,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:53,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:16:53,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:53,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176179248] [2022-12-13 02:16:53,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176179248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:53,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:53,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:53,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633465818] [2022-12-13 02:16:53,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:53,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:53,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:53,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:53,452 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:53,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:53,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:53,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:53,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:53,528 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:53,529 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:53,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:53,530 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:53,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:53,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:53,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:53,530 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:53,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:53,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:53,533 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,533 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:53,533 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:53,533 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:53,533 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,533 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:53,533 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:53,534 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:53,541 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:53,541 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:16:53,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:53,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:53,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:53,629 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:53,629 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:16:53,629 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:53,630 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 02:16:53,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:53,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:53,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable418 [2022-12-13 02:16:53,630 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 02:16:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash -790091788, now seen corresponding path program 1 times [2022-12-13 02:16:53,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:53,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597303148] [2022-12-13 02:16:53,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:53,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:53,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:16:53,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:53,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597303148] [2022-12-13 02:16:53,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597303148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:53,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:53,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:53,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389238198] [2022-12-13 02:16:53,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:53,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:53,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:53,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:53,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:53,677 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:53,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:53,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:53,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:53,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:53,743 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:53,743 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:53,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:53,744 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:53,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:53,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:53,745 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:53,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:53,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:53,747 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,748 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:53,748 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:53,748 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:53,748 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:53,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:53,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:53,754 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:53,754 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:16:53,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:53,754 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:53,754 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:53,841 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:53,841 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:53,841 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:53,841 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 02:16:53,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:53,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:53,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable419 [2022-12-13 02:16:53,842 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 02:16:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:53,842 INFO L85 PathProgramCache]: Analyzing trace with hash -761462637, now seen corresponding path program 1 times [2022-12-13 02:16:53,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:53,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34350570] [2022-12-13 02:16:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:53,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:53,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:16:53,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:53,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34350570] [2022-12-13 02:16:53,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34350570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:53,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:53,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:53,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489299660] [2022-12-13 02:16:53,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:53,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:53,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:53,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:53,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:53,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:53,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:53,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:53,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:53,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:53,956 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:53,956 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:53,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:53,957 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:53,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:53,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:53,958 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:53,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:53,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:53,960 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,960 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:53,960 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:53,960 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:53,961 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,961 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:53,961 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:53,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:53,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:53,966 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:53,967 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:53,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:53,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:53,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:54,054 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:54,055 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:54,055 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:54,055 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 02:16:54,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:54,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:54,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable420 [2022-12-13 02:16:54,055 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 02:16:54,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:54,056 INFO L85 PathProgramCache]: Analyzing trace with hash -732833486, now seen corresponding path program 1 times [2022-12-13 02:16:54,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:54,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583556823] [2022-12-13 02:16:54,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:54,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:54,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:16:54,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:54,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583556823] [2022-12-13 02:16:54,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583556823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:54,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:54,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047941689] [2022-12-13 02:16:54,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:54,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:54,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:54,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:54,109 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:54,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:54,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:54,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:54,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:54,175 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:54,175 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:54,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:54,177 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:54,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:54,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:54,177 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:54,177 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:54,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:54,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:54,180 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:54,180 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:54,180 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:54,180 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:54,180 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:54,180 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:54,181 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:54,181 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:54,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:54,186 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:54,186 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:54,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:54,187 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:54,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:54,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:54,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:16:54,278 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:54,278 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 02:16:54,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:54,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:54,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable421 [2022-12-13 02:16:54,278 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 02:16:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:54,278 INFO L85 PathProgramCache]: Analyzing trace with hash -704204335, now seen corresponding path program 1 times [2022-12-13 02:16:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:54,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418732283] [2022-12-13 02:16:54,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:54,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:16:54,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:54,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418732283] [2022-12-13 02:16:54,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418732283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:54,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:54,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:54,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156562778] [2022-12-13 02:16:54,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:54,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:54,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:54,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:54,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:54,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:54,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:54,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:54,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:54,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:54,421 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:54,421 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:54,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:54,422 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:54,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:54,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:54,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:54,423 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:54,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:54,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:54,425 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:54,425 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:54,426 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:54,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:54,426 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:54,426 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:54,426 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:54,426 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:54,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:54,431 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:54,432 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:54,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:54,432 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:54,432 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:54,519 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:54,519 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:54,519 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:54,519 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 02:16:54,519 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:54,520 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:54,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable422 [2022-12-13 02:16:54,520 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 02:16:54,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:54,520 INFO L85 PathProgramCache]: Analyzing trace with hash -675575184, now seen corresponding path program 1 times [2022-12-13 02:16:54,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:54,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973590908] [2022-12-13 02:16:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:54,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:16:54,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:54,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973590908] [2022-12-13 02:16:54,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973590908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:54,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:54,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:54,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715622361] [2022-12-13 02:16:54,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:54,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:54,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:54,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:54,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:54,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:54,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:54,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:54,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:54,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:54,666 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:54,666 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:54,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:54,667 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:54,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:54,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:54,668 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:54,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:54,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:54,670 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:54,671 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:54,671 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:54,671 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:54,671 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:54,671 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:54,671 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:54,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:54,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:54,677 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:54,677 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:54,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:54,677 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:54,678 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:54,765 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:54,765 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:54,765 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:54,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:54,765 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:54,765 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:54,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable423 [2022-12-13 02:16:54,765 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 02:16:54,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:54,766 INFO L85 PathProgramCache]: Analyzing trace with hash -646946033, now seen corresponding path program 1 times [2022-12-13 02:16:54,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:54,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016961343] [2022-12-13 02:16:54,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:54,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:54,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:16:54,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:54,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016961343] [2022-12-13 02:16:54,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016961343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:54,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:54,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595829925] [2022-12-13 02:16:54,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:54,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:54,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:54,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:54,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:54,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:54,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:54,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:54,878 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:54,878 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:54,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:54,880 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:54,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:54,880 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:54,880 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:54,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:54,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:54,883 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:54,883 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:54,883 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:54,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:54,883 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:54,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:54,883 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:54,883 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:54,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:54,889 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:54,889 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:16:54,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:54,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:54,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:54,976 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:54,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:54,977 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:54,977 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 02:16:54,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:54,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:54,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable424 [2022-12-13 02:16:54,978 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 02:16:54,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash -618316882, now seen corresponding path program 1 times [2022-12-13 02:16:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:54,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131691030] [2022-12-13 02:16:54,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:55,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:16:55,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:55,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131691030] [2022-12-13 02:16:55,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131691030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:55,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:55,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411796629] [2022-12-13 02:16:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:55,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:55,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:55,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:55,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:55,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:55,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:55,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:55,093 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:55,094 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:55,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:55,095 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:55,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:55,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:55,095 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:55,095 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:55,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:55,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:55,098 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,098 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:55,098 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:55,098 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:55,098 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,099 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:55,099 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:55,099 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:55,104 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:55,105 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:55,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:55,105 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:55,105 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:55,191 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:55,192 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:55,192 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:55,192 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 02:16:55,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:55,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:55,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable425 [2022-12-13 02:16:55,192 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 02:16:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash -589687731, now seen corresponding path program 1 times [2022-12-13 02:16:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:55,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670723847] [2022-12-13 02:16:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:55,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:55,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:16:55,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:55,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670723847] [2022-12-13 02:16:55,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670723847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:55,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:55,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:55,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610371978] [2022-12-13 02:16:55,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:55,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:55,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:55,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:55,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:55,238 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:55,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:55,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:55,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:55,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:55,321 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:55,322 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:55,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:55,323 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:55,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:55,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:55,323 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:55,323 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:55,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:55,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:55,326 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:55,326 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:55,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:55,326 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:55,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:55,327 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:55,332 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:55,332 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:16:55,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:55,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:55,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:55,420 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:55,420 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:55,420 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:55,420 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 02:16:55,420 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:55,420 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:55,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable426 [2022-12-13 02:16:55,421 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 02:16:55,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:55,421 INFO L85 PathProgramCache]: Analyzing trace with hash -561058580, now seen corresponding path program 1 times [2022-12-13 02:16:55,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:55,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604860627] [2022-12-13 02:16:55,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:55,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:55,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 02:16:55,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:55,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604860627] [2022-12-13 02:16:55,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604860627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:55,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:55,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:55,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680949937] [2022-12-13 02:16:55,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:55,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:55,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:55,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:55,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:55,468 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:55,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:55,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:55,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:55,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:55,544 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:55,544 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:16:55,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:55,545 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:55,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:55,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:55,546 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:55,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:55,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:55,548 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,548 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:55,549 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:55,549 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:55,549 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,549 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:55,549 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:55,549 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:55,555 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:55,555 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:16:55,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:55,555 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:55,555 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:55,642 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:55,643 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:55,643 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:55,643 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 02:16:55,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:55,643 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:55,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable427 [2022-12-13 02:16:55,643 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 02:16:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:55,643 INFO L85 PathProgramCache]: Analyzing trace with hash -532429429, now seen corresponding path program 1 times [2022-12-13 02:16:55,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:55,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789592652] [2022-12-13 02:16:55,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:55,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:55,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:16:55,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:55,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789592652] [2022-12-13 02:16:55,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789592652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:55,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:55,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:55,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635633286] [2022-12-13 02:16:55,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:55,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:55,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:55,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:55,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:55,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:55,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:55,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:55,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:55,755 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:55,755 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:55,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:55,756 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:55,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:55,757 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:55,757 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:55,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:55,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:55,760 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:55,760 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:55,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:55,760 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:55,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:55,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:55,766 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:55,766 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:55,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:55,766 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:55,766 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:55,851 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:55,852 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:16:55,852 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:55,852 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 02:16:55,852 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:55,852 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:55,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable428 [2022-12-13 02:16:55,852 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 02:16:55,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash -503800278, now seen corresponding path program 1 times [2022-12-13 02:16:55,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:55,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844158447] [2022-12-13 02:16:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:55,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:16:55,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:55,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844158447] [2022-12-13 02:16:55,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844158447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:55,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:55,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:55,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669937858] [2022-12-13 02:16:55,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:55,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:55,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:55,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:55,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:55,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:55,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:55,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:55,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:55,972 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:55,972 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:55,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:55,973 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:55,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:55,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:55,974 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:55,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:55,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:55,977 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:55,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:55,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:55,977 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:55,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:55,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:55,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:55,983 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:55,983 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:55,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:55,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:55,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:56,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:56,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:56,071 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:56,071 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 02:16:56,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:56,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:56,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable429 [2022-12-13 02:16:56,071 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 02:16:56,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:56,071 INFO L85 PathProgramCache]: Analyzing trace with hash -475171127, now seen corresponding path program 1 times [2022-12-13 02:16:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:56,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423514816] [2022-12-13 02:16:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:56,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:56,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:16:56,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:56,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423514816] [2022-12-13 02:16:56,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423514816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:56,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:56,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147268866] [2022-12-13 02:16:56,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:56,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:56,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:56,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:56,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:56,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:56,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:56,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:56,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:56,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:56,194 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:56,194 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:56,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:56,195 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:56,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:56,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:56,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:56,196 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:56,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:56,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:56,198 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:56,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:56,199 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:56,199 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:56,199 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:56,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:56,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:56,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:56,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:56,211 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:56,211 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:56,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:56,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:56,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:56,299 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:56,300 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:16:56,300 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:56,300 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 02:16:56,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:56,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:56,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable430 [2022-12-13 02:16:56,300 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 02:16:56,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash -446541976, now seen corresponding path program 1 times [2022-12-13 02:16:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:56,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973167244] [2022-12-13 02:16:56,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:56,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:56,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:16:56,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:56,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973167244] [2022-12-13 02:16:56,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973167244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:56,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:56,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:56,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828393402] [2022-12-13 02:16:56,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:56,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:56,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:56,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:56,347 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:56,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:56,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:56,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:56,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:56,422 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:56,422 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:56,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:56,423 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:56,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:56,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:56,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:56,424 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:56,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:56,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:56,427 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:56,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:56,428 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:56,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:56,428 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:56,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:56,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:56,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:56,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:56,436 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:56,437 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:56,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:56,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:56,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:56,535 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:56,535 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:16:56,535 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:56,535 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 02:16:56,535 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:56,535 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:56,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable431 [2022-12-13 02:16:56,535 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 02:16:56,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash -417912825, now seen corresponding path program 1 times [2022-12-13 02:16:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:56,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754752198] [2022-12-13 02:16:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:56,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:56,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:16:56,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:56,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754752198] [2022-12-13 02:16:56,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754752198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:56,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:56,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:56,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912789371] [2022-12-13 02:16:56,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:56,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:56,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:56,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:56,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:56,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:56,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:56,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:56,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:56,647 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:56,647 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:56,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:56,649 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:56,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:56,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:56,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:56,649 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:56,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:56,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:56,652 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:56,652 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:56,652 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:56,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:56,652 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:56,652 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:56,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:56,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:56,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:56,658 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:56,658 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:56,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:56,659 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:56,659 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:56,745 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:56,745 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:56,745 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:56,745 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 02:16:56,745 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:56,746 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:56,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable432 [2022-12-13 02:16:56,746 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 02:16:56,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash -389283674, now seen corresponding path program 1 times [2022-12-13 02:16:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:56,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395087705] [2022-12-13 02:16:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:56,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 02:16:56,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:56,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395087705] [2022-12-13 02:16:56,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395087705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:56,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:56,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:56,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351643080] [2022-12-13 02:16:56,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:56,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:56,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:56,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:56,793 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:56,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:56,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:56,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:56,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:56,869 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:56,869 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:56,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:56,870 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:56,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:56,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:56,871 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:56,871 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:56,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:56,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:56,873 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:56,873 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:56,874 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:56,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:56,874 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:56,874 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:56,874 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:56,874 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:56,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:56,880 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:56,880 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:56,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:56,880 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:56,880 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:56,967 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:56,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:56,967 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:56,967 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 02:16:56,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:56,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:56,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable433 [2022-12-13 02:16:56,968 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 02:16:56,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:56,968 INFO L85 PathProgramCache]: Analyzing trace with hash -360654523, now seen corresponding path program 1 times [2022-12-13 02:16:56,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:56,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657329712] [2022-12-13 02:16:56,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:56,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:57,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:16:57,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:57,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657329712] [2022-12-13 02:16:57,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657329712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:57,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:57,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:57,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886256347] [2022-12-13 02:16:57,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:57,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:57,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:57,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:57,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:57,014 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:57,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:57,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:57,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:57,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:57,090 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:57,091 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:57,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:57,092 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:57,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:57,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:57,092 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:57,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:57,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:57,095 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,095 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:57,095 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:57,095 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:57,095 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,095 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:57,095 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:57,096 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:57,101 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:57,101 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:57,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:57,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:57,102 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:57,189 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:57,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:57,190 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:57,190 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 02:16:57,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:57,190 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:57,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable434 [2022-12-13 02:16:57,190 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 02:16:57,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash -332025372, now seen corresponding path program 1 times [2022-12-13 02:16:57,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:57,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684804966] [2022-12-13 02:16:57,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:57,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:57,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:16:57,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:57,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684804966] [2022-12-13 02:16:57,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684804966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:57,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:57,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:57,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659753632] [2022-12-13 02:16:57,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:57,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:57,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:57,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:57,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:57,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:57,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:57,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:57,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:57,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:57,310 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:57,310 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:57,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:57,312 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:57,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:57,312 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:57,312 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:57,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:57,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:57,315 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,315 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:57,315 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:57,315 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:57,315 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,315 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:57,315 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:57,315 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:57,321 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:57,321 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:57,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:57,322 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:57,322 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:57,408 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:57,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:57,408 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:57,408 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 02:16:57,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:57,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:57,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable435 [2022-12-13 02:16:57,409 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 02:16:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash -303396221, now seen corresponding path program 1 times [2022-12-13 02:16:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:57,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874465125] [2022-12-13 02:16:57,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:57,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:57,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:16:57,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:57,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874465125] [2022-12-13 02:16:57,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874465125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:57,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:57,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:57,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260009318] [2022-12-13 02:16:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:57,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:57,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:57,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:57,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:57,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:57,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:57,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:57,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:57,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:57,519 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:57,519 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:57,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:57,520 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:57,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:57,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:57,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:57,521 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:57,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:57,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:57,524 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:57,524 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:57,524 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:57,524 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,524 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:57,524 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:57,524 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:57,530 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:57,530 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:57,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:57,531 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:57,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:57,617 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:57,618 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:57,618 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:57,618 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 02:16:57,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:57,618 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:57,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436 [2022-12-13 02:16:57,618 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 02:16:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash -274767070, now seen corresponding path program 1 times [2022-12-13 02:16:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:57,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943686080] [2022-12-13 02:16:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:57,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:57,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:16:57,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:57,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943686080] [2022-12-13 02:16:57,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943686080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:57,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:57,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:57,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381075738] [2022-12-13 02:16:57,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:57,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:57,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:57,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:57,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:57,666 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:57,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:57,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:57,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:57,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:57,741 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:57,742 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:57,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:57,743 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:57,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:57,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:57,743 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:57,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:57,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:57,746 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:57,746 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:57,746 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:57,746 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,747 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:57,747 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:57,747 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:57,752 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:57,753 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:16:57,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:57,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:57,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:57,842 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:57,843 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:16:57,843 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:57,843 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 02:16:57,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:57,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:57,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable437 [2022-12-13 02:16:57,843 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 02:16:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash -246137919, now seen corresponding path program 1 times [2022-12-13 02:16:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:57,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729845905] [2022-12-13 02:16:57,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:57,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:57,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:16:57,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:57,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729845905] [2022-12-13 02:16:57,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729845905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:57,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:57,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:57,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557123296] [2022-12-13 02:16:57,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:57,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:57,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:57,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:57,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:57,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:57,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:57,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:57,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:57,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:57,954 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:57,954 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:57,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:57,955 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:57,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:57,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:57,956 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:57,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:57,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:57,959 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,959 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:57,959 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:57,959 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:57,959 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,959 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:57,959 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:57,959 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:57,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:57,965 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:57,965 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:57,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:57,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:57,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:58,052 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:58,052 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:16:58,052 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:58,052 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 02:16:58,052 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:58,052 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:58,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable438 [2022-12-13 02:16:58,053 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 02:16:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:58,053 INFO L85 PathProgramCache]: Analyzing trace with hash -217508768, now seen corresponding path program 1 times [2022-12-13 02:16:58,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:58,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134563101] [2022-12-13 02:16:58,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:58,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:16:58,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:58,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134563101] [2022-12-13 02:16:58,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134563101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:58,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:58,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:16:58,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532590223] [2022-12-13 02:16:58,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:58,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:16:58,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:58,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:16:58,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:16:58,115 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:58,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:58,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:58,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:58,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:58,198 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:58,198 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:58,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:58,199 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:58,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:58,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:58,200 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:58,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:58,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:58,202 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:58,202 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:58,203 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:58,203 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:58,203 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:58,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:58,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:58,203 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:58,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:58,209 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:58,209 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:58,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:58,209 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:58,209 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:58,300 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:58,300 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:16:58,301 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:58,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:16:58,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:58,301 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:58,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable439 [2022-12-13 02:16:58,301 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 02:16:58,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash -188879617, now seen corresponding path program 1 times [2022-12-13 02:16:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:58,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378607414] [2022-12-13 02:16:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:58,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:16:58,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:58,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378607414] [2022-12-13 02:16:58,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378607414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:58,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:58,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:58,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284998407] [2022-12-13 02:16:58,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:58,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:58,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:58,348 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:58,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:58,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:58,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:58,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:58,424 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:58,424 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:58,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:58,426 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:58,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:58,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:58,426 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:58,426 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:58,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:58,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:58,429 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:58,429 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:58,429 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:58,429 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:58,429 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:58,429 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:58,429 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:58,429 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:58,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:58,435 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:58,435 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:16:58,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:58,436 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:58,436 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:58,524 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:58,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:58,524 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:58,524 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 02:16:58,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:58,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:58,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable440 [2022-12-13 02:16:58,524 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 02:16:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash -160250466, now seen corresponding path program 1 times [2022-12-13 02:16:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:58,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769678128] [2022-12-13 02:16:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:58,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:16:58,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:58,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769678128] [2022-12-13 02:16:58,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769678128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:58,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:58,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:58,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982664772] [2022-12-13 02:16:58,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:58,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:58,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:58,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:58,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:58,568 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:58,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:58,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:58,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:58,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:58,648 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:58,649 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:58,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:58,650 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:58,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:58,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:58,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:58,650 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:58,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:58,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:58,653 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:58,653 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:58,653 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:58,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:58,653 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:58,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:58,654 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:58,654 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:58,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:58,659 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:58,659 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:58,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:58,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:58,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:58,747 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:58,748 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:58,748 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:58,748 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 02:16:58,748 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:58,748 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:58,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable441 [2022-12-13 02:16:58,748 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 02:16:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:58,749 INFO L85 PathProgramCache]: Analyzing trace with hash -131621315, now seen corresponding path program 1 times [2022-12-13 02:16:58,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:58,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792290985] [2022-12-13 02:16:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:58,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:58,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:16:58,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:58,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792290985] [2022-12-13 02:16:58,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792290985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:58,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:58,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:58,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576557622] [2022-12-13 02:16:58,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:58,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:58,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:58,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:58,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:58,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:58,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:58,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:58,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:58,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:58,891 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:58,891 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:16:58,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:58,892 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:58,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:58,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:58,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:58,893 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:58,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:58,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:58,895 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:58,895 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:58,895 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:58,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:58,896 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:58,896 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:58,896 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:58,896 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:58,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:58,901 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:58,901 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:16:58,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:58,902 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:58,902 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:58,989 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:58,990 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:58,990 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:58,990 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 02:16:58,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:58,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:58,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable442 [2022-12-13 02:16:58,990 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 02:16:58,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash -102992164, now seen corresponding path program 1 times [2022-12-13 02:16:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:58,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754389996] [2022-12-13 02:16:58,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:58,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:59,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:16:59,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:59,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754389996] [2022-12-13 02:16:59,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754389996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:59,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:59,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:59,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621222344] [2022-12-13 02:16:59,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:59,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:59,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:59,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:59,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:59,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:59,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:59,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:59,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:59,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:59,099 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:59,099 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:16:59,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:59,100 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:59,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:59,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:59,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:59,100 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:59,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:59,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:59,103 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,103 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:59,103 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:59,103 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:59,103 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,103 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:59,103 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:59,104 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:59,116 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:59,116 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:59,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:59,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:59,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:59,203 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:59,203 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:16:59,203 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:59,203 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 02:16:59,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:59,203 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:59,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable443 [2022-12-13 02:16:59,204 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 02:16:59,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash -74363013, now seen corresponding path program 1 times [2022-12-13 02:16:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:59,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916738571] [2022-12-13 02:16:59,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:59,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:59,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:16:59,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:59,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916738571] [2022-12-13 02:16:59,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916738571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:59,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:59,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:59,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713123535] [2022-12-13 02:16:59,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:59,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:59,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:59,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:59,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:59,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:59,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:59,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:59,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:59,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:59,326 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:59,326 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:59,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:59,327 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:59,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:59,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:59,328 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:59,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:59,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:59,331 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:59,331 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:59,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:59,331 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,331 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:59,331 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:59,331 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:59,337 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:59,337 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:59,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:59,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:59,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:59,425 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:59,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:16:59,426 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:59,426 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 02:16:59,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:59,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:59,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable444 [2022-12-13 02:16:59,426 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 02:16:59,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:59,426 INFO L85 PathProgramCache]: Analyzing trace with hash -45733862, now seen corresponding path program 1 times [2022-12-13 02:16:59,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:59,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002641209] [2022-12-13 02:16:59,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:59,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:16:59,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:59,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002641209] [2022-12-13 02:16:59,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002641209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:59,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:59,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:59,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165813183] [2022-12-13 02:16:59,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:59,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:59,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:59,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:59,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:59,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:59,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:59,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:59,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:59,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:59,550 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:59,550 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:59,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:59,551 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:59,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:59,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:59,552 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:59,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:59,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:59,554 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,554 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:59,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:59,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:59,555 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,555 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:59,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:59,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:59,561 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:59,561 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:59,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:59,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:59,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:59,647 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:59,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:16:59,647 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:59,647 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 02:16:59,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:59,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:59,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable445 [2022-12-13 02:16:59,648 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 02:16:59,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:59,648 INFO L85 PathProgramCache]: Analyzing trace with hash -17104711, now seen corresponding path program 1 times [2022-12-13 02:16:59,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:59,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147603320] [2022-12-13 02:16:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:59,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:16:59,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:59,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147603320] [2022-12-13 02:16:59,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147603320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:59,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:59,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:59,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860668817] [2022-12-13 02:16:59,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:59,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:59,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:59,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:59,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:59,694 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:59,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:59,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:59,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:59,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:59,759 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:59,759 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:59,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:59,761 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:59,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:59,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:59,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:59,761 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:59,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:59,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:59,764 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:59,764 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:59,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:59,764 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:59,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:59,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:59,770 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:59,770 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:16:59,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:59,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:59,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:16:59,858 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:16:59,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:16:59,859 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:16:59,859 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 02:16:59,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:16:59,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:16:59,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable446 [2022-12-13 02:16:59,859 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 02:16:59,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:16:59,859 INFO L85 PathProgramCache]: Analyzing trace with hash 11524440, now seen corresponding path program 1 times [2022-12-13 02:16:59,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:16:59,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180495103] [2022-12-13 02:16:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:16:59,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:16:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:16:59,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:16:59,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:16:59,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180495103] [2022-12-13 02:16:59,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180495103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:16:59,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:16:59,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:16:59,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928072211] [2022-12-13 02:16:59,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:16:59,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:16:59,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:16:59,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:16:59,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:16:59,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:16:59,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:16:59,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:16:59,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:16:59,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:16:59,981 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:16:59,981 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:16:59,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:16:59,982 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:16:59,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:59,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:16:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:16:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:16:59,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:16:59,982 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:16:59,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:16:59,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:16:59,985 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,985 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:16:59,985 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:16:59,985 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:16:59,985 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:16:59,986 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:16:59,986 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:16:59,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:59,991 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:16:59,991 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:16:59,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:16:59,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:16:59,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:00,080 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:00,081 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:00,081 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:00,081 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 02:17:00,081 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:00,081 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:00,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable447 [2022-12-13 02:17:00,081 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 02:17:00,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:00,081 INFO L85 PathProgramCache]: Analyzing trace with hash 40153591, now seen corresponding path program 1 times [2022-12-13 02:17:00,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:00,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533862942] [2022-12-13 02:17:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:00,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:00,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:17:00,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:00,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533862942] [2022-12-13 02:17:00,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533862942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:00,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:00,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:00,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111678120] [2022-12-13 02:17:00,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:00,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:00,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:00,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:00,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:00,135 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:00,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:00,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:00,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:00,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:00,201 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:00,201 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:00,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:00,202 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:00,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:00,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:00,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:00,203 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:00,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:00,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:00,205 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:00,205 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:00,206 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:00,206 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:00,206 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:00,206 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:00,206 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:00,206 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:00,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:00,212 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:00,212 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:00,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:00,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:00,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:00,297 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:00,298 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:17:00,298 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:00,298 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 02:17:00,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:00,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:00,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable448 [2022-12-13 02:17:00,298 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 02:17:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash 68782742, now seen corresponding path program 1 times [2022-12-13 02:17:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:00,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688414090] [2022-12-13 02:17:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:00,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:00,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:17:00,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:00,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688414090] [2022-12-13 02:17:00,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688414090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:00,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:00,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:00,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561050801] [2022-12-13 02:17:00,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:00,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:00,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:00,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:00,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:00,361 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:00,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:00,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:00,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:00,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:00,437 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:00,438 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:00,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:00,439 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:00,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:00,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:00,439 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:00,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:00,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:00,442 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:00,442 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:00,442 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:00,442 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:00,442 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:00,442 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:00,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:00,443 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:00,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:00,448 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:00,448 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:00,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:00,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:00,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:00,535 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:00,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:00,536 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:00,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:00,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:00,536 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:00,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable449 [2022-12-13 02:17:00,536 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 02:17:00,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:00,536 INFO L85 PathProgramCache]: Analyzing trace with hash 97411893, now seen corresponding path program 1 times [2022-12-13 02:17:00,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:00,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055123231] [2022-12-13 02:17:00,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:00,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:00,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:17:00,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:00,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055123231] [2022-12-13 02:17:00,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055123231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:00,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:00,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:00,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288025501] [2022-12-13 02:17:00,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:00,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:00,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:00,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:00,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:00,600 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:00,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:00,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:00,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:00,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:00,675 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:00,675 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:00,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:00,676 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:00,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:00,677 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:00,677 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:00,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:00,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:00,680 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:00,680 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:00,680 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:00,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:00,680 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:00,680 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:00,680 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:00,680 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:00,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:00,686 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:00,686 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:00,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:00,687 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:00,687 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:00,774 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:00,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:00,774 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:00,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:00,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:00,774 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:00,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable450 [2022-12-13 02:17:00,774 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 02:17:00,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:00,775 INFO L85 PathProgramCache]: Analyzing trace with hash 126041044, now seen corresponding path program 1 times [2022-12-13 02:17:00,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:00,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86581645] [2022-12-13 02:17:00,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:00,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:00,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:17:00,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:00,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86581645] [2022-12-13 02:17:00,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86581645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:00,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:00,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:00,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258504506] [2022-12-13 02:17:00,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:00,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:00,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:00,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:00,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:00,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:00,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:00,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:00,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:00,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:00,894 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:00,895 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:00,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:00,896 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:00,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:00,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:00,896 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:00,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:00,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:00,899 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:00,899 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:00,899 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:00,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:00,899 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:00,899 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:00,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:00,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:00,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:00,905 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:00,905 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:00,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:00,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:00,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:00,991 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:00,992 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:00,992 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:00,992 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 02:17:00,992 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:00,992 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:00,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable451 [2022-12-13 02:17:00,992 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 02:17:00,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:00,992 INFO L85 PathProgramCache]: Analyzing trace with hash 154670195, now seen corresponding path program 1 times [2022-12-13 02:17:00,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:00,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055783842] [2022-12-13 02:17:00,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:00,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:01,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:17:01,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:01,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055783842] [2022-12-13 02:17:01,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055783842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:01,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:01,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:01,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693455830] [2022-12-13 02:17:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:01,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:01,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:01,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:01,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:01,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:01,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:01,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:01,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:01,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:01,139 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:01,139 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:01,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:01,140 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:01,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:01,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:01,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:01,141 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:01,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:01,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:01,144 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:01,144 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:01,144 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:01,144 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:01,144 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:01,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:01,145 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:01,145 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:01,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:01,154 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:01,154 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:01,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:01,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:01,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:01,261 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:01,261 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:17:01,261 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:01,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:01,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:01,261 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:01,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable452 [2022-12-13 02:17:01,262 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 02:17:01,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:01,262 INFO L85 PathProgramCache]: Analyzing trace with hash 183299346, now seen corresponding path program 1 times [2022-12-13 02:17:01,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:01,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767750850] [2022-12-13 02:17:01,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:01,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:01,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:17:01,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:01,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767750850] [2022-12-13 02:17:01,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767750850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:01,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:01,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:01,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177676601] [2022-12-13 02:17:01,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:01,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:01,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:01,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:01,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:01,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:01,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:01,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:01,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:01,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:01,415 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:01,415 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:01,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:01,416 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:01,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:01,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:01,417 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:01,417 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:01,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:01,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:01,421 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:01,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:01,422 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:01,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:01,422 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:01,422 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:01,422 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:01,422 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:01,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:01,430 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:01,431 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:01,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:01,431 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:01,432 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:01,533 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:01,534 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 02:17:01,534 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:01,534 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 02:17:01,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:01,534 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:01,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable453 [2022-12-13 02:17:01,534 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 02:17:01,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash 211928497, now seen corresponding path program 1 times [2022-12-13 02:17:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:01,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431264682] [2022-12-13 02:17:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:01,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:01,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:17:01,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:01,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431264682] [2022-12-13 02:17:01,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431264682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:01,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:01,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:01,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788127535] [2022-12-13 02:17:01,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:01,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:01,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:01,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:01,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:01,597 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:01,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:01,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:01,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:01,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:01,674 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:01,674 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:01,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:01,675 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:01,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:01,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:01,676 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:01,676 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:01,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:01,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:01,679 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:01,679 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:01,679 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:01,679 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:01,679 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:01,679 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:01,679 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:01,679 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:01,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:01,685 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:01,685 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:01,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:01,686 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:01,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:01,774 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:01,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:01,774 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:01,774 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 02:17:01,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:01,774 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:01,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable454 [2022-12-13 02:17:01,774 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 02:17:01,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash 240557648, now seen corresponding path program 1 times [2022-12-13 02:17:01,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:01,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336319942] [2022-12-13 02:17:01,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:01,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:01,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 02:17:01,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:01,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336319942] [2022-12-13 02:17:01,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336319942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:01,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:01,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:01,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135096257] [2022-12-13 02:17:01,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:01,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:01,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:01,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:01,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:01,821 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:01,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:01,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:01,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:01,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:01,896 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:01,896 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:01,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:01,897 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:01,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:01,898 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:01,898 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:01,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:01,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:01,901 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:01,901 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:01,901 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:01,901 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:01,901 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:01,901 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:01,901 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:01,902 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:01,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:01,907 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:01,907 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:01,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:01,908 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:01,908 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:01,996 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:01,996 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:01,996 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:01,996 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 02:17:01,997 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:01,997 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:01,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable455 [2022-12-13 02:17:01,997 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 02:17:01,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash 269186799, now seen corresponding path program 1 times [2022-12-13 02:17:01,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:01,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507009821] [2022-12-13 02:17:01,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:01,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:02,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:17:02,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:02,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507009821] [2022-12-13 02:17:02,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507009821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:02,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:02,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132366791] [2022-12-13 02:17:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:02,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:02,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:02,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:02,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:02,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:02,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:02,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:02,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:02,119 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:02,119 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:02,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:02,121 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:02,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:02,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:02,121 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:02,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:02,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:02,124 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:02,124 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:02,124 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:02,124 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:02,124 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:02,124 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:02,124 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:02,125 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:02,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:02,131 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:02,131 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:02,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:02,131 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:02,131 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:02,223 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:02,223 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:17:02,224 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:02,224 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 02:17:02,224 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:02,224 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:02,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable456 [2022-12-13 02:17:02,224 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 02:17:02,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash 297815950, now seen corresponding path program 1 times [2022-12-13 02:17:02,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:02,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118595201] [2022-12-13 02:17:02,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:02,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:02,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:17:02,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:02,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118595201] [2022-12-13 02:17:02,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118595201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:02,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:02,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:02,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617051803] [2022-12-13 02:17:02,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:02,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:02,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:02,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:02,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:02,270 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:02,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:02,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:02,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:02,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:02,347 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:02,347 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:02,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:02,348 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:02,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:02,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:02,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:02,349 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:02,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:02,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:02,351 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:02,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:02,352 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:02,352 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:02,352 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:02,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:02,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:02,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:02,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:02,358 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:02,358 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:02,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:02,358 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:02,358 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:02,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:02,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:02,445 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:02,445 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 02:17:02,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:02,446 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:02,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable457 [2022-12-13 02:17:02,446 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 02:17:02,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:02,446 INFO L85 PathProgramCache]: Analyzing trace with hash 326445101, now seen corresponding path program 1 times [2022-12-13 02:17:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:02,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755024025] [2022-12-13 02:17:02,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:02,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:02,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 02:17:02,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:02,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755024025] [2022-12-13 02:17:02,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755024025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:02,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:02,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:02,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296404136] [2022-12-13 02:17:02,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:02,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:02,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:02,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:02,514 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:02,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:02,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:02,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:02,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:02,588 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:02,589 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:02,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:02,590 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:02,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:02,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:02,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:02,590 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:02,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:02,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:02,593 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:02,593 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:02,593 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:02,593 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:02,593 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:02,594 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:02,594 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:02,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:02,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:02,599 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:02,599 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:02,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:02,600 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:02,600 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:02,685 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:02,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:02,686 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:02,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:02,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:02,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:02,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable458 [2022-12-13 02:17:02,686 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 02:17:02,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash 355074252, now seen corresponding path program 1 times [2022-12-13 02:17:02,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:02,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723215306] [2022-12-13 02:17:02,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:02,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:02,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:17:02,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:02,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723215306] [2022-12-13 02:17:02,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723215306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:02,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:02,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:02,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301208087] [2022-12-13 02:17:02,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:02,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:02,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:02,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:02,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:02,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:02,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:02,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:02,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:02,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:02,837 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:02,837 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:02,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:02,839 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:02,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:02,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:02,839 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:02,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:02,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:02,842 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:02,842 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:02,842 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:02,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:02,843 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:02,843 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:02,843 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:02,843 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:02,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:02,851 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:02,851 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:02,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:02,852 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:02,852 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:02,939 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:02,939 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:02,939 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:02,939 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 02:17:02,939 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:02,939 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:02,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable459 [2022-12-13 02:17:02,940 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 02:17:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:02,940 INFO L85 PathProgramCache]: Analyzing trace with hash 383703403, now seen corresponding path program 1 times [2022-12-13 02:17:02,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:02,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271027882] [2022-12-13 02:17:02,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:02,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:02,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:17:02,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:02,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271027882] [2022-12-13 02:17:02,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271027882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:02,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:02,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:02,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405175067] [2022-12-13 02:17:02,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:02,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:02,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:02,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:02,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:02,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:02,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:02,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:02,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:02,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:03,074 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:03,075 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:03,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:03,076 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:03,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:03,076 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:03,076 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:03,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:03,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:03,079 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,079 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:03,079 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:03,079 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:03,079 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,079 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:03,079 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:03,080 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:03,085 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:03,085 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:03,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:03,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:03,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:03,172 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:03,172 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:03,172 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:03,173 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 02:17:03,173 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:03,173 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:03,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable460 [2022-12-13 02:17:03,173 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 02:17:03,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:03,173 INFO L85 PathProgramCache]: Analyzing trace with hash 412332554, now seen corresponding path program 1 times [2022-12-13 02:17:03,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:03,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023180803] [2022-12-13 02:17:03,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:03,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:03,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:17:03,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:03,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023180803] [2022-12-13 02:17:03,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023180803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:03,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:03,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:03,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436466353] [2022-12-13 02:17:03,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:03,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:03,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:03,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:03,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:03,219 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:03,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:03,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:03,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:03,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:03,296 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:03,296 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:03,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:03,297 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:03,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:03,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:03,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:03,298 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:03,298 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:03,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:03,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:03,301 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,301 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:03,301 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:03,301 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:03,301 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:03,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:03,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:03,307 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:03,307 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:03,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:03,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:03,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:03,399 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:03,400 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:17:03,400 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:03,400 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 02:17:03,400 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:03,400 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:03,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable461 [2022-12-13 02:17:03,400 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 02:17:03,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash 440961705, now seen corresponding path program 1 times [2022-12-13 02:17:03,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:03,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277222639] [2022-12-13 02:17:03,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:03,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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:17:03,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:03,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277222639] [2022-12-13 02:17:03,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277222639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:03,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:03,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:03,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995063876] [2022-12-13 02:17:03,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:03,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:03,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:03,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:03,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:03,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:03,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:03,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:03,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:03,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:03,513 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:03,513 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:03,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:03,514 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:03,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:03,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:03,515 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:03,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:03,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:03,518 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:03,518 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:03,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:03,518 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,518 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:03,518 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:03,518 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:03,524 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:03,524 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:03,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:03,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:03,525 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:03,610 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:03,611 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:03,611 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:03,611 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 02:17:03,611 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:03,611 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:03,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable462 [2022-12-13 02:17:03,611 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 02:17:03,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:03,611 INFO L85 PathProgramCache]: Analyzing trace with hash 469590856, now seen corresponding path program 1 times [2022-12-13 02:17:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:03,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7643336] [2022-12-13 02:17:03,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:03,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:03,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:03,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7643336] [2022-12-13 02:17:03,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7643336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:03,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:03,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:03,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860849738] [2022-12-13 02:17:03,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:03,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:03,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:03,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:03,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:03,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:03,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:03,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:03,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:03,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:03,734 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:03,734 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:03,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:03,736 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:03,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:03,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:03,736 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:03,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:03,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:03,739 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,739 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:03,739 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:03,739 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:03,739 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:03,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:03,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:03,745 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:03,745 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:03,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:03,746 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:03,746 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:03,833 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:03,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:03,834 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:03,834 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 02:17:03,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:03,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:03,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable463 [2022-12-13 02:17:03,834 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 02:17:03,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:03,834 INFO L85 PathProgramCache]: Analyzing trace with hash 498220007, now seen corresponding path program 1 times [2022-12-13 02:17:03,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:03,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897384336] [2022-12-13 02:17:03,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:03,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:03,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:17:03,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:03,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897384336] [2022-12-13 02:17:03,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897384336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:03,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:03,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:03,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730586124] [2022-12-13 02:17:03,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:03,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:03,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:03,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:03,881 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:03,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:03,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:03,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:03,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:03,956 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:03,956 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:03,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:03,958 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:03,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:03,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:03,958 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:03,958 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:03,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:03,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:03,961 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,961 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:03,961 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:03,961 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:03,961 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,961 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:03,961 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:03,962 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:03,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:03,967 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:03,967 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:03,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:03,968 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:03,968 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:04,063 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:04,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:17:04,064 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:04,064 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 02:17:04,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:04,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:04,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable464 [2022-12-13 02:17:04,064 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 02:17:04,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:04,064 INFO L85 PathProgramCache]: Analyzing trace with hash 526849158, now seen corresponding path program 1 times [2022-12-13 02:17:04,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:04,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235051542] [2022-12-13 02:17:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:04,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:04,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235051542] [2022-12-13 02:17:04,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235051542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:04,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:04,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:04,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939569523] [2022-12-13 02:17:04,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:04,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:04,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:04,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:04,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:04,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:04,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:04,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:04,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:04,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:04,187 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:04,187 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:04,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:04,188 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:04,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:04,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:04,189 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:04,189 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:04,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:04,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:04,191 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:04,191 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:04,191 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:04,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:04,192 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:04,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:04,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:04,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:04,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:04,200 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:04,200 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:04,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:04,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:04,201 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:04,289 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:04,289 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:17:04,289 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:04,289 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 02:17:04,289 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:04,289 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:04,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable465 [2022-12-13 02:17:04,289 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 02:17:04,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:04,290 INFO L85 PathProgramCache]: Analyzing trace with hash 555478309, now seen corresponding path program 1 times [2022-12-13 02:17:04,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:04,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371919327] [2022-12-13 02:17:04,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:04,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:04,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:17:04,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:04,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371919327] [2022-12-13 02:17:04,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371919327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:04,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:04,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:04,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942216662] [2022-12-13 02:17:04,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:04,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:04,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:04,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:04,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:04,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:04,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:04,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:04,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:04,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:04,406 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:04,407 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:04,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:04,408 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:04,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:04,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:04,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:04,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:04,408 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:04,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:04,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:04,411 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:04,411 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:04,411 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:04,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:04,411 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:04,412 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:04,412 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:04,412 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:04,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:04,417 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:04,418 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:04,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:04,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:04,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:04,505 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:04,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:04,506 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:04,506 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 02:17:04,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:04,506 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:04,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable466 [2022-12-13 02:17:04,506 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 02:17:04,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:04,506 INFO L85 PathProgramCache]: Analyzing trace with hash 584107460, now seen corresponding path program 1 times [2022-12-13 02:17:04,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:04,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627070425] [2022-12-13 02:17:04,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:04,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:17:04,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:04,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627070425] [2022-12-13 02:17:04,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627070425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:04,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:04,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:04,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055063528] [2022-12-13 02:17:04,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:04,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:04,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:04,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:04,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:04,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:04,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:04,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:04,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:04,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:04,631 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:04,632 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:04,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:04,633 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:04,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:04,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:04,633 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:04,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:04,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:04,636 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:04,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:04,636 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:04,636 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:04,636 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:04,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:04,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:04,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:04,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:04,642 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:04,642 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:17:04,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:04,643 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:04,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:04,730 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:04,731 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:04,731 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:04,731 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 02:17:04,731 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:04,731 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:04,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable467 [2022-12-13 02:17:04,731 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 02:17:04,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash 612736611, now seen corresponding path program 1 times [2022-12-13 02:17:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:04,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823834472] [2022-12-13 02:17:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:04,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:17:04,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:04,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823834472] [2022-12-13 02:17:04,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823834472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:04,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:04,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:04,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835683395] [2022-12-13 02:17:04,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:04,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:04,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:04,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:04,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:04,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:04,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:04,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:04,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:04,853 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:04,853 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:04,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:04,854 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:04,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:04,855 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:04,855 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:04,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:04,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:04,857 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:04,857 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:04,858 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:04,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:04,858 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:04,858 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:04,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:04,858 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:04,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:04,864 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:04,864 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:04,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:04,864 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:04,864 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:04,955 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:04,956 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:17:04,956 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:04,956 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 02:17:04,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:04,956 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:04,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable468 [2022-12-13 02:17:04,956 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 02:17:04,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash 641365762, now seen corresponding path program 1 times [2022-12-13 02:17:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:04,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533195370] [2022-12-13 02:17:04,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:04,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:05,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:17:05,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:05,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533195370] [2022-12-13 02:17:05,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533195370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:05,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:05,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:05,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244374189] [2022-12-13 02:17:05,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:05,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:05,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:05,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:05,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:05,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:05,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:05,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:05,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:05,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:05,087 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:05,087 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:05,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:05,088 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:05,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:05,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:05,089 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:05,089 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:05,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:05,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:05,091 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:05,091 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:05,091 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:05,091 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:05,092 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:05,092 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:05,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:05,092 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:05,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:05,097 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:05,097 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:05,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:05,098 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:05,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:05,185 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:05,186 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:05,186 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:05,186 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 02:17:05,186 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:05,186 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:05,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable469 [2022-12-13 02:17:05,186 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 02:17:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:05,186 INFO L85 PathProgramCache]: Analyzing trace with hash 669994913, now seen corresponding path program 1 times [2022-12-13 02:17:05,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:05,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781608591] [2022-12-13 02:17:05,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:05,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:17:05,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:05,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781608591] [2022-12-13 02:17:05,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781608591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:05,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:05,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:05,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099797560] [2022-12-13 02:17:05,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:05,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:05,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:05,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:05,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:05,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:05,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:05,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:05,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:05,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:05,298 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:05,298 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:17:05,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:05,299 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:05,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:05,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:05,300 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:05,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:05,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:05,302 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:05,302 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:05,302 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:05,303 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:05,303 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:05,303 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:05,303 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:05,303 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:05,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:05,309 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:05,309 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:17:05,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:05,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:05,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:05,397 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:05,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:05,398 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:05,398 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 02:17:05,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:05,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:05,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable470 [2022-12-13 02:17:05,398 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 02:17:05,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:05,398 INFO L85 PathProgramCache]: Analyzing trace with hash 698624064, now seen corresponding path program 1 times [2022-12-13 02:17:05,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:05,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120526587] [2022-12-13 02:17:05,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:05,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:05,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:17:05,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:05,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120526587] [2022-12-13 02:17:05,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120526587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:05,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:05,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:05,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239788922] [2022-12-13 02:17:05,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:05,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:05,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:05,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:05,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:05,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:05,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:05,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:05,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:05,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:05,540 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:05,541 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:05,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:05,542 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:05,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:05,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:05,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:05,543 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:05,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:05,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:05,545 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:05,545 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:05,546 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:05,546 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:05,546 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:05,546 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:05,546 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:05,546 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:05,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:05,552 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:05,552 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:05,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:05,552 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:05,552 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:05,640 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:05,641 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:05,641 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:05,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:05,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:05,641 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:05,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable471 [2022-12-13 02:17:05,641 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 02:17:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash 727253215, now seen corresponding path program 1 times [2022-12-13 02:17:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:05,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900159381] [2022-12-13 02:17:05,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:05,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:05,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:17:05,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:05,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900159381] [2022-12-13 02:17:05,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900159381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:05,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:05,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:05,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135254742] [2022-12-13 02:17:05,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:05,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:05,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:05,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:05,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:05,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:05,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:05,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:05,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:05,793 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:05,793 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:17:05,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:05,794 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:05,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:05,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:05,795 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:05,795 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:05,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:05,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:05,798 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:05,798 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:05,798 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:05,798 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:05,798 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:05,798 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:05,798 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:05,799 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:05,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:05,804 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:05,804 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:05,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:05,805 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:05,805 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:05,896 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:05,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:17:05,896 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:05,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:05,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:05,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:05,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable472 [2022-12-13 02:17:05,897 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 02:17:05,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:05,897 INFO L85 PathProgramCache]: Analyzing trace with hash 755882366, now seen corresponding path program 1 times [2022-12-13 02:17:05,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:05,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847410457] [2022-12-13 02:17:05,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:05,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:05,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:17:05,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:05,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847410457] [2022-12-13 02:17:05,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847410457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:05,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:05,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554787756] [2022-12-13 02:17:05,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:05,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:05,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:05,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:05,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:05,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:05,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:05,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:05,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:05,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:06,028 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:06,028 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:06,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:06,029 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:06,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:06,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:06,030 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:06,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:06,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:06,032 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:06,032 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:06,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:06,032 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,033 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:06,033 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:06,033 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:06,038 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:06,038 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:06,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:06,039 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:06,039 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:06,126 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:06,126 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:06,126 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:06,126 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 02:17:06,126 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:06,126 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:06,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable473 [2022-12-13 02:17:06,126 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 02:17:06,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:06,127 INFO L85 PathProgramCache]: Analyzing trace with hash 784511517, now seen corresponding path program 1 times [2022-12-13 02:17:06,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:06,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202628204] [2022-12-13 02:17:06,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:06,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:06,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:17:06,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:06,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202628204] [2022-12-13 02:17:06,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202628204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:06,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:06,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:06,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124631616] [2022-12-13 02:17:06,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:06,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:06,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:06,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:06,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:06,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:06,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:06,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:06,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:06,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:06,247 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:06,248 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:06,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:06,249 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:06,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:06,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:06,249 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:06,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:06,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:06,252 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,252 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:06,252 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:06,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:06,252 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,252 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:06,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:06,253 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:06,258 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:06,258 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:06,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:06,259 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:06,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:06,345 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:06,346 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:06,346 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:06,346 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 02:17:06,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:06,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:06,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable474 [2022-12-13 02:17:06,346 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 02:17:06,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:06,346 INFO L85 PathProgramCache]: Analyzing trace with hash 813140668, now seen corresponding path program 1 times [2022-12-13 02:17:06,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:06,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515852641] [2022-12-13 02:17:06,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:06,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:06,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:17:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:06,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515852641] [2022-12-13 02:17:06,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515852641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:06,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:06,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:06,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814673493] [2022-12-13 02:17:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:06,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:06,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:06,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:06,408 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:06,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:06,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:06,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:06,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:06,492 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:06,492 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:06,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:06,493 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:06,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:06,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:06,494 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:06,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:06,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:06,496 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,496 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:06,497 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:06,497 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:06,497 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,497 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:06,497 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:06,497 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:06,503 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:06,503 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:06,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:06,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:06,504 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:06,589 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:06,590 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:06,590 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:06,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:06,590 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:06,590 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:06,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable475 [2022-12-13 02:17:06,590 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 02:17:06,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:06,590 INFO L85 PathProgramCache]: Analyzing trace with hash 841769819, now seen corresponding path program 1 times [2022-12-13 02:17:06,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:06,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785257320] [2022-12-13 02:17:06,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:06,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:06,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:17:06,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:06,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785257320] [2022-12-13 02:17:06,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785257320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:06,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:06,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:06,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442080446] [2022-12-13 02:17:06,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:06,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:06,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:06,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:06,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:06,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:06,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:06,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:06,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:06,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:06,703 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:06,703 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:06,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:06,704 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:06,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:06,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:06,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:06,705 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:06,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:06,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:06,707 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:06,707 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:06,708 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:06,708 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,708 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:06,708 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:06,708 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:06,713 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:06,714 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:06,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:06,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:06,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:06,801 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:06,802 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:06,802 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:06,802 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 02:17:06,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:06,802 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:06,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable476 [2022-12-13 02:17:06,802 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 02:17:06,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:06,802 INFO L85 PathProgramCache]: Analyzing trace with hash 870398970, now seen corresponding path program 1 times [2022-12-13 02:17:06,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:06,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061583892] [2022-12-13 02:17:06,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:06,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:06,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:17:06,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:06,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061583892] [2022-12-13 02:17:06,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061583892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:06,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:06,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:06,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036461848] [2022-12-13 02:17:06,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:06,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:06,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:06,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:06,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:06,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:06,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:06,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:06,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:06,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:06,923 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:06,924 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:06,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:06,925 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:06,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:06,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:06,925 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:06,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:06,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:06,928 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,928 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:06,928 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:06,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:06,928 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,928 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:06,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:06,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:06,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:06,934 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:06,934 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:06,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:06,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:06,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:07,021 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:07,022 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:07,022 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:07,022 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 02:17:07,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:07,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:07,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable477 [2022-12-13 02:17:07,022 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 02:17:07,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:07,022 INFO L85 PathProgramCache]: Analyzing trace with hash 899028121, now seen corresponding path program 1 times [2022-12-13 02:17:07,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:07,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372970112] [2022-12-13 02:17:07,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:07,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:17:07,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:07,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372970112] [2022-12-13 02:17:07,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372970112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:07,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:07,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:07,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072450699] [2022-12-13 02:17:07,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:07,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:07,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:07,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:07,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:07,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:07,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:07,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:07,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:07,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:07,144 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:07,144 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:07,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:07,145 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:07,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:07,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:07,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:07,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:07,146 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:07,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:07,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:07,148 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:07,149 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:07,149 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:07,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:07,149 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:07,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:07,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:07,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:07,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:07,155 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:07,155 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:07,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:07,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:07,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:07,242 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:07,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:07,243 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:07,243 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 02:17:07,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:07,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:07,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable478 [2022-12-13 02:17:07,243 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 02:17:07,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:07,243 INFO L85 PathProgramCache]: Analyzing trace with hash 927657272, now seen corresponding path program 1 times [2022-12-13 02:17:07,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:07,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795099116] [2022-12-13 02:17:07,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:07,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:07,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:07,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795099116] [2022-12-13 02:17:07,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795099116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:07,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:07,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:07,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67634328] [2022-12-13 02:17:07,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:07,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:07,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:07,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:07,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:07,290 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:07,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:07,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:07,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:07,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:07,357 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:07,357 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:07,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:07,358 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:07,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:07,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:07,359 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:07,359 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:07,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:07,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:07,361 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:07,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:07,362 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:07,362 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:07,362 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:07,362 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:07,362 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:07,362 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:07,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:07,368 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:07,368 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:07,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:07,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:07,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:07,456 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:07,456 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:07,456 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:07,457 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 02:17:07,457 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:07,457 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:07,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable479 [2022-12-13 02:17:07,457 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 02:17:07,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:07,457 INFO L85 PathProgramCache]: Analyzing trace with hash 956286423, now seen corresponding path program 1 times [2022-12-13 02:17:07,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:07,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902661805] [2022-12-13 02:17:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:07,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:07,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:17:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:07,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902661805] [2022-12-13 02:17:07,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902661805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:07,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:07,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:07,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504993669] [2022-12-13 02:17:07,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:07,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:07,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:07,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:07,505 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:07,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:07,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:07,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:07,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:07,573 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:07,573 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:07,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:07,574 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:07,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:07,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:07,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:07,574 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:07,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:07,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:07,577 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:07,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:07,577 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:07,578 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:07,578 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:07,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:07,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:07,578 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:07,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:07,584 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:07,584 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:07,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:07,584 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:07,584 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:07,675 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:07,676 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:17:07,676 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:07,676 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 02:17:07,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:07,676 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:07,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable480 [2022-12-13 02:17:07,676 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 02:17:07,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash 984915574, now seen corresponding path program 1 times [2022-12-13 02:17:07,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:07,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702780873] [2022-12-13 02:17:07,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:07,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:07,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:17:07,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:07,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702780873] [2022-12-13 02:17:07,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702780873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:07,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:07,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:07,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270941583] [2022-12-13 02:17:07,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:07,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:07,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:07,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:07,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:07,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:07,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:07,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:07,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:07,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:07,800 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:07,800 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:07,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:07,801 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:07,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:07,802 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:07,802 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:07,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:07,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:07,805 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:07,805 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:07,805 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:07,805 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:07,805 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:07,805 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:07,805 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:07,805 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:07,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:07,811 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:07,811 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:07,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:07,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:07,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:07,905 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:07,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:17:07,905 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:07,905 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 02:17:07,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:07,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:07,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable481 [2022-12-13 02:17:07,906 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 02:17:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1013544725, now seen corresponding path program 1 times [2022-12-13 02:17:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:07,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022121115] [2022-12-13 02:17:07,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:07,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:07,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:17:07,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:07,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022121115] [2022-12-13 02:17:07,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022121115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:07,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:07,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:07,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433862044] [2022-12-13 02:17:07,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:07,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:07,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:07,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:07,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:07,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:07,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:07,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:07,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:07,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:08,021 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:08,021 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:08,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:08,022 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:08,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:08,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:08,022 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:08,023 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:08,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:08,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:08,025 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,025 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:08,025 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:08,026 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:08,026 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,026 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:08,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:08,026 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:08,032 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:08,032 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:08,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:08,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:08,033 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:08,123 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:08,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:17:08,123 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:08,123 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 02:17:08,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:08,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:08,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable482 [2022-12-13 02:17:08,123 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 02:17:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:08,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1042173876, now seen corresponding path program 1 times [2022-12-13 02:17:08,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:08,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460121732] [2022-12-13 02:17:08,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:08,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:08,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:08,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:08,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460121732] [2022-12-13 02:17:08,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460121732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:08,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:08,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:08,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937901137] [2022-12-13 02:17:08,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:08,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:08,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:08,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:08,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:08,170 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:08,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:08,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:08,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:08,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:08,246 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:08,246 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:08,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:08,248 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:08,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:08,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:08,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:08,248 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:08,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:08,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:08,251 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,251 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:08,251 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:08,251 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:08,251 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,251 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:08,252 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:08,252 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:08,257 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:08,257 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:08,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:08,258 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:08,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:08,345 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:08,346 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:08,346 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:08,346 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 02:17:08,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:08,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:08,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable483 [2022-12-13 02:17:08,346 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 02:17:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1070803027, now seen corresponding path program 1 times [2022-12-13 02:17:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:08,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827928331] [2022-12-13 02:17:08,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:08,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:08,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:17:08,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:08,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827928331] [2022-12-13 02:17:08,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827928331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:08,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:08,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:08,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254876193] [2022-12-13 02:17:08,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:08,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:08,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:08,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:08,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:08,394 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:08,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:08,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:08,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:08,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:08,459 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:08,460 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:08,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1095 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:08,461 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:08,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:08,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:08,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:08,461 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:08,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:08,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:08,464 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,464 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:08,464 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:08,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:08,464 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,465 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:08,465 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:08,465 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:08,470 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:08,470 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:08,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:08,471 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:08,471 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:08,558 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:08,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:08,559 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:08,559 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 02:17:08,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:08,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:08,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable484 [2022-12-13 02:17:08,559 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 02:17:08,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1099432178, now seen corresponding path program 1 times [2022-12-13 02:17:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:08,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290594579] [2022-12-13 02:17:08,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:08,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:08,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:17:08,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:08,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290594579] [2022-12-13 02:17:08,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290594579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:08,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:08,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:08,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479787115] [2022-12-13 02:17:08,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:08,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:08,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:08,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:08,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:08,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:08,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:08,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:08,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:08,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:08,684 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:08,684 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:08,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:08,685 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:08,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:08,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:08,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:08,686 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:08,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:08,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:08,689 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,689 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:08,689 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:08,689 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:08,689 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,689 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:08,689 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:08,689 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:08,695 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:08,695 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:08,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:08,696 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:08,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:08,783 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:08,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:08,784 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:08,784 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 02:17:08,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:08,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:08,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable485 [2022-12-13 02:17:08,784 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 02:17:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:08,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1128061329, now seen corresponding path program 1 times [2022-12-13 02:17:08,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:08,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000717605] [2022-12-13 02:17:08,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:08,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:08,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:17:08,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:08,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000717605] [2022-12-13 02:17:08,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000717605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:08,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:08,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:08,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788218511] [2022-12-13 02:17:08,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:08,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:08,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:08,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:08,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:08,839 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:08,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:08,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:08,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:08,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:08,918 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:08,918 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:08,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:08,919 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:08,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:08,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:08,920 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:08,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:08,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:08,922 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,923 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:08,923 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:08,923 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:08,923 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,923 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:08,923 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:08,923 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:08,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:08,929 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:08,929 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:08,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:08,929 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:08,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:09,019 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:09,019 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:09,019 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:09,019 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 02:17:09,019 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:09,020 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:09,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable486 [2022-12-13 02:17:09,020 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 02:17:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:09,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1156690480, now seen corresponding path program 1 times [2022-12-13 02:17:09,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:09,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584588124] [2022-12-13 02:17:09,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:09,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:17:09,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:09,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584588124] [2022-12-13 02:17:09,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584588124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:09,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:09,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:09,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775901994] [2022-12-13 02:17:09,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:09,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:09,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:09,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:09,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:09,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:09,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:09,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:09,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:09,133 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:09,134 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:09,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:09,135 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:09,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:09,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:09,135 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:09,135 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:09,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:09,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:09,138 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:09,138 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:09,138 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:09,138 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:09,138 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:09,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:09,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:09,139 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:09,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:09,144 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:09,144 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:09,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:09,145 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:09,145 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:09,231 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:09,231 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:09,231 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:09,231 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 02:17:09,231 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:09,231 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:09,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable487 [2022-12-13 02:17:09,231 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 02:17:09,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1185319631, now seen corresponding path program 1 times [2022-12-13 02:17:09,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:09,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990777982] [2022-12-13 02:17:09,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:09,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:09,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:17:09,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:09,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990777982] [2022-12-13 02:17:09,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990777982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:09,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:09,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:09,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470739314] [2022-12-13 02:17:09,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:09,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:09,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:09,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:09,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:09,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:09,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:09,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:09,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:09,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:09,372 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:09,373 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:17:09,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:09,374 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:09,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:09,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:09,374 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:09,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:09,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:09,377 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:09,377 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:09,377 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:09,377 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:09,377 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:09,377 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:09,377 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:09,378 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:09,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:09,384 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:09,384 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:09,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:09,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:09,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:09,472 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:09,473 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:09,473 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:09,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:09,473 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:09,473 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:09,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable488 [2022-12-13 02:17:09,473 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 02:17:09,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:09,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1213948782, now seen corresponding path program 1 times [2022-12-13 02:17:09,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:09,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582760048] [2022-12-13 02:17:09,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:09,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:09,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:17:09,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:09,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582760048] [2022-12-13 02:17:09,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582760048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:09,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:09,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759008965] [2022-12-13 02:17:09,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:09,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:09,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:09,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:09,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:09,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:09,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:09,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:09,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:09,591 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:09,592 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:09,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:09,593 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:09,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:09,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:09,594 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:09,594 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:09,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:09,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:09,597 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:09,597 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:09,597 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:09,597 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:09,597 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:09,598 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:09,598 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:09,598 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:09,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:09,603 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:09,603 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:09,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:09,604 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:09,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:09,691 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:09,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:09,692 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:09,692 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 02:17:09,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:09,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:09,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable489 [2022-12-13 02:17:09,692 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 02:17:09,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:09,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1242577933, now seen corresponding path program 1 times [2022-12-13 02:17:09,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:09,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542068905] [2022-12-13 02:17:09,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:09,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:09,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:17:09,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:09,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542068905] [2022-12-13 02:17:09,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542068905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:09,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:09,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:09,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163725941] [2022-12-13 02:17:09,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:09,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:09,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:09,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:09,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:09,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:09,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:09,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:09,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:09,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:09,823 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:09,824 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:09,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:09,825 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:09,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:09,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:09,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:09,825 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:09,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:09,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:09,828 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:09,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:09,828 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:09,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:09,828 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:09,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:09,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:09,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:09,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:09,834 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:09,834 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:09,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:09,835 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:09,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:09,923 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:09,923 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:09,923 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:09,923 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 02:17:09,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:09,923 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:09,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable490 [2022-12-13 02:17:09,924 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 02:17:09,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:09,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1271207084, now seen corresponding path program 1 times [2022-12-13 02:17:09,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:09,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026514036] [2022-12-13 02:17:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:09,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:09,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:17:09,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:09,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026514036] [2022-12-13 02:17:09,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026514036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:09,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:09,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:09,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518869574] [2022-12-13 02:17:09,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:09,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:09,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:09,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:09,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:09,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:09,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:10,039 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:10,039 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:10,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:10,040 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:10,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:10,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:10,041 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:10,041 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:10,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:10,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:10,044 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:10,044 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:10,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:10,044 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,044 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:10,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:10,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:10,050 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:10,050 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:10,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:10,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:10,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:10,138 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:10,138 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:10,138 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:10,138 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 02:17:10,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:10,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:10,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable491 [2022-12-13 02:17:10,139 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 02:17:10,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1299836235, now seen corresponding path program 1 times [2022-12-13 02:17:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:10,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020026977] [2022-12-13 02:17:10,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:10,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 02:17:10,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:10,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020026977] [2022-12-13 02:17:10,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020026977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:10,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:10,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:10,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404636712] [2022-12-13 02:17:10,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:10,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:10,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:10,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:10,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:10,186 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:10,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:10,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:10,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:10,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:10,262 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:10,262 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:10,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:10,263 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:10,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:10,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:10,264 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:10,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:10,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:10,267 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,267 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:10,267 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:10,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:10,267 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,267 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:10,267 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:10,267 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:10,273 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:10,273 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:10,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:10,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:10,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:10,361 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:10,361 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:10,362 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:10,362 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 02:17:10,362 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:10,362 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:10,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable492 [2022-12-13 02:17:10,362 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 02:17:10,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1328465386, now seen corresponding path program 1 times [2022-12-13 02:17:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:10,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051617096] [2022-12-13 02:17:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:10,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:10,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:17:10,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:10,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051617096] [2022-12-13 02:17:10,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051617096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:10,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:10,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529473461] [2022-12-13 02:17:10,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:10,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:10,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:10,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:10,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:10,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:10,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:10,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:10,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:10,477 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:10,477 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:10,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:10,478 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:10,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:10,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:10,479 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:10,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:10,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:10,482 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,482 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:10,482 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:10,482 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:10,482 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,482 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:10,482 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:10,482 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:10,488 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:10,488 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:10,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:10,489 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:10,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:10,575 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:10,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:10,576 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:10,576 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 02:17:10,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:10,576 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:10,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable493 [2022-12-13 02:17:10,576 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 02:17:10,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1357094537, now seen corresponding path program 1 times [2022-12-13 02:17:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:10,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948980044] [2022-12-13 02:17:10,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:10,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:10,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:17:10,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:10,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948980044] [2022-12-13 02:17:10,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948980044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:10,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:10,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:10,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515307677] [2022-12-13 02:17:10,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:10,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:10,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:10,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:10,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:10,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:10,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:10,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:10,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:10,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:10,698 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:10,698 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:10,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:10,699 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:10,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:10,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:10,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:10,700 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:10,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:10,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:10,703 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:10,703 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:10,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:10,703 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:10,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:10,703 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:10,717 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:10,717 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:10,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:10,718 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:10,718 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:10,803 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:10,803 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:17:10,803 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:10,804 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 02:17:10,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:10,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:10,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable494 [2022-12-13 02:17:10,804 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 02:17:10,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:10,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1385723688, now seen corresponding path program 1 times [2022-12-13 02:17:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:10,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895407204] [2022-12-13 02:17:10,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:10,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:17:10,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:10,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895407204] [2022-12-13 02:17:10,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895407204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:10,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:10,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:10,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800208452] [2022-12-13 02:17:10,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:10,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:10,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:10,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:10,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:10,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:10,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:10,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:10,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:10,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:10,930 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:10,931 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:10,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:10,932 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:10,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:10,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:10,932 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:10,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:10,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:10,935 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,935 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:10,935 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:10,935 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:10,935 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,935 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:10,935 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:10,936 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:10,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:10,941 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:10,941 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:10,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:10,942 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:10,942 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:11,030 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:11,030 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:11,030 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:11,030 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 02:17:11,031 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:11,031 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:11,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable495 [2022-12-13 02:17:11,031 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 02:17:11,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:11,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1414352839, now seen corresponding path program 1 times [2022-12-13 02:17:11,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:11,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53049968] [2022-12-13 02:17:11,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:11,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:11,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:17:11,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:11,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53049968] [2022-12-13 02:17:11,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53049968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:11,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:11,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:11,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681552552] [2022-12-13 02:17:11,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:11,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:11,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:11,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:11,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:11,094 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:11,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:11,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:11,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:11,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:11,170 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:11,170 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:11,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:11,171 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:11,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:11,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:11,171 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:11,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:11,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:11,174 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:11,174 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:11,174 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:11,174 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:11,175 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:11,175 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:11,175 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:11,175 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:11,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:11,180 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:11,181 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:11,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:11,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:11,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:11,269 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:11,269 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:11,269 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:11,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:11,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:11,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:11,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable496 [2022-12-13 02:17:11,270 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 02:17:11,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:11,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1442981990, now seen corresponding path program 1 times [2022-12-13 02:17:11,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:11,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139313535] [2022-12-13 02:17:11,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:11,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:11,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:17:11,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:11,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139313535] [2022-12-13 02:17:11,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139313535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:11,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:11,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:11,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865373367] [2022-12-13 02:17:11,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:11,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:11,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:11,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:11,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:11,319 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:11,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:11,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:11,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:11,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:11,386 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:11,386 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:11,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:11,387 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:11,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:11,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:11,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:11,388 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:11,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:11,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:11,390 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:11,390 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:11,390 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:11,390 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:11,390 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:11,391 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:11,391 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:11,391 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:11,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:11,397 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:11,397 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:11,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:11,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:11,397 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:11,485 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:11,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:11,486 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:11,486 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 02:17:11,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:11,486 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:11,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable497 [2022-12-13 02:17:11,486 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 02:17:11,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1471611141, now seen corresponding path program 1 times [2022-12-13 02:17:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:11,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122625009] [2022-12-13 02:17:11,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:11,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:17:11,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:11,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122625009] [2022-12-13 02:17:11,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122625009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:11,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:11,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:11,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629000712] [2022-12-13 02:17:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:11,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:11,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:11,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:11,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:11,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:11,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:11,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:11,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:11,609 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:11,609 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:11,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:11,610 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:11,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:11,611 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:11,611 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:11,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:11,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:11,613 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:11,614 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:11,614 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:11,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:11,614 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:11,614 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:11,614 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:11,614 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:11,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:11,620 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:11,620 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:11,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:11,620 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:11,621 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:11,728 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:11,728 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 02:17:11,728 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:11,728 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 02:17:11,728 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:11,729 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:11,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable498 [2022-12-13 02:17:11,729 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 02:17:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:11,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1500240292, now seen corresponding path program 1 times [2022-12-13 02:17:11,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:11,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330272378] [2022-12-13 02:17:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:11,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:17:11,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:11,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330272378] [2022-12-13 02:17:11,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330272378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:11,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:11,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:11,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865131217] [2022-12-13 02:17:11,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:11,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:11,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:11,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:11,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:11,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:11,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:11,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:11,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:11,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:11,875 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:11,875 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:11,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:11,876 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:11,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:11,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:11,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:11,877 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:11,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:11,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:11,879 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:11,879 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:11,880 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:11,880 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:11,880 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:11,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:11,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:11,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:11,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:11,886 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:11,886 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:11,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:11,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:11,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:11,974 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:11,975 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:11,975 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:11,975 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 02:17:11,975 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:11,975 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:11,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable499 [2022-12-13 02:17:11,975 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 02:17:11,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:11,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1528869443, now seen corresponding path program 1 times [2022-12-13 02:17:11,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:11,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541506083] [2022-12-13 02:17:11,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:11,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:12,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:17:12,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:12,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541506083] [2022-12-13 02:17:12,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541506083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:12,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:12,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:12,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588033472] [2022-12-13 02:17:12,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:12,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:12,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:12,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:12,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:12,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:12,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:12,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:12,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:12,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:12,107 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:12,108 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:12,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:12,109 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:12,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:12,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:12,110 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:12,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:12,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:12,114 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:12,114 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:12,114 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:12,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:12,114 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:12,115 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:12,115 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:12,115 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:12,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:12,123 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:12,123 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:12,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:12,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:12,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:12,213 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:12,213 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:17:12,213 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:12,213 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 02:17:12,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:12,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:12,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable500 [2022-12-13 02:17:12,214 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 02:17:12,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:12,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1557498594, now seen corresponding path program 1 times [2022-12-13 02:17:12,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:12,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260174996] [2022-12-13 02:17:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:12,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:12,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:17:12,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:12,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260174996] [2022-12-13 02:17:12,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260174996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:12,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:12,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:12,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395810368] [2022-12-13 02:17:12,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:12,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:12,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:12,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:12,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:12,278 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:12,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:12,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:12,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:12,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:12,347 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:12,347 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:12,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:12,348 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:12,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:12,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:12,348 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:12,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:12,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:12,351 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:12,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:12,351 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:12,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:12,351 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:12,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:12,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:12,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:12,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:12,357 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:12,357 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:12,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:12,358 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:12,358 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:12,447 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:12,447 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:12,447 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:12,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:12,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:12,447 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:12,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable501 [2022-12-13 02:17:12,447 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 02:17:12,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1586127745, now seen corresponding path program 1 times [2022-12-13 02:17:12,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:12,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512317966] [2022-12-13 02:17:12,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:12,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:17:12,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:12,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512317966] [2022-12-13 02:17:12,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512317966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:12,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:12,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:12,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797637476] [2022-12-13 02:17:12,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:12,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:12,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:12,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:12,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:12,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:12,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:12,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:12,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:12,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:12,590 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:12,590 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:12,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:12,592 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:12,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:12,592 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:12,592 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:12,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:12,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:12,595 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:12,595 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:12,595 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:12,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:12,595 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:12,595 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:12,595 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:12,596 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:12,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:12,601 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:12,601 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:12,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:12,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:12,602 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:12,694 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:12,695 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:17:12,695 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:12,695 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 02:17:12,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:12,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:12,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable502 [2022-12-13 02:17:12,695 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 02:17:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:12,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1614756896, now seen corresponding path program 1 times [2022-12-13 02:17:12,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:12,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499886109] [2022-12-13 02:17:12,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:12,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:12,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:17:12,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:12,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499886109] [2022-12-13 02:17:12,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499886109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:12,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:12,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:12,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833698858] [2022-12-13 02:17:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:12,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:12,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:12,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:12,750 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:12,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:12,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:12,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:12,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:12,825 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:12,825 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:12,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:12,826 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:12,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:12,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:12,827 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:12,827 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:12,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:12,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:12,830 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:12,830 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:12,830 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:12,830 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:12,830 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:12,830 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:12,830 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:12,830 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:12,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:12,836 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:12,836 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:12,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:12,837 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:12,837 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:12,923 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:12,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:12,924 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:12,924 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 02:17:12,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:12,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:12,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable503 [2022-12-13 02:17:12,924 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 02:17:12,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1643386047, now seen corresponding path program 1 times [2022-12-13 02:17:12,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:12,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179088064] [2022-12-13 02:17:12,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:12,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:17:12,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:12,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179088064] [2022-12-13 02:17:12,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179088064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:12,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:12,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:12,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502606529] [2022-12-13 02:17:12,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:12,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:12,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:12,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:12,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:12,971 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:12,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:12,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:12,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:12,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:13,046 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:13,046 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:13,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:13,047 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:13,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:13,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:13,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:13,048 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:13,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:13,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:13,050 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,050 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:13,051 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:13,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:13,051 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:13,051 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:13,051 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:13,057 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:13,057 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:13,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:13,057 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:13,057 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:13,145 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:13,146 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:13,146 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:13,146 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 02:17:13,146 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:13,146 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:13,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable504 [2022-12-13 02:17:13,146 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 02:17:13,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:13,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1672015198, now seen corresponding path program 1 times [2022-12-13 02:17:13,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:13,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539912308] [2022-12-13 02:17:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:13,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:13,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:17:13,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:13,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539912308] [2022-12-13 02:17:13,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539912308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:13,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:13,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:13,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490413354] [2022-12-13 02:17:13,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:13,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:13,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:13,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:13,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:13,194 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:13,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:13,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:13,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:13,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:13,270 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:13,270 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:13,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:13,272 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:13,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:13,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:13,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:13,272 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:13,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:13,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:13,275 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,275 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:13,276 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:13,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:13,276 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:13,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:13,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:13,283 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:13,283 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:17:13,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:13,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:13,284 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:13,370 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:13,371 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:13,371 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:13,371 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 02:17:13,371 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:13,371 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:13,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable505 [2022-12-13 02:17:13,372 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 02:17:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1700644349, now seen corresponding path program 1 times [2022-12-13 02:17:13,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:13,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525647096] [2022-12-13 02:17:13,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:13,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:13,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:17:13,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:13,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525647096] [2022-12-13 02:17:13,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525647096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:13,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:13,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:13,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311419987] [2022-12-13 02:17:13,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:13,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:13,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:13,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:13,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:13,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:13,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:13,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:13,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:13,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:13,504 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:13,505 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:13,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:13,506 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:13,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:13,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:13,506 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:13,506 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:13,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:13,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:13,509 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,509 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:13,509 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:13,510 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:13,510 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,510 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:13,510 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:13,510 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:13,516 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:13,516 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:13,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:13,516 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:13,516 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:13,603 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:13,603 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:13,603 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:13,603 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 02:17:13,603 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:13,603 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:13,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable506 [2022-12-13 02:17:13,604 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 02:17:13,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:13,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1729273500, now seen corresponding path program 1 times [2022-12-13 02:17:13,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:13,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272519595] [2022-12-13 02:17:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:13,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:13,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:17:13,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:13,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272519595] [2022-12-13 02:17:13,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272519595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:13,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:13,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:13,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357067229] [2022-12-13 02:17:13,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:13,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:13,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:13,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:13,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:13,662 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:13,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:13,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:13,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:13,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:13,748 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:13,748 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:13,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:13,749 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:13,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:13,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:13,750 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:13,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:13,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:13,752 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,752 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:13,752 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:13,752 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:13,752 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:13,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:13,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:13,759 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:13,759 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:13,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:13,759 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:13,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:13,847 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:13,848 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:13,848 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:13,848 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 02:17:13,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:13,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:13,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable507 [2022-12-13 02:17:13,849 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 02:17:13,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1757902651, now seen corresponding path program 1 times [2022-12-13 02:17:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:13,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279985158] [2022-12-13 02:17:13,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:13,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:17:13,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:13,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279985158] [2022-12-13 02:17:13,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279985158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:13,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:13,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:13,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398412437] [2022-12-13 02:17:13,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:13,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:13,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:13,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:13,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:13,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:13,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:13,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:13,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:13,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:13,972 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:13,972 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:13,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:13,973 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:13,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:13,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:13,974 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:13,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:13,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:13,977 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:13,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:13,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:13,977 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:13,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:13,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:13,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:13,987 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:13,987 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:13,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:13,988 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:13,988 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:14,092 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:14,093 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:17:14,093 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:14,093 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 02:17:14,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:14,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:14,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable508 [2022-12-13 02:17:14,093 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 02:17:14,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:14,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1786531802, now seen corresponding path program 1 times [2022-12-13 02:17:14,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:14,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743009896] [2022-12-13 02:17:14,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:14,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:14,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:17:14,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:14,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743009896] [2022-12-13 02:17:14,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743009896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:14,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:14,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:14,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380717528] [2022-12-13 02:17:14,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:14,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:14,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:14,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:14,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:14,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:14,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:14,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:14,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:14,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:14,220 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:14,220 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:14,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:14,221 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:14,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:14,222 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:14,222 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:14,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:14,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:14,224 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:14,225 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:14,225 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:14,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:14,225 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:14,225 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:14,225 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:14,225 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:14,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:14,234 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:14,234 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:14,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:14,235 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:14,235 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:14,323 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:14,323 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:17:14,323 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:14,324 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 02:17:14,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:14,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:14,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable509 [2022-12-13 02:17:14,324 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 02:17:14,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:14,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1815160953, now seen corresponding path program 1 times [2022-12-13 02:17:14,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:14,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977544722] [2022-12-13 02:17:14,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:14,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:14,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:17:14,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:14,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977544722] [2022-12-13 02:17:14,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977544722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:14,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:14,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:14,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886411816] [2022-12-13 02:17:14,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:14,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:14,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:14,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:14,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:14,381 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:14,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:14,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:14,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:14,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:14,457 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:14,458 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:14,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:14,459 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:14,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:14,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:14,459 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:14,459 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:14,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:14,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:14,462 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:14,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:14,462 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:14,462 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:14,462 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:14,463 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:14,463 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:14,463 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:14,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:14,470 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:14,470 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:14,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:14,471 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:14,471 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:14,558 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:14,558 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:14,559 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:14,559 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 02:17:14,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:14,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:14,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable510 [2022-12-13 02:17:14,559 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 02:17:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1843790104, now seen corresponding path program 1 times [2022-12-13 02:17:14,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:14,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798677051] [2022-12-13 02:17:14,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:14,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:14,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:17:14,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:14,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798677051] [2022-12-13 02:17:14,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798677051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:14,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:14,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638434656] [2022-12-13 02:17:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:14,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:14,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:14,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:14,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:14,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:14,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:14,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:14,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:14,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:14,717 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:14,717 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:14,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:14,719 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:14,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:14,719 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:14,719 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:14,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:14,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:14,722 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:14,723 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:14,723 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:14,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:14,723 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:14,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:14,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:14,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:14,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:14,738 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:14,739 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:14,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:14,739 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:14,739 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:14,826 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:14,826 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:17:14,826 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:14,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:14,827 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:14,827 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:14,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable511 [2022-12-13 02:17:14,827 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 02:17:14,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:14,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1872419255, now seen corresponding path program 1 times [2022-12-13 02:17:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:14,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008965268] [2022-12-13 02:17:14,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:14,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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:17:14,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:14,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008965268] [2022-12-13 02:17:14,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008965268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:14,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:14,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690243564] [2022-12-13 02:17:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:14,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:14,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:14,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:14,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:14,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:14,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:14,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:14,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:14,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:14,970 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:14,970 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:14,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:14,971 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:14,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:14,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:14,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:14,972 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:14,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:14,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:14,975 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:14,975 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:14,975 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:14,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:14,975 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:14,976 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:14,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:14,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:14,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:14,985 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:14,985 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:14,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:14,986 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:14,986 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:15,093 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:15,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:17:15,094 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:15,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:15,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:15,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:15,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable512 [2022-12-13 02:17:15,095 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 02:17:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1901048406, now seen corresponding path program 1 times [2022-12-13 02:17:15,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:15,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861899528] [2022-12-13 02:17:15,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:15,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:15,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:17:15,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:15,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861899528] [2022-12-13 02:17:15,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861899528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:15,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:15,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:15,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790768017] [2022-12-13 02:17:15,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:15,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:15,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:15,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:15,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:15,153 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:15,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:15,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:15,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:15,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:15,230 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:15,231 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:15,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:15,232 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:15,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:15,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:15,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:15,233 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:15,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:15,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:15,236 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:15,236 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:15,237 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:15,237 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:15,237 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:15,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:15,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:15,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:15,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:15,245 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:15,246 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:15,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:15,246 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:15,246 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:15,357 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:15,359 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:17:15,359 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:15,359 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 02:17:15,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:15,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:15,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable513 [2022-12-13 02:17:15,359 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 02:17:15,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:15,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1929677557, now seen corresponding path program 1 times [2022-12-13 02:17:15,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:15,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439388807] [2022-12-13 02:17:15,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:15,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:15,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:17:15,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:15,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439388807] [2022-12-13 02:17:15,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439388807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:15,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:15,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969577262] [2022-12-13 02:17:15,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:15,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:15,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:15,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:15,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:15,413 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:15,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:15,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:15,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:15,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:15,500 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:15,500 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:15,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:15,502 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:15,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:15,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:15,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:15,503 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:15,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:15,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:15,506 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:15,506 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:15,506 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:15,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:15,507 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:15,507 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:15,507 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:15,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:15,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:15,515 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:15,515 INFO L131 PetriNetUnfolder]: For 435/444 co-relation queries the response was YES. [2022-12-13 02:17:15,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/444 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:15,516 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:15,516 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:15,622 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:15,623 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:17:15,623 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:15,623 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 02:17:15,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:15,623 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:15,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable514 [2022-12-13 02:17:15,623 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 02:17:15,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:15,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1958306708, now seen corresponding path program 1 times [2022-12-13 02:17:15,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:15,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57752003] [2022-12-13 02:17:15,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:15,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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 02:17:15,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:15,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57752003] [2022-12-13 02:17:15,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57752003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:15,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:15,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:15,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890711412] [2022-12-13 02:17:15,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:15,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:15,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:15,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:15,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:15,683 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:15,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:15,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:15,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:15,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:15,754 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:15,754 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:15,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:15,755 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:15,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:15,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:15,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:15,756 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:15,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:15,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:15,759 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:15,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:15,759 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:15,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:15,759 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:15,759 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:15,759 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:15,759 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:15,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:15,765 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:15,765 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:15,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:15,766 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:15,766 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:15,860 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:15,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:17:15,862 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:15,862 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 02:17:15,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:15,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:15,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable515 [2022-12-13 02:17:15,862 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 02:17:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:15,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1986935859, now seen corresponding path program 1 times [2022-12-13 02:17:15,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:15,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266440354] [2022-12-13 02:17:15,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:15,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:15,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:17:15,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:15,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266440354] [2022-12-13 02:17:15,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266440354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:15,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:15,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:15,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187125926] [2022-12-13 02:17:15,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:15,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:15,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:15,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:15,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:15,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:15,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:15,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:15,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:15,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:16,006 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:16,006 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:16,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:16,007 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:16,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:16,008 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:16,008 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:16,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:16,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:16,010 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:16,011 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:16,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:16,011 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,011 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:16,011 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:16,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:16,017 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:16,017 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:17:16,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:16,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:16,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:16,105 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:16,105 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:16,105 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:16,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:16,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:16,106 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:16,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable516 [2022-12-13 02:17:16,106 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 02:17:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:16,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2015565010, now seen corresponding path program 1 times [2022-12-13 02:17:16,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:16,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551111765] [2022-12-13 02:17:16,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:16,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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 02:17:16,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:16,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551111765] [2022-12-13 02:17:16,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551111765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:16,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:16,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:16,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597184700] [2022-12-13 02:17:16,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:16,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:16,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:16,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:16,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:16,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:16,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:16,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:16,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:16,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:16,229 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:16,229 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:16,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:16,230 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:16,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:16,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:16,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:16,230 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:16,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:16,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:16,233 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,233 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:16,233 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:16,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:16,233 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:16,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:16,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:16,239 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:16,239 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:16,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:16,240 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:16,240 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:16,325 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:16,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:17:16,325 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:16,325 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 02:17:16,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:16,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:16,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable517 [2022-12-13 02:17:16,325 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 02:17:16,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:16,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2044194161, now seen corresponding path program 1 times [2022-12-13 02:17:16,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:16,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014511276] [2022-12-13 02:17:16,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:16,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:16,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:17:16,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:16,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014511276] [2022-12-13 02:17:16,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014511276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:16,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:16,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:16,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635261373] [2022-12-13 02:17:16,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:16,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:16,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:16,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:16,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:16,369 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:16,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:16,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:16,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:16,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:16,434 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:16,434 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:16,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:16,435 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:16,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:16,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:16,435 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:16,436 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:16,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:16,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:16,438 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,438 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:16,438 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:16,438 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:16,438 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,439 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:16,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:16,439 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:16,444 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:16,444 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:16,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:16,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:16,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:16,531 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:16,531 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:16,531 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:16,531 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 02:17:16,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:16,531 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:16,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable518 [2022-12-13 02:17:16,531 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 02:17:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2072823312, now seen corresponding path program 1 times [2022-12-13 02:17:16,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:16,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642987650] [2022-12-13 02:17:16,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:16,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 02:17:16,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:16,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642987650] [2022-12-13 02:17:16,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642987650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:16,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:16,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231292162] [2022-12-13 02:17:16,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:16,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:16,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:16,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:16,577 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:16,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:16,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:16,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:16,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:16,647 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:16,647 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:16,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:16,648 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:16,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:16,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:16,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:16,649 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:16,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:16,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:16,651 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,651 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:16,652 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:16,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:16,652 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,652 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:16,652 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:16,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:16,658 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:16,658 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:16,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:16,658 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:16,658 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:16,743 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:16,744 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:17:16,744 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:16,744 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 02:17:16,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:16,744 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:16,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519 [2022-12-13 02:17:16,744 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 02:17:16,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2101452463, now seen corresponding path program 1 times [2022-12-13 02:17:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:16,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492220903] [2022-12-13 02:17:16,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:16,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:16,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:17:16,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:16,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492220903] [2022-12-13 02:17:16,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492220903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:16,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:16,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108021620] [2022-12-13 02:17:16,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:16,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:16,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:16,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:16,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:16,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:16,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:16,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:16,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:16,891 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:16,892 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:16,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:16,893 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:16,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:16,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:16,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:16,893 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:16,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:16,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:16,896 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:16,896 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:16,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:16,896 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,897 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:16,897 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:16,897 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:16,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:16,902 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:16,902 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:16,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:16,903 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:16,903 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:16,989 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:16,989 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:16,990 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:16,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:16,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:16,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:16,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable520 [2022-12-13 02:17:16,990 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 02:17:16,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:16,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2130081614, now seen corresponding path program 1 times [2022-12-13 02:17:16,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:16,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834520096] [2022-12-13 02:17:16,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:16,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:17,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:17:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:17,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834520096] [2022-12-13 02:17:17,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834520096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:17,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:17,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462713392] [2022-12-13 02:17:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:17,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:17,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:17,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:17,038 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:17,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:17,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:17,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:17,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:17,104 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:17,104 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:17:17,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:17,106 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:17,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:17,106 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:17,106 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:17,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:17,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:17,109 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:17,109 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:17,109 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:17,109 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:17,109 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:17,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:17,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:17,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:17,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:17,115 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:17,115 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:17,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:17,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:17,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:17,203 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:17,204 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:17,204 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:17,204 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 02:17:17,204 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:17,204 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:17,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable521 [2022-12-13 02:17:17,204 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 02:17:17,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2136256531, now seen corresponding path program 1 times [2022-12-13 02:17:17,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:17,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160132935] [2022-12-13 02:17:17,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:17,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:17,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:17:17,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:17,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160132935] [2022-12-13 02:17:17,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160132935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:17,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:17,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:17,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984445681] [2022-12-13 02:17:17,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:17,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:17,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:17,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:17,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:17,252 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:17,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:17,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:17,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:17,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:17,327 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:17,327 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:17,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:17,328 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:17,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:17,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:17,329 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:17,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:17,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:17,331 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:17,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:17,332 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:17,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:17,332 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:17,332 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:17,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:17,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:17,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:17,338 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:17,338 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:17,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:17,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:17,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:17,425 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:17,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:17,425 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:17,425 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 02:17:17,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:17,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:17,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable522 [2022-12-13 02:17:17,426 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 02:17:17,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:17,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2107627380, now seen corresponding path program 1 times [2022-12-13 02:17:17,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:17,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93181724] [2022-12-13 02:17:17,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:17,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:17,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:17:17,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:17,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93181724] [2022-12-13 02:17:17,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93181724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:17,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:17,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:17,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049318720] [2022-12-13 02:17:17,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:17,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:17,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:17,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:17,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:17,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:17,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:17,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:17,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:17,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:17,541 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:17,541 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:17,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:17,542 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:17,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:17,543 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:17,543 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:17,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:17,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:17,545 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:17,546 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:17,546 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:17,546 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:17,546 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:17,546 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:17,546 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:17,547 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:17,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:17,555 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:17,556 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:17,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:17,556 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:17,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:17,663 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:17,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:17:17,664 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:17,664 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 02:17:17,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:17,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:17,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable523 [2022-12-13 02:17:17,664 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 02:17:17,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:17,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2078998229, now seen corresponding path program 1 times [2022-12-13 02:17:17,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:17,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269100361] [2022-12-13 02:17:17,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:17,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:17,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:17:17,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:17,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269100361] [2022-12-13 02:17:17,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269100361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:17,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:17,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066364524] [2022-12-13 02:17:17,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:17,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:17,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:17,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:17,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:17,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:17,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:17,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:17,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:17,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:17,817 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:17,817 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:17,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:17,819 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:17,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:17,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:17,820 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:17,820 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:17,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:17,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:17,824 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:17,824 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:17,824 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:17,824 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:17,824 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:17,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:17,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:17,825 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:17,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:17,832 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:17,832 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:17,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:17,833 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:17,833 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:17,932 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:17,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 02:17:17,933 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:17,933 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 02:17:17,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:17,933 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:17,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable524 [2022-12-13 02:17:17,933 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 02:17:17,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:17,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2050369078, now seen corresponding path program 1 times [2022-12-13 02:17:17,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:17,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356356082] [2022-12-13 02:17:17,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:17,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:17,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:17:17,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:17,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356356082] [2022-12-13 02:17:17,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356356082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:17,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:17,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:17,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371421476] [2022-12-13 02:17:17,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:17,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:17,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:17,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:17,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:17,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:17,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:17,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:17,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:17,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:18,091 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:18,091 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:18,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:18,093 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:18,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:18,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:18,094 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:18,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:18,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:18,098 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:18,098 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:18,098 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:18,098 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:18,098 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:18,098 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:18,099 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:18,099 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:18,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:18,106 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:18,107 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:17:18,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:18,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:18,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:18,220 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:18,221 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:17:18,221 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:18,221 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 02:17:18,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:18,221 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:18,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable525 [2022-12-13 02:17:18,221 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 02:17:18,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:18,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2021739927, now seen corresponding path program 1 times [2022-12-13 02:17:18,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:18,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909317001] [2022-12-13 02:17:18,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:18,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:18,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:17:18,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:18,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909317001] [2022-12-13 02:17:18,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909317001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:18,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:18,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:18,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008883996] [2022-12-13 02:17:18,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:18,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:18,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:18,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:18,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:18,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:18,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:18,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:18,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:18,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:18,357 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:18,357 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:18,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:18,358 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:18,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:18,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:18,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:18,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:18,359 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:18,359 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:18,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:18,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:18,361 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:18,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:18,361 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:18,362 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:18,362 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:18,362 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:18,362 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:18,362 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:18,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:18,367 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:18,368 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:18,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:18,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:18,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:18,456 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:18,457 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:18,457 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:18,457 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 02:17:18,457 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:18,457 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:18,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable526 [2022-12-13 02:17:18,457 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 02:17:18,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1993110776, now seen corresponding path program 1 times [2022-12-13 02:17:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:18,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906032480] [2022-12-13 02:17:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:18,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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:17:18,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:18,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906032480] [2022-12-13 02:17:18,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906032480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:18,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:18,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:18,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46358405] [2022-12-13 02:17:18,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:18,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:18,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:18,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:18,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:18,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:18,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:18,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:18,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:18,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:18,573 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:18,573 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:18,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:18,574 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:18,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:18,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:18,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:18,575 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:18,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:18,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:18,577 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:18,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:18,577 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:18,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:18,577 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:18,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:18,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:18,578 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:18,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:18,583 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:18,584 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:18,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:18,584 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:18,584 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:18,671 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:18,671 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:18,671 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:18,672 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 02:17:18,672 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:18,672 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:18,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable527 [2022-12-13 02:17:18,672 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 02:17:18,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1964481625, now seen corresponding path program 1 times [2022-12-13 02:17:18,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:18,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715712337] [2022-12-13 02:17:18,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:18,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:18,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:17:18,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:18,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715712337] [2022-12-13 02:17:18,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715712337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:18,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:18,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:18,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343596292] [2022-12-13 02:17:18,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:18,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:18,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:18,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:18,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:18,735 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:18,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:18,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:18,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:18,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:18,827 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:18,827 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:18,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:18,828 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:18,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:18,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:18,829 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:18,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:18,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:18,831 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:18,832 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:18,832 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:18,832 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:18,832 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:18,832 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:18,832 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:18,832 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:18,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:18,838 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:18,838 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:18,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:18,838 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:18,839 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:18,925 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:18,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:18,925 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:18,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:18,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:18,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:18,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable528 [2022-12-13 02:17:18,926 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 02:17:18,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:18,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1935852474, now seen corresponding path program 1 times [2022-12-13 02:17:18,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:18,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853665697] [2022-12-13 02:17:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:18,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:18,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:17:18,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:18,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853665697] [2022-12-13 02:17:18,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853665697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:18,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:18,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:18,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675862868] [2022-12-13 02:17:18,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:18,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:18,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:18,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:18,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:18,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:18,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:18,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:18,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:18,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:19,055 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:19,055 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:19,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:19,056 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:19,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:19,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:19,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:19,057 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:19,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:19,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:19,060 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:19,060 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:19,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:19,060 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:19,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:19,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:19,066 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:19,066 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:19,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:19,067 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:19,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:19,156 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:19,157 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:17:19,157 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:19,157 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 02:17:19,157 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:19,157 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:19,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable529 [2022-12-13 02:17:19,157 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 02:17:19,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1907223323, now seen corresponding path program 1 times [2022-12-13 02:17:19,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:19,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826405082] [2022-12-13 02:17:19,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:19,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:19,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:17:19,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:19,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826405082] [2022-12-13 02:17:19,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826405082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:19,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:19,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:19,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187659377] [2022-12-13 02:17:19,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:19,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:19,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:19,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:19,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:19,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:19,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:19,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:19,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:19,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:19,267 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:19,267 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:17:19,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:19,269 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:19,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:19,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:19,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:19,269 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:19,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:19,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:19,272 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:19,272 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:19,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:19,272 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:19,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:19,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:19,278 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:19,278 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:19,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:19,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:19,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:19,366 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:19,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:19,367 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:19,367 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 02:17:19,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:19,367 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:19,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable530 [2022-12-13 02:17:19,367 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 02:17:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1878594172, now seen corresponding path program 1 times [2022-12-13 02:17:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:19,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418448754] [2022-12-13 02:17:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:19,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:19,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:17:19,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:19,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418448754] [2022-12-13 02:17:19,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418448754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:19,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:19,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:19,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61884647] [2022-12-13 02:17:19,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:19,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:19,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:19,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:19,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:19,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:19,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:19,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:19,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:19,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:19,482 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:19,482 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:19,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:19,483 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:19,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:19,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:19,484 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:19,484 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:19,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:19,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:19,486 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:19,487 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:19,487 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:19,487 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:19,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:19,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:19,495 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:19,495 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:19,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:19,496 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:19,496 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:19,583 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:19,584 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:17:19,584 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:19,584 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 02:17:19,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:19,584 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:19,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable531 [2022-12-13 02:17:19,584 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 02:17:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1849965021, now seen corresponding path program 1 times [2022-12-13 02:17:19,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:19,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719464932] [2022-12-13 02:17:19,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:19,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:19,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:17:19,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:19,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719464932] [2022-12-13 02:17:19,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719464932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:19,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:19,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:19,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480492749] [2022-12-13 02:17:19,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:19,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:19,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:19,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:19,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:19,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:19,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:19,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:19,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:19,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:19,691 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:19,692 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:19,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:19,693 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:19,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:19,693 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:19,693 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:19,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:19,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:19,696 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,696 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:19,696 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:19,696 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:19,696 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,696 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:19,697 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:19,697 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:19,702 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:19,702 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:19,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:19,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:19,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:19,797 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:19,798 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:17:19,798 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:19,798 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 02:17:19,798 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:19,798 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:19,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable532 [2022-12-13 02:17:19,798 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 02:17:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1821335870, now seen corresponding path program 1 times [2022-12-13 02:17:19,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:19,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319866212] [2022-12-13 02:17:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:19,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:19,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:17:19,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:19,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319866212] [2022-12-13 02:17:19,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319866212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:19,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:19,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:19,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235661449] [2022-12-13 02:17:19,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:19,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:19,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:19,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:19,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:19,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:19,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:19,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:19,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:19,906 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:19,906 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:19,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:19,907 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:19,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:19,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:19,908 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:19,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:19,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:19,911 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,911 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:19,911 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:19,911 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:19,911 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:19,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:19,912 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:19,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:19,918 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:19,918 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:19,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:19,919 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:19,919 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:20,006 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:20,007 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:20,007 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:20,007 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 02:17:20,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:20,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:20,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable533 [2022-12-13 02:17:20,007 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 02:17:20,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:20,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1792706719, now seen corresponding path program 1 times [2022-12-13 02:17:20,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:20,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339637765] [2022-12-13 02:17:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:20,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:20,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:17:20,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:20,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339637765] [2022-12-13 02:17:20,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339637765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:20,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:20,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:20,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374981196] [2022-12-13 02:17:20,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:20,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:20,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:20,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:20,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:20,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:20,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:20,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:20,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:20,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:20,126 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:20,126 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:20,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:20,127 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:20,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:20,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:20,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:20,128 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:20,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:20,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:20,131 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:20,131 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:20,131 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:20,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:20,131 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:20,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:20,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:20,132 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:20,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:20,137 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:20,137 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:20,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:20,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:20,138 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:20,224 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:20,224 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:20,224 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:20,224 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 02:17:20,224 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:20,224 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:20,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable534 [2022-12-13 02:17:20,225 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 02:17:20,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:20,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1764077568, now seen corresponding path program 1 times [2022-12-13 02:17:20,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:20,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667624864] [2022-12-13 02:17:20,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:20,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:20,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:17:20,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:20,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667624864] [2022-12-13 02:17:20,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667624864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:20,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:20,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:20,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198135140] [2022-12-13 02:17:20,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:20,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:20,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:20,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:20,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:20,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:20,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:20,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:20,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:20,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:20,362 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:20,362 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:20,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:20,363 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:20,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:20,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:20,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:20,363 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:20,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:20,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:20,366 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:20,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:20,366 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:20,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:20,366 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:20,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:20,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:20,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:20,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:20,372 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:20,372 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:20,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:20,373 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:20,373 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:20,460 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:20,461 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:20,461 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:20,461 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 02:17:20,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:20,461 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:20,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable535 [2022-12-13 02:17:20,461 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 02:17:20,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:20,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1735448417, now seen corresponding path program 1 times [2022-12-13 02:17:20,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:20,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826384639] [2022-12-13 02:17:20,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:20,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:20,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:17:20,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:20,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826384639] [2022-12-13 02:17:20,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826384639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:20,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:20,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:20,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122023517] [2022-12-13 02:17:20,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:20,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:20,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:20,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:20,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:20,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:20,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:20,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:20,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:20,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:20,599 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:20,599 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:20,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:20,600 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:20,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:20,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:20,601 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:20,601 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:20,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:20,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:20,603 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:20,603 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:20,604 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:20,604 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:20,604 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:20,604 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:20,604 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:20,604 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:20,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:20,609 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:20,610 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:20,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:20,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:20,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:20,697 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:20,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:20,697 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:20,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:20,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:20,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:20,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable536 [2022-12-13 02:17:20,698 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 02:17:20,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:20,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1706819266, now seen corresponding path program 1 times [2022-12-13 02:17:20,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:20,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283794435] [2022-12-13 02:17:20,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:20,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:20,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:17:20,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:20,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283794435] [2022-12-13 02:17:20,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283794435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:20,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:20,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:20,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84553565] [2022-12-13 02:17:20,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:20,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:20,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:20,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:20,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:20,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:20,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:20,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:20,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:20,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:20,834 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:20,835 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:20,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:20,836 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:20,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:20,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:20,836 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:20,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:20,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:20,839 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:20,839 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:20,839 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:20,839 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:20,839 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:20,840 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:20,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:20,840 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:20,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:20,845 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:20,845 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:20,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:20,846 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:20,846 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:20,933 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:20,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:20,933 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:20,933 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 02:17:20,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:20,933 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:20,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable537 [2022-12-13 02:17:20,933 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 02:17:20,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:20,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1678190115, now seen corresponding path program 1 times [2022-12-13 02:17:20,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:20,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122017056] [2022-12-13 02:17:20,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:20,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:17:20,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:20,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122017056] [2022-12-13 02:17:20,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122017056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:20,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:20,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:20,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175587437] [2022-12-13 02:17:20,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:20,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:20,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:20,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:20,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:20,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:20,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:20,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:20,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:20,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:21,053 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:21,053 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:21,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:21,054 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:21,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:21,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:21,055 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:21,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:21,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:21,057 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:21,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:21,058 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:21,058 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:21,058 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:21,058 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:21,058 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:21,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:21,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:21,064 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:21,064 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:21,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:21,064 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:21,065 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:21,154 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:21,154 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:21,154 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:21,154 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 02:17:21,154 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:21,154 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:21,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable538 [2022-12-13 02:17:21,154 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 02:17:21,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:21,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1649560964, now seen corresponding path program 1 times [2022-12-13 02:17:21,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:21,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774892710] [2022-12-13 02:17:21,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:21,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:21,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:17:21,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:21,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774892710] [2022-12-13 02:17:21,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774892710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:21,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:21,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:21,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774103186] [2022-12-13 02:17:21,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:21,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:21,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:21,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:21,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:21,218 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:21,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:21,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:21,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:21,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:21,345 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:21,345 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:21,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:21,346 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:21,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:21,347 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:21,347 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:21,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:21,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:21,349 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:21,349 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:21,350 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:21,350 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:21,350 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:21,350 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:21,350 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:21,350 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:21,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:21,356 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:21,356 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:21,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:21,356 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:21,356 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:21,443 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:21,443 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:21,443 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:21,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:21,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:21,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:21,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable539 [2022-12-13 02:17:21,443 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 02:17:21,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:21,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1620931813, now seen corresponding path program 1 times [2022-12-13 02:17:21,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:21,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40245212] [2022-12-13 02:17:21,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:21,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:21,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:17:21,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:21,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40245212] [2022-12-13 02:17:21,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40245212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:21,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:21,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:21,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883818965] [2022-12-13 02:17:21,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:21,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:21,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:21,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:21,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:21,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:21,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:21,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:21,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:21,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:21,575 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:21,575 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:21,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:21,576 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:21,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:21,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:21,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:21,577 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:21,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:21,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:21,579 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:21,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:21,580 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:21,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:21,580 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:21,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:21,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:21,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:21,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:21,586 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:21,586 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:21,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:21,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:21,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:21,678 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:21,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:17:21,679 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:21,679 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 02:17:21,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:21,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:21,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable540 [2022-12-13 02:17:21,679 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 02:17:21,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:21,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1592302662, now seen corresponding path program 1 times [2022-12-13 02:17:21,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:21,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555743547] [2022-12-13 02:17:21,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:21,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:21,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:17:21,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:21,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555743547] [2022-12-13 02:17:21,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555743547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:21,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:21,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:21,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895376342] [2022-12-13 02:17:21,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:21,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:21,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:21,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:21,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:21,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:21,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:21,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:21,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:21,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:21,798 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:21,798 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:21,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:21,799 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:21,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:21,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:21,800 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:21,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:21,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:21,802 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:21,803 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:21,803 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:21,803 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:21,803 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:21,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:21,803 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:21,803 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:21,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:21,809 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:21,809 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:21,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:21,809 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:21,809 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:21,896 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:21,897 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:21,897 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:21,897 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 02:17:21,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:21,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:21,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable541 [2022-12-13 02:17:21,897 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 02:17:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:21,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1563673511, now seen corresponding path program 1 times [2022-12-13 02:17:21,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:21,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023894902] [2022-12-13 02:17:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:21,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:21,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:17:21,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:21,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023894902] [2022-12-13 02:17:21,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023894902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:21,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:21,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:21,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364453305] [2022-12-13 02:17:21,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:21,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:21,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:21,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:21,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:21,961 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:21,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:21,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:21,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:21,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:22,046 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:22,046 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:22,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:22,047 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:22,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:22,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:22,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:22,048 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:22,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:22,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:22,050 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,050 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:22,050 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:22,050 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:22,050 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:22,051 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:22,051 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:22,056 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:22,057 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:22,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:22,057 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:22,057 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:22,145 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:22,145 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:22,145 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:22,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:22,146 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:22,146 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:22,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable542 [2022-12-13 02:17:22,146 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 02:17:22,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:22,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1535044360, now seen corresponding path program 1 times [2022-12-13 02:17:22,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:22,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007262929] [2022-12-13 02:17:22,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:22,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:22,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:17:22,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:22,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007262929] [2022-12-13 02:17:22,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007262929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:22,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:22,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:22,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212113467] [2022-12-13 02:17:22,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:22,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:22,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:22,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:22,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:22,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:22,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:22,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:22,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:22,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:22,268 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:22,269 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:22,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:22,270 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:22,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:22,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:22,270 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:22,270 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:22,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:22,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:22,273 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,273 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:22,273 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:22,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:22,273 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,273 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:22,273 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:22,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:22,279 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:22,279 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:22,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:22,280 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:22,280 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:22,366 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:22,366 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:22,366 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:22,366 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 02:17:22,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:22,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:22,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable543 [2022-12-13 02:17:22,366 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 02:17:22,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:22,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1506415209, now seen corresponding path program 1 times [2022-12-13 02:17:22,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:22,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744793558] [2022-12-13 02:17:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:22,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:22,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:17:22,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:22,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744793558] [2022-12-13 02:17:22,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744793558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:22,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:22,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:22,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232583186] [2022-12-13 02:17:22,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:22,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:22,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:22,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:22,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:22,413 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:22,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:22,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:22,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:22,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:22,478 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:22,479 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:22,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:22,480 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:22,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:22,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:22,480 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:22,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:22,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:22,483 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,483 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:22,483 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:22,483 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:22,483 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,483 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:22,483 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:22,484 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:22,489 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:22,489 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:22,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:22,490 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:22,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:22,577 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:22,577 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:22,577 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:22,578 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 02:17:22,578 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:22,578 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:22,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable544 [2022-12-13 02:17:22,578 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 02:17:22,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:22,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1477786058, now seen corresponding path program 1 times [2022-12-13 02:17:22,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:22,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459912281] [2022-12-13 02:17:22,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:22,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:22,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:17:22,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:22,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459912281] [2022-12-13 02:17:22,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459912281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:22,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:22,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:22,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999890326] [2022-12-13 02:17:22,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:22,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:22,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:22,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:22,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:22,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:22,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:22,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:22,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:22,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:22,707 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:22,707 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:22,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:22,708 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:22,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:22,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:22,709 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:22,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:22,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:22,712 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,712 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:22,712 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:22,712 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:22,712 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:22,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:22,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:22,718 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:22,718 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:22,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:22,719 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:22,719 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:22,807 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:22,807 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:22,807 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:22,807 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 02:17:22,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:22,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:22,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable545 [2022-12-13 02:17:22,808 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 02:17:22,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1449156907, now seen corresponding path program 1 times [2022-12-13 02:17:22,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:22,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164654997] [2022-12-13 02:17:22,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:22,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:22,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:17:22,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:22,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164654997] [2022-12-13 02:17:22,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164654997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:22,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:22,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:22,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767061907] [2022-12-13 02:17:22,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:22,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:22,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:22,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:22,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:22,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:22,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:22,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:22,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:22,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:22,934 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:22,934 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:22,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:22,935 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:22,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:22,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:22,936 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:22,936 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:22,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:22,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:22,938 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,938 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:22,938 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:22,938 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:22,938 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:22,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:22,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:22,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:22,945 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:22,945 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:22,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:22,946 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:22,946 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:23,033 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:23,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:23,034 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:23,034 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 02:17:23,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:23,034 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:23,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable546 [2022-12-13 02:17:23,034 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 02:17:23,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:23,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1420527756, now seen corresponding path program 1 times [2022-12-13 02:17:23,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:23,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006869270] [2022-12-13 02:17:23,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:23,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:23,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:17:23,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:23,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006869270] [2022-12-13 02:17:23,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006869270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:23,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:23,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:23,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913733757] [2022-12-13 02:17:23,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:23,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:23,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:23,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:23,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:23,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:23,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:23,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:23,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:23,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:23,153 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:23,154 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:23,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:23,155 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:23,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:23,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:23,155 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:23,155 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:23,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:23,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:23,158 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:23,158 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:23,158 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:23,158 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:23,158 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:23,159 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:23,159 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:23,159 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:23,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:23,164 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:23,164 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:23,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:23,165 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:23,165 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:23,251 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:23,251 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:23,251 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:23,251 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 02:17:23,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:23,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:23,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable547 [2022-12-13 02:17:23,251 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 02:17:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:23,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1391898605, now seen corresponding path program 1 times [2022-12-13 02:17:23,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:23,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943254055] [2022-12-13 02:17:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:23,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:23,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:17:23,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:23,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943254055] [2022-12-13 02:17:23,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943254055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:23,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:23,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:23,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185549869] [2022-12-13 02:17:23,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:23,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:23,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:23,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:23,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:23,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:23,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:23,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:23,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:23,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:23,363 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:23,363 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:23,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:23,364 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:23,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:23,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:23,365 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:23,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:23,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:23,368 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:23,368 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:23,368 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:23,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:23,368 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:23,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:23,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:23,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:23,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:23,374 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:23,374 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:23,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:23,375 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:23,375 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:23,462 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:23,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:23,463 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:23,463 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 02:17:23,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:23,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:23,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable548 [2022-12-13 02:17:23,463 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 02:17:23,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1363269454, now seen corresponding path program 1 times [2022-12-13 02:17:23,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:23,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938916537] [2022-12-13 02:17:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:23,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:17:23,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:23,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938916537] [2022-12-13 02:17:23,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938916537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:23,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:23,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158685093] [2022-12-13 02:17:23,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:23,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:23,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:23,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:23,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:23,510 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:23,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:23,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:23,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:23,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:23,583 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:23,583 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:23,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:23,585 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:23,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:23,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:23,585 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:23,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:23,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:23,596 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:23,596 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:23,596 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:23,596 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:23,596 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:23,596 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:23,596 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:23,596 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:23,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:23,602 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:23,602 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:23,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:23,603 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:23,603 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:23,690 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:23,690 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:23,691 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:23,691 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 02:17:23,691 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:23,691 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:23,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable549 [2022-12-13 02:17:23,691 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 02:17:23,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:23,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1334640303, now seen corresponding path program 1 times [2022-12-13 02:17:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:23,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277988388] [2022-12-13 02:17:23,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:23,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:23,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 02:17:23,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:23,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277988388] [2022-12-13 02:17:23,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277988388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:23,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:23,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:23,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680527421] [2022-12-13 02:17:23,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:23,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:23,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:23,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:23,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:23,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:23,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:23,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:23,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:23,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:23,808 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:23,808 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:17:23,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:23,809 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:23,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:23,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:23,809 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:23,809 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:23,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:23,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:23,812 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:23,812 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:23,812 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:23,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:23,812 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:23,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:23,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:23,813 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:23,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:23,820 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:23,820 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:23,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:23,821 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:23,821 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:23,907 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:23,908 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:23,908 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:23,908 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 02:17:23,908 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:23,908 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:23,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable550 [2022-12-13 02:17:23,908 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 02:17:23,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:23,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1306011152, now seen corresponding path program 1 times [2022-12-13 02:17:23,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:23,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673557805] [2022-12-13 02:17:23,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:23,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:23,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:23,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673557805] [2022-12-13 02:17:23,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673557805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:23,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:23,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642215863] [2022-12-13 02:17:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:23,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:23,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:23,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:23,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:23,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:23,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:23,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:24,034 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:24,035 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:24,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:24,036 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:24,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:24,036 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:24,036 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:24,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:24,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:24,039 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:24,039 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:24,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:24,040 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:24,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:24,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:24,048 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:24,048 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:24,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:24,049 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:24,049 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:24,137 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:24,138 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:17:24,138 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:24,138 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 02:17:24,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:24,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:24,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable551 [2022-12-13 02:17:24,138 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 02:17:24,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:24,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1277382001, now seen corresponding path program 1 times [2022-12-13 02:17:24,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:24,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146018799] [2022-12-13 02:17:24,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:24,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:24,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:17:24,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:24,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146018799] [2022-12-13 02:17:24,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146018799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:24,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:24,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776057349] [2022-12-13 02:17:24,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:24,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:24,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:24,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:24,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:24,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:24,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:24,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:24,264 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:24,264 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:24,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:24,265 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:24,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:24,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:24,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:24,266 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:24,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:24,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:24,268 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,268 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:24,268 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:24,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:24,268 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,269 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:24,269 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:24,269 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:24,274 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:24,274 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:24,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:24,275 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:24,275 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:24,362 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:24,363 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:24,363 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:24,363 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 02:17:24,363 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:24,363 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:24,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable552 [2022-12-13 02:17:24,363 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 02:17:24,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:24,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1248752850, now seen corresponding path program 1 times [2022-12-13 02:17:24,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:24,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72880295] [2022-12-13 02:17:24,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:24,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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:17:24,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:24,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72880295] [2022-12-13 02:17:24,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72880295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:24,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:24,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641787533] [2022-12-13 02:17:24,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:24,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:24,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:24,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:24,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:24,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:24,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:24,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:24,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:24,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:24,483 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:24,483 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:24,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:24,484 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:24,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:24,485 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:24,485 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:24,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:24,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:24,487 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,488 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:24,488 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:24,488 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:24,488 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,488 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:24,488 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:24,488 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:24,494 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:24,494 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:24,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:24,494 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:24,494 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:24,588 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:24,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:17:24,589 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:24,589 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 02:17:24,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:24,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:24,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable553 [2022-12-13 02:17:24,589 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 02:17:24,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:24,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1220123699, now seen corresponding path program 1 times [2022-12-13 02:17:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:24,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497420614] [2022-12-13 02:17:24,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:24,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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:17:24,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:24,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497420614] [2022-12-13 02:17:24,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497420614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:24,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:24,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:24,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767448470] [2022-12-13 02:17:24,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:24,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:24,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:24,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:24,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:24,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:24,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:24,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:24,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:24,716 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:24,716 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:24,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:24,717 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:24,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:24,717 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:24,718 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:24,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:24,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:24,720 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,720 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:24,720 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:24,720 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:24,721 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,721 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:24,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:24,721 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:24,726 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:24,727 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:24,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:24,727 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:24,727 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:24,812 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:24,813 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:24,813 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:24,813 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 02:17:24,813 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:24,813 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:24,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable554 [2022-12-13 02:17:24,813 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 02:17:24,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1191494548, now seen corresponding path program 1 times [2022-12-13 02:17:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:24,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271653863] [2022-12-13 02:17:24,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:24,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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 02:17:24,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:24,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271653863] [2022-12-13 02:17:24,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271653863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:24,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:24,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325891148] [2022-12-13 02:17:24,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:24,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:24,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:24,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:24,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:24,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:24,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:24,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:24,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:24,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:24,952 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:24,952 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:24,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:24,954 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:24,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:24,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:24,955 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:24,955 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:24,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:24,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:24,959 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,959 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:24,959 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:24,959 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:24,959 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,959 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:24,959 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:24,960 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:24,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:24,967 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:24,967 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:24,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:24,968 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:24,968 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:25,053 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:25,054 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:25,054 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:25,054 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 02:17:25,054 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:25,054 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:25,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable555 [2022-12-13 02:17:25,054 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 02:17:25,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:25,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1162865397, now seen corresponding path program 1 times [2022-12-13 02:17:25,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:25,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367635306] [2022-12-13 02:17:25,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:25,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:25,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:17:25,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:25,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367635306] [2022-12-13 02:17:25,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367635306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:25,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:25,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:25,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654957970] [2022-12-13 02:17:25,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:25,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:25,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:25,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:25,102 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:25,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:25,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:25,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:25,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:25,179 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:25,180 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:25,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:25,181 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:25,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:25,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:25,181 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:25,181 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:25,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:25,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:25,184 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:25,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:25,184 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:25,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:25,184 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:25,184 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:25,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:25,185 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:25,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:25,190 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:25,190 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:25,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:25,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:25,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:25,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:25,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:25,278 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:25,278 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 02:17:25,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:25,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:25,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable556 [2022-12-13 02:17:25,278 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 02:17:25,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1134236246, now seen corresponding path program 1 times [2022-12-13 02:17:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:25,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890532581] [2022-12-13 02:17:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:25,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:17:25,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:25,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890532581] [2022-12-13 02:17:25,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890532581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:25,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:25,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:25,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241256762] [2022-12-13 02:17:25,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:25,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:25,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:25,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:25,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:25,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:25,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:25,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:25,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:25,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:25,401 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:25,401 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:25,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:25,402 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:25,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:25,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:25,403 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:25,403 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:25,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:25,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:25,406 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:25,406 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:25,406 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:25,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:25,406 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:25,406 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:25,406 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:25,406 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:25,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:25,412 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:25,412 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:25,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:25,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:25,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:25,498 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:25,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:25,499 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:25,499 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 02:17:25,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:25,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:25,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable557 [2022-12-13 02:17:25,499 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 02:17:25,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1105607095, now seen corresponding path program 1 times [2022-12-13 02:17:25,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:25,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508588190] [2022-12-13 02:17:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:25,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:25,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 02:17:25,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:25,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508588190] [2022-12-13 02:17:25,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508588190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:25,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:25,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:25,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849837176] [2022-12-13 02:17:25,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:25,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:25,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:25,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:25,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:25,555 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:25,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:25,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:25,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:25,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:25,631 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:25,631 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:25,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:25,632 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:25,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:25,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:25,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:25,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:25,633 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:25,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:25,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:25,635 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:25,635 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:25,635 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:25,635 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:25,635 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:25,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:25,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:25,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:25,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:25,641 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:25,641 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:25,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:25,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:25,642 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:25,728 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:25,728 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:25,729 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:25,729 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 02:17:25,729 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:25,729 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:25,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable558 [2022-12-13 02:17:25,729 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 02:17:25,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:25,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1076977944, now seen corresponding path program 1 times [2022-12-13 02:17:25,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:25,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737828946] [2022-12-13 02:17:25,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:25,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:25,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:17:25,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:25,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737828946] [2022-12-13 02:17:25,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737828946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:25,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:25,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:25,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204539131] [2022-12-13 02:17:25,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:25,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:25,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:25,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:25,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:25,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:25,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:25,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:25,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:25,843 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:25,843 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:25,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:25,844 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:25,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:25,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:25,845 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:25,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:25,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:25,847 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:25,847 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:25,848 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:25,848 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:25,848 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:25,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:25,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:25,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:25,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:25,853 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:25,854 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:25,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:25,854 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:25,854 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:25,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:25,941 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:25,942 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:25,942 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 02:17:25,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:25,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:25,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable559 [2022-12-13 02:17:25,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 02:17:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1048348793, now seen corresponding path program 1 times [2022-12-13 02:17:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:25,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840661819] [2022-12-13 02:17:25,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:25,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:25,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:17:25,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:25,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840661819] [2022-12-13 02:17:25,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840661819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:25,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:25,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:25,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944170047] [2022-12-13 02:17:25,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:25,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:25,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:25,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:25,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:25,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:25,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:25,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:25,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:25,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:26,051 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:26,051 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:26,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:26,052 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:26,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:26,053 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:26,053 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:26,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:26,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:26,055 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,055 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:26,056 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:26,056 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:26,056 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,056 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:26,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:26,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:26,062 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:26,062 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:26,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:26,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:26,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:26,148 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:26,148 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:17:26,148 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:26,149 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 02:17:26,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:26,149 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:26,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable560 [2022-12-13 02:17:26,149 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 02:17:26,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:26,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1019719642, now seen corresponding path program 1 times [2022-12-13 02:17:26,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:26,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443528426] [2022-12-13 02:17:26,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:26,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:26,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:17:26,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:26,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443528426] [2022-12-13 02:17:26,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443528426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:26,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:26,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:26,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945133161] [2022-12-13 02:17:26,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:26,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:26,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:26,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:26,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:26,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:26,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:26,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:26,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:26,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:26,288 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:26,288 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:26,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:26,289 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:26,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:26,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:26,289 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:26,290 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:26,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:26,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:26,292 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,292 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:26,292 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:26,292 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:26,292 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:26,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:26,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:26,298 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:26,298 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:17:26,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:26,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:26,299 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:26,385 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:26,385 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:26,385 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:26,385 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 02:17:26,385 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:26,385 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:26,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable561 [2022-12-13 02:17:26,385 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 02:17:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash -991090491, now seen corresponding path program 1 times [2022-12-13 02:17:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:26,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638562833] [2022-12-13 02:17:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:26,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:26,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:17:26,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:26,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638562833] [2022-12-13 02:17:26,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638562833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:26,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:26,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:26,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612412090] [2022-12-13 02:17:26,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:26,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:26,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:26,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:26,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:26,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:26,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:26,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:26,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:26,515 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:26,515 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:26,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:26,516 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:26,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:26,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:26,517 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:26,517 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:26,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:26,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:26,519 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,520 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:26,520 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:26,520 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:26,520 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,520 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:26,520 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:26,520 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:26,526 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:26,526 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:26,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:26,526 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:26,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:26,630 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:26,630 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 02:17:26,630 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:26,630 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 02:17:26,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:26,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:26,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable562 [2022-12-13 02:17:26,631 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 02:17:26,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:26,631 INFO L85 PathProgramCache]: Analyzing trace with hash -962461340, now seen corresponding path program 1 times [2022-12-13 02:17:26,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:26,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839892172] [2022-12-13 02:17:26,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:26,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:26,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:17:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:26,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839892172] [2022-12-13 02:17:26,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839892172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:26,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:26,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:26,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182668800] [2022-12-13 02:17:26,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:26,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:26,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:26,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:26,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:26,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:26,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:26,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:26,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:26,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:26,753 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:26,753 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:26,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:26,755 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:26,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:26,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:26,755 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:26,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:26,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:26,757 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,758 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:26,758 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:26,758 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:26,758 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,758 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:26,758 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:26,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:26,764 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:26,764 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:26,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:26,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:26,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:26,851 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:26,851 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:26,851 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:26,851 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 02:17:26,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:26,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:26,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable563 [2022-12-13 02:17:26,851 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 02:17:26,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:26,852 INFO L85 PathProgramCache]: Analyzing trace with hash -933832189, now seen corresponding path program 1 times [2022-12-13 02:17:26,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:26,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082412230] [2022-12-13 02:17:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:26,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:26,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:17:26,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:26,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082412230] [2022-12-13 02:17:26,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082412230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:26,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:26,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:26,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060338675] [2022-12-13 02:17:26,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:26,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:26,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:26,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:26,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:26,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:26,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:26,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:26,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:26,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:26,972 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:26,972 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:26,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:26,973 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:26,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:26,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:26,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:26,974 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:26,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:26,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:26,977 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:26,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:26,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:26,977 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:26,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:26,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:26,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:26,983 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:26,983 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:26,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:26,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:26,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:27,073 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:27,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:27,073 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:27,073 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 02:17:27,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:27,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:27,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable564 [2022-12-13 02:17:27,073 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 02:17:27,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:27,074 INFO L85 PathProgramCache]: Analyzing trace with hash -905203038, now seen corresponding path program 1 times [2022-12-13 02:17:27,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:27,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011559987] [2022-12-13 02:17:27,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:27,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:27,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:17:27,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:27,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011559987] [2022-12-13 02:17:27,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011559987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:27,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:27,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:27,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130360927] [2022-12-13 02:17:27,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:27,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:27,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:27,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:27,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:27,125 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:27,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:27,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:27,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:27,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:27,191 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:27,191 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:27,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:27,193 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:27,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:27,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:27,193 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:27,193 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:27,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:27,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:27,196 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:27,196 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:27,196 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:27,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:27,196 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:27,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:27,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:27,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:27,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:27,202 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:27,202 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:27,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:27,202 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:27,203 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:27,290 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:27,290 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:27,290 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:27,291 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 02:17:27,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:27,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:27,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable565 [2022-12-13 02:17:27,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 02:17:27,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash -876573887, now seen corresponding path program 1 times [2022-12-13 02:17:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:27,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806130498] [2022-12-13 02:17:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:27,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:17:27,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:27,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806130498] [2022-12-13 02:17:27,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806130498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:27,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:27,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:27,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144014546] [2022-12-13 02:17:27,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:27,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:27,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:27,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:27,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:27,338 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:27,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:27,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:27,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:27,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:27,415 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:27,415 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:27,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:27,416 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:27,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:27,417 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:27,417 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:27,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:27,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:27,419 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:27,419 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:27,420 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:27,420 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:27,420 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:27,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:27,420 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:27,420 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:27,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:27,432 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:27,432 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:27,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:27,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:27,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:27,518 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:27,519 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:17:27,519 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:27,519 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 02:17:27,519 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:27,519 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:27,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable566 [2022-12-13 02:17:27,519 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 02:17:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -847944736, now seen corresponding path program 1 times [2022-12-13 02:17:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:27,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708610542] [2022-12-13 02:17:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:27,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:17:27,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:27,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708610542] [2022-12-13 02:17:27,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708610542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:27,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:27,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:27,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172820332] [2022-12-13 02:17:27,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:27,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:27,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:27,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:27,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:27,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:27,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:27,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:27,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:27,654 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:27,654 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:27,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:27,655 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:27,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:27,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:27,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:27,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:27,656 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:27,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:27,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:27,658 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:27,659 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:27,659 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:27,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:27,659 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:27,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:27,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:27,659 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:27,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:27,665 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:27,665 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:27,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:27,665 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:27,665 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:27,751 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:27,751 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:17:27,752 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:27,752 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 02:17:27,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:27,752 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:27,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable567 [2022-12-13 02:17:27,752 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 02:17:27,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:27,752 INFO L85 PathProgramCache]: Analyzing trace with hash -819315585, now seen corresponding path program 1 times [2022-12-13 02:17:27,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:27,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865250462] [2022-12-13 02:17:27,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:27,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:27,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:17:27,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:27,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865250462] [2022-12-13 02:17:27,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865250462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:27,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:27,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:27,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490601855] [2022-12-13 02:17:27,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:27,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:27,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:27,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:27,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:27,796 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:27,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:27,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:27,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:27,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:27,871 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:27,871 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:27,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:27,872 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:27,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:27,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:27,873 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:27,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:27,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:27,875 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:27,875 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:27,876 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:27,876 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:27,876 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:27,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:27,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:27,876 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:27,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:27,882 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:27,882 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:27,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:27,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:27,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:27,968 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:27,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:17:27,968 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:27,968 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 02:17:27,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:27,968 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:27,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable568 [2022-12-13 02:17:27,968 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 02:17:27,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:27,969 INFO L85 PathProgramCache]: Analyzing trace with hash -790686434, now seen corresponding path program 1 times [2022-12-13 02:17:27,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:27,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117380170] [2022-12-13 02:17:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:27,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:28,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:17:28,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:28,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117380170] [2022-12-13 02:17:28,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117380170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:28,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:28,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:28,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805212098] [2022-12-13 02:17:28,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:28,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:28,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:28,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:28,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:28,017 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:28,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:28,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:28,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:28,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:28,086 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:28,086 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:28,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:28,087 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:28,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:28,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:28,088 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:28,088 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:28,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:28,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:28,090 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:28,090 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:28,091 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:28,091 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:28,091 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:28,091 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:28,091 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:28,091 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:28,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:28,097 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:28,097 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:28,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:28,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:28,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:28,184 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:28,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:28,184 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:28,184 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 02:17:28,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:28,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:28,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable569 [2022-12-13 02:17:28,184 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 02:17:28,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:28,185 INFO L85 PathProgramCache]: Analyzing trace with hash -762057283, now seen corresponding path program 1 times [2022-12-13 02:17:28,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:28,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68285145] [2022-12-13 02:17:28,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:28,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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:17:28,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:28,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68285145] [2022-12-13 02:17:28,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68285145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:28,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:28,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:28,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810799282] [2022-12-13 02:17:28,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:28,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:28,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:28,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:28,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:28,230 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:28,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:28,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:28,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:28,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:28,307 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:28,308 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:28,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:28,309 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:28,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:28,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:28,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:28,309 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:28,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:28,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:28,312 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:28,312 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:28,312 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:28,312 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:28,312 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:28,313 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:28,313 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:28,313 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:28,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:28,318 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:28,318 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:28,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:28,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:28,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:28,415 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:28,416 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:17:28,416 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:28,416 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 02:17:28,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:28,416 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:28,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable570 [2022-12-13 02:17:28,416 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 02:17:28,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:28,416 INFO L85 PathProgramCache]: Analyzing trace with hash -733428132, now seen corresponding path program 1 times [2022-12-13 02:17:28,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:28,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37484802] [2022-12-13 02:17:28,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:28,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:28,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:17:28,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:28,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37484802] [2022-12-13 02:17:28,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37484802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:28,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:28,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:28,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575009318] [2022-12-13 02:17:28,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:28,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:28,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:28,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:28,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:28,470 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:28,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:28,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:28,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:28,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:28,536 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:28,536 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:28,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:28,537 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:28,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:28,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:28,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:28,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:28,538 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:28,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:28,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:28,541 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:28,541 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:28,541 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:28,541 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:28,541 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:28,541 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:28,541 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:28,541 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:28,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:28,547 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:28,547 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:28,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:28,548 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:28,548 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:28,636 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:28,636 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:28,637 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:28,637 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 02:17:28,637 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:28,637 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:28,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable571 [2022-12-13 02:17:28,637 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 02:17:28,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:28,637 INFO L85 PathProgramCache]: Analyzing trace with hash -704798981, now seen corresponding path program 1 times [2022-12-13 02:17:28,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:28,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994132629] [2022-12-13 02:17:28,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:28,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:28,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 02:17:28,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:28,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994132629] [2022-12-13 02:17:28,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994132629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:28,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:28,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:28,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222609030] [2022-12-13 02:17:28,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:28,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:28,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:28,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:28,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:28,695 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:28,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:28,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:28,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:28,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:28,789 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:28,789 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:28,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:28,790 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:28,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:28,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:28,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:28,791 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:28,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:28,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:28,794 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:28,794 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:28,794 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:28,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:28,794 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:28,794 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:28,794 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:28,794 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:28,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:28,800 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:28,800 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:28,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:28,801 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:28,801 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:28,887 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:28,888 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:28,888 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:28,888 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 02:17:28,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:28,888 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:28,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable572 [2022-12-13 02:17:28,888 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 02:17:28,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash -676169830, now seen corresponding path program 1 times [2022-12-13 02:17:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:28,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227849769] [2022-12-13 02:17:28,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:28,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:28,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:17:28,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:28,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227849769] [2022-12-13 02:17:28,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227849769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:28,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:28,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:28,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094943523] [2022-12-13 02:17:28,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:28,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:28,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:28,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:28,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:28,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:28,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:28,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:28,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:28,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:29,001 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:29,001 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:29,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:29,002 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:29,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:29,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:29,003 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:29,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:29,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:29,006 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,006 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:29,006 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:29,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:29,006 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:29,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:29,006 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:29,012 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:29,012 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:29,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 444 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:29,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:29,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:29,102 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:29,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:29,102 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:29,102 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 02:17:29,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:29,102 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:29,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable573 [2022-12-13 02:17:29,103 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 02:17:29,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:29,103 INFO L85 PathProgramCache]: Analyzing trace with hash -647540679, now seen corresponding path program 1 times [2022-12-13 02:17:29,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:29,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081411423] [2022-12-13 02:17:29,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:29,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:29,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:17:29,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:29,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081411423] [2022-12-13 02:17:29,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081411423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:29,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:29,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:29,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693269375] [2022-12-13 02:17:29,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:29,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:29,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:29,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:29,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:29,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:29,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:29,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:29,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:29,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:29,225 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:29,226 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:29,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:29,227 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:29,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:29,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:29,227 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:29,227 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:29,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:29,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:29,230 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,230 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:29,230 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:29,230 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:29,230 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:29,231 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:29,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:29,236 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:29,236 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:29,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:29,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:29,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:29,324 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:29,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:29,325 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:29,325 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 02:17:29,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:29,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:29,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable574 [2022-12-13 02:17:29,325 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 02:17:29,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:29,325 INFO L85 PathProgramCache]: Analyzing trace with hash -618911528, now seen corresponding path program 1 times [2022-12-13 02:17:29,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:29,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604560237] [2022-12-13 02:17:29,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:29,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:29,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 02:17:29,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:29,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604560237] [2022-12-13 02:17:29,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604560237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:29,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:29,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:29,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739619942] [2022-12-13 02:17:29,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:29,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:29,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:29,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:29,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:29,372 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:29,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:29,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:29,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:29,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:29,447 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:29,447 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:29,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:29,448 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:29,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:29,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:29,449 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:29,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:29,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:29,451 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:29,452 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:29,452 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:29,452 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,452 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:29,452 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:29,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:29,458 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:29,458 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:29,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:29,459 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:29,459 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:29,546 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:29,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:29,547 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:29,547 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 02:17:29,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:29,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:29,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable575 [2022-12-13 02:17:29,547 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 02:17:29,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:29,547 INFO L85 PathProgramCache]: Analyzing trace with hash -590282377, now seen corresponding path program 1 times [2022-12-13 02:17:29,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:29,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997477990] [2022-12-13 02:17:29,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:29,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:29,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:17:29,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:29,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997477990] [2022-12-13 02:17:29,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997477990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:29,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:29,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783480725] [2022-12-13 02:17:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:29,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:29,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:29,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:29,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:29,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:29,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:29,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:29,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:29,659 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:29,659 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:29,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:29,661 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:29,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:29,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:29,661 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:29,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:29,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:29,664 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,664 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:29,664 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:29,664 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:29,664 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,664 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:29,664 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:29,664 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:29,670 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:29,670 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:29,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:29,671 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:29,671 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:29,759 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:29,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:29,759 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:29,760 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 02:17:29,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:29,760 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:29,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable576 [2022-12-13 02:17:29,760 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 02:17:29,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:29,760 INFO L85 PathProgramCache]: Analyzing trace with hash -561653226, now seen corresponding path program 1 times [2022-12-13 02:17:29,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:29,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245793473] [2022-12-13 02:17:29,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:29,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:29,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:17:29,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:29,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245793473] [2022-12-13 02:17:29,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245793473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:29,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:29,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:29,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554194756] [2022-12-13 02:17:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:29,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:29,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:29,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:29,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:29,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:29,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:29,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:29,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:29,880 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:29,880 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:29,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:29,881 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:29,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:29,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:29,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:29,882 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:29,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:29,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:29,884 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,884 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:29,885 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:29,885 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:29,885 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,885 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:29,885 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:29,885 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:29,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:29,891 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:29,891 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:17:29,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:29,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:29,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:29,977 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:29,978 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:29,978 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:29,978 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 02:17:29,978 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:29,978 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:29,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable577 [2022-12-13 02:17:29,978 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 02:17:29,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:29,978 INFO L85 PathProgramCache]: Analyzing trace with hash -533024075, now seen corresponding path program 1 times [2022-12-13 02:17:29,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:29,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434677331] [2022-12-13 02:17:29,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:29,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:30,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:17:30,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:30,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434677331] [2022-12-13 02:17:30,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434677331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:30,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:30,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:30,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002892558] [2022-12-13 02:17:30,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:30,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:30,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:30,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:30,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:30,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:30,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:30,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:30,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:30,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:30,101 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:30,101 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:30,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:30,102 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:30,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:30,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:30,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:30,102 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:30,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:30,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:30,105 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:30,105 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:30,105 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:30,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:30,105 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:30,106 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:30,106 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:30,106 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:30,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:30,111 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:30,111 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:30,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:30,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:30,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:30,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:30,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:30,200 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:30,200 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 02:17:30,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:30,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:30,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable578 [2022-12-13 02:17:30,201 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 02:17:30,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:30,201 INFO L85 PathProgramCache]: Analyzing trace with hash -504394924, now seen corresponding path program 1 times [2022-12-13 02:17:30,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:30,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724987709] [2022-12-13 02:17:30,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:30,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:17:30,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:30,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724987709] [2022-12-13 02:17:30,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724987709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:30,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:30,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:30,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323405977] [2022-12-13 02:17:30,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:30,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:30,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:30,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:30,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:30,252 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:30,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:30,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:30,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:30,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:30,321 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:30,321 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:30,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:30,322 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:30,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:30,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:30,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:30,322 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:30,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:30,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:30,325 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:30,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:30,325 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:30,325 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:30,325 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:30,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:30,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:30,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:30,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:30,337 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:30,337 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:30,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:30,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:30,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:30,425 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:30,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:17:30,426 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:30,426 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 02:17:30,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:30,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:30,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable579 [2022-12-13 02:17:30,426 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 02:17:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -475765773, now seen corresponding path program 1 times [2022-12-13 02:17:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:30,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270821790] [2022-12-13 02:17:30,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:30,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:30,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:17:30,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:30,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270821790] [2022-12-13 02:17:30,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270821790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:30,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:30,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:30,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686367849] [2022-12-13 02:17:30,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:30,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:30,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:30,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:30,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:30,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:30,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:30,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:30,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:30,556 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:30,556 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:30,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:30,557 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:30,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:30,557 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:30,557 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:30,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:30,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:30,560 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:30,560 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:30,560 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:30,560 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:30,560 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:30,561 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:30,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:30,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:30,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:30,566 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:30,566 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:30,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:30,567 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:30,567 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:30,653 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:30,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:30,653 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:30,653 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 02:17:30,653 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:30,653 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:30,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable580 [2022-12-13 02:17:30,653 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 02:17:30,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:30,654 INFO L85 PathProgramCache]: Analyzing trace with hash -447136622, now seen corresponding path program 1 times [2022-12-13 02:17:30,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:30,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095789945] [2022-12-13 02:17:30,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:30,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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 02:17:30,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:30,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095789945] [2022-12-13 02:17:30,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095789945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:30,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:30,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:30,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757671017] [2022-12-13 02:17:30,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:30,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:30,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:30,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:30,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:30,715 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:30,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:30,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:30,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:30,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:30,792 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:30,792 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:30,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:30,793 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:30,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:30,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:30,794 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:30,794 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:30,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:30,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:30,796 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:30,796 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:30,796 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:30,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:30,797 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:30,797 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:30,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:30,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:30,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:30,802 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:30,802 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:30,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:30,803 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:30,803 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:30,890 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:30,890 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:30,890 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:30,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:30,890 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:30,890 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:30,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable581 [2022-12-13 02:17:30,890 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 02:17:30,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash -418507471, now seen corresponding path program 1 times [2022-12-13 02:17:30,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:30,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545351296] [2022-12-13 02:17:30,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:30,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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:17:30,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:30,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545351296] [2022-12-13 02:17:30,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545351296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:30,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:30,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:30,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760345399] [2022-12-13 02:17:30,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:30,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:30,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:30,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:30,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:30,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:30,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:31,002 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:31,002 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:31,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:31,003 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:31,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:31,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:31,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:31,004 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:31,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:31,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:31,006 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,006 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:31,006 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:31,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:31,006 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:31,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:31,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:31,012 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:31,012 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:31,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:31,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:31,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:31,099 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:31,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:31,100 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:31,100 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 02:17:31,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:31,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:31,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable582 [2022-12-13 02:17:31,100 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 02:17:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:31,100 INFO L85 PathProgramCache]: Analyzing trace with hash -389878320, now seen corresponding path program 1 times [2022-12-13 02:17:31,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:31,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796142317] [2022-12-13 02:17:31,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:31,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:31,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:31,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796142317] [2022-12-13 02:17:31,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796142317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:31,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:31,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389422727] [2022-12-13 02:17:31,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:31,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:31,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:31,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:31,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:31,145 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:31,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:31,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:31,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:31,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:31,218 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:31,218 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:31,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:31,219 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:31,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:31,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:31,220 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:31,220 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:31,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:31,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:31,222 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,223 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:31,223 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:31,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:31,223 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:31,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:31,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:31,229 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:31,229 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:31,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:31,229 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:31,229 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:31,324 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:31,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:17:31,325 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:31,325 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 02:17:31,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:31,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:31,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable583 [2022-12-13 02:17:31,325 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 02:17:31,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash -361249169, now seen corresponding path program 1 times [2022-12-13 02:17:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:31,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119792053] [2022-12-13 02:17:31,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:31,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:17:31,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:31,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119792053] [2022-12-13 02:17:31,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119792053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:31,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:31,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:31,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165917121] [2022-12-13 02:17:31,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:31,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:31,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:31,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:31,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:31,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:31,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:31,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:31,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:31,464 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:31,464 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:31,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:31,465 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:31,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:31,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:31,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:31,465 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:31,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:31,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:31,468 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,469 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:31,469 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:31,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:31,469 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,469 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:31,469 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:31,469 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:31,478 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:31,478 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:31,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:31,479 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:31,479 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:31,583 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:31,584 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:17:31,584 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:31,584 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 02:17:31,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:31,584 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:31,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable584 [2022-12-13 02:17:31,584 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 02:17:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:31,584 INFO L85 PathProgramCache]: Analyzing trace with hash -332620018, now seen corresponding path program 1 times [2022-12-13 02:17:31,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:31,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62878630] [2022-12-13 02:17:31,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:31,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:31,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:17:31,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:31,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62878630] [2022-12-13 02:17:31,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62878630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:31,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:31,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:31,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499979882] [2022-12-13 02:17:31,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:31,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:31,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:31,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:31,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:31,645 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:31,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:31,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:31,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:31,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:31,733 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:31,733 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:31,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:31,734 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:31,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:31,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:31,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:31,735 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:31,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:31,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:31,739 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,739 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:31,739 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:31,739 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:31,739 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:31,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:31,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:31,747 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:31,747 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:31,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:31,748 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:31,748 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:31,835 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:31,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:17:31,836 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:31,836 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 02:17:31,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:31,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:31,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable585 [2022-12-13 02:17:31,836 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 02:17:31,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:31,837 INFO L85 PathProgramCache]: Analyzing trace with hash -303990867, now seen corresponding path program 1 times [2022-12-13 02:17:31,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:31,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128987949] [2022-12-13 02:17:31,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:31,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:17:31,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:31,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128987949] [2022-12-13 02:17:31,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128987949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:31,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:31,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:31,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340516206] [2022-12-13 02:17:31,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:31,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:31,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:31,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:31,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:31,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:31,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:31,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:31,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:31,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:31,948 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:31,948 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:31,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:31,949 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:31,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:31,950 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:31,950 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:31,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:31,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:31,952 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,953 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:31,953 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:31,953 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:31,953 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,953 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:31,953 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:31,953 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:31,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:31,959 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:31,959 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:31,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:31,959 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:31,959 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:32,045 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:32,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:32,046 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:32,046 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 02:17:32,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:32,046 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:32,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable586 [2022-12-13 02:17:32,046 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 02:17:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash -275361716, now seen corresponding path program 1 times [2022-12-13 02:17:32,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:32,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638592322] [2022-12-13 02:17:32,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:32,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:32,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:17:32,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:32,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638592322] [2022-12-13 02:17:32,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638592322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:32,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:32,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:32,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949283093] [2022-12-13 02:17:32,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:32,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:32,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:32,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:32,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:32,092 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:32,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:32,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:32,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:32,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:32,168 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:32,168 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:32,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:32,169 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:32,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:32,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:32,169 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:32,170 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:32,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:32,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:32,172 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:32,172 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:32,172 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:32,172 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:32,172 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:32,173 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:32,173 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:32,173 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:32,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:32,178 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:32,178 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:32,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:32,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:32,179 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:32,266 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:32,267 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:32,267 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:32,267 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 02:17:32,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:32,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:32,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable587 [2022-12-13 02:17:32,267 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 02:17:32,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:32,267 INFO L85 PathProgramCache]: Analyzing trace with hash -246732565, now seen corresponding path program 1 times [2022-12-13 02:17:32,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:32,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922217450] [2022-12-13 02:17:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:32,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:32,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:17:32,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:32,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922217450] [2022-12-13 02:17:32,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922217450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:32,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:32,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:32,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659090762] [2022-12-13 02:17:32,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:32,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:32,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:32,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:32,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:32,326 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:32,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:32,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:32,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:32,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:32,402 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:32,402 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:32,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:32,403 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:32,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:32,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:32,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:32,404 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:32,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:32,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:32,406 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:32,406 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:32,406 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:32,407 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:32,407 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:32,407 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:32,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:32,407 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:32,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:32,412 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:32,413 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:32,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:32,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:32,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:32,513 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:32,513 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:17:32,513 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:32,514 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 02:17:32,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:32,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:32,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable588 [2022-12-13 02:17:32,514 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 02:17:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash -218103414, now seen corresponding path program 1 times [2022-12-13 02:17:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:32,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125089972] [2022-12-13 02:17:32,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:32,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:32,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:17:32,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:32,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125089972] [2022-12-13 02:17:32,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125089972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:32,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:32,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:32,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213955710] [2022-12-13 02:17:32,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:32,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:32,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:32,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:32,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:32,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:32,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:32,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:32,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:32,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:32,633 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:32,633 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:32,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:32,634 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:32,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:32,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:32,635 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:32,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:32,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:32,638 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:32,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:32,638 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:32,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:32,638 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:32,638 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:32,638 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:32,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:32,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:32,644 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:32,644 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:32,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:32,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:32,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:32,731 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:32,732 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:32,732 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:32,732 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 02:17:32,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:32,732 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:32,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable589 [2022-12-13 02:17:32,732 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 02:17:32,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:32,732 INFO L85 PathProgramCache]: Analyzing trace with hash -189474263, now seen corresponding path program 1 times [2022-12-13 02:17:32,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:32,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896946543] [2022-12-13 02:17:32,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:32,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:32,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:17:32,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:32,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896946543] [2022-12-13 02:17:32,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896946543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:32,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:32,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:32,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113164488] [2022-12-13 02:17:32,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:32,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:32,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:32,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:32,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:32,785 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:32,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:32,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:32,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:32,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:32,882 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:32,883 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:32,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:32,884 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:32,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:32,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:32,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:32,885 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:32,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:32,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:32,889 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:32,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:32,889 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:32,889 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:32,889 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:32,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:32,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:32,890 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:32,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:32,897 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:32,897 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:32,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:32,898 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:32,898 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:32,988 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:32,989 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:17:32,989 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:32,989 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 02:17:32,989 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:32,989 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:32,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable590 [2022-12-13 02:17:32,989 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 02:17:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:32,989 INFO L85 PathProgramCache]: Analyzing trace with hash -160845112, now seen corresponding path program 1 times [2022-12-13 02:17:32,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:32,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953827785] [2022-12-13 02:17:32,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:32,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:33,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:17:33,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:33,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953827785] [2022-12-13 02:17:33,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953827785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:33,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:33,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:33,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377253745] [2022-12-13 02:17:33,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:33,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:33,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:33,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:33,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:33,036 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:33,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:33,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:33,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:33,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:33,112 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:33,112 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:33,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:33,113 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:33,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:33,114 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:33,114 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:33,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:33,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:33,116 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:33,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:33,117 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:33,117 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:33,117 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:33,117 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:33,117 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:33,117 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:33,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:33,123 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:33,123 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:33,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:33,123 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:33,123 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:33,211 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:33,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:33,212 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:33,212 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 02:17:33,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:33,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:33,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable591 [2022-12-13 02:17:33,212 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 02:17:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:33,212 INFO L85 PathProgramCache]: Analyzing trace with hash -132215961, now seen corresponding path program 1 times [2022-12-13 02:17:33,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:33,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736768833] [2022-12-13 02:17:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:33,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:33,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:17:33,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:33,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736768833] [2022-12-13 02:17:33,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736768833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:33,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:33,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:33,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713547189] [2022-12-13 02:17:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:33,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:33,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:33,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:33,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:33,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:33,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:33,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:33,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:33,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:33,373 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:33,373 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:33,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:33,375 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:33,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:33,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:33,375 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:33,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:33,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:33,378 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:33,378 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:33,378 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:33,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:33,378 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:33,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:33,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:33,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:33,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:33,384 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:33,384 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:33,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:33,385 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:33,385 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:33,473 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:33,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:33,474 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:33,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:33,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:33,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:33,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable592 [2022-12-13 02:17:33,474 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 02:17:33,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:33,474 INFO L85 PathProgramCache]: Analyzing trace with hash -103586810, now seen corresponding path program 1 times [2022-12-13 02:17:33,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:33,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127888941] [2022-12-13 02:17:33,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:33,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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 02:17:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:33,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127888941] [2022-12-13 02:17:33,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127888941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:33,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:33,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:33,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902309664] [2022-12-13 02:17:33,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:33,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:33,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:33,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:33,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:33,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:33,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:33,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:33,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:33,587 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:33,587 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:33,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:33,588 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:33,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:33,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:33,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:33,589 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:33,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:33,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:33,591 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:33,591 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:33,591 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:33,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:33,592 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:33,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:33,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:33,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:33,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:33,597 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:33,598 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:33,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:33,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:33,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:33,686 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:33,687 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:33,687 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:33,687 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 02:17:33,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:33,687 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:33,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable593 [2022-12-13 02:17:33,687 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 02:17:33,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:33,687 INFO L85 PathProgramCache]: Analyzing trace with hash -74957659, now seen corresponding path program 1 times [2022-12-13 02:17:33,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:33,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833147026] [2022-12-13 02:17:33,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:33,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:33,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:17:33,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:33,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833147026] [2022-12-13 02:17:33,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833147026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:33,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:33,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720881741] [2022-12-13 02:17:33,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:33,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:33,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:33,750 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:33,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:33,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:33,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:33,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:33,825 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:33,825 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:33,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:33,826 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:33,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:33,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:33,827 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:33,827 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:33,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:33,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:33,830 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:33,830 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:33,830 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:33,830 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:33,830 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:33,830 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:33,830 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:33,831 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:33,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:33,839 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:33,839 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:33,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:33,840 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:33,840 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:33,958 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:33,958 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:17:33,958 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:33,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:33,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:33,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:33,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable594 [2022-12-13 02:17:33,959 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 02:17:33,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:33,959 INFO L85 PathProgramCache]: Analyzing trace with hash -46328508, now seen corresponding path program 1 times [2022-12-13 02:17:33,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:33,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863497607] [2022-12-13 02:17:33,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:33,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:34,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:17:34,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:34,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863497607] [2022-12-13 02:17:34,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863497607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:34,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:34,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:34,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157761992] [2022-12-13 02:17:34,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:34,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:34,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:34,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:34,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:34,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:34,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:34,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:34,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:34,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:34,116 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:34,116 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:34,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:34,117 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:34,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:34,118 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:34,118 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:34,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:34,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:34,122 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:34,122 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:34,122 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:34,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:34,122 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:34,123 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:34,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:34,123 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:34,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:34,130 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:34,131 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:34,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:34,131 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:34,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:34,236 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:34,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:17:34,237 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:34,237 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 02:17:34,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:34,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:34,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable595 [2022-12-13 02:17:34,237 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 02:17:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash -17699357, now seen corresponding path program 1 times [2022-12-13 02:17:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:34,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449980608] [2022-12-13 02:17:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:34,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:34,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:17:34,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:34,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449980608] [2022-12-13 02:17:34,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449980608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:34,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:34,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:34,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303037234] [2022-12-13 02:17:34,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:34,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:34,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:34,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:34,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:34,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:34,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:34,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:34,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:34,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:34,355 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:34,356 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:34,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:34,357 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:34,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:34,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:34,357 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:34,358 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:34,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:34,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:34,360 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:34,360 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:34,360 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:34,360 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:34,361 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:34,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:34,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:34,361 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:34,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:34,369 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:34,370 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:34,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:34,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:34,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:34,458 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:34,458 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:17:34,459 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:34,459 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 02:17:34,459 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:34,459 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:34,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable596 [2022-12-13 02:17:34,459 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 02:17:34,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:34,459 INFO L85 PathProgramCache]: Analyzing trace with hash 10929794, now seen corresponding path program 1 times [2022-12-13 02:17:34,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:34,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835494865] [2022-12-13 02:17:34,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:34,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:34,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:17:34,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:34,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835494865] [2022-12-13 02:17:34,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835494865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:34,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:34,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:34,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711351009] [2022-12-13 02:17:34,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:34,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:34,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:34,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:34,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:34,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:34,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:34,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:34,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:34,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:34,573 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:34,573 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:34,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:34,574 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:34,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:34,575 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:34,575 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:34,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:34,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:34,577 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:34,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:34,578 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:34,578 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:34,578 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:34,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:34,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:34,578 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:34,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:34,586 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:34,587 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:34,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:34,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:34,588 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:34,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:34,681 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:17:34,681 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:34,681 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 02:17:34,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:34,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:34,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable597 [2022-12-13 02:17:34,682 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 02:17:34,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash 39558945, now seen corresponding path program 1 times [2022-12-13 02:17:34,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:34,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415572367] [2022-12-13 02:17:34,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:34,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:34,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:17:34,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:34,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415572367] [2022-12-13 02:17:34,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415572367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:34,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:34,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610095705] [2022-12-13 02:17:34,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:34,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:34,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:34,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:34,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:34,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:34,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:34,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:34,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:34,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:34,805 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:34,806 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:34,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:34,807 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:34,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:34,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:34,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:34,807 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:34,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:34,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:34,810 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:34,810 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:34,810 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:34,810 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:34,810 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:34,810 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:34,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:34,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:34,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:34,816 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:34,816 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:34,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:34,817 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:34,817 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:34,903 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:34,903 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:34,903 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:34,903 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 02:17:34,903 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:34,903 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:34,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable598 [2022-12-13 02:17:34,904 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 02:17:34,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:34,904 INFO L85 PathProgramCache]: Analyzing trace with hash 68188096, now seen corresponding path program 1 times [2022-12-13 02:17:34,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:34,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918476660] [2022-12-13 02:17:34,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:34,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:17:34,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:34,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918476660] [2022-12-13 02:17:34,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918476660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:34,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:34,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:34,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866373486] [2022-12-13 02:17:34,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:34,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:34,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:34,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:34,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:34,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:34,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:34,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:34,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:34,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:35,013 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:35,014 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:35,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:35,015 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:35,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:35,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:35,015 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:35,015 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:35,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:35,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:35,018 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,018 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:35,018 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:35,018 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:35,018 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,018 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:35,018 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:35,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:35,024 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:35,024 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:35,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:35,025 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:35,025 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:35,110 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:35,111 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:35,111 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:35,111 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 02:17:35,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:35,111 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:35,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable599 [2022-12-13 02:17:35,111 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 02:17:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:35,111 INFO L85 PathProgramCache]: Analyzing trace with hash 96817247, now seen corresponding path program 1 times [2022-12-13 02:17:35,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:35,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183127005] [2022-12-13 02:17:35,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:35,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:35,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:35,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183127005] [2022-12-13 02:17:35,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183127005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:35,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:35,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:35,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423744722] [2022-12-13 02:17:35,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:35,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:35,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:35,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:35,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:35,158 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:35,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:35,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:35,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:35,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:35,225 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:35,225 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:35,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:35,226 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:35,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:35,227 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:35,227 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:35,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:35,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:35,230 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,230 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:35,230 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:35,230 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:35,230 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:35,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:35,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:35,244 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:35,244 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:35,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:35,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:35,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:35,331 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:35,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:17:35,331 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:35,331 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 02:17:35,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:35,331 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:35,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable600 [2022-12-13 02:17:35,332 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 02:17:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:35,332 INFO L85 PathProgramCache]: Analyzing trace with hash 125446398, now seen corresponding path program 1 times [2022-12-13 02:17:35,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:35,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9121901] [2022-12-13 02:17:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:35,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:35,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:17:35,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:35,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9121901] [2022-12-13 02:17:35,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9121901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:35,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:35,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:35,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450781685] [2022-12-13 02:17:35,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:35,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:35,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:35,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:35,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:35,378 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:35,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:35,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:35,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:35,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:35,441 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:35,441 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:35,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:35,442 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:35,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:35,442 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:35,443 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:35,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:35,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:35,445 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,445 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:35,446 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:35,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:35,446 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,446 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:35,446 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:35,446 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:35,451 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:35,452 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:35,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:35,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:35,452 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:35,539 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:35,539 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:35,539 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:35,539 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 02:17:35,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:35,539 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:35,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable601 [2022-12-13 02:17:35,539 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 02:17:35,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash 154075549, now seen corresponding path program 1 times [2022-12-13 02:17:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:35,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868094409] [2022-12-13 02:17:35,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:35,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:35,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:17:35,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:35,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868094409] [2022-12-13 02:17:35,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868094409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:35,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:35,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:35,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223280602] [2022-12-13 02:17:35,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:35,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:35,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:35,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:35,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:35,601 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:35,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:35,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:35,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:35,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:35,685 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:35,685 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:35,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:35,686 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:35,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:35,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:35,687 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:35,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:35,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:35,689 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,689 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:35,689 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:35,689 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:35,689 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:35,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:35,690 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:35,695 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:35,695 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:35,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:35,696 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:35,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:35,781 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:35,782 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:35,782 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:35,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:35,782 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:35,782 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:35,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable602 [2022-12-13 02:17:35,782 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 02:17:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:35,782 INFO L85 PathProgramCache]: Analyzing trace with hash 182704700, now seen corresponding path program 1 times [2022-12-13 02:17:35,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:35,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268725391] [2022-12-13 02:17:35,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:35,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:35,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:17:35,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:35,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268725391] [2022-12-13 02:17:35,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268725391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:35,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:35,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:35,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105573305] [2022-12-13 02:17:35,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:35,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:35,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:35,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:35,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:35,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:35,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:35,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:35,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:35,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:35,930 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:35,930 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:35,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1125 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:35,931 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:35,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:35,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:35,932 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:35,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:35,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:35,935 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,935 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:35,935 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:35,935 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:35,935 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,935 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:35,935 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:35,935 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:35,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:35,941 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:35,941 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:35,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:35,942 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:35,942 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:36,033 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:36,034 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:17:36,034 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:36,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:36,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:36,034 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:36,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable603 [2022-12-13 02:17:36,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 02:17:36,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash 211333851, now seen corresponding path program 1 times [2022-12-13 02:17:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:36,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122994180] [2022-12-13 02:17:36,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:36,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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:17:36,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:36,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122994180] [2022-12-13 02:17:36,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122994180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:36,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:36,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:36,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060653105] [2022-12-13 02:17:36,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:36,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:36,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:36,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:36,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:36,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:36,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:36,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:36,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:36,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:36,167 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:36,167 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:36,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:36,168 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:36,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:36,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:36,169 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:36,169 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:36,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:36,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:36,171 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:36,172 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:36,172 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:36,172 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:36,172 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:36,172 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:36,172 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:36,172 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:36,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:36,178 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:36,178 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:36,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:36,178 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:36,178 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:36,272 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:36,272 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:17:36,272 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:36,272 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 02:17:36,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:36,272 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:36,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable604 [2022-12-13 02:17:36,272 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 02:17:36,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:36,273 INFO L85 PathProgramCache]: Analyzing trace with hash 239963002, now seen corresponding path program 1 times [2022-12-13 02:17:36,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:36,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789644486] [2022-12-13 02:17:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:36,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:36,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 02:17:36,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:36,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789644486] [2022-12-13 02:17:36,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789644486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:36,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:36,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966541692] [2022-12-13 02:17:36,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:36,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:36,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:36,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:36,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:36,342 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:36,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:36,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:36,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:36,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:36,420 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:36,420 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:36,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:36,421 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:36,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:36,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:36,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:36,422 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:36,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:36,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:36,424 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:36,424 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:36,425 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:36,425 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:36,425 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:36,425 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:36,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:36,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:36,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:36,431 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:36,431 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:36,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:36,431 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:36,431 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:36,518 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:36,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:36,518 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:36,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:36,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:36,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:36,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable605 [2022-12-13 02:17:36,519 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 02:17:36,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:36,519 INFO L85 PathProgramCache]: Analyzing trace with hash 268592153, now seen corresponding path program 1 times [2022-12-13 02:17:36,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:36,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381337534] [2022-12-13 02:17:36,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:36,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:36,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:17:36,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:36,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381337534] [2022-12-13 02:17:36,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381337534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:36,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:36,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:36,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981116544] [2022-12-13 02:17:36,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:36,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:36,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:36,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:36,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:36,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:36,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:36,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:36,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:36,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:36,671 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:36,671 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:36,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:36,672 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:36,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:36,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:36,673 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:36,673 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:36,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:36,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:36,675 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:36,676 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:36,676 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:36,676 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:36,676 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:36,676 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:36,676 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:36,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:36,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:36,682 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:36,682 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:36,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:36,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:36,683 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:36,770 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:36,770 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:36,770 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:36,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:36,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:36,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:36,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable606 [2022-12-13 02:17:36,771 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 02:17:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash 297221304, now seen corresponding path program 1 times [2022-12-13 02:17:36,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:36,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906514106] [2022-12-13 02:17:36,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:36,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:36,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:17:36,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:36,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906514106] [2022-12-13 02:17:36,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906514106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:36,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:36,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801163161] [2022-12-13 02:17:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:36,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:36,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:36,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:36,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:36,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:36,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:36,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:36,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:36,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:36,895 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:36,895 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:36,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:36,896 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:36,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:36,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:36,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:36,897 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:36,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:36,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:36,899 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:36,899 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:36,900 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:36,900 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:36,900 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:36,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:36,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:36,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:36,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:36,906 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:36,906 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:36,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:36,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:36,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:36,995 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:36,996 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:36,996 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:36,996 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 02:17:36,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:36,996 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:36,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable607 [2022-12-13 02:17:36,996 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 02:17:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash 325850455, now seen corresponding path program 1 times [2022-12-13 02:17:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:36,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457201953] [2022-12-13 02:17:36,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:36,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:37,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:17:37,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:37,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457201953] [2022-12-13 02:17:37,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457201953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:37,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:37,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108004800] [2022-12-13 02:17:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:37,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:37,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:37,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:37,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:37,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:37,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:37,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:37,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:37,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:37,110 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:37,110 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:37,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:37,111 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:37,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:37,112 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:37,112 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:37,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:37,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:37,115 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:37,115 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:37,115 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:37,115 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:37,115 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:37,115 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:37,115 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:37,115 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:37,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:37,121 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:37,121 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:37,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:37,122 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:37,122 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:37,215 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:37,215 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:17:37,215 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:37,216 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 02:17:37,216 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:37,216 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:37,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable608 [2022-12-13 02:17:37,216 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 02:17:37,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:37,216 INFO L85 PathProgramCache]: Analyzing trace with hash 354479606, now seen corresponding path program 1 times [2022-12-13 02:17:37,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:37,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747740443] [2022-12-13 02:17:37,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:37,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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:17:37,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:37,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747740443] [2022-12-13 02:17:37,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747740443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:37,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:37,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:37,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879926644] [2022-12-13 02:17:37,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:37,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:37,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:37,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:37,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:37,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:37,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:37,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:37,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:37,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:37,327 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:37,327 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:37,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:37,328 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:37,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:37,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:37,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:37,329 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:37,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:37,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:37,331 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:37,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:37,332 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:37,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:37,332 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:37,332 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:37,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:37,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:37,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:37,338 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:37,338 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:37,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 465 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:37,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:37,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:37,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:37,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:37,425 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:37,425 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 02:17:37,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:37,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:37,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable609 [2022-12-13 02:17:37,425 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 02:17:37,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:37,425 INFO L85 PathProgramCache]: Analyzing trace with hash 383108757, now seen corresponding path program 1 times [2022-12-13 02:17:37,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:37,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687384432] [2022-12-13 02:17:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:37,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:17:37,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:37,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687384432] [2022-12-13 02:17:37,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687384432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:37,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:37,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:37,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027561863] [2022-12-13 02:17:37,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:37,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:37,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:37,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:37,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:37,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:37,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:37,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:37,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:37,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:37,570 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:37,570 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:37,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:37,571 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:37,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:37,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:37,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:37,572 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:37,572 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:37,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:37,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:37,575 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:37,575 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:37,575 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:37,575 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:37,575 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:37,575 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:37,575 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:37,575 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:37,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:37,581 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:37,581 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:37,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:37,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:37,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:37,669 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:37,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:37,669 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:37,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:37,670 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:37,670 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:37,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable610 [2022-12-13 02:17:37,670 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 02:17:37,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash 411737908, now seen corresponding path program 1 times [2022-12-13 02:17:37,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:37,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239861522] [2022-12-13 02:17:37,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:37,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:37,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:17:37,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:37,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239861522] [2022-12-13 02:17:37,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239861522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:37,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:37,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:37,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620185634] [2022-12-13 02:17:37,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:37,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:37,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:37,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:37,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:37,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:37,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:37,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:37,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:37,838 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:37,838 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:37,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:37,840 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:37,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:37,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:37,840 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:37,840 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:37,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:37,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:37,845 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:37,845 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:37,845 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:37,845 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:37,845 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:37,845 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:37,845 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:37,846 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:37,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:37,853 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:37,853 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:37,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:37,854 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:37,854 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:37,963 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:37,964 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:17:37,964 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:37,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:37,964 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:37,964 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:37,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable611 [2022-12-13 02:17:37,964 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 02:17:37,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash 440367059, now seen corresponding path program 1 times [2022-12-13 02:17:37,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:37,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347691618] [2022-12-13 02:17:37,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:37,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:38,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:17:38,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:38,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347691618] [2022-12-13 02:17:38,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347691618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:38,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:38,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:38,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558223370] [2022-12-13 02:17:38,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:38,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:38,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:38,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:38,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:38,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:38,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:38,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:38,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:38,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:38,117 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:38,118 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:38,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:38,119 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:38,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:38,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:38,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:38,119 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:38,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:38,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:38,122 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:38,122 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:38,122 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:38,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:38,122 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:38,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:38,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:38,123 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:38,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:38,128 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:38,128 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:38,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:38,129 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:38,129 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:38,226 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:38,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:17:38,227 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:38,227 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 02:17:38,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:38,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:38,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable612 [2022-12-13 02:17:38,228 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 02:17:38,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:38,228 INFO L85 PathProgramCache]: Analyzing trace with hash 468996210, now seen corresponding path program 1 times [2022-12-13 02:17:38,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:38,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165000939] [2022-12-13 02:17:38,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:38,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:38,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:17:38,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:38,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165000939] [2022-12-13 02:17:38,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165000939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:38,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:38,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:38,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670767503] [2022-12-13 02:17:38,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:38,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:38,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:38,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:38,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:38,286 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:38,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:38,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:38,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:38,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:38,352 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:38,352 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:38,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:38,353 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:38,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:38,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:38,354 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:38,354 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:38,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:38,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:38,356 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:38,356 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:38,357 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:38,357 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:38,357 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:38,357 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:38,357 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:38,357 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:38,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:38,363 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:38,363 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:38,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:38,363 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:38,363 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:38,449 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:38,450 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:38,450 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:38,450 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 02:17:38,450 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:38,450 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:38,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable613 [2022-12-13 02:17:38,450 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 02:17:38,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:38,450 INFO L85 PathProgramCache]: Analyzing trace with hash 497625361, now seen corresponding path program 1 times [2022-12-13 02:17:38,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:38,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617780827] [2022-12-13 02:17:38,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:38,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:38,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:38,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617780827] [2022-12-13 02:17:38,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617780827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:38,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:38,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:38,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705936999] [2022-12-13 02:17:38,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:38,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:38,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:38,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:38,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:38,499 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:38,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:38,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:38,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:38,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:38,575 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:38,576 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:38,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:38,577 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:38,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:38,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:38,577 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:38,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:38,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:38,580 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:38,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:38,580 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:38,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:38,580 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:38,581 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:38,581 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:38,581 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:38,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:38,590 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:38,590 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:38,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:38,591 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:38,591 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:38,696 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:38,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:17:38,697 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:38,697 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 02:17:38,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:38,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:38,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable614 [2022-12-13 02:17:38,697 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 02:17:38,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:38,698 INFO L85 PathProgramCache]: Analyzing trace with hash 526254512, now seen corresponding path program 1 times [2022-12-13 02:17:38,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:38,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990865393] [2022-12-13 02:17:38,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:38,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:38,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:17:38,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:38,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990865393] [2022-12-13 02:17:38,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990865393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:38,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:38,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:38,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140537154] [2022-12-13 02:17:38,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:38,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:38,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:38,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:38,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:38,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:38,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:38,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:38,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:38,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:38,848 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:38,848 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:17:38,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:38,850 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:38,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:38,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:38,850 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:38,850 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:38,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:38,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:38,854 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:38,854 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:38,854 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:38,854 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:38,855 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:38,855 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:38,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:38,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:38,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:38,863 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:38,863 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:38,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:38,864 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:38,864 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:38,963 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:38,964 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 02:17:38,964 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:38,964 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 02:17:38,964 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:38,964 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:38,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable615 [2022-12-13 02:17:38,964 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 02:17:38,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:38,964 INFO L85 PathProgramCache]: Analyzing trace with hash 554883663, now seen corresponding path program 1 times [2022-12-13 02:17:38,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:38,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278036605] [2022-12-13 02:17:38,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:38,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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:17:39,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:39,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278036605] [2022-12-13 02:17:39,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278036605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:39,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:39,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:39,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268263677] [2022-12-13 02:17:39,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:39,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:39,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:39,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:39,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:39,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:39,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:39,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:39,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:39,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:39,086 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:39,086 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:39,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:39,087 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:39,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:39,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:39,087 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:39,088 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:39,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:39,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:39,090 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,090 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:39,090 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:39,090 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:39,091 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,091 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:39,091 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:39,091 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:39,097 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:39,097 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:39,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:39,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:39,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:39,184 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:39,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:39,185 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:39,185 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 02:17:39,185 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:39,185 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:39,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable616 [2022-12-13 02:17:39,185 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 02:17:39,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:39,185 INFO L85 PathProgramCache]: Analyzing trace with hash 583512814, now seen corresponding path program 1 times [2022-12-13 02:17:39,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:39,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993506208] [2022-12-13 02:17:39,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:39,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:39,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 02:17:39,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:39,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993506208] [2022-12-13 02:17:39,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993506208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:39,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:39,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:39,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080986677] [2022-12-13 02:17:39,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:39,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:39,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:39,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:39,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:39,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:39,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:39,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:39,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:39,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:39,322 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:39,322 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:39,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:39,323 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:39,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:39,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:39,323 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:39,323 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:39,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:39,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:39,326 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:39,326 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:39,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:39,326 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,327 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:39,327 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:39,327 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:39,332 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:39,332 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:17:39,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:39,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:39,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:39,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:39,418 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:17:39,418 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:39,419 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 02:17:39,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:39,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:39,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable617 [2022-12-13 02:17:39,419 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 02:17:39,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:39,419 INFO L85 PathProgramCache]: Analyzing trace with hash 612141965, now seen corresponding path program 1 times [2022-12-13 02:17:39,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:39,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808628828] [2022-12-13 02:17:39,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:39,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:39,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:17:39,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:39,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808628828] [2022-12-13 02:17:39,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808628828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:39,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:39,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995852287] [2022-12-13 02:17:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:39,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:39,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:39,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:39,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:39,466 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:39,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:39,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:39,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:39,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:39,532 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:39,532 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:39,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:39,533 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:39,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:39,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:39,534 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:39,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:39,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:39,536 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:39,536 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:39,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:39,536 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:39,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:39,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:39,542 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:39,542 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:39,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:39,543 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:39,543 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:39,629 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:39,630 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:39,630 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:39,630 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 02:17:39,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:39,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:39,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable618 [2022-12-13 02:17:39,630 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 02:17:39,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:39,630 INFO L85 PathProgramCache]: Analyzing trace with hash 640771116, now seen corresponding path program 1 times [2022-12-13 02:17:39,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:39,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596743082] [2022-12-13 02:17:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:39,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:39,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:17:39,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:39,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596743082] [2022-12-13 02:17:39,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596743082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:39,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:39,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:39,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977974043] [2022-12-13 02:17:39,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:39,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:39,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:39,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:39,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:39,677 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:39,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:39,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:39,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:39,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:39,743 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:39,744 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:39,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:39,745 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:39,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:39,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:39,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:39,745 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:39,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:39,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:39,748 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,748 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:39,748 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:39,748 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:39,748 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:39,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:39,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:39,754 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:39,754 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:39,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:39,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:39,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:39,842 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:39,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:39,843 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:39,843 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 02:17:39,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:39,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:39,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable619 [2022-12-13 02:17:39,843 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 02:17:39,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash 669400267, now seen corresponding path program 1 times [2022-12-13 02:17:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:39,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895502457] [2022-12-13 02:17:39,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:39,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:39,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:39,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895502457] [2022-12-13 02:17:39,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895502457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:39,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:39,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:39,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247662329] [2022-12-13 02:17:39,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:39,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:39,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:39,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:39,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:39,888 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:39,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:39,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:39,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:39,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:39,956 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:39,956 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:39,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1097 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:39,957 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:39,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:39,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:39,957 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:39,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:39,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:39,960 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,960 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:39,960 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:39,960 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:39,960 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,961 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:39,961 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:39,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:39,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:39,966 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:39,966 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:39,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:39,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:39,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:40,055 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:40,055 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:40,055 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:40,055 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 02:17:40,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:40,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:40,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable620 [2022-12-13 02:17:40,056 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 02:17:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash 698029418, now seen corresponding path program 1 times [2022-12-13 02:17:40,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:40,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938177614] [2022-12-13 02:17:40,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:40,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:40,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:17:40,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:40,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938177614] [2022-12-13 02:17:40,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938177614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:40,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:40,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:40,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462278444] [2022-12-13 02:17:40,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:40,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:40,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:40,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:40,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:40,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:40,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:40,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:40,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:40,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:40,177 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:40,177 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:40,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:40,178 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:40,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:40,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:40,179 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:40,179 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:40,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:40,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:40,182 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:40,182 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:40,182 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:40,182 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:40,182 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:40,182 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:40,182 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:40,182 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:40,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:40,188 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:40,188 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:40,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:40,189 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:40,189 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:40,276 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:40,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:40,276 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:40,276 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 02:17:40,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:40,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:40,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable621 [2022-12-13 02:17:40,277 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 02:17:40,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:40,277 INFO L85 PathProgramCache]: Analyzing trace with hash 726658569, now seen corresponding path program 1 times [2022-12-13 02:17:40,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:40,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146776774] [2022-12-13 02:17:40,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:40,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:40,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:17:40,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:40,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146776774] [2022-12-13 02:17:40,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146776774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:40,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:40,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:40,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526129240] [2022-12-13 02:17:40,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:40,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:40,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:40,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:40,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:40,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:40,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:40,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:40,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:40,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:40,425 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:40,425 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:40,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:40,426 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:40,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:40,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:40,427 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:40,427 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:40,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:40,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:40,429 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:40,429 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:40,430 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:40,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:40,430 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:40,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:40,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:40,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:40,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:40,436 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:40,436 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:40,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:40,436 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:40,436 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:40,524 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:40,525 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:40,525 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:40,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:40,525 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:40,525 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:40,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable622 [2022-12-13 02:17:40,525 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 02:17:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash 755287720, now seen corresponding path program 1 times [2022-12-13 02:17:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:40,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257765006] [2022-12-13 02:17:40,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:40,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:40,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:17:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:40,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257765006] [2022-12-13 02:17:40,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257765006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:40,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:40,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909904446] [2022-12-13 02:17:40,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:40,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:40,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:40,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:40,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:40,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:40,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:40,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:40,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:40,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:40,641 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:40,641 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:40,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:40,643 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:40,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:40,643 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:40,643 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:40,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:40,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:40,646 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:40,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:40,646 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:40,646 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:40,646 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:40,646 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:40,646 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:40,646 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:40,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:40,652 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:40,652 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:40,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:40,653 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:40,653 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:40,741 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:40,741 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:40,741 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:40,741 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 02:17:40,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:40,741 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:40,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable623 [2022-12-13 02:17:40,741 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 02:17:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:40,742 INFO L85 PathProgramCache]: Analyzing trace with hash 783916871, now seen corresponding path program 1 times [2022-12-13 02:17:40,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:40,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367048606] [2022-12-13 02:17:40,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:40,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:40,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:17:40,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:40,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367048606] [2022-12-13 02:17:40,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367048606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:40,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:40,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:40,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119471534] [2022-12-13 02:17:40,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:40,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:40,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:40,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:40,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:40,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:40,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:40,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:40,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:40,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:40,856 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:40,856 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:40,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:40,857 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:40,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:40,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:40,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:40,858 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:40,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:40,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:40,861 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:40,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:40,861 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:40,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:40,861 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:40,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:40,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:40,861 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:40,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:40,867 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:40,867 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:40,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:40,868 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:40,868 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:40,956 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:40,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:40,957 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:40,957 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 02:17:40,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:40,957 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:40,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable624 [2022-12-13 02:17:40,957 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 02:17:40,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:40,957 INFO L85 PathProgramCache]: Analyzing trace with hash 812546022, now seen corresponding path program 1 times [2022-12-13 02:17:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:40,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358701800] [2022-12-13 02:17:40,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:40,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:41,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:17:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:41,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358701800] [2022-12-13 02:17:41,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358701800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:41,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:41,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:41,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362144563] [2022-12-13 02:17:41,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:41,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:41,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:41,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:41,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:41,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:41,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:41,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:41,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:41,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:41,078 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:41,078 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:41,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:41,079 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:41,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:41,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:41,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:41,080 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:41,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:41,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:41,082 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:41,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:41,082 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:41,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:41,082 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:41,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:41,083 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:41,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:41,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:41,088 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:41,088 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:41,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:41,089 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:41,089 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:41,184 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:41,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:17:41,185 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:41,185 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 02:17:41,185 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:41,185 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:41,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable625 [2022-12-13 02:17:41,186 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 02:17:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash 841175173, now seen corresponding path program 1 times [2022-12-13 02:17:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:41,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810379020] [2022-12-13 02:17:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:41,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:17:41,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:41,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810379020] [2022-12-13 02:17:41,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810379020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:41,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:41,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:41,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68688818] [2022-12-13 02:17:41,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:41,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:41,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:41,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:41,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:41,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:41,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:41,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:41,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:41,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:41,307 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:41,308 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:41,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:41,309 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:41,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:41,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:41,309 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:41,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:41,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:41,312 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:41,312 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:41,312 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:41,312 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:41,312 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:41,312 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:41,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:41,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:41,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:41,318 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:41,318 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:41,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:41,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:41,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:41,406 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:41,406 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:41,406 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:41,406 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 02:17:41,406 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:41,407 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:41,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable626 [2022-12-13 02:17:41,407 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 02:17:41,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:41,407 INFO L85 PathProgramCache]: Analyzing trace with hash 869804324, now seen corresponding path program 1 times [2022-12-13 02:17:41,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:41,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036559411] [2022-12-13 02:17:41,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:41,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:41,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:17:41,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:41,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036559411] [2022-12-13 02:17:41,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036559411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:41,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:41,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:41,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118072619] [2022-12-13 02:17:41,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:41,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:41,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:41,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:41,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:41,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:41,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:41,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:41,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:41,542 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:41,542 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:41,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:41,543 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:41,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:41,544 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:41,544 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:41,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:41,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:41,547 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:41,547 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:41,547 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:41,547 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:41,547 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:41,547 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:41,547 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:41,547 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:41,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:41,553 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:41,553 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:41,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:41,554 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:41,554 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:41,655 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:41,655 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:17:41,656 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:41,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:41,656 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:41,656 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:41,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable627 [2022-12-13 02:17:41,656 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 02:17:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:41,656 INFO L85 PathProgramCache]: Analyzing trace with hash 898433475, now seen corresponding path program 1 times [2022-12-13 02:17:41,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:41,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974714744] [2022-12-13 02:17:41,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:41,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:41,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:17:41,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:41,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974714744] [2022-12-13 02:17:41,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974714744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:41,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:41,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:41,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213074780] [2022-12-13 02:17:41,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:41,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:41,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:41,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:41,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:41,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:41,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:41,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:41,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:41,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:41,770 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:41,771 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:41,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:41,772 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:41,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:41,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:41,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:41,772 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:41,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:41,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:41,775 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:41,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:41,775 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:41,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:41,775 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:41,775 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:41,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:41,776 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:41,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:41,781 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:41,781 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:41,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:41,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:41,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:41,868 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:41,869 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:41,869 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:41,869 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 02:17:41,869 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:41,869 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:41,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable628 [2022-12-13 02:17:41,869 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 02:17:41,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash 927062626, now seen corresponding path program 1 times [2022-12-13 02:17:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:41,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052625071] [2022-12-13 02:17:41,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:41,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:41,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:17:41,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:41,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052625071] [2022-12-13 02:17:41,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052625071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:41,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:41,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:41,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471738851] [2022-12-13 02:17:41,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:41,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:41,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:41,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:41,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:41,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:41,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:41,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:41,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:41,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:42,004 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:42,005 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:42,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:42,006 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:42,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:42,006 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:42,006 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:42,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:42,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:42,009 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:42,009 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:42,009 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:42,009 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:42,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:42,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:42,021 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:42,022 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:42,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:42,022 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:42,022 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:42,112 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:42,112 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:17:42,112 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:42,112 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 02:17:42,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:42,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:42,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable629 [2022-12-13 02:17:42,113 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 02:17:42,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash 955691777, now seen corresponding path program 1 times [2022-12-13 02:17:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:42,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506700868] [2022-12-13 02:17:42,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:42,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:42,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506700868] [2022-12-13 02:17:42,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506700868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:42,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:42,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:42,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940957727] [2022-12-13 02:17:42,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:42,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:42,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:42,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:42,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:42,158 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:42,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:42,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:42,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:42,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:42,239 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:42,240 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:42,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:42,241 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:42,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:42,241 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:42,241 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:42,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:42,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:42,244 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,244 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:42,244 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:42,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:42,244 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,244 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:42,244 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:42,245 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:42,250 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:42,250 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:42,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:42,251 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:42,251 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:42,339 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:42,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:42,340 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:42,340 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 02:17:42,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:42,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:42,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable630 [2022-12-13 02:17:42,340 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 02:17:42,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash 984320928, now seen corresponding path program 1 times [2022-12-13 02:17:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:42,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196673859] [2022-12-13 02:17:42,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:42,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:42,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196673859] [2022-12-13 02:17:42,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196673859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:42,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:42,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:42,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224003796] [2022-12-13 02:17:42,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:42,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:42,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:42,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:42,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:42,384 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:42,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:42,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:42,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:42,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:42,449 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:42,449 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:42,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:42,450 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:42,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:42,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:42,451 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:42,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:42,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:42,454 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,454 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:42,454 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:42,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:42,454 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,454 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:42,454 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:42,454 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:42,460 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:42,460 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:42,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:42,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:42,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:42,548 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:42,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:42,549 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:42,549 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 02:17:42,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:42,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:42,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable631 [2022-12-13 02:17:42,549 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 02:17:42,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:42,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1012950079, now seen corresponding path program 1 times [2022-12-13 02:17:42,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:42,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839037631] [2022-12-13 02:17:42,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:42,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:42,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 02:17:42,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:42,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839037631] [2022-12-13 02:17:42,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839037631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:42,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:42,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:42,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479936191] [2022-12-13 02:17:42,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:42,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:42,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:42,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:42,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:42,597 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:42,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:42,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:42,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:42,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:42,672 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:42,672 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:42,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:42,673 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:42,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:42,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:42,674 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:42,674 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:42,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:42,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:42,677 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:42,677 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:42,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:42,677 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:42,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:42,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:42,683 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:42,683 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:42,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:42,684 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:42,684 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:42,779 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:42,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:17:42,780 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:42,780 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 02:17:42,780 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:42,780 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:42,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable632 [2022-12-13 02:17:42,780 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 02:17:42,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:42,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1041579230, now seen corresponding path program 1 times [2022-12-13 02:17:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:42,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540394887] [2022-12-13 02:17:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:42,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:17:42,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:42,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540394887] [2022-12-13 02:17:42,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540394887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:42,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:42,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:42,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113445157] [2022-12-13 02:17:42,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:42,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:42,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:42,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:42,831 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:42,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:42,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:42,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:42,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:42,910 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:42,910 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:42,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1125 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:42,911 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:42,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:42,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:42,912 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:42,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:42,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:42,914 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,914 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:42,915 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:42,915 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:42,915 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:42,915 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:42,915 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:42,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:42,922 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:42,922 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:42,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:42,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:42,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:43,009 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:43,010 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:43,010 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:43,010 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 02:17:43,010 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:43,010 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:43,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable633 [2022-12-13 02:17:43,010 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 02:17:43,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:43,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1070208381, now seen corresponding path program 1 times [2022-12-13 02:17:43,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:43,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761245947] [2022-12-13 02:17:43,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:43,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:43,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:43,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761245947] [2022-12-13 02:17:43,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761245947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:43,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:43,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:43,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540409675] [2022-12-13 02:17:43,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:43,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:43,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:43,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:43,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:43,064 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:43,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:43,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:43,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:43,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:43,129 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:43,130 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:43,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:43,131 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:43,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:43,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:43,131 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:43,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:43,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:43,134 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:43,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:43,134 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:43,134 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:43,134 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:43,134 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:43,134 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:43,134 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:43,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:43,140 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:43,140 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:43,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:43,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:43,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:43,227 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:43,228 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:43,228 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:43,228 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 02:17:43,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:43,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:43,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable634 [2022-12-13 02:17:43,228 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 02:17:43,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1098837532, now seen corresponding path program 1 times [2022-12-13 02:17:43,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:43,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066717125] [2022-12-13 02:17:43,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:43,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:17:43,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:43,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066717125] [2022-12-13 02:17:43,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066717125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:43,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:43,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:43,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505883486] [2022-12-13 02:17:43,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:43,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:43,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:43,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:43,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:43,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:43,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:43,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:43,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:43,356 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:43,356 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:43,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:43,357 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:43,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:43,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:43,358 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:43,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:43,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:43,360 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:43,360 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:43,360 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:43,360 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:43,361 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:43,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:43,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:43,361 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:43,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:43,366 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:43,367 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:43,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:43,367 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:43,367 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:43,454 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:43,454 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:43,454 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:43,454 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 02:17:43,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:43,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:43,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable635 [2022-12-13 02:17:43,455 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 02:17:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:43,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1127466683, now seen corresponding path program 1 times [2022-12-13 02:17:43,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:43,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135423944] [2022-12-13 02:17:43,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:43,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:17:43,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:43,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135423944] [2022-12-13 02:17:43,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135423944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:43,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:43,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:43,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154719618] [2022-12-13 02:17:43,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:43,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:43,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:43,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:43,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:43,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:43,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:43,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:43,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:43,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:43,577 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:43,577 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:43,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:43,578 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:43,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:43,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:43,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:43,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:43,579 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:43,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:43,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:43,582 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:43,582 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:43,582 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:43,582 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:43,582 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:43,582 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:43,582 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:43,582 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:43,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:43,588 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:43,588 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:43,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:43,589 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:43,589 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:43,675 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:43,675 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:43,675 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:43,675 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 02:17:43,675 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:43,675 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:43,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636 [2022-12-13 02:17:43,676 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 02:17:43,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:43,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1156095834, now seen corresponding path program 1 times [2022-12-13 02:17:43,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:43,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059998523] [2022-12-13 02:17:43,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:43,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:43,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:17:43,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:43,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059998523] [2022-12-13 02:17:43,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059998523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:43,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:43,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:43,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495402127] [2022-12-13 02:17:43,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:43,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:43,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:43,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:43,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:43,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:43,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:43,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:43,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:43,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:43,798 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:43,798 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:43,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:43,799 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:43,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:43,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:43,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:43,799 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:43,799 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:43,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:43,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:43,802 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:43,802 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:43,802 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:43,802 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:43,802 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:43,802 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:43,802 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:43,802 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:43,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:43,808 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:43,808 INFO L131 PetriNetUnfolder]: For 435/444 co-relation queries the response was YES. [2022-12-13 02:17:43,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/444 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:43,809 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:43,809 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:43,895 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:43,895 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:43,895 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:43,895 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 02:17:43,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:43,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:43,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable637 [2022-12-13 02:17:43,896 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 02:17:43,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:43,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1184724985, now seen corresponding path program 1 times [2022-12-13 02:17:43,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:43,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567152800] [2022-12-13 02:17:43,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:43,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:43,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:17:43,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:43,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567152800] [2022-12-13 02:17:43,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567152800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:43,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:43,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:43,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214432803] [2022-12-13 02:17:43,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:43,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:43,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:43,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:43,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:43,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:43,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:43,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:43,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:43,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:44,035 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:44,035 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:17:44,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:44,036 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:44,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:44,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:44,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:44,037 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:44,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:44,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:44,039 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:44,040 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:44,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:44,040 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:44,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:44,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:44,047 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:44,047 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:17:44,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:44,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:44,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:44,135 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:44,135 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:44,136 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:44,136 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 02:17:44,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:44,136 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:44,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable638 [2022-12-13 02:17:44,136 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 02:17:44,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:44,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1213354136, now seen corresponding path program 1 times [2022-12-13 02:17:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:44,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641728872] [2022-12-13 02:17:44,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:44,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:44,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:44,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641728872] [2022-12-13 02:17:44,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641728872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:44,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:44,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:44,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585414371] [2022-12-13 02:17:44,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:44,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:44,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:44,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:44,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:44,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:44,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:44,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:44,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:44,251 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:44,252 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:44,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:44,253 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:44,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:44,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:44,253 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:44,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:44,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:44,257 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,257 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:44,257 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:44,257 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:44,257 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:44,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:44,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:44,263 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:44,263 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:44,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:44,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:44,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:44,351 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:44,351 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:44,351 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:44,351 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 02:17:44,351 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:44,351 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:44,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable639 [2022-12-13 02:17:44,351 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 02:17:44,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1241983287, now seen corresponding path program 1 times [2022-12-13 02:17:44,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:44,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891966457] [2022-12-13 02:17:44,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:44,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:44,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:17:44,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:44,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891966457] [2022-12-13 02:17:44,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891966457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:44,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:44,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:44,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035926707] [2022-12-13 02:17:44,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:44,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:44,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:44,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:44,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:44,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:44,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:44,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:44,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:44,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:44,466 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:44,467 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:44,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:44,468 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:44,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:44,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:44,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:44,468 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:44,468 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:44,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:44,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:44,471 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,471 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:44,471 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:44,471 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:44,471 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:44,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:44,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:44,477 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:44,477 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:44,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:44,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:44,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:44,565 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:44,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:44,565 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:44,566 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 02:17:44,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:44,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:44,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable640 [2022-12-13 02:17:44,566 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 02:17:44,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1270612438, now seen corresponding path program 1 times [2022-12-13 02:17:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:44,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040409852] [2022-12-13 02:17:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:44,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:44,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:17:44,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:44,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040409852] [2022-12-13 02:17:44,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040409852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:44,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:44,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:44,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811192859] [2022-12-13 02:17:44,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:44,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:44,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:44,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:44,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:44,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:44,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:44,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:44,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:44,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:44,703 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:44,703 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:44,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:44,704 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:44,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:44,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:44,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:44,705 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:44,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:44,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:44,707 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:44,707 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:44,708 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:44,708 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,708 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:44,708 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:44,708 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:44,713 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:44,714 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:44,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:44,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:44,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:44,800 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:44,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:44,801 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:44,801 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 02:17:44,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:44,801 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:44,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable641 [2022-12-13 02:17:44,801 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 02:17:44,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1299241589, now seen corresponding path program 1 times [2022-12-13 02:17:44,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:44,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348715142] [2022-12-13 02:17:44,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:44,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:44,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:17:44,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:44,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348715142] [2022-12-13 02:17:44,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348715142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:44,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:44,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:44,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375415272] [2022-12-13 02:17:44,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:44,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:44,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:44,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:44,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:44,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:44,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:44,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:44,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:44,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:44,922 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:44,923 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:44,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:44,924 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:44,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:44,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:44,927 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:44,927 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:44,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:44,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:44,930 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:44,930 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:44,930 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:44,930 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:44,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:44,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:44,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:44,936 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:44,937 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:44,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:44,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:44,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:45,024 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:45,024 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:45,024 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:45,024 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 02:17:45,025 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:45,025 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:45,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable642 [2022-12-13 02:17:45,025 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 02:17:45,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:45,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1327870740, now seen corresponding path program 1 times [2022-12-13 02:17:45,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:45,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369088840] [2022-12-13 02:17:45,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:45,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:45,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:17:45,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:45,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369088840] [2022-12-13 02:17:45,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369088840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:45,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:45,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:45,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335362881] [2022-12-13 02:17:45,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:45,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:45,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:45,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:45,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:45,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:45,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:45,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:45,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:45,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:45,146 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:45,146 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:45,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:45,147 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:45,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:45,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:45,148 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:45,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:45,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:45,150 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:45,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:45,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:45,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:45,150 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:45,151 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:45,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:45,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:45,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:45,156 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:45,156 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:45,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:45,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:45,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:45,245 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:45,246 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:45,246 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:45,246 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 02:17:45,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:45,246 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:45,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable643 [2022-12-13 02:17:45,246 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 02:17:45,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:45,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1356499891, now seen corresponding path program 1 times [2022-12-13 02:17:45,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:45,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842436940] [2022-12-13 02:17:45,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:45,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:45,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:17:45,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:45,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842436940] [2022-12-13 02:17:45,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842436940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:45,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:45,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:45,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986149161] [2022-12-13 02:17:45,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:45,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:45,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:45,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:45,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:45,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:45,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:45,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:45,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:45,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:45,360 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:45,360 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:45,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:45,362 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:45,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:45,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:45,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:45,362 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:45,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:45,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:45,365 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:45,365 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:45,365 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:45,365 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:45,365 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:45,365 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:45,365 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:45,365 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:45,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:45,371 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:45,371 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:45,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:45,372 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:45,372 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:45,463 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:45,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:17:45,463 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:45,463 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 02:17:45,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:45,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:45,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable644 [2022-12-13 02:17:45,463 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 02:17:45,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:45,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1385129042, now seen corresponding path program 1 times [2022-12-13 02:17:45,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:45,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050945843] [2022-12-13 02:17:45,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:45,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:45,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:17:45,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:45,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050945843] [2022-12-13 02:17:45,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050945843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:45,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:45,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:45,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704717786] [2022-12-13 02:17:45,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:45,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:45,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:45,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:45,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:45,526 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:45,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:45,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:45,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:45,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:45,604 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:45,604 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:45,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:45,605 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:45,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:45,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:45,606 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:45,606 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:45,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:45,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:45,608 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:45,608 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:45,609 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:45,609 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:45,609 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:45,609 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:45,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:45,609 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:45,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:45,615 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:45,615 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:45,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:45,615 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:45,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:45,703 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:45,704 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:45,704 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:45,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:45,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:45,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:45,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable645 [2022-12-13 02:17:45,704 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 02:17:45,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1413758193, now seen corresponding path program 1 times [2022-12-13 02:17:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:45,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016007910] [2022-12-13 02:17:45,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:45,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:45,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:17:45,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:45,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016007910] [2022-12-13 02:17:45,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016007910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:45,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:45,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:45,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474017185] [2022-12-13 02:17:45,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:45,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:45,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:45,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:45,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:45,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:45,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:45,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:45,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:45,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:45,835 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:45,836 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:45,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:45,836 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:45,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:45,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:45,837 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:45,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:45,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:45,840 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:45,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:45,840 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:45,840 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:45,840 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:45,840 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:45,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:45,840 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:45,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:45,846 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:45,846 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:17:45,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:45,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:45,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:45,933 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:45,934 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:45,934 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:45,934 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 02:17:45,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:45,934 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:45,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable646 [2022-12-13 02:17:45,934 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 02:17:45,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1442387344, now seen corresponding path program 1 times [2022-12-13 02:17:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:45,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239018641] [2022-12-13 02:17:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:45,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:17:45,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:45,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239018641] [2022-12-13 02:17:45,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239018641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:45,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:45,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:45,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199745735] [2022-12-13 02:17:45,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:45,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:45,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:45,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:45,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:45,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:45,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:45,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:45,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:46,067 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:46,067 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:46,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:46,068 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:46,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:46,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:46,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:46,068 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:46,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:46,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:46,071 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,071 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:46,071 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:46,071 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:46,071 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,072 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:46,072 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:46,072 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:46,077 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:46,077 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:46,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:46,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:46,078 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:46,163 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:46,163 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:17:46,163 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:46,163 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 02:17:46,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:46,163 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:46,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable647 [2022-12-13 02:17:46,163 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 02:17:46,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:46,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1471016495, now seen corresponding path program 1 times [2022-12-13 02:17:46,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:46,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682301934] [2022-12-13 02:17:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:46,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:46,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:17:46,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:46,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682301934] [2022-12-13 02:17:46,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682301934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:46,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:46,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:46,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713708607] [2022-12-13 02:17:46,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:46,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:46,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:46,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:46,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:46,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:46,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:46,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:46,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:46,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:46,275 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:46,275 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:46,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:46,276 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:46,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:46,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:46,277 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:46,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:46,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:46,279 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,279 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:46,279 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:46,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:46,280 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,280 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:46,280 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:46,280 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:46,285 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:46,285 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:46,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:46,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:46,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:46,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:46,371 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:17:46,371 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:46,372 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 02:17:46,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:46,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:46,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable648 [2022-12-13 02:17:46,372 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 02:17:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1499645646, now seen corresponding path program 1 times [2022-12-13 02:17:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:46,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568087517] [2022-12-13 02:17:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:46,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:46,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:17:46,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:46,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568087517] [2022-12-13 02:17:46,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568087517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:46,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:46,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134561525] [2022-12-13 02:17:46,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:46,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:46,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:46,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:46,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:46,435 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:46,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:46,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:46,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:46,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:46,510 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:46,511 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:46,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:46,512 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:46,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:46,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:46,512 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:46,512 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:46,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:46,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:46,515 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,515 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:46,515 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:46,515 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:46,515 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:46,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:46,515 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:46,521 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:46,521 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:46,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:46,521 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:46,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:46,607 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:46,608 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:46,608 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:46,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:46,608 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:46,608 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:46,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable649 [2022-12-13 02:17:46,608 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 02:17:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1528274797, now seen corresponding path program 1 times [2022-12-13 02:17:46,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:46,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848053992] [2022-12-13 02:17:46,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:46,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:46,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:17:46,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:46,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848053992] [2022-12-13 02:17:46,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848053992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:46,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:46,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:46,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226782748] [2022-12-13 02:17:46,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:46,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:46,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:46,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:46,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:46,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:46,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:46,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:46,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:46,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:46,748 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:46,748 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:46,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:46,749 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:46,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:46,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:46,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:46,750 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:46,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:46,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:46,753 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:46,753 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:46,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:46,753 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:46,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:46,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:46,766 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:46,766 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:46,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:46,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:46,767 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:46,852 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:46,852 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:17:46,852 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:46,852 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 02:17:46,852 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:46,852 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:46,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable650 [2022-12-13 02:17:46,853 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 02:17:46,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:46,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1556903948, now seen corresponding path program 1 times [2022-12-13 02:17:46,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:46,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794203905] [2022-12-13 02:17:46,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:46,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:46,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:17:46,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:46,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794203905] [2022-12-13 02:17:46,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794203905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:46,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:46,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:46,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338115234] [2022-12-13 02:17:46,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:46,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:46,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:46,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:46,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:46,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:46,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:46,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:46,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:46,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:46,973 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:46,973 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:46,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1125 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:46,974 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:46,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:46,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:46,975 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:46,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:46,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:46,977 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:46,978 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:46,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:46,978 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:46,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:46,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:46,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:46,984 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:46,984 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:46,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:46,985 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:46,985 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:47,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:47,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:17:47,070 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:47,070 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 02:17:47,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:47,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:47,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable651 [2022-12-13 02:17:47,071 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 02:17:47,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:47,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1585533099, now seen corresponding path program 1 times [2022-12-13 02:17:47,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:47,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060913278] [2022-12-13 02:17:47,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:47,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:47,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:17:47,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:47,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060913278] [2022-12-13 02:17:47,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060913278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:47,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:47,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:47,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578137224] [2022-12-13 02:17:47,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:47,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:47,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:47,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:47,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:47,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:47,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:47,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:47,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:47,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:47,185 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:47,185 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:47,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:47,187 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:47,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:47,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:47,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:47,187 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:47,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:47,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:47,190 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:47,190 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:47,190 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:47,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:47,190 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:47,190 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:47,190 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:47,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:47,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:47,196 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:47,196 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:47,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:47,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:47,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:47,282 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:47,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:47,283 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:47,283 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 02:17:47,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:47,283 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:47,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable652 [2022-12-13 02:17:47,283 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 02:17:47,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1614162250, now seen corresponding path program 1 times [2022-12-13 02:17:47,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:47,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850983734] [2022-12-13 02:17:47,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:47,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:47,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:17:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:47,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850983734] [2022-12-13 02:17:47,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850983734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:47,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:47,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:47,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929633598] [2022-12-13 02:17:47,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:47,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:47,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:47,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:47,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:47,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:47,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:47,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:47,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:47,396 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:47,397 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:47,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:47,398 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:47,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:47,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:47,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:47,398 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:47,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:47,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:47,401 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:47,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:47,401 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:47,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:47,401 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:47,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:47,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:47,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:47,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:47,410 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:47,410 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:47,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:47,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:47,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:47,513 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:47,513 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 02:17:47,514 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:47,514 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 02:17:47,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:47,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:47,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable653 [2022-12-13 02:17:47,514 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 02:17:47,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:47,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1642791401, now seen corresponding path program 1 times [2022-12-13 02:17:47,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:47,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726112666] [2022-12-13 02:17:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:47,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:47,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:17:47,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:47,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726112666] [2022-12-13 02:17:47,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726112666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:47,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:47,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:47,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565723638] [2022-12-13 02:17:47,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:47,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:47,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:47,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:47,590 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:47,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:47,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:47,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:47,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:47,679 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:47,679 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:47,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:47,680 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:47,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:47,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:47,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:47,681 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:47,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:47,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:47,684 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:47,684 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:47,684 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:47,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:47,684 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:47,685 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:47,685 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:47,685 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:47,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:47,691 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:47,691 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:47,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:47,692 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:47,692 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:47,785 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:47,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:17:47,786 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:47,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:47,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:47,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:47,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable654 [2022-12-13 02:17:47,786 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 02:17:47,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1671420552, now seen corresponding path program 1 times [2022-12-13 02:17:47,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:47,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341644092] [2022-12-13 02:17:47,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:47,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:47,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:17:47,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:47,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341644092] [2022-12-13 02:17:47,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341644092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:47,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:47,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:47,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906625149] [2022-12-13 02:17:47,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:47,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:47,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:47,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:47,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:47,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:47,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:47,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:47,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:47,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:47,899 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:47,899 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:47,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:47,900 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:47,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:47,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:47,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:47,901 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:47,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:47,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:47,903 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:47,903 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:47,903 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:47,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:47,903 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:47,904 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:47,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:47,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:47,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:47,909 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:47,909 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:47,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:47,910 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:47,910 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:47,996 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:47,996 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:47,996 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:47,996 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 02:17:47,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:47,996 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:47,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable655 [2022-12-13 02:17:47,996 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 02:17:47,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:47,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1700049703, now seen corresponding path program 1 times [2022-12-13 02:17:47,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:47,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359122855] [2022-12-13 02:17:47,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:47,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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 02:17:48,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:48,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359122855] [2022-12-13 02:17:48,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359122855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:48,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:48,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:48,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204360637] [2022-12-13 02:17:48,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:48,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:48,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:48,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:48,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:48,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:48,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:48,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:48,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:48,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:48,111 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:48,111 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:48,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:48,112 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:48,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:48,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:48,113 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:48,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:48,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:48,116 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:48,116 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:48,116 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:48,116 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:48,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:48,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:48,124 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:48,125 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:48,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:48,125 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:48,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:48,213 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:48,213 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:17:48,213 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:48,213 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 02:17:48,214 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:48,214 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:48,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable656 [2022-12-13 02:17:48,214 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 02:17:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:48,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1728678854, now seen corresponding path program 1 times [2022-12-13 02:17:48,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:48,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640512220] [2022-12-13 02:17:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:48,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:48,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:17:48,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:48,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640512220] [2022-12-13 02:17:48,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640512220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:48,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:48,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:48,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431644046] [2022-12-13 02:17:48,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:48,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:48,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:48,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:48,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:48,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:48,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:48,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:48,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:48,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:48,337 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:48,337 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:48,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:48,338 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:48,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:48,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:48,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:48,339 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:48,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:48,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:48,341 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,341 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:48,342 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:48,342 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:48,342 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:48,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:48,342 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:48,348 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:48,348 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:48,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:48,348 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:48,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:48,435 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:48,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:48,436 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:48,436 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 02:17:48,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:48,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:48,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable657 [2022-12-13 02:17:48,436 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 02:17:48,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1757308005, now seen corresponding path program 1 times [2022-12-13 02:17:48,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:48,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874837167] [2022-12-13 02:17:48,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:48,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:48,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:17:48,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:48,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874837167] [2022-12-13 02:17:48,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874837167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:48,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:48,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:48,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047476920] [2022-12-13 02:17:48,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:48,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:48,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:48,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:48,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:48,482 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:48,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:48,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:48,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:48,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:48,557 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:48,557 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:48,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:48,558 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:48,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:48,559 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:48,559 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:48,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:48,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:48,561 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,561 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:48,561 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:48,561 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:48,561 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,562 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:48,562 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:48,562 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:48,567 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:48,567 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:48,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:48,568 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:48,568 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:48,654 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:48,655 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:48,655 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:48,655 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 02:17:48,655 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:48,655 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:48,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable658 [2022-12-13 02:17:48,655 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 02:17:48,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:48,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1785937156, now seen corresponding path program 1 times [2022-12-13 02:17:48,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:48,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185711510] [2022-12-13 02:17:48,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:48,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:48,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:17:48,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:48,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185711510] [2022-12-13 02:17:48,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185711510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:48,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:48,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:48,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25850046] [2022-12-13 02:17:48,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:48,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:48,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:48,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:48,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:48,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:48,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:48,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:48,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:48,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:48,776 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:48,777 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:48,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:48,778 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:48,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:48,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:48,778 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:48,778 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:48,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:48,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:48,780 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,781 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:48,781 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:48,781 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:48,781 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,781 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:48,781 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:48,781 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:48,787 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:48,787 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:48,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:48,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:48,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:48,873 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:48,874 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:48,874 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:48,874 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 02:17:48,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:48,874 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:48,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable659 [2022-12-13 02:17:48,874 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 02:17:48,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1814566307, now seen corresponding path program 1 times [2022-12-13 02:17:48,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:48,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766845349] [2022-12-13 02:17:48,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:48,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:48,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:17:48,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:48,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766845349] [2022-12-13 02:17:48,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766845349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:48,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:48,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:48,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039106696] [2022-12-13 02:17:48,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:48,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:48,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:48,922 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:48,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:48,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:48,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:48,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:48,988 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:48,988 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:48,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:48,989 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:48,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:48,990 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:48,990 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:48,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:48,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:48,992 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,992 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:48,993 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:48,993 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:48,993 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,993 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:48,993 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:48,993 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:48,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:48,999 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:48,999 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:48,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:48,999 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:48,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:49,085 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:49,085 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:17:49,085 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:49,085 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 02:17:49,086 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:49,086 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:49,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable660 [2022-12-13 02:17:49,086 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 02:17:49,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:49,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1843195458, now seen corresponding path program 1 times [2022-12-13 02:17:49,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:49,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584947771] [2022-12-13 02:17:49,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:49,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:49,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:17:49,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:49,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584947771] [2022-12-13 02:17:49,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584947771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:49,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:49,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568202954] [2022-12-13 02:17:49,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:49,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:49,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:49,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:49,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:49,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:49,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:49,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:49,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:49,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:49,205 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:49,205 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:49,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:49,206 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:49,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:49,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:49,207 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:49,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:49,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:49,209 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:49,210 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:49,210 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:49,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:49,210 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:49,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:49,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:49,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:49,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:49,216 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:49,216 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:49,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:49,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:49,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:49,302 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:49,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:49,303 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:49,303 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 02:17:49,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:49,303 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:49,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable661 [2022-12-13 02:17:49,303 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 02:17:49,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:49,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1871824609, now seen corresponding path program 1 times [2022-12-13 02:17:49,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:49,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971870574] [2022-12-13 02:17:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:49,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:49,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:17:49,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:49,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971870574] [2022-12-13 02:17:49,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971870574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:49,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:49,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:49,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803764401] [2022-12-13 02:17:49,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:49,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:49,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:49,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:49,352 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:49,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:49,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:49,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:49,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:49,426 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:49,427 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:49,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:49,428 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:49,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:49,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:49,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:49,428 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:49,428 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:49,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:49,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:49,431 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:49,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:49,431 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:49,431 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:49,431 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:49,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:49,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:49,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:49,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:49,437 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:49,437 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:49,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:49,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:49,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:49,523 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:49,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:49,524 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:49,524 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 02:17:49,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:49,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:49,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable662 [2022-12-13 02:17:49,524 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 02:17:49,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:49,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1900453760, now seen corresponding path program 1 times [2022-12-13 02:17:49,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:49,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487958823] [2022-12-13 02:17:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:49,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:49,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:17:49,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:49,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487958823] [2022-12-13 02:17:49,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487958823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:49,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:49,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275562131] [2022-12-13 02:17:49,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:49,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:49,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:49,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:49,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:49,570 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:49,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:49,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:49,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:49,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:49,642 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:49,642 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:49,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:49,643 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:49,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:49,644 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:49,644 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:49,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:49,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:49,646 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:49,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:49,647 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:49,647 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:49,647 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:49,647 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:49,647 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:49,647 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:49,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:49,653 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:49,653 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:49,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:49,653 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:49,653 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:49,740 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:49,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:49,740 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:49,740 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 02:17:49,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:49,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:49,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable663 [2022-12-13 02:17:49,740 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 02:17:49,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:49,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1929082911, now seen corresponding path program 1 times [2022-12-13 02:17:49,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:49,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271018599] [2022-12-13 02:17:49,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:49,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:17:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:49,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271018599] [2022-12-13 02:17:49,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271018599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:49,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:49,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164022525] [2022-12-13 02:17:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:49,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:49,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:49,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:49,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:49,789 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:49,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:49,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:49,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:49,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:49,855 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:49,855 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:49,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:49,856 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:49,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:49,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:49,857 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:49,857 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:49,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:49,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:49,859 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:49,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:49,860 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:49,860 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:49,860 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:49,860 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:49,860 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:49,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:49,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:49,866 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:49,866 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:49,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:49,866 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:49,866 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:49,953 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:49,953 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:49,953 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:49,953 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 02:17:49,953 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:49,953 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:49,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable664 [2022-12-13 02:17:49,953 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 02:17:49,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:49,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1957712062, now seen corresponding path program 1 times [2022-12-13 02:17:49,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:49,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780703036] [2022-12-13 02:17:49,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:49,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:50,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:17:50,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:50,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780703036] [2022-12-13 02:17:50,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780703036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:50,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:50,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:50,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85222085] [2022-12-13 02:17:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:50,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:50,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:50,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:50,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:50,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:50,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:50,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:50,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:50,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:50,079 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:50,079 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:50,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:50,080 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:50,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:50,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:50,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:50,081 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:50,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:50,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:50,083 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,083 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:50,083 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:50,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:50,083 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,084 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:50,084 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:50,084 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:50,089 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:50,090 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:50,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:50,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:50,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:50,176 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:50,176 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:50,176 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:50,176 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 02:17:50,176 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:50,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:50,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable665 [2022-12-13 02:17:50,176 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 02:17:50,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:50,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1986341213, now seen corresponding path program 1 times [2022-12-13 02:17:50,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:50,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463431902] [2022-12-13 02:17:50,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:50,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:50,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:17:50,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:50,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463431902] [2022-12-13 02:17:50,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463431902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:50,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:50,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:50,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890914354] [2022-12-13 02:17:50,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:50,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:50,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:50,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:50,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:50,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:50,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:50,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:50,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:50,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:50,290 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:50,290 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:50,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:50,291 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:50,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:50,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:50,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:50,292 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:50,292 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:50,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:50,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:50,294 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,294 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:50,294 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:50,295 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:50,295 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,295 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:50,295 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:50,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:50,300 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:50,301 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:50,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:50,301 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:50,301 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:50,388 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:50,389 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:50,389 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:50,389 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 02:17:50,389 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:50,389 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:50,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable666 [2022-12-13 02:17:50,389 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 02:17:50,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:50,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2014970364, now seen corresponding path program 1 times [2022-12-13 02:17:50,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:50,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055894284] [2022-12-13 02:17:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:50,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:50,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:17:50,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:50,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055894284] [2022-12-13 02:17:50,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055894284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:50,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:50,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:50,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233962724] [2022-12-13 02:17:50,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:50,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:50,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:50,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:50,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:50,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:50,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:50,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:50,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:50,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:50,522 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:50,522 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:50,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:50,523 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:50,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:50,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:50,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:50,524 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:50,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:50,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:50,526 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,526 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:50,526 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:50,526 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:50,526 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,527 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:50,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:50,527 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:50,532 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:50,532 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:50,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:50,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:50,533 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:50,621 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:50,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:50,622 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:50,622 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 02:17:50,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:50,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:50,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable667 [2022-12-13 02:17:50,622 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 02:17:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:50,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2043599515, now seen corresponding path program 1 times [2022-12-13 02:17:50,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:50,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949126229] [2022-12-13 02:17:50,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:50,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:50,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:17:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:50,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949126229] [2022-12-13 02:17:50,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949126229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:50,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:50,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964406590] [2022-12-13 02:17:50,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:50,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:50,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:50,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:50,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:50,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:50,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:50,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:50,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:50,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:50,754 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:50,754 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:50,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:50,755 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:50,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:50,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:50,755 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:50,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:50,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:50,758 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,758 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:50,758 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:50,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:50,759 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,759 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:50,759 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:50,759 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:50,764 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:50,765 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:50,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:50,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:50,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:50,858 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:50,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:17:50,858 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:50,858 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 02:17:50,858 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:50,858 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:50,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable668 [2022-12-13 02:17:50,858 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 02:17:50,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:50,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2072228666, now seen corresponding path program 1 times [2022-12-13 02:17:50,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:50,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027389926] [2022-12-13 02:17:50,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:50,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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 02:17:50,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:50,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027389926] [2022-12-13 02:17:50,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027389926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:50,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:50,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:50,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67061711] [2022-12-13 02:17:50,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:50,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:50,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:50,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:50,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:50,906 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:50,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:50,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:50,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:50,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:50,981 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:50,982 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:50,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:50,983 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:50,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:50,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:50,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:50,983 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:50,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:50,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:50,986 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,986 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:50,986 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:50,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:50,986 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:50,987 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:50,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:50,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:50,992 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:50,992 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:50,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:50,993 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:50,993 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:51,086 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:51,086 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:17:51,086 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:51,086 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 02:17:51,086 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:51,086 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:51,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable669 [2022-12-13 02:17:51,087 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 02:17:51,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:51,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2100857817, now seen corresponding path program 1 times [2022-12-13 02:17:51,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:51,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078702166] [2022-12-13 02:17:51,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:51,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:51,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:51,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078702166] [2022-12-13 02:17:51,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078702166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:51,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:51,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:51,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54063655] [2022-12-13 02:17:51,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:51,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:51,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:51,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:51,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:51,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:51,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:51,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:51,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:51,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:51,234 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:51,234 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:51,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:51,235 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:51,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:51,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:51,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:51,236 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:51,236 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:51,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:51,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:51,238 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:51,238 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:51,239 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:51,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:51,239 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:51,239 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:51,239 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:51,239 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:51,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:51,245 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:51,245 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:51,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:51,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:51,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:51,332 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:51,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:51,333 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:51,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:51,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:51,333 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:51,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable670 [2022-12-13 02:17:51,333 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 02:17:51,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:51,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2129486968, now seen corresponding path program 1 times [2022-12-13 02:17:51,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:51,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246883788] [2022-12-13 02:17:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:51,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:51,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:17:51,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:51,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246883788] [2022-12-13 02:17:51,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246883788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:51,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:51,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:51,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256959677] [2022-12-13 02:17:51,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:51,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:51,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:51,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:51,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:51,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:51,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:51,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:51,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:51,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:51,502 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:51,502 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:51,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:51,503 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:51,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:51,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:51,504 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:51,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:51,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:51,506 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:51,506 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:51,506 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:51,506 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:51,506 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:51,507 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:51,507 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:51,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:51,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:51,513 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:51,513 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:51,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:51,513 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:51,513 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:51,602 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:51,603 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:17:51,603 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:51,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:51,603 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:51,603 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:51,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable671 [2022-12-13 02:17:51,603 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 02:17:51,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:51,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2136851177, now seen corresponding path program 1 times [2022-12-13 02:17:51,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:51,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994722279] [2022-12-13 02:17:51,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:51,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:51,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:17:51,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:51,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994722279] [2022-12-13 02:17:51,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994722279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:51,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:51,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:51,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898805650] [2022-12-13 02:17:51,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:51,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:51,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:51,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:51,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:51,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:51,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:51,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:51,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:51,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:51,731 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:51,731 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:51,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:51,732 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:51,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:51,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:51,733 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:51,733 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:51,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:51,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:51,735 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:51,735 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:51,735 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:51,735 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:51,736 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:51,736 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:51,736 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:51,736 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:51,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:51,741 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:51,741 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:51,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:51,742 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:51,742 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:51,830 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:51,830 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:17:51,830 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:51,831 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 02:17:51,831 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:51,831 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:51,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable672 [2022-12-13 02:17:51,831 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 02:17:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:51,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2108222026, now seen corresponding path program 1 times [2022-12-13 02:17:51,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:51,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649189320] [2022-12-13 02:17:51,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:51,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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:17:51,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:51,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649189320] [2022-12-13 02:17:51,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649189320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:51,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:51,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:51,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693421746] [2022-12-13 02:17:51,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:51,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:51,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:51,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:51,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:51,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:51,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:51,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:51,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:51,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:51,954 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:51,954 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:51,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:51,955 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:51,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:51,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:51,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:51,956 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:51,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:51,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:51,958 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:51,958 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:51,959 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:51,959 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:51,959 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:51,959 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:51,959 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:51,959 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:51,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:51,965 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:51,965 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:17:51,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:51,965 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:51,965 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:52,052 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:52,052 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:52,052 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:52,052 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 02:17:52,052 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:52,052 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:52,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable673 [2022-12-13 02:17:52,052 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 02:17:52,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:52,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2079592875, now seen corresponding path program 1 times [2022-12-13 02:17:52,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:52,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191664967] [2022-12-13 02:17:52,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:52,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:52,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:17:52,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:52,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191664967] [2022-12-13 02:17:52,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191664967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:52,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:52,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:52,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725229215] [2022-12-13 02:17:52,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:52,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:52,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:52,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:52,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:52,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:52,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:52,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:52,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:52,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:52,166 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:52,166 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:52,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:52,167 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:52,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:52,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:52,168 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:52,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:52,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:52,170 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:52,170 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:52,170 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:52,170 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:52,171 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:52,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:52,171 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:52,171 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:52,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:52,177 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:52,177 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:52,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:52,177 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:52,177 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:52,263 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:52,264 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:52,264 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:52,264 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 02:17:52,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:52,264 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:52,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable674 [2022-12-13 02:17:52,264 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 02:17:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:52,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2050963724, now seen corresponding path program 1 times [2022-12-13 02:17:52,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:52,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756743755] [2022-12-13 02:17:52,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:52,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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 02:17:52,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:52,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756743755] [2022-12-13 02:17:52,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756743755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:52,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:52,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026353869] [2022-12-13 02:17:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:52,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:52,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:52,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:52,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:52,312 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:52,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:52,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:52,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:52,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:52,378 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:52,378 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:52,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:52,379 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:52,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:52,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:52,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:52,379 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:52,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:52,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:52,382 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:52,382 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:52,382 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:52,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:52,382 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:52,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:52,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:52,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:52,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:52,388 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:52,388 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:52,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:52,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:52,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:52,488 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:52,489 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:17:52,489 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:52,489 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 02:17:52,489 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:52,489 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:52,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable675 [2022-12-13 02:17:52,489 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 02:17:52,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:52,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2022334573, now seen corresponding path program 1 times [2022-12-13 02:17:52,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:52,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309177651] [2022-12-13 02:17:52,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:52,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:52,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:17:52,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:52,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309177651] [2022-12-13 02:17:52,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309177651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:52,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:52,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:52,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137337151] [2022-12-13 02:17:52,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:52,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:52,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:52,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:52,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:52,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:52,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:52,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:52,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:52,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:52,603 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:52,603 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:52,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:52,604 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:52,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:52,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:52,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:52,605 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:52,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:52,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:52,607 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:52,607 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:52,607 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:52,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:52,607 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:52,608 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:52,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:52,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:52,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:52,613 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:52,613 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:52,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:52,614 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:52,614 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:52,701 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:52,701 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:52,701 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:52,701 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 02:17:52,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:52,701 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:52,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable676 [2022-12-13 02:17:52,701 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 02:17:52,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:52,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1993705422, now seen corresponding path program 1 times [2022-12-13 02:17:52,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:52,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445374352] [2022-12-13 02:17:52,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:52,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:52,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:17:52,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:52,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445374352] [2022-12-13 02:17:52,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445374352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:52,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:52,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:52,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093131059] [2022-12-13 02:17:52,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:52,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:52,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:52,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:52,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:52,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:52,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:52,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:52,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:52,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:52,818 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:52,818 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:52,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:52,819 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:52,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:52,820 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:52,820 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:52,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:52,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:52,822 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:52,822 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:52,822 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:52,822 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:52,823 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:52,823 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:52,823 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:52,823 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:52,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:52,829 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:52,829 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:52,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:52,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:52,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:52,915 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:52,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:52,915 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:52,915 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 02:17:52,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:52,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:52,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable677 [2022-12-13 02:17:52,915 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 02:17:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1965076271, now seen corresponding path program 1 times [2022-12-13 02:17:52,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:52,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247047515] [2022-12-13 02:17:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:52,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:52,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:17:52,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:52,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247047515] [2022-12-13 02:17:52,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247047515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:52,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:52,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489933853] [2022-12-13 02:17:52,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:52,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:52,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:52,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:52,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:52,965 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:52,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:52,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:52,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:52,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:53,031 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:53,032 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:53,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:53,033 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:53,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:53,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:53,033 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:53,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:53,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:53,036 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:53,036 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:53,036 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:53,036 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:53,036 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:53,037 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:53,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:53,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:53,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:53,046 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:53,046 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:53,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:53,047 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:53,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:53,154 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:53,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:17:53,155 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:53,155 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 02:17:53,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:53,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:53,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable678 [2022-12-13 02:17:53,155 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 02:17:53,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:53,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1936447120, now seen corresponding path program 1 times [2022-12-13 02:17:53,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:53,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615752154] [2022-12-13 02:17:53,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:53,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:53,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 02:17:53,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:53,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615752154] [2022-12-13 02:17:53,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615752154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:53,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:53,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:53,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255371636] [2022-12-13 02:17:53,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:53,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:53,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:53,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:53,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:53,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:53,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:53,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:53,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:53,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:53,303 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:53,303 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:53,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:53,305 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:53,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:53,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:53,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:53,305 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:53,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:53,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:53,309 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:53,309 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:53,309 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:53,309 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:53,309 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:53,310 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:53,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:53,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:53,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:53,317 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:53,317 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:53,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:53,318 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:53,318 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:53,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:53,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:17:53,425 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:53,425 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 02:17:53,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:53,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:53,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable679 [2022-12-13 02:17:53,425 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 02:17:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:53,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1907817969, now seen corresponding path program 1 times [2022-12-13 02:17:53,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:53,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761350639] [2022-12-13 02:17:53,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:53,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:17:53,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:53,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761350639] [2022-12-13 02:17:53,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761350639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:53,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:53,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:53,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045159690] [2022-12-13 02:17:53,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:53,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:53,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:53,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:53,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:53,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:53,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:53,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:53,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:53,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:53,586 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:53,586 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:53,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:53,588 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:53,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:53,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:53,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:53,589 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:53,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:53,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:53,593 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:53,593 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:53,593 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:53,593 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:53,593 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:53,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:53,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:53,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:53,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:53,601 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:53,601 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:53,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:53,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:53,602 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:53,711 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:53,711 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:17:53,711 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:53,711 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 02:17:53,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:53,712 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:53,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable680 [2022-12-13 02:17:53,712 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 02:17:53,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1879188818, now seen corresponding path program 1 times [2022-12-13 02:17:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:53,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118893104] [2022-12-13 02:17:53,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:53,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:17:53,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:53,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118893104] [2022-12-13 02:17:53,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118893104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:53,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:53,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:53,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585473290] [2022-12-13 02:17:53,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:53,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:53,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:53,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:53,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:53,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:53,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:53,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:53,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:53,874 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:53,874 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:53,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:53,876 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:53,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:53,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:53,877 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:53,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:53,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:53,880 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:53,880 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:53,881 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:53,881 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:53,881 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:53,881 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:53,881 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:53,881 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:53,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:53,889 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:53,889 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:53,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:53,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:53,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:53,997 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:53,997 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:17:53,998 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:53,998 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 02:17:53,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:53,998 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:53,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable681 [2022-12-13 02:17:53,998 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 02:17:53,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:53,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1850559667, now seen corresponding path program 1 times [2022-12-13 02:17:53,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:53,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242869876] [2022-12-13 02:17:53,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:53,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:54,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:17:54,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:54,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242869876] [2022-12-13 02:17:54,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242869876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:54,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:54,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:54,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686117726] [2022-12-13 02:17:54,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:54,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:54,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:54,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:54,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:54,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:54,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:54,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:54,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:54,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:54,143 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:54,143 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:54,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:54,144 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:54,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:54,145 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:54,145 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:54,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:54,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:54,148 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:54,148 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:54,148 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:54,148 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:54,148 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:54,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:54,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:54,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:54,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:54,154 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:54,154 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:17:54,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:54,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:54,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:54,242 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:54,242 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:54,242 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:54,242 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 02:17:54,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:54,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:54,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable682 [2022-12-13 02:17:54,243 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 02:17:54,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:54,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1821930516, now seen corresponding path program 1 times [2022-12-13 02:17:54,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:54,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605915275] [2022-12-13 02:17:54,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:54,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:54,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:17:54,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:54,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605915275] [2022-12-13 02:17:54,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605915275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:54,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:54,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:54,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818078546] [2022-12-13 02:17:54,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:54,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:54,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:54,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:54,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:54,322 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:54,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:54,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:54,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:54,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:54,398 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:54,398 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:17:54,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:54,400 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:54,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:54,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:54,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:54,400 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:54,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:54,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:54,403 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:54,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:54,403 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:54,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:54,403 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:54,403 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:54,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:54,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:54,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:54,409 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:54,409 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:54,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:54,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:54,410 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:54,496 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:54,497 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:54,497 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:54,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:54,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:54,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:54,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable683 [2022-12-13 02:17:54,497 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 02:17:54,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:54,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1793301365, now seen corresponding path program 1 times [2022-12-13 02:17:54,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:54,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610715595] [2022-12-13 02:17:54,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:54,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:54,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:17:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:54,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610715595] [2022-12-13 02:17:54,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610715595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:54,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:54,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432416820] [2022-12-13 02:17:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:54,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:54,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:54,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:54,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:54,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:54,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:54,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:54,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:54,614 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:54,614 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:54,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1134 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:54,615 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:54,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:54,616 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:54,616 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:54,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:54,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:54,618 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:54,618 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:54,618 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:54,618 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:54,619 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:54,619 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:54,619 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:54,619 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:54,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:54,624 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:54,625 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:54,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:54,625 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:54,625 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:54,712 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:54,712 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:54,712 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:54,712 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 02:17:54,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:54,712 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:54,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable684 [2022-12-13 02:17:54,713 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 02:17:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:54,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1764672214, now seen corresponding path program 1 times [2022-12-13 02:17:54,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:54,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138820549] [2022-12-13 02:17:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:54,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:54,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:17:54,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:54,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138820549] [2022-12-13 02:17:54,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138820549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:54,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:54,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:54,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168563811] [2022-12-13 02:17:54,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:54,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:54,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:54,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:54,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:54,770 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:54,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:54,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:54,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:54,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:54,852 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:54,852 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:17:54,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:54,853 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:54,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:54,854 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:54,854 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:54,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:54,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:54,856 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:54,856 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:54,857 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:54,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:54,857 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:54,857 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:54,857 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:54,857 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:54,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:54,863 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:54,863 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:17:54,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:54,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:54,863 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:54,949 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:54,950 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:54,950 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:54,950 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 02:17:54,950 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:54,950 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:54,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable685 [2022-12-13 02:17:54,950 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 02:17:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1736043063, now seen corresponding path program 1 times [2022-12-13 02:17:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:54,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300253744] [2022-12-13 02:17:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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:17:54,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:54,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300253744] [2022-12-13 02:17:54,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300253744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:54,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:54,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:54,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510618074] [2022-12-13 02:17:54,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:54,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:54,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:54,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:54,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:54,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:54,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:54,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:54,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:54,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:55,076 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:55,077 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:55,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:55,078 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:55,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:55,078 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:55,078 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:55,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:55,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:55,081 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:55,081 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:55,081 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:55,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:55,081 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:55,081 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:55,081 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:55,081 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:55,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:55,087 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:55,087 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:55,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:55,088 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:55,088 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:55,175 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:55,175 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:55,175 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:55,175 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 02:17:55,175 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:55,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:55,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable686 [2022-12-13 02:17:55,176 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 02:17:55,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1707413912, now seen corresponding path program 1 times [2022-12-13 02:17:55,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:55,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728929797] [2022-12-13 02:17:55,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:55,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:55,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:17:55,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:55,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728929797] [2022-12-13 02:17:55,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728929797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:55,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:55,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:55,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578669231] [2022-12-13 02:17:55,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:55,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:55,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:55,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:55,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:55,228 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:55,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:55,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:55,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:55,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:55,294 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:55,294 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:55,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:55,296 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:55,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:55,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:55,296 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:55,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:55,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:55,299 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:55,299 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:55,299 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:55,299 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:55,299 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:55,299 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:55,299 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:55,300 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:55,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:55,305 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:55,306 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:55,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:55,306 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:55,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:55,394 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:55,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:55,395 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:55,395 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 02:17:55,395 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:55,395 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:55,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable687 [2022-12-13 02:17:55,395 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 02:17:55,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:55,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1678784761, now seen corresponding path program 1 times [2022-12-13 02:17:55,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:55,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646798206] [2022-12-13 02:17:55,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:55,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:55,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:17:55,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:55,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646798206] [2022-12-13 02:17:55,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646798206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:55,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:55,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:55,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186052959] [2022-12-13 02:17:55,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:55,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:55,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:55,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:55,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:55,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:55,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:55,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:55,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:55,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:55,542 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:55,542 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:55,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:55,543 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:55,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:55,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:55,544 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:55,544 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:55,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:55,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:55,546 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:55,546 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:55,546 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:55,547 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:55,547 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:55,547 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:55,547 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:55,547 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:55,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:55,553 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:55,553 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:17:55,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:55,553 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:55,553 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:55,640 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:55,640 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:55,640 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:55,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:55,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:55,641 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:55,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable688 [2022-12-13 02:17:55,641 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 02:17:55,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:55,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1650155610, now seen corresponding path program 1 times [2022-12-13 02:17:55,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:55,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311475209] [2022-12-13 02:17:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:55,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:55,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:17:55,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:55,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311475209] [2022-12-13 02:17:55,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311475209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:55,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:55,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:55,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658016984] [2022-12-13 02:17:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:55,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:55,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:55,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:55,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:55,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:55,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:55,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:55,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:55,765 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:55,765 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:55,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:55,766 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:55,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:55,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:55,767 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:55,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:55,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:55,769 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:55,769 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:55,769 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:55,770 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:55,770 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:55,770 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:55,770 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:55,770 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:55,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:55,776 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:55,776 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:17:55,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:55,776 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:55,776 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:55,863 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:55,863 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:55,863 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:55,863 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 02:17:55,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:55,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:55,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable689 [2022-12-13 02:17:55,863 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 02:17:55,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1621526459, now seen corresponding path program 1 times [2022-12-13 02:17:55,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:55,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173561231] [2022-12-13 02:17:55,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:55,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:55,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:17:55,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:55,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173561231] [2022-12-13 02:17:55,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173561231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:55,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:55,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:55,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494224745] [2022-12-13 02:17:55,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:55,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:55,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:55,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:55,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:55,938 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:55,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:55,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:55,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:55,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:56,021 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:56,021 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:56,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:56,022 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:56,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:56,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:56,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:56,023 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:56,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:56,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:56,026 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,026 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:56,026 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:56,026 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:56,026 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,026 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:56,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:56,026 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:56,032 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:56,033 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:56,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:56,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:56,033 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:56,122 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:56,122 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:56,123 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:56,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:56,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:56,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:56,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable690 [2022-12-13 02:17:56,123 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 02:17:56,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:56,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1592897308, now seen corresponding path program 1 times [2022-12-13 02:17:56,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:56,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307125774] [2022-12-13 02:17:56,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:56,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:56,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 02:17:56,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:56,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307125774] [2022-12-13 02:17:56,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307125774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:56,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:56,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:56,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322415055] [2022-12-13 02:17:56,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:56,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:56,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:56,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:56,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:56,186 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:56,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:56,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:56,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:56,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:56,262 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:56,262 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:56,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:56,264 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:56,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:56,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:56,264 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:56,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:56,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:56,267 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,267 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:56,267 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:56,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:56,267 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,267 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:56,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:56,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:56,273 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:56,273 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:56,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:56,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:56,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:56,360 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:56,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:56,360 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:56,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:56,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:56,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:56,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable691 [2022-12-13 02:17:56,361 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 02:17:56,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1564268157, now seen corresponding path program 1 times [2022-12-13 02:17:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:56,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019926329] [2022-12-13 02:17:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:56,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:17:56,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:56,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019926329] [2022-12-13 02:17:56,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019926329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:56,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:56,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:56,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678582586] [2022-12-13 02:17:56,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:56,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:56,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:56,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:56,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:56,418 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:56,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:56,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:56,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:56,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:56,483 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:56,483 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:56,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:56,484 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:56,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:56,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:56,485 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:56,485 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:56,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:56,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:56,487 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:56,488 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:56,488 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:56,488 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,488 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:56,488 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:56,488 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:56,494 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:56,494 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:17:56,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:56,494 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:56,494 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:56,580 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:56,580 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:17:56,580 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:56,580 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 02:17:56,580 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:56,580 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:56,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable692 [2022-12-13 02:17:56,580 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 02:17:56,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:56,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1535639006, now seen corresponding path program 1 times [2022-12-13 02:17:56,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:56,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785763763] [2022-12-13 02:17:56,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:56,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:56,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 02:17:56,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:56,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785763763] [2022-12-13 02:17:56,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785763763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:56,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:56,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:56,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684052986] [2022-12-13 02:17:56,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:56,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:56,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:56,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:56,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:56,628 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:56,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:56,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:56,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:56,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:56,702 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:56,702 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:56,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:56,703 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:56,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:56,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:56,703 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:56,703 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:56,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:56,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:56,706 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,706 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:56,706 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:56,706 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:56,706 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,707 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:56,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:56,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:56,712 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:56,712 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:17:56,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:56,713 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:56,713 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:56,799 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:56,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:56,800 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:56,800 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 02:17:56,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:56,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:56,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable693 [2022-12-13 02:17:56,800 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 02:17:56,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:56,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1507009855, now seen corresponding path program 1 times [2022-12-13 02:17:56,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:56,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749287759] [2022-12-13 02:17:56,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:56,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:56,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:17:56,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:56,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749287759] [2022-12-13 02:17:56,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749287759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:56,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:56,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:56,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990754772] [2022-12-13 02:17:56,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:56,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:56,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:56,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:56,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:56,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:56,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:56,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:56,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:56,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:56,938 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:56,938 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:56,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:56,939 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:56,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:56,940 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:56,940 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:56,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:56,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:56,942 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,942 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:56,942 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:56,942 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:56,943 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,943 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:56,943 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:56,943 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:56,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:56,948 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:56,949 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:17:56,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:56,949 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:56,949 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:57,035 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:57,036 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:57,036 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:57,036 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 02:17:57,036 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:57,036 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:57,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable694 [2022-12-13 02:17:57,036 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 02:17:57,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:57,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1478380704, now seen corresponding path program 1 times [2022-12-13 02:17:57,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:57,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129025804] [2022-12-13 02:17:57,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:57,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:57,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 02:17:57,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:57,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129025804] [2022-12-13 02:17:57,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129025804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:57,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:57,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:57,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533974637] [2022-12-13 02:17:57,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:57,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:57,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:57,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:57,082 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:57,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:57,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:57,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:57,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:57,147 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:57,147 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:57,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:57,149 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:57,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:57,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:57,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:57,149 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:57,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:57,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:57,151 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:57,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:57,152 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:57,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:57,152 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:57,152 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:57,152 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:57,152 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:57,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:57,158 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:57,158 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:57,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:57,158 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:57,158 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:57,245 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:57,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:57,245 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:57,245 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 02:17:57,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:57,245 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:57,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable695 [2022-12-13 02:17:57,245 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 02:17:57,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:57,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1449751553, now seen corresponding path program 1 times [2022-12-13 02:17:57,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:57,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238946658] [2022-12-13 02:17:57,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:57,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:57,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:17:57,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:57,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238946658] [2022-12-13 02:17:57,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238946658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:57,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:57,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350702597] [2022-12-13 02:17:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:57,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:57,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:57,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:57,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:57,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:57,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:57,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:57,365 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:57,365 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:57,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:57,366 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:57,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:57,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:57,367 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:57,367 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:57,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:57,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:57,369 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:57,369 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:57,369 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:57,369 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:57,370 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:57,370 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:57,370 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:57,370 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:57,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:57,375 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:57,375 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:57,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:57,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:57,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:57,462 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:57,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:57,463 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:57,463 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 02:17:57,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:57,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:57,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable696 [2022-12-13 02:17:57,463 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 02:17:57,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:57,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1421122402, now seen corresponding path program 1 times [2022-12-13 02:17:57,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:57,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500174619] [2022-12-13 02:17:57,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:57,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:17:57,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:57,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500174619] [2022-12-13 02:17:57,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500174619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:57,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:57,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:57,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541710288] [2022-12-13 02:17:57,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:57,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:57,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:57,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:57,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:57,511 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:57,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:57,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:57,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:57,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:57,587 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:57,587 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:57,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:57,588 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:57,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:57,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:57,589 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:57,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:57,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:57,592 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:57,592 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:57,592 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:57,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:57,592 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:57,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:57,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:57,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:57,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:57,598 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:57,598 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:57,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 465 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:57,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:57,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:57,686 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:57,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:57,686 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:57,686 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 02:17:57,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:57,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:57,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable697 [2022-12-13 02:17:57,686 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 02:17:57,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:57,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1392493251, now seen corresponding path program 1 times [2022-12-13 02:17:57,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:57,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540402822] [2022-12-13 02:17:57,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:57,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:57,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:17:57,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:57,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540402822] [2022-12-13 02:17:57,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540402822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:57,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:57,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:57,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335041782] [2022-12-13 02:17:57,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:57,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:57,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:57,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:57,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:57,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:57,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:57,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:57,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:57,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:57,816 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:57,816 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:57,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:57,817 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:57,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:57,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:57,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:57,818 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:57,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:57,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:57,820 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:57,820 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:57,821 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:57,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:57,821 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:57,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:57,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:57,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:57,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:57,826 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:57,827 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:57,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:57,827 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:57,827 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:57,914 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:57,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:57,915 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:57,915 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 02:17:57,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:57,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:57,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable698 [2022-12-13 02:17:57,915 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 02:17:57,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:57,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1363864100, now seen corresponding path program 1 times [2022-12-13 02:17:57,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:57,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498885144] [2022-12-13 02:17:57,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:57,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17: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:17:57,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:57,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498885144] [2022-12-13 02:17:57,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498885144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:57,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:57,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:57,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252768299] [2022-12-13 02:17:57,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:57,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:57,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:57,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:57,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:57,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:57,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:57,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:57,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:57,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:58,046 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:58,046 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:58,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:58,047 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:58,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:58,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:58,047 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:58,048 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:58,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:58,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:58,050 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:58,050 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:58,050 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:58,050 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:58,050 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:58,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:58,051 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:58,051 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:58,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:58,056 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:58,056 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:17:58,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:58,057 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:58,057 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:58,143 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:58,144 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:58,144 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:58,144 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 02:17:58,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:58,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:58,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable699 [2022-12-13 02:17:58,144 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 02:17:58,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1335234949, now seen corresponding path program 1 times [2022-12-13 02:17:58,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:58,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742644561] [2022-12-13 02:17:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:58,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:58,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:17:58,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:58,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742644561] [2022-12-13 02:17:58,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742644561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:58,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:58,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:58,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981169447] [2022-12-13 02:17:58,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:58,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:58,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:58,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:58,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:58,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:58,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:58,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:58,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:58,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:58,267 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:58,268 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:58,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:58,269 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:58,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:58,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:58,269 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:58,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:58,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:58,272 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:58,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:58,272 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:58,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:58,272 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:58,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:58,273 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:58,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:58,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:58,285 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:58,285 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:17:58,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:58,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:58,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:58,372 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:58,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:17:58,372 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:58,372 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 02:17:58,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:58,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:58,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable700 [2022-12-13 02:17:58,372 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 02:17:58,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:58,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1306605798, now seen corresponding path program 1 times [2022-12-13 02:17:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:58,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970515517] [2022-12-13 02:17:58,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:58,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 02:17:58,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:58,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970515517] [2022-12-13 02:17:58,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970515517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:58,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:58,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:58,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37107755] [2022-12-13 02:17:58,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:58,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:58,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:58,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:58,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:58,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:58,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:58,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:58,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:58,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:58,494 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:58,494 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:58,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:58,495 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:58,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:58,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:58,496 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:58,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:58,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:58,498 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:58,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:58,499 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:58,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:58,499 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:58,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:58,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:58,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:58,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:58,505 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:58,505 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:58,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:58,505 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:58,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:58,592 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:58,593 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:58,593 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:58,593 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 02:17:58,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:58,593 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:58,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable701 [2022-12-13 02:17:58,593 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 02:17:58,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1277976647, now seen corresponding path program 1 times [2022-12-13 02:17:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:58,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289139911] [2022-12-13 02:17:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:58,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:58,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:17:58,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:58,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289139911] [2022-12-13 02:17:58,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289139911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:58,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:58,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:58,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314375677] [2022-12-13 02:17:58,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:58,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:58,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:58,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:58,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:58,656 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:58,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:58,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:58,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:58,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:58,743 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:58,743 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:58,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:58,744 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:58,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:58,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:58,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:58,745 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:58,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:58,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:58,747 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:58,747 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:58,747 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:58,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:58,747 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:58,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:58,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:58,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:58,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:58,753 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:58,753 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:17:58,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:58,754 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:58,754 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:58,840 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:58,840 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:17:58,840 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:58,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:58,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:58,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:58,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable702 [2022-12-13 02:17:58,841 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 02:17:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:58,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1249347496, now seen corresponding path program 1 times [2022-12-13 02:17:58,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:58,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455763591] [2022-12-13 02:17:58,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:58,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:58,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:17:58,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:58,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455763591] [2022-12-13 02:17:58,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455763591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:58,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:58,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:17:58,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74655706] [2022-12-13 02:17:58,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:58,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:17:58,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:58,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:17:58,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:17:58,920 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:58,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:58,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:58,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:58,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:58,997 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:58,997 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:58,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:58,998 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:58,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:58,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:58,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:58,999 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:58,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:59,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:59,001 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:59,001 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:59,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:59,001 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:59,002 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:59,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:59,007 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:59,007 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:17:59,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:59,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:59,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:59,096 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:59,097 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:17:59,097 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:59,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:17:59,097 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:59,097 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:59,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable703 [2022-12-13 02:17:59,097 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 02:17:59,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:59,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1220718345, now seen corresponding path program 1 times [2022-12-13 02:17:59,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:59,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627752349] [2022-12-13 02:17:59,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:59,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:17:59,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:59,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627752349] [2022-12-13 02:17:59,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627752349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:59,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:59,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:59,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513762428] [2022-12-13 02:17:59,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:59,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:59,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:59,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:59,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:59,145 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:59,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:59,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:59,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:59,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:59,211 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:59,211 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:17:59,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:59,212 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:59,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:59,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:59,213 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:59,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:59,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:59,215 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,215 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:59,215 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:59,215 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:59,216 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,216 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:59,216 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:59,216 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:59,229 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:59,229 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:59,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:59,229 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:59,230 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:59,316 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:59,316 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:17:59,316 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:59,317 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 02:17:59,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:59,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:59,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable704 [2022-12-13 02:17:59,317 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 02:17:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:59,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1192089194, now seen corresponding path program 1 times [2022-12-13 02:17:59,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:59,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239174150] [2022-12-13 02:17:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:59,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:59,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:17:59,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:59,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239174150] [2022-12-13 02:17:59,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239174150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:59,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:59,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:59,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662168752] [2022-12-13 02:17:59,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:59,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:59,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:59,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:59,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:59,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:59,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:59,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:59,443 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:59,443 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:17:59,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:59,444 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:59,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:59,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:59,445 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:59,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:59,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:59,447 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:59,448 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:59,448 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:59,448 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,448 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:59,448 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:59,448 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:59,456 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:59,457 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:59,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:59,458 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:59,458 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:59,554 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:59,555 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:17:59,555 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:59,555 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 02:17:59,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:59,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:59,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable705 [2022-12-13 02:17:59,555 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 02:17:59,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:59,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1163460043, now seen corresponding path program 1 times [2022-12-13 02:17:59,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:59,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587887932] [2022-12-13 02:17:59,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:59,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:59,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:17:59,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:59,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587887932] [2022-12-13 02:17:59,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587887932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:59,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:59,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:59,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946828352] [2022-12-13 02:17:59,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:59,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:59,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:59,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:59,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:59,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:59,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:59,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:59,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:59,668 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:59,668 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:17:59,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:59,669 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:59,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:59,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:59,670 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:59,670 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:59,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:59,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:59,673 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,673 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:59,673 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:59,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:59,673 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:59,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:59,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:59,679 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:59,679 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:17:59,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:59,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:59,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:59,766 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:59,767 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:17:59,767 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:59,767 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 02:17:59,767 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:59,767 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:59,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable706 [2022-12-13 02:17:59,767 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 02:17:59,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1134830892, now seen corresponding path program 1 times [2022-12-13 02:17:59,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:59,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514071124] [2022-12-13 02:17:59,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:59,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:17:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:17:59,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:17:59,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:17:59,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514071124] [2022-12-13 02:17:59,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514071124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:17:59,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:17:59,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:17:59,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267844136] [2022-12-13 02:17:59,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:17:59,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:17:59,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:17:59,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:17:59,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:17:59,814 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:17:59,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:17:59,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:17:59,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:17:59,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:17:59,889 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:17:59,889 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:17:59,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:17:59,890 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:17:59,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:59,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:17:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:17:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:17:59,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:17:59,891 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:17:59,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:17:59,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:17:59,893 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,893 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:17:59,894 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:17:59,894 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:17:59,894 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,894 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:17:59,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:17:59,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:17:59,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:59,900 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:17:59,900 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:17:59,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:17:59,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:17:59,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:17:59,992 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:17:59,992 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:17:59,992 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:17:59,992 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 02:17:59,992 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:17:59,992 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:17:59,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable707 [2022-12-13 02:17:59,992 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 02:17:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:17:59,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1106201741, now seen corresponding path program 1 times [2022-12-13 02:17:59,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:17:59,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584349582] [2022-12-13 02:17:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:17:59,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:00,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:18:00,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:00,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584349582] [2022-12-13 02:18:00,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584349582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:00,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:00,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:00,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320599324] [2022-12-13 02:18:00,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:00,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:00,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:00,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:00,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:00,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:00,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:00,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:00,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:00,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:00,143 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:00,143 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:00,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:00,144 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:00,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:00,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:00,145 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:00,145 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:00,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:00,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:00,148 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:00,148 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:00,148 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:00,148 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:00,148 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:00,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:00,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:00,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:00,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:00,154 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:00,154 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:00,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:00,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:00,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:00,250 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:00,251 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:18:00,251 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:00,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:00,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:00,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:00,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable708 [2022-12-13 02:18:00,251 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 02:18:00,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:00,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1077572590, now seen corresponding path program 1 times [2022-12-13 02:18:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:00,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465692001] [2022-12-13 02:18:00,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18: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:18:00,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:00,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465692001] [2022-12-13 02:18:00,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465692001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:00,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:00,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:00,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302385060] [2022-12-13 02:18:00,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:00,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:00,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:00,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:00,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:00,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:00,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:00,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:00,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:00,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:00,376 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:00,376 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:00,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:00,377 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:00,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:00,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:00,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:00,377 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:00,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:00,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:00,380 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:00,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:00,380 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:00,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:00,381 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:00,381 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:00,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:00,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:00,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:00,387 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:00,387 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:00,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:00,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:00,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:00,476 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:00,477 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:18:00,477 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:00,477 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 02:18:00,477 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:00,477 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:00,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable709 [2022-12-13 02:18:00,477 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 02:18:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1048943439, now seen corresponding path program 1 times [2022-12-13 02:18:00,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:00,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072451362] [2022-12-13 02:18:00,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18: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 02:18:00,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:00,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072451362] [2022-12-13 02:18:00,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072451362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:00,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:00,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:00,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111096747] [2022-12-13 02:18:00,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:00,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:00,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:00,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:00,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:00,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:00,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:00,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:00,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:00,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:00,602 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:00,602 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:00,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:00,604 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:00,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:00,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:00,604 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:00,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:00,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:00,607 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:00,607 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:00,607 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:00,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:00,607 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:00,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:00,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:00,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:00,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:00,613 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:00,613 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:00,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:00,614 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:00,614 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:00,700 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:00,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:00,700 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:00,700 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 02:18:00,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:00,700 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:00,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable710 [2022-12-13 02:18:00,700 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 02:18:00,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:00,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1020314288, now seen corresponding path program 1 times [2022-12-13 02:18:00,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:00,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281757232] [2022-12-13 02:18:00,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:00,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:00,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 02:18:00,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:00,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281757232] [2022-12-13 02:18:00,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281757232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:00,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:00,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:00,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599545424] [2022-12-13 02:18:00,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:00,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:00,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:00,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:00,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:00,748 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:00,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:00,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:00,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:00,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:00,824 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:00,824 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:00,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:00,825 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:00,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:00,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:00,826 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:00,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:00,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:00,828 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:00,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:00,828 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:00,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:00,828 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:00,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:00,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:00,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:00,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:00,834 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:00,834 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:00,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:00,835 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:00,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:00,921 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:00,921 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:00,921 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:00,921 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 02:18:00,921 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:00,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:00,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable711 [2022-12-13 02:18:00,922 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 02:18:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:00,922 INFO L85 PathProgramCache]: Analyzing trace with hash -991685137, now seen corresponding path program 1 times [2022-12-13 02:18:00,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:00,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857321157] [2022-12-13 02:18:00,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:00,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:18:00,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:00,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857321157] [2022-12-13 02:18:00,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857321157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:00,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:00,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:00,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847590022] [2022-12-13 02:18:00,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:00,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:00,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:00,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:00,969 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:00,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:00,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:00,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:00,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:01,043 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:01,043 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:01,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:01,044 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:01,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:01,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:01,045 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:01,045 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:01,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:01,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:01,047 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,047 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:01,048 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:01,048 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:01,048 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,048 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:01,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:01,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:01,054 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:01,054 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:01,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:01,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:01,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:01,140 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:01,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:01,141 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:01,141 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 02:18:01,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:01,141 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:01,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable712 [2022-12-13 02:18:01,141 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 02:18:01,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash -963055986, now seen corresponding path program 1 times [2022-12-13 02:18:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:01,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404555976] [2022-12-13 02:18:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:01,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:01,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:18:01,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:01,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404555976] [2022-12-13 02:18:01,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404555976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:01,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:01,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:01,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738724244] [2022-12-13 02:18:01,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:01,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:01,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:01,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:01,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:01,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:01,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:01,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:01,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:01,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:01,273 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:01,274 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:01,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:01,275 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:01,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:01,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:01,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:01,275 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:01,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:01,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:01,278 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:01,278 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:01,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:01,278 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:01,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:01,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:01,284 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:01,284 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:01,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:01,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:01,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:01,372 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:01,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:01,373 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:01,373 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 02:18:01,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:01,373 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:01,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable713 [2022-12-13 02:18:01,373 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 02:18:01,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash -934426835, now seen corresponding path program 1 times [2022-12-13 02:18:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:01,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892719049] [2022-12-13 02:18:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:01,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:18:01,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:01,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892719049] [2022-12-13 02:18:01,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892719049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:01,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:01,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:01,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099397345] [2022-12-13 02:18:01,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:01,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:01,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:01,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:01,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:01,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:01,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:01,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:01,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:01,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:01,523 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:01,524 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:01,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:01,525 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:01,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:01,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:01,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:01,525 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:01,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:01,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:01,528 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:01,528 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:01,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:01,529 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:01,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:01,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:01,535 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:01,535 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:01,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:01,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:01,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:01,621 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:01,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:01,622 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:01,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:01,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:01,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:01,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable714 [2022-12-13 02:18:01,622 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 02:18:01,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:01,622 INFO L85 PathProgramCache]: Analyzing trace with hash -905797684, now seen corresponding path program 1 times [2022-12-13 02:18:01,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:01,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758095023] [2022-12-13 02:18:01,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:01,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:01,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:18:01,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:01,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758095023] [2022-12-13 02:18:01,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758095023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:01,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:01,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:01,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866981456] [2022-12-13 02:18:01,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:01,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:01,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:01,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:01,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:01,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:01,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:01,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:01,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:01,742 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:01,742 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:01,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:01,743 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:01,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:01,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:01,744 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:01,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:01,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:01,747 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,747 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:01,747 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:01,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:01,747 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,747 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:01,747 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:01,747 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:01,753 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:01,753 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:01,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:01,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:01,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:01,840 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:01,840 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:01,840 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:01,840 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 02:18:01,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:01,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:01,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable715 [2022-12-13 02:18:01,841 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 02:18:01,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:01,841 INFO L85 PathProgramCache]: Analyzing trace with hash -877168533, now seen corresponding path program 1 times [2022-12-13 02:18:01,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:01,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382945058] [2022-12-13 02:18:01,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:01,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:01,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:18:01,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:01,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382945058] [2022-12-13 02:18:01,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382945058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:01,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:01,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:01,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80584184] [2022-12-13 02:18:01,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:01,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:01,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:01,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:01,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:01,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:01,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:01,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:01,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:01,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:01,960 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:01,960 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:01,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:01,961 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:01,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:01,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:01,961 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:01,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:01,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:01,964 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,964 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:01,964 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:01,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:01,965 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,965 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:01,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:01,965 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:01,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:01,971 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:01,971 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:01,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:01,971 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:01,971 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:02,059 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:02,059 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:02,059 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:02,059 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 02:18:02,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:02,060 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:02,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable716 [2022-12-13 02:18:02,060 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 02:18:02,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:02,060 INFO L85 PathProgramCache]: Analyzing trace with hash -848539382, now seen corresponding path program 1 times [2022-12-13 02:18:02,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:02,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146753264] [2022-12-13 02:18:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:02,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:02,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:18:02,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:02,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146753264] [2022-12-13 02:18:02,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146753264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:02,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:02,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075187910] [2022-12-13 02:18:02,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:02,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:02,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:02,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:02,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:02,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:02,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:02,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:02,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:02,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:02,193 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:02,193 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:02,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:02,194 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:02,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:02,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:02,195 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:02,195 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:02,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:02,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:02,197 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:02,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:02,198 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:02,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:02,198 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:02,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:02,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:02,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:02,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:02,204 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:02,204 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:02,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:02,204 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:02,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:02,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:02,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:02,292 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:02,292 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 02:18:02,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:02,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:02,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable717 [2022-12-13 02:18:02,292 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 02:18:02,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:02,292 INFO L85 PathProgramCache]: Analyzing trace with hash -819910231, now seen corresponding path program 1 times [2022-12-13 02:18:02,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:02,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984842492] [2022-12-13 02:18:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:02,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:02,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:18:02,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:02,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984842492] [2022-12-13 02:18:02,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984842492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:02,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:02,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:02,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483791818] [2022-12-13 02:18:02,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:02,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:02,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:02,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:02,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:02,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:02,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:02,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:02,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:02,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:02,415 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:02,415 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:02,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:02,416 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:02,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:02,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:02,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:02,417 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:02,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:02,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:02,419 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:02,419 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:02,419 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:02,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:02,419 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:02,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:02,420 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:02,420 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:02,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:02,425 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:02,425 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:02,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:02,426 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:02,426 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:02,517 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:02,517 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:18:02,517 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:02,517 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 02:18:02,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:02,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:02,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable718 [2022-12-13 02:18:02,518 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 02:18:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash -791281080, now seen corresponding path program 1 times [2022-12-13 02:18:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:02,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873148767] [2022-12-13 02:18:02,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:02,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:18:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:02,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873148767] [2022-12-13 02:18:02,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873148767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:02,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:02,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:02,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967888335] [2022-12-13 02:18:02,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:02,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:02,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:02,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:02,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:02,595 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:02,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:02,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:02,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:02,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:02,680 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:02,680 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:02,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:02,681 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:02,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:02,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:02,681 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:02,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:02,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:02,684 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:02,684 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:02,684 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:02,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:02,684 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:02,684 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:02,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:02,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:02,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:02,690 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:02,690 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:02,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:02,691 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:02,691 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:02,786 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:02,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:18:02,787 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:02,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:02,787 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:02,787 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:02,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable719 [2022-12-13 02:18:02,787 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 02:18:02,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:02,787 INFO L85 PathProgramCache]: Analyzing trace with hash -762651929, now seen corresponding path program 1 times [2022-12-13 02:18:02,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:02,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339607809] [2022-12-13 02:18:02,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:02,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:02,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:18:02,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:02,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339607809] [2022-12-13 02:18:02,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339607809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:02,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:02,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:02,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194154241] [2022-12-13 02:18:02,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:02,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:02,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:02,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:02,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:02,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:02,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:02,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:02,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:02,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:02,942 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:02,942 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:02,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:02,943 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:02,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:02,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:02,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:02,944 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:02,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:02,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:02,946 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:02,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:02,946 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:02,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:02,946 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:02,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:02,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:02,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:02,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:02,952 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:02,953 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:18:02,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:02,953 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:02,953 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:03,039 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:03,040 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:03,040 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:03,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:03,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:03,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:03,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable720 [2022-12-13 02:18:03,040 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 02:18:03,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:03,040 INFO L85 PathProgramCache]: Analyzing trace with hash -734022778, now seen corresponding path program 1 times [2022-12-13 02:18:03,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:03,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986062284] [2022-12-13 02:18:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:03,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:03,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:18:03,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:03,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986062284] [2022-12-13 02:18:03,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986062284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:03,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:03,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:03,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034015263] [2022-12-13 02:18:03,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:03,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:03,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:03,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:03,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:03,095 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:03,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:03,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:03,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:03,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:03,170 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:03,170 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:03,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1095 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:03,171 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:03,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:03,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:03,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:03,172 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:03,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:03,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:03,174 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:03,174 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:03,174 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:03,174 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:03,174 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:03,175 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:03,175 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:03,175 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:03,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:03,180 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:03,180 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:03,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:03,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:03,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:03,267 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:03,268 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:03,268 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:03,268 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 02:18:03,268 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:03,268 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:03,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable721 [2022-12-13 02:18:03,268 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 02:18:03,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:03,268 INFO L85 PathProgramCache]: Analyzing trace with hash -705393627, now seen corresponding path program 1 times [2022-12-13 02:18:03,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:03,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976945459] [2022-12-13 02:18:03,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:03,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:03,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:18:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:03,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976945459] [2022-12-13 02:18:03,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976945459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:03,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:03,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:03,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127999313] [2022-12-13 02:18:03,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:03,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:03,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:03,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:03,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:03,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:03,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:03,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:03,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:03,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:03,390 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:03,390 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:03,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:03,391 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:03,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:03,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:03,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:03,391 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:03,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:03,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:03,394 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:03,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:03,394 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:03,394 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:03,394 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:03,395 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:03,395 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:03,395 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:03,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:03,400 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:03,400 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:03,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:03,401 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:03,401 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:03,488 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:03,488 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:03,488 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:03,489 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 02:18:03,489 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:03,489 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:03,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable722 [2022-12-13 02:18:03,489 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 02:18:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:03,489 INFO L85 PathProgramCache]: Analyzing trace with hash -676764476, now seen corresponding path program 1 times [2022-12-13 02:18:03,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:03,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133290919] [2022-12-13 02:18:03,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:03,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:18:03,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:03,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133290919] [2022-12-13 02:18:03,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133290919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:03,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:03,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:03,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324986296] [2022-12-13 02:18:03,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:03,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:03,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:03,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:03,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:03,536 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:03,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:03,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:03,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:03,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:03,602 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:03,602 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:03,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:03,603 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:03,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:03,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:03,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:03,604 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:03,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:03,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:03,606 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:03,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:03,607 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:03,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:03,607 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:03,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:03,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:03,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:03,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:03,613 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:03,613 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:03,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:03,613 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:03,613 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:03,699 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:03,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:03,700 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:03,700 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 02:18:03,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:03,700 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:03,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable723 [2022-12-13 02:18:03,700 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 02:18:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -648135325, now seen corresponding path program 1 times [2022-12-13 02:18:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:03,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612431495] [2022-12-13 02:18:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:03,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:03,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:18:03,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:03,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612431495] [2022-12-13 02:18:03,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612431495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:03,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:03,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467639134] [2022-12-13 02:18:03,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:03,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:03,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:03,746 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:03,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:03,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:03,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:03,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:03,813 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:03,813 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:03,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:03,814 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:03,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:03,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:03,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:03,814 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:03,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:03,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:03,817 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:03,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:03,817 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:03,817 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:03,817 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:03,817 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:03,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:03,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:03,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:03,823 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:03,823 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:03,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:03,824 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:03,824 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:03,910 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:03,910 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:03,910 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:03,910 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 02:18:03,910 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:03,910 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:03,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable724 [2022-12-13 02:18:03,911 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 02:18:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash -619506174, now seen corresponding path program 1 times [2022-12-13 02:18:03,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:03,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831217553] [2022-12-13 02:18:03,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:03,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:03,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:18:03,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:03,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831217553] [2022-12-13 02:18:03,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831217553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:03,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:03,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:03,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671435456] [2022-12-13 02:18:03,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:03,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:03,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:03,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:03,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:03,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:03,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:03,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:03,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:03,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:04,055 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:04,055 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:04,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:04,056 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:04,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:04,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:04,057 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:04,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:04,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:04,059 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:04,060 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:04,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:04,060 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:04,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:04,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:04,066 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:04,066 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:04,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:04,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:04,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:04,153 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:04,154 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:04,154 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:04,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:04,154 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:04,154 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:04,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable725 [2022-12-13 02:18:04,154 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 02:18:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:04,154 INFO L85 PathProgramCache]: Analyzing trace with hash -590877023, now seen corresponding path program 1 times [2022-12-13 02:18:04,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:04,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113148863] [2022-12-13 02:18:04,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:04,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:04,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:18:04,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:04,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113148863] [2022-12-13 02:18:04,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113148863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:04,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:04,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:04,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302439398] [2022-12-13 02:18:04,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:04,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:04,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:04,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:04,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:04,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:04,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:04,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:04,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:04,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:04,278 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:04,279 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:04,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:04,280 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:04,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:04,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:04,280 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:04,280 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:04,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:04,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:04,283 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,283 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:04,283 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:04,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:04,283 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,283 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:04,283 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:04,283 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:04,289 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:04,289 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:04,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:04,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:04,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:04,377 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:04,377 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:04,377 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:04,377 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 02:18:04,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:04,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:04,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable726 [2022-12-13 02:18:04,378 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 02:18:04,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash -562247872, now seen corresponding path program 1 times [2022-12-13 02:18:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:04,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684488646] [2022-12-13 02:18:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:04,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:04,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:18:04,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:04,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684488646] [2022-12-13 02:18:04,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684488646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:04,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:04,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025295425] [2022-12-13 02:18:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:04,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:04,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:04,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:04,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:04,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:04,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:04,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:04,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:04,490 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:04,491 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:04,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:04,492 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:04,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:04,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:04,492 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:04,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:04,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:04,495 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,495 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:04,495 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:04,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:04,496 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,496 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:04,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:04,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:04,505 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:04,505 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:04,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:04,506 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:04,506 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:04,614 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:04,615 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:18:04,615 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:04,615 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 02:18:04,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:04,615 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:04,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable727 [2022-12-13 02:18:04,615 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 02:18:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash -533618721, now seen corresponding path program 1 times [2022-12-13 02:18:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:04,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191806144] [2022-12-13 02:18:04,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:04,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:04,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:18:04,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:04,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191806144] [2022-12-13 02:18:04,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191806144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:04,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:04,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:04,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437443402] [2022-12-13 02:18:04,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:04,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:04,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:04,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:04,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:04,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:04,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:04,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:04,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:04,751 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:04,751 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:04,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:04,752 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:04,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:04,753 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:04,753 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:04,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:04,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:04,756 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,756 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:04,756 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:04,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:04,756 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:04,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:04,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:04,762 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:04,762 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:04,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:04,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:04,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:04,849 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:04,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:04,849 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:04,849 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 02:18:04,849 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:04,849 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:04,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable728 [2022-12-13 02:18:04,849 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 02:18:04,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:04,850 INFO L85 PathProgramCache]: Analyzing trace with hash -504989570, now seen corresponding path program 1 times [2022-12-13 02:18:04,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:04,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084258295] [2022-12-13 02:18:04,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:04,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:04,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:18:04,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:04,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084258295] [2022-12-13 02:18:04,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084258295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:04,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:04,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:04,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531728996] [2022-12-13 02:18:04,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:04,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:04,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:04,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:04,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:04,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:04,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:04,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:04,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:04,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:04,982 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:04,982 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:04,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:04,983 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:04,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:04,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:04,984 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:04,984 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:04,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:04,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:04,987 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,987 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:04,987 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:04,987 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:04,988 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,988 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:04,988 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:04,988 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:04,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:04,996 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:04,996 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:04,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 444 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:04,997 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:04,997 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:05,090 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:05,090 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:18:05,090 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:05,090 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 02:18:05,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:05,091 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:05,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable729 [2022-12-13 02:18:05,091 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 02:18:05,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash -476360419, now seen corresponding path program 1 times [2022-12-13 02:18:05,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:05,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084699901] [2022-12-13 02:18:05,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:05,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:05,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:18:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:05,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084699901] [2022-12-13 02:18:05,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084699901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:05,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:05,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:05,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560094840] [2022-12-13 02:18:05,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:05,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:05,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:05,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:05,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:05,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:05,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:05,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:05,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:05,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:05,200 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:05,201 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:05,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:05,202 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:05,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:05,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:05,202 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:05,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:05,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:05,205 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:05,205 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:05,205 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:05,205 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:05,205 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:05,205 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:05,205 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:05,205 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:05,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:05,211 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:05,211 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:05,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:05,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:05,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:05,298 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:05,298 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:05,298 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:05,299 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 02:18:05,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:05,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:05,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable730 [2022-12-13 02:18:05,299 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 02:18:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash -447731268, now seen corresponding path program 1 times [2022-12-13 02:18:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:05,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299670845] [2022-12-13 02:18:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:05,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:05,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:18:05,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:05,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299670845] [2022-12-13 02:18:05,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299670845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:05,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:05,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:05,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193163124] [2022-12-13 02:18:05,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:05,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:05,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:05,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:05,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:05,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:05,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:05,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:05,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:05,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:05,440 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:05,440 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:05,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:05,441 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:05,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:05,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:05,442 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:05,442 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:05,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:05,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:05,445 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:05,445 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:05,445 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:05,445 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:05,445 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:05,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:05,445 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:05,445 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:05,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:05,451 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:05,451 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:05,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:05,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:05,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:05,539 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:05,539 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:05,539 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:05,539 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 02:18:05,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:05,540 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:05,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable731 [2022-12-13 02:18:05,540 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 02:18:05,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:05,540 INFO L85 PathProgramCache]: Analyzing trace with hash -419102117, now seen corresponding path program 1 times [2022-12-13 02:18:05,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:05,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756206099] [2022-12-13 02:18:05,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:05,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:05,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 02:18:05,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:05,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756206099] [2022-12-13 02:18:05,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756206099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:05,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:05,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006443837] [2022-12-13 02:18:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:05,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:05,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:05,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:05,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:05,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:05,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:05,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:05,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:05,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:05,660 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:05,661 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:05,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:05,662 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:05,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:05,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:05,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:05,662 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:05,662 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:05,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:05,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:05,664 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:05,665 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:05,665 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:05,665 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:05,665 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:05,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:05,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:05,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:05,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:05,671 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:05,671 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:05,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:05,671 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:05,671 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:05,761 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:05,762 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:18:05,762 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:05,762 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 02:18:05,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:05,762 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:05,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable732 [2022-12-13 02:18:05,762 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 02:18:05,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:05,762 INFO L85 PathProgramCache]: Analyzing trace with hash -390472966, now seen corresponding path program 1 times [2022-12-13 02:18:05,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:05,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256636376] [2022-12-13 02:18:05,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:05,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18: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:18:05,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:05,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256636376] [2022-12-13 02:18:05,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256636376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:05,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:05,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:05,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925629883] [2022-12-13 02:18:05,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:05,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:05,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:05,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:05,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:05,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:05,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:05,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:05,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:05,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:05,921 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:05,921 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:05,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:05,922 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:05,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:05,923 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:05,924 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:05,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:05,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:05,927 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:05,927 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:05,928 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:05,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:05,928 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:05,928 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:05,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:05,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:05,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:05,940 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:05,940 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:18:05,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:05,941 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:05,941 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:06,027 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:06,027 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:18:06,027 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:06,027 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 02:18:06,027 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:06,027 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:06,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable733 [2022-12-13 02:18:06,027 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 02:18:06,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash -361843815, now seen corresponding path program 1 times [2022-12-13 02:18:06,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:06,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555861530] [2022-12-13 02:18:06,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:06,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:18:06,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:06,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555861530] [2022-12-13 02:18:06,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555861530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:06,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:06,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:06,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003510247] [2022-12-13 02:18:06,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:06,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:06,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:06,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:06,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:06,076 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:06,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:06,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:06,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:06,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:06,141 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:06,141 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:06,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:06,142 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:06,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:06,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:06,143 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:06,143 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:06,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:06,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:06,145 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:06,145 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:06,146 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:06,146 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:06,146 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:06,146 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:06,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:06,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:06,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:06,152 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:06,152 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:06,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:06,152 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:06,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:06,237 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:06,238 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:06,238 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:06,238 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 02:18:06,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:06,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:06,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable734 [2022-12-13 02:18:06,238 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 02:18:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:06,238 INFO L85 PathProgramCache]: Analyzing trace with hash -333214664, now seen corresponding path program 1 times [2022-12-13 02:18:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:06,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179712881] [2022-12-13 02:18:06,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:06,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:06,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:18:06,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:06,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179712881] [2022-12-13 02:18:06,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179712881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:06,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:06,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:06,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516741861] [2022-12-13 02:18:06,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:06,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:06,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:06,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:06,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:06,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:06,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:06,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:06,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:06,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:06,368 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:06,368 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:06,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:06,369 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:06,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:06,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:06,370 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:06,370 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:06,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:06,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:06,372 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:06,372 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:06,372 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:06,372 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:06,373 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:06,373 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:06,373 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:06,373 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:06,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:06,378 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:06,378 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:06,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:06,379 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:06,379 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:06,466 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:06,466 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:06,466 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:06,466 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 02:18:06,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:06,466 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:06,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable735 [2022-12-13 02:18:06,466 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 02:18:06,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:06,467 INFO L85 PathProgramCache]: Analyzing trace with hash -304585513, now seen corresponding path program 1 times [2022-12-13 02:18:06,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:06,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056910437] [2022-12-13 02:18:06,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:06,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:06,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:18:06,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:06,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056910437] [2022-12-13 02:18:06,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056910437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:06,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:06,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:06,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61206762] [2022-12-13 02:18:06,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:06,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:06,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:06,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:06,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:06,530 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:06,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:06,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:06,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:06,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:06,597 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:06,598 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:06,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:06,599 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:06,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:06,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:06,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:06,599 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:06,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:06,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:06,602 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:06,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:06,602 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:06,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:06,602 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:06,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:06,602 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:06,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:06,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:06,608 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:06,608 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:06,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:06,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:06,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:06,695 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:06,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:06,696 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:06,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:06,696 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:06,696 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:06,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable736 [2022-12-13 02:18:06,696 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 02:18:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash -275956362, now seen corresponding path program 1 times [2022-12-13 02:18:06,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:06,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273318558] [2022-12-13 02:18:06,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:06,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:06,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 02:18:06,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:06,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273318558] [2022-12-13 02:18:06,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273318558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:06,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:06,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:06,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180519] [2022-12-13 02:18:06,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:06,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:06,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:06,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:06,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:06,741 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:06,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:06,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:06,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:06,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:06,816 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:06,816 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:06,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:06,817 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:06,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:06,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:06,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:06,818 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:06,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:06,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:06,820 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:06,820 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:06,820 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:06,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:06,820 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:06,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:06,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:06,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:06,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:06,826 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:06,826 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:06,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:06,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:06,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:06,920 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:06,921 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:18:06,921 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:06,921 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 02:18:06,921 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:06,921 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:06,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable737 [2022-12-13 02:18:06,921 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 02:18:06,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:06,921 INFO L85 PathProgramCache]: Analyzing trace with hash -247327211, now seen corresponding path program 1 times [2022-12-13 02:18:06,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:06,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047178352] [2022-12-13 02:18:06,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:06,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:06,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:18:06,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:06,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047178352] [2022-12-13 02:18:06,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047178352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:06,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:06,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:06,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514594175] [2022-12-13 02:18:06,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:06,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:06,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:06,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:06,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:06,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:06,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:06,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:06,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:07,043 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:07,043 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:18:07,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:07,044 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:07,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:07,045 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:07,045 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:07,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:07,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:07,047 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:07,047 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:07,047 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:07,048 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:07,048 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:07,048 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:07,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:07,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:07,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:07,053 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:07,054 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:07,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:07,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:07,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:07,141 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:07,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:07,141 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:07,141 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 02:18:07,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:07,141 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:07,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable738 [2022-12-13 02:18:07,141 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 02:18:07,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:07,142 INFO L85 PathProgramCache]: Analyzing trace with hash -218698060, now seen corresponding path program 1 times [2022-12-13 02:18:07,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:07,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927375839] [2022-12-13 02:18:07,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:07,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:07,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:18:07,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:07,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927375839] [2022-12-13 02:18:07,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927375839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:07,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:07,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:07,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236279892] [2022-12-13 02:18:07,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:07,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:07,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:07,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:07,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:07,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:07,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:07,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:07,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:07,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:07,254 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:07,254 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:07,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:07,255 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:07,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:07,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:07,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:07,256 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:07,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:07,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:07,258 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:07,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:07,259 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:07,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:07,259 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:07,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:07,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:07,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:07,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:07,265 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:07,265 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:07,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:07,265 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:07,265 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:07,367 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:07,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:18:07,367 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:07,368 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 02:18:07,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:07,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:07,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable739 [2022-12-13 02:18:07,368 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 02:18:07,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:07,368 INFO L85 PathProgramCache]: Analyzing trace with hash -190068909, now seen corresponding path program 1 times [2022-12-13 02:18:07,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:07,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840768057] [2022-12-13 02:18:07,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:07,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:07,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:18:07,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:07,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840768057] [2022-12-13 02:18:07,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840768057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:07,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:07,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:07,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993523841] [2022-12-13 02:18:07,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:07,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:07,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:07,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:07,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:07,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:07,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:07,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:07,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:07,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:07,544 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:07,545 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:07,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:07,546 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:07,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:07,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:07,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:07,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:07,547 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:07,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:07,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:07,550 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:07,550 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:07,551 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:07,551 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:07,551 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:07,551 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:07,551 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:07,551 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:07,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:07,559 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:07,559 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:07,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:07,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:07,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:07,665 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:07,666 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:18:07,666 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:07,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:07,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:07,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:07,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable740 [2022-12-13 02:18:07,666 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 02:18:07,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash -161439758, now seen corresponding path program 1 times [2022-12-13 02:18:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:07,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216633342] [2022-12-13 02:18:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:07,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:07,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:18:07,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:07,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216633342] [2022-12-13 02:18:07,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216633342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:07,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:07,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:07,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747186152] [2022-12-13 02:18:07,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:07,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:07,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:07,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:07,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:07,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:07,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:07,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:07,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:07,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:07,823 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:07,823 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:07,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:07,824 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:07,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:07,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:07,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:07,825 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:07,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:07,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:07,829 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:07,829 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:07,830 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:07,830 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:07,830 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:07,830 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:07,830 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:07,830 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:07,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:07,840 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:07,840 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:07,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:07,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:07,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:07,962 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:07,962 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:18:07,962 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:07,962 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 02:18:07,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:07,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:07,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable741 [2022-12-13 02:18:07,963 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 02:18:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash -132810607, now seen corresponding path program 1 times [2022-12-13 02:18:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:07,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330236097] [2022-12-13 02:18:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:08,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:18:08,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:08,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330236097] [2022-12-13 02:18:08,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330236097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:08,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:08,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:08,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530867913] [2022-12-13 02:18:08,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:08,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:08,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:08,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:08,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:08,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:08,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:08,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:08,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:08,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:08,104 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:08,104 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:08,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:08,105 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:08,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:08,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:08,106 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:08,106 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:08,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:08,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:08,110 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:08,110 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:08,110 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:08,110 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:08,110 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:08,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:08,111 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:08,111 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:08,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:08,118 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:08,118 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:08,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:08,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:08,119 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:08,226 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:08,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:18:08,227 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:08,227 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 02:18:08,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:08,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:08,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable742 [2022-12-13 02:18:08,227 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 02:18:08,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash -104181456, now seen corresponding path program 1 times [2022-12-13 02:18:08,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:08,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194803638] [2022-12-13 02:18:08,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:08,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:08,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:18:08,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:08,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194803638] [2022-12-13 02:18:08,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194803638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:08,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:08,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:08,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187023060] [2022-12-13 02:18:08,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:08,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:08,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:08,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:08,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:08,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:08,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:08,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:08,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:08,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:08,374 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:08,374 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:08,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:08,376 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:08,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:08,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:08,377 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:08,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:08,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:08,380 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:08,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:08,381 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:08,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:08,381 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:08,381 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:08,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:08,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:08,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:08,389 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:08,389 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:08,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:08,390 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:08,390 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:08,496 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:08,496 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:18:08,496 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:08,496 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 02:18:08,496 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:08,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:08,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable743 [2022-12-13 02:18:08,497 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 02:18:08,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash -75552305, now seen corresponding path program 1 times [2022-12-13 02:18:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:08,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448888511] [2022-12-13 02:18:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:08,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 02:18:08,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:08,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448888511] [2022-12-13 02:18:08,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448888511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:08,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:08,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:08,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832235555] [2022-12-13 02:18:08,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:08,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:08,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:08,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:08,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:08,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:08,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:08,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:08,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:08,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:08,654 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:08,654 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:08,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:08,655 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:08,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:08,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:08,656 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:08,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:08,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:08,660 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:08,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:08,660 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:08,660 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:08,660 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:08,660 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:08,660 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:08,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:08,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:08,668 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:08,668 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:08,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:08,669 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:08,669 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:08,776 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:08,776 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:18:08,776 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:08,776 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 02:18:08,776 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:08,776 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:08,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable744 [2022-12-13 02:18:08,777 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 02:18:08,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:08,777 INFO L85 PathProgramCache]: Analyzing trace with hash -46923154, now seen corresponding path program 1 times [2022-12-13 02:18:08,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:08,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990642162] [2022-12-13 02:18:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:08,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:18:08,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:08,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990642162] [2022-12-13 02:18:08,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990642162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:08,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:08,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:08,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964954233] [2022-12-13 02:18:08,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:08,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:08,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:08,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:08,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:08,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:08,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:08,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:08,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:08,923 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:08,923 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:08,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:08,924 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:08,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:08,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:08,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:08,925 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:08,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:08,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:08,928 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:08,929 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:08,929 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:08,929 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:08,929 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:08,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:08,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:08,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:08,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:08,939 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:08,939 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:08,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:08,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:08,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:09,027 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:09,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:18:09,028 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:09,028 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 02:18:09,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:09,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:09,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable745 [2022-12-13 02:18:09,028 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 02:18:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:09,028 INFO L85 PathProgramCache]: Analyzing trace with hash -18294003, now seen corresponding path program 1 times [2022-12-13 02:18:09,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:09,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385824701] [2022-12-13 02:18:09,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:09,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:09,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:18:09,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:09,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385824701] [2022-12-13 02:18:09,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385824701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:09,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:09,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:09,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258041299] [2022-12-13 02:18:09,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:09,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:09,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:09,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:09,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:09,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:09,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:09,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:09,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:09,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:09,159 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:09,159 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:09,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:09,161 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:09,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:09,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:09,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:09,161 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:09,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:09,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:09,164 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:09,164 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:09,164 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:09,164 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:09,164 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:09,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:09,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:09,165 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:09,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:09,170 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:09,170 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:09,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:09,171 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:09,171 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:09,256 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:09,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:09,257 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:09,257 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 02:18:09,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:09,257 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:09,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable746 [2022-12-13 02:18:09,257 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 02:18:09,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:09,258 INFO L85 PathProgramCache]: Analyzing trace with hash 10335148, now seen corresponding path program 1 times [2022-12-13 02:18:09,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:09,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552976828] [2022-12-13 02:18:09,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:09,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:09,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:18:09,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:09,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552976828] [2022-12-13 02:18:09,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552976828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:09,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:09,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:09,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237937869] [2022-12-13 02:18:09,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:09,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:09,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:09,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:09,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:09,305 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:09,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:09,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:09,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:09,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:09,383 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:09,383 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:09,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:09,384 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:09,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:09,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:09,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:09,384 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:09,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:09,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:09,387 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:09,387 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:09,387 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:09,387 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:09,387 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:09,388 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:09,388 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:09,388 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:09,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:09,393 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:09,393 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:09,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:09,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:09,394 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:09,482 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:09,482 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:09,482 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:09,483 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 02:18:09,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:09,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:09,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable747 [2022-12-13 02:18:09,483 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 02:18:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:09,483 INFO L85 PathProgramCache]: Analyzing trace with hash 38964299, now seen corresponding path program 1 times [2022-12-13 02:18:09,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:09,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111687214] [2022-12-13 02:18:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:09,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:09,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:18:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111687214] [2022-12-13 02:18:09,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111687214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:09,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:09,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909582751] [2022-12-13 02:18:09,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:09,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:09,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:09,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:09,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:09,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:09,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:09,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:09,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:09,594 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:09,594 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:09,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:09,595 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:09,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:09,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:09,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:09,596 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:09,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:09,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:09,598 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:09,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:09,599 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:09,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:09,599 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:09,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:09,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:09,599 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:09,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:09,605 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:09,605 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:09,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:09,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:09,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:09,691 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:09,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:09,692 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:09,692 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 02:18:09,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:09,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:09,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable748 [2022-12-13 02:18:09,692 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 02:18:09,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:09,692 INFO L85 PathProgramCache]: Analyzing trace with hash 67593450, now seen corresponding path program 1 times [2022-12-13 02:18:09,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:09,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489430830] [2022-12-13 02:18:09,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:09,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:09,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:18:09,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:09,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489430830] [2022-12-13 02:18:09,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489430830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:09,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:09,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:09,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999214350] [2022-12-13 02:18:09,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:09,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:09,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:09,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:09,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:09,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:09,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:09,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:09,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:09,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:09,816 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:09,816 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:09,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:09,817 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:09,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:09,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:09,818 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:09,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:09,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:09,820 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:09,820 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:09,820 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:09,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:09,821 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:09,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:09,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:09,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:09,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:09,826 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:09,826 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:09,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:09,827 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:09,827 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:09,912 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:09,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:09,912 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:09,912 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 02:18:09,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:09,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:09,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable749 [2022-12-13 02:18:09,913 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 02:18:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash 96222601, now seen corresponding path program 1 times [2022-12-13 02:18:09,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:09,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086171085] [2022-12-13 02:18:09,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:09,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:09,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:18:09,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:09,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086171085] [2022-12-13 02:18:09,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086171085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:09,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:09,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:09,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070860165] [2022-12-13 02:18:09,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:09,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:09,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:09,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:09,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:09,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:09,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:09,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:09,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:09,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:10,035 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:10,035 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:10,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:10,036 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:10,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:10,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:10,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:10,037 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:10,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:10,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:10,040 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,040 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:10,040 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:10,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:10,040 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:10,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:10,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:10,046 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:10,046 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:10,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:10,046 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:10,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:10,136 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:10,136 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:10,136 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:10,137 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 02:18:10,137 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:10,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:10,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable750 [2022-12-13 02:18:10,137 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 02:18:10,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:10,137 INFO L85 PathProgramCache]: Analyzing trace with hash 124851752, now seen corresponding path program 1 times [2022-12-13 02:18:10,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:10,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484166768] [2022-12-13 02:18:10,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:10,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:10,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:18:10,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:10,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484166768] [2022-12-13 02:18:10,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484166768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:10,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:10,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:10,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336533475] [2022-12-13 02:18:10,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:10,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:10,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:10,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:10,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:10,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:10,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:10,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:10,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:10,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:10,249 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:10,249 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:10,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:10,250 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:10,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:10,250 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:10,250 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:10,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:10,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:10,253 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,253 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:10,253 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:10,253 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:10,253 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,253 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:10,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:10,254 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:10,259 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:10,259 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:10,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:10,260 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:10,260 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:10,348 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:10,348 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:10,348 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:10,348 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 02:18:10,348 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:10,348 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:10,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable751 [2022-12-13 02:18:10,348 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 02:18:10,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash 153480903, now seen corresponding path program 1 times [2022-12-13 02:18:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:10,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776042] [2022-12-13 02:18:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:10,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:18:10,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:10,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776042] [2022-12-13 02:18:10,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:10,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:10,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:10,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800807529] [2022-12-13 02:18:10,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:10,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:10,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:10,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:10,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:10,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:10,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:10,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:10,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:10,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:10,459 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:10,459 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:10,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:10,460 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:10,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:10,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:10,461 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:10,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:10,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:10,463 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,463 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:10,463 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:10,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:10,464 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:10,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:10,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:10,469 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:10,469 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:10,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:10,470 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:10,470 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:10,557 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:10,557 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:10,557 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:10,557 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 02:18:10,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:10,557 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:10,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable752 [2022-12-13 02:18:10,557 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 02:18:10,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:10,558 INFO L85 PathProgramCache]: Analyzing trace with hash 182110054, now seen corresponding path program 1 times [2022-12-13 02:18:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:10,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012169091] [2022-12-13 02:18:10,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:10,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:10,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:18:10,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:10,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012169091] [2022-12-13 02:18:10,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012169091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:10,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:10,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:10,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449272225] [2022-12-13 02:18:10,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:10,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:10,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:10,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:10,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:10,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:10,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:10,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:10,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:10,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:10,687 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:10,687 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:10,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:10,688 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:10,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:10,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:10,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:10,688 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:10,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:10,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:10,691 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:10,691 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:10,691 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:10,691 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,692 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:10,692 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:10,692 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:10,697 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:10,697 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:10,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:10,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:10,698 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:10,786 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:10,787 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:10,787 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:10,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:10,787 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:10,787 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:10,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable753 [2022-12-13 02:18:10,787 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 02:18:10,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:10,787 INFO L85 PathProgramCache]: Analyzing trace with hash 210739205, now seen corresponding path program 1 times [2022-12-13 02:18:10,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:10,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211725400] [2022-12-13 02:18:10,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:10,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:10,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:18:10,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:10,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211725400] [2022-12-13 02:18:10,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211725400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:10,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:10,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:10,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433953656] [2022-12-13 02:18:10,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:10,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:10,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:10,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:10,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:10,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:10,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:10,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:10,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:10,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:10,936 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:10,937 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:10,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:10,938 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:10,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:10,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:10,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:10,938 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:10,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:10,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:10,941 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,941 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:10,941 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:10,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:10,941 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,942 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:10,942 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:10,942 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:10,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:10,948 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:10,948 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:10,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:10,949 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:10,949 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:11,035 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:11,036 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:11,036 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:11,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:11,036 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:11,036 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:11,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable754 [2022-12-13 02:18:11,036 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 02:18:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash 239368356, now seen corresponding path program 1 times [2022-12-13 02:18:11,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:11,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575493127] [2022-12-13 02:18:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:11,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:18:11,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:11,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575493127] [2022-12-13 02:18:11,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575493127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:11,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:11,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585281153] [2022-12-13 02:18:11,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:11,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:11,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:11,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:11,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:11,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:11,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:11,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:11,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:11,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:11,176 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:11,177 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:11,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:11,178 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:11,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:11,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:11,178 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:11,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:11,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:11,181 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:11,181 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:11,181 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:11,181 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:11,181 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:11,182 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:11,182 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:11,182 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:11,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:11,187 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:11,187 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:11,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:11,188 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:11,188 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:11,273 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:11,274 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:11,274 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:11,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:11,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:11,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:11,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable755 [2022-12-13 02:18:11,274 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 02:18:11,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:11,274 INFO L85 PathProgramCache]: Analyzing trace with hash 267997507, now seen corresponding path program 1 times [2022-12-13 02:18:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:11,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049794968] [2022-12-13 02:18:11,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:11,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:11,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:18:11,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:11,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049794968] [2022-12-13 02:18:11,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049794968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:11,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:11,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:11,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881680148] [2022-12-13 02:18:11,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:11,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:11,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:11,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:11,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:11,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:11,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:11,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:11,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:11,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:11,396 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:11,396 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:11,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:11,397 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:11,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:11,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:11,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:11,398 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:11,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:11,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:11,401 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:11,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:11,401 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:11,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:11,401 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:11,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:11,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:11,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:11,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:11,407 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:11,407 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:11,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:11,407 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:11,407 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:11,493 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:11,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:11,493 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:11,493 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 02:18:11,493 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:11,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:11,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable756 [2022-12-13 02:18:11,493 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 02:18:11,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:11,494 INFO L85 PathProgramCache]: Analyzing trace with hash 296626658, now seen corresponding path program 1 times [2022-12-13 02:18:11,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:11,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926628762] [2022-12-13 02:18:11,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:11,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:11,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:18:11,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:11,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926628762] [2022-12-13 02:18:11,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926628762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:11,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:11,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187197611] [2022-12-13 02:18:11,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:11,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:11,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:11,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:11,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:11,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:11,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:11,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:11,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:11,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:11,615 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:11,615 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:11,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:11,616 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:11,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:11,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:11,616 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:11,617 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:11,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:11,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:11,619 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:11,619 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:11,619 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:11,619 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:11,619 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:11,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:11,620 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:11,620 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:11,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:11,625 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:11,625 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:11,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:11,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:11,626 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:11,711 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:11,711 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:11,712 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:11,712 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 02:18:11,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:11,712 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:11,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable757 [2022-12-13 02:18:11,712 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 02:18:11,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash 325255809, now seen corresponding path program 1 times [2022-12-13 02:18:11,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:11,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439047543] [2022-12-13 02:18:11,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:11,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:11,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:18:11,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:11,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439047543] [2022-12-13 02:18:11,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439047543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:11,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:11,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:11,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180502228] [2022-12-13 02:18:11,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:11,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:11,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:11,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:11,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:11,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:11,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:11,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:11,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:11,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:11,842 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:11,842 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:11,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:11,843 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:11,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:11,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:11,844 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:11,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:11,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:11,846 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:11,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:11,847 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:11,847 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:11,847 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:11,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:11,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:11,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:11,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:11,853 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:11,853 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:18:11,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:11,854 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:11,854 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:11,939 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:11,939 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:11,939 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:11,939 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 02:18:11,939 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:11,939 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:11,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable758 [2022-12-13 02:18:11,939 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 02:18:11,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash 353884960, now seen corresponding path program 1 times [2022-12-13 02:18:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:11,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54404140] [2022-12-13 02:18:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:11,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:18:11,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:11,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54404140] [2022-12-13 02:18:11,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54404140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:11,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:11,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:11,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771501672] [2022-12-13 02:18:11,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:11,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:11,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:11,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:11,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:11,985 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:11,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:11,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:11,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:11,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:12,060 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:12,060 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:12,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:12,062 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:12,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:12,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:12,062 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:12,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:12,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:12,065 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,065 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:12,065 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:12,065 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:12,065 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,065 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:12,065 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:12,065 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:12,071 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:12,071 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:12,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:12,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:12,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:12,158 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:12,158 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:12,158 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:12,158 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 02:18:12,158 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:12,158 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:12,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable759 [2022-12-13 02:18:12,159 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 02:18:12,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:12,159 INFO L85 PathProgramCache]: Analyzing trace with hash 382514111, now seen corresponding path program 1 times [2022-12-13 02:18:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:12,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078901796] [2022-12-13 02:18:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:12,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:12,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:18:12,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:12,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078901796] [2022-12-13 02:18:12,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078901796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:12,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:12,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:12,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842755218] [2022-12-13 02:18:12,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:12,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:12,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:12,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:12,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:12,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:12,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:12,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:12,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:12,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:12,282 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:12,283 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:12,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:12,284 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:12,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:12,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:12,284 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:12,284 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:12,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:12,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:12,287 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,287 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:12,287 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:12,287 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:12,287 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,288 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:12,288 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:12,288 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:12,296 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:12,297 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:12,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:12,297 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:12,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:12,402 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:12,402 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:18:12,403 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:12,403 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 02:18:12,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:12,403 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:12,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable760 [2022-12-13 02:18:12,403 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 02:18:12,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash 411143262, now seen corresponding path program 1 times [2022-12-13 02:18:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:12,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207934507] [2022-12-13 02:18:12,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:12,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:18:12,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:12,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207934507] [2022-12-13 02:18:12,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207934507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:12,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:12,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:12,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177044839] [2022-12-13 02:18:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:12,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:12,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:12,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:12,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:12,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:12,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:12,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:12,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:12,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:12,527 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:12,527 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:12,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:12,528 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:12,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:12,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:12,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:12,529 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:12,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:12,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:12,531 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,531 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:12,531 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:12,532 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:12,532 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,532 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:12,532 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:12,532 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:12,538 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:12,538 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:12,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:12,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:12,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:12,623 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:12,624 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:12,624 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:12,624 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 02:18:12,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:12,624 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:12,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable761 [2022-12-13 02:18:12,624 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 02:18:12,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash 439772413, now seen corresponding path program 1 times [2022-12-13 02:18:12,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:12,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435400084] [2022-12-13 02:18:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:12,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:12,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:18:12,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:12,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435400084] [2022-12-13 02:18:12,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435400084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:12,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:12,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:12,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357616719] [2022-12-13 02:18:12,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:12,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:12,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:12,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:12,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:12,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:12,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:12,738 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:12,738 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:12,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:12,739 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:12,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:12,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:12,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:12,739 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:12,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:12,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:12,750 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:12,750 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:12,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:12,750 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:12,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:12,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:12,756 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:12,756 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:12,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:12,757 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:12,757 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:12,843 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:12,843 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:12,843 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:12,843 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 02:18:12,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:12,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:12,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable762 [2022-12-13 02:18:12,843 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 02:18:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash 468401564, now seen corresponding path program 1 times [2022-12-13 02:18:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:12,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413930210] [2022-12-13 02:18:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:12,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:18:12,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:12,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413930210] [2022-12-13 02:18:12,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413930210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:12,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:12,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:12,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996655677] [2022-12-13 02:18:12,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:12,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:12,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:12,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:12,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:12,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:12,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:12,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:12,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:12,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:12,953 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:12,953 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:12,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:12,954 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:12,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:12,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:12,954 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:12,954 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:12,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:12,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:12,957 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,957 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:12,957 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:12,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:12,957 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:12,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:12,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:12,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:12,963 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:12,963 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:12,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:12,963 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:12,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:13,049 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:13,049 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:13,049 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:13,049 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 02:18:13,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:13,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:13,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable763 [2022-12-13 02:18:13,050 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 02:18:13,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash 497030715, now seen corresponding path program 1 times [2022-12-13 02:18:13,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:13,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597060990] [2022-12-13 02:18:13,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:13,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:13,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:18:13,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:13,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597060990] [2022-12-13 02:18:13,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597060990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:13,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:13,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:13,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053880990] [2022-12-13 02:18:13,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:13,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:13,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:13,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:13,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:13,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:13,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:13,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:13,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:13,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:13,162 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:13,162 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:13,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:13,163 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:13,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:13,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:13,163 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:13,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:13,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:13,166 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:13,166 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:13,166 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:13,166 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:13,166 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:13,166 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:13,166 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:13,166 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:13,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:13,172 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:13,172 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:13,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:13,173 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:13,173 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:13,259 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:13,259 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:13,259 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:13,260 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 02:18:13,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:13,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:13,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable764 [2022-12-13 02:18:13,260 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 02:18:13,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:13,260 INFO L85 PathProgramCache]: Analyzing trace with hash 525659866, now seen corresponding path program 1 times [2022-12-13 02:18:13,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:13,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257588902] [2022-12-13 02:18:13,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:13,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:13,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:18:13,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:13,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257588902] [2022-12-13 02:18:13,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257588902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:13,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:13,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:13,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267368380] [2022-12-13 02:18:13,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:13,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:13,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:13,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:13,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:13,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:13,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:13,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:13,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:13,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:13,392 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:13,393 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:13,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:13,394 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:13,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:13,394 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:13,394 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:13,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:13,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:13,397 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:13,397 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:13,397 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:13,397 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:13,397 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:13,397 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:13,397 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:13,397 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:13,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:13,403 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:13,403 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:13,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:13,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:13,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:13,488 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:13,489 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:13,489 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:13,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:13,489 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:13,489 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:13,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable765 [2022-12-13 02:18:13,489 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 02:18:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:13,490 INFO L85 PathProgramCache]: Analyzing trace with hash 554289017, now seen corresponding path program 1 times [2022-12-13 02:18:13,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:13,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487314450] [2022-12-13 02:18:13,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:13,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:18:13,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:13,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487314450] [2022-12-13 02:18:13,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487314450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:13,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:13,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:13,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802915878] [2022-12-13 02:18:13,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:13,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:13,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:13,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:13,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:13,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:13,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:13,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:13,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:13,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:13,603 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:13,604 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:13,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:13,605 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:13,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:13,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:13,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:13,605 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:13,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:13,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:13,608 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:13,608 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:13,608 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:13,608 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:13,608 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:13,609 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:13,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:13,609 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:13,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:13,628 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:13,628 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:13,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:13,629 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:13,629 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:13,723 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:13,724 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:18:13,724 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:13,724 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 02:18:13,724 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:13,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:13,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable766 [2022-12-13 02:18:13,724 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 02:18:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash 582918168, now seen corresponding path program 1 times [2022-12-13 02:18:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:13,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879101607] [2022-12-13 02:18:13,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:13,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:13,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:18:13,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:13,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879101607] [2022-12-13 02:18:13,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879101607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:13,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:13,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:13,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426058724] [2022-12-13 02:18:13,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:13,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:13,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:13,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:13,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:13,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:13,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:13,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:13,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:13,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:13,853 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:13,853 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:13,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:13,854 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:13,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:13,855 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:13,855 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:13,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:13,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:13,857 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:13,857 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:13,858 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:13,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:13,858 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:13,858 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:13,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:13,858 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:13,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:13,864 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:13,864 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:13,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:13,865 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:13,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:13,950 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:13,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:13,951 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:13,951 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 02:18:13,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:13,951 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:13,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable767 [2022-12-13 02:18:13,951 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 02:18:13,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:13,951 INFO L85 PathProgramCache]: Analyzing trace with hash 611547319, now seen corresponding path program 1 times [2022-12-13 02:18:13,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:13,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051403154] [2022-12-13 02:18:13,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:13,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:13,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:18:13,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:13,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051403154] [2022-12-13 02:18:13,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051403154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:13,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:13,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047845960] [2022-12-13 02:18:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:13,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:13,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:13,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:13,998 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:13,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:13,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:13,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:13,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:14,072 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:14,073 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:14,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:14,074 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:14,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:14,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:14,074 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:14,074 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:14,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:14,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:14,077 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:14,077 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:14,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:14,077 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,077 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:14,077 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:14,077 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:14,083 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:14,083 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:14,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:14,084 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:14,084 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:14,170 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:14,171 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:14,171 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:14,171 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 02:18:14,171 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:14,171 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:14,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable768 [2022-12-13 02:18:14,171 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 02:18:14,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:14,171 INFO L85 PathProgramCache]: Analyzing trace with hash 640176470, now seen corresponding path program 1 times [2022-12-13 02:18:14,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:14,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141595426] [2022-12-13 02:18:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:14,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:14,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:18:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:14,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141595426] [2022-12-13 02:18:14,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141595426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:14,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:14,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:14,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161677108] [2022-12-13 02:18:14,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:14,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:14,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:14,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:14,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:14,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:14,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:14,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:14,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:14,292 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:14,292 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:14,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:14,294 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:14,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:14,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:14,294 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:14,294 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:14,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:14,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:14,297 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:14,297 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:14,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:14,297 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:14,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:14,297 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:14,303 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:14,303 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:14,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:14,304 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:14,304 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:14,390 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:14,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:14,390 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:14,390 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 02:18:14,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:14,390 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:14,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable769 [2022-12-13 02:18:14,390 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 02:18:14,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:14,391 INFO L85 PathProgramCache]: Analyzing trace with hash 668805621, now seen corresponding path program 1 times [2022-12-13 02:18:14,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:14,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653127655] [2022-12-13 02:18:14,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:14,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:18:14,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:14,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653127655] [2022-12-13 02:18:14,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653127655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:14,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:14,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:14,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043802130] [2022-12-13 02:18:14,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:14,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:14,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:14,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:14,437 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:14,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:14,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:14,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:14,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:14,511 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:14,511 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:14,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:14,512 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:14,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:14,513 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:14,513 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:14,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:14,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:14,515 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,515 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:14,515 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:14,515 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:14,516 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:14,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:14,516 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:14,521 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:14,521 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:14,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:14,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:14,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:14,609 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:14,609 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:14,609 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:14,609 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 02:18:14,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:14,609 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:14,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable770 [2022-12-13 02:18:14,610 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 02:18:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash 697434772, now seen corresponding path program 1 times [2022-12-13 02:18:14,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:14,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791078020] [2022-12-13 02:18:14,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:14,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:14,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:18:14,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:14,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791078020] [2022-12-13 02:18:14,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791078020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:14,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:14,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:14,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828969838] [2022-12-13 02:18:14,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:14,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:14,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:14,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:14,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:14,677 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:14,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:14,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:14,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:14,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:14,753 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:14,753 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:14,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:14,754 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:14,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:14,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:14,754 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:14,755 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:14,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:14,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:14,757 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,757 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:14,757 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:14,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:14,758 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,758 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:14,758 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:14,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:14,763 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:14,764 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:14,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:14,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:14,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:14,850 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:14,850 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:14,850 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:14,850 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 02:18:14,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:14,850 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:14,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable771 [2022-12-13 02:18:14,850 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 02:18:14,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:14,851 INFO L85 PathProgramCache]: Analyzing trace with hash 726063923, now seen corresponding path program 1 times [2022-12-13 02:18:14,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:14,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537044195] [2022-12-13 02:18:14,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:14,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:14,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:18:14,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:14,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537044195] [2022-12-13 02:18:14,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537044195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:14,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:14,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:14,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401173217] [2022-12-13 02:18:14,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:14,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:14,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:14,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:14,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:14,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:14,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:14,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:14,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:14,973 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:14,973 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:14,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:14,974 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:14,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:14,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:14,975 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:14,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:14,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:14,978 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,979 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:14,979 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:14,979 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:14,979 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,979 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:14,979 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:14,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:14,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:14,988 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:14,988 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:14,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:14,989 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:14,989 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:15,091 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:15,092 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:18:15,092 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:15,092 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 02:18:15,092 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:15,092 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:15,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable772 [2022-12-13 02:18:15,092 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 02:18:15,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:15,093 INFO L85 PathProgramCache]: Analyzing trace with hash 754693074, now seen corresponding path program 1 times [2022-12-13 02:18:15,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:15,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693302187] [2022-12-13 02:18:15,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:15,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:15,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:18:15,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:15,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693302187] [2022-12-13 02:18:15,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693302187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:15,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:15,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:15,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821809161] [2022-12-13 02:18:15,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:15,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:15,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:15,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:15,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:15,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:15,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:15,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:15,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:15,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:15,239 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:15,239 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:15,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:15,240 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:15,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:15,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:15,241 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:15,241 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:15,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:15,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:15,243 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:15,243 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:15,244 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:15,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:15,244 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:15,244 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:15,244 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:15,244 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:15,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:15,250 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:15,250 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:15,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:15,250 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:15,250 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:15,337 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:15,338 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:15,338 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:15,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:15,338 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:15,338 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:15,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable773 [2022-12-13 02:18:15,338 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 02:18:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash 783322225, now seen corresponding path program 1 times [2022-12-13 02:18:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:15,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320192427] [2022-12-13 02:18:15,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:15,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:18:15,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:15,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320192427] [2022-12-13 02:18:15,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320192427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:15,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:15,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:15,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780233039] [2022-12-13 02:18:15,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:15,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:15,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:15,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:15,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:15,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:15,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:15,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:15,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:15,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:15,453 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:15,453 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:15,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:15,454 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:15,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:15,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:15,455 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:15,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:15,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:15,457 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:15,457 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:15,457 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:15,458 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:15,458 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:15,458 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:15,458 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:15,458 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:15,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:15,463 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:15,464 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:15,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:15,464 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:15,464 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:15,550 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:15,551 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:15,551 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:15,551 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 02:18:15,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:15,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:15,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable774 [2022-12-13 02:18:15,551 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 02:18:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:15,551 INFO L85 PathProgramCache]: Analyzing trace with hash 811951376, now seen corresponding path program 1 times [2022-12-13 02:18:15,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:15,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852342381] [2022-12-13 02:18:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:15,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:15,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:18:15,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:15,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852342381] [2022-12-13 02:18:15,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852342381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:15,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:15,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:15,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813947426] [2022-12-13 02:18:15,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:15,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:15,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:15,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:15,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:15,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:15,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:15,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:15,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:15,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:15,684 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:15,684 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:15,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:15,685 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:15,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:15,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:15,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:15,686 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:15,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:15,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:15,688 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:15,688 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:15,688 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:15,688 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:15,688 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:15,689 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:15,689 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:15,689 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:15,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:15,694 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:15,694 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:15,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:15,695 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:15,695 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:15,781 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:15,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:15,781 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:15,781 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 02:18:15,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:15,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:15,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable775 [2022-12-13 02:18:15,782 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 02:18:15,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:15,782 INFO L85 PathProgramCache]: Analyzing trace with hash 840580527, now seen corresponding path program 1 times [2022-12-13 02:18:15,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:15,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537877773] [2022-12-13 02:18:15,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:15,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:15,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:18:15,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:15,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537877773] [2022-12-13 02:18:15,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537877773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:15,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:15,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:15,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163268533] [2022-12-13 02:18:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:15,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:15,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:15,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:15,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:15,828 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:15,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:15,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:15,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:15,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:15,903 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:15,903 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:18:15,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:15,904 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:15,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:15,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:15,905 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:15,905 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:15,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:15,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:15,907 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:15,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:15,907 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:15,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:15,908 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:15,908 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:15,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:15,908 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:15,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:15,913 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:15,913 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:15,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:15,914 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:15,914 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:16,001 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:16,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:16,001 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:16,001 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 02:18:16,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:16,001 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:16,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable776 [2022-12-13 02:18:16,001 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 02:18:16,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:16,002 INFO L85 PathProgramCache]: Analyzing trace with hash 869209678, now seen corresponding path program 1 times [2022-12-13 02:18:16,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:16,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682793604] [2022-12-13 02:18:16,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:16,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:16,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:18:16,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:16,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682793604] [2022-12-13 02:18:16,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682793604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:16,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:16,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:16,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463350782] [2022-12-13 02:18:16,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:16,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:16,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:16,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:16,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:16,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:16,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:16,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:16,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:16,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:16,147 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:16,147 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:16,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:16,148 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:16,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:16,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:16,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:16,149 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:16,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:16,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:16,151 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:16,151 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:16,151 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:16,151 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:16,152 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:16,152 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:16,152 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:16,152 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:16,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:16,157 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:16,157 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:16,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:16,158 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:16,158 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:16,246 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:16,246 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:16,246 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:16,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:16,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:16,246 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:16,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable777 [2022-12-13 02:18:16,246 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 02:18:16,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:16,247 INFO L85 PathProgramCache]: Analyzing trace with hash 897838829, now seen corresponding path program 1 times [2022-12-13 02:18:16,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:16,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280127223] [2022-12-13 02:18:16,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:16,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:16,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:18:16,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:16,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280127223] [2022-12-13 02:18:16,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280127223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:16,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:16,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:16,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458113470] [2022-12-13 02:18:16,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:16,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:16,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:16,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:16,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:16,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:16,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:16,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:16,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:16,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:16,359 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:16,359 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:16,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:16,360 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:16,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:16,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:16,361 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:16,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:16,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:16,363 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:16,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:16,364 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:16,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:16,364 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:16,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:16,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:16,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:16,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:16,369 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:16,369 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:16,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:16,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:16,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:16,456 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:16,457 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:16,457 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:16,457 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 02:18:16,457 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:16,457 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:16,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable778 [2022-12-13 02:18:16,457 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 02:18:16,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash 926467980, now seen corresponding path program 1 times [2022-12-13 02:18:16,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:16,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527110970] [2022-12-13 02:18:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:16,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 02:18:16,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:16,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527110970] [2022-12-13 02:18:16,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527110970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:16,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:16,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:16,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739730706] [2022-12-13 02:18:16,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:16,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:16,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:16,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:16,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:16,514 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:16,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:16,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:16,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:16,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:16,588 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:16,589 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:16,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:16,590 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:16,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:16,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:16,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:16,590 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:16,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:16,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:16,593 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:16,593 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:16,593 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:16,593 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:16,593 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:16,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:16,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:16,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:16,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:16,599 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:16,599 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:16,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:16,600 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:16,600 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:16,685 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:16,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:16,686 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:16,686 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 02:18:16,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:16,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:16,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable779 [2022-12-13 02:18:16,686 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 02:18:16,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:16,686 INFO L85 PathProgramCache]: Analyzing trace with hash 955097131, now seen corresponding path program 1 times [2022-12-13 02:18:16,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:16,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30135989] [2022-12-13 02:18:16,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:16,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:16,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:18:16,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:16,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30135989] [2022-12-13 02:18:16,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30135989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:16,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:16,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:16,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871985384] [2022-12-13 02:18:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:16,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:16,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:16,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:16,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:16,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:16,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:16,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:16,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:16,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:16,798 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:16,798 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:16,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:16,800 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:16,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:16,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:16,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:16,800 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:16,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:16,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:16,804 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:16,805 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:16,805 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:16,805 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:16,805 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:16,805 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:16,805 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:16,805 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:16,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:16,814 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:16,814 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:16,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:16,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:16,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:16,918 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:16,918 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:18:16,918 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:16,919 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 02:18:16,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:16,919 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:16,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable780 [2022-12-13 02:18:16,919 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 02:18:16,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:16,919 INFO L85 PathProgramCache]: Analyzing trace with hash 983726282, now seen corresponding path program 1 times [2022-12-13 02:18:16,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:16,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239724763] [2022-12-13 02:18:16,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:16,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:16,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:18:16,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:16,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239724763] [2022-12-13 02:18:16,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239724763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:16,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:16,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:16,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736626897] [2022-12-13 02:18:16,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:16,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:16,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:16,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:16,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:16,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:16,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:16,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:16,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:16,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:17,044 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:17,044 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:18:17,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:17,045 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:17,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:17,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:17,046 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:17,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:17,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:17,048 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:17,048 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:17,048 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:17,048 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:17,049 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:17,049 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:17,054 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:17,054 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:17,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:17,055 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:17,055 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:17,141 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:17,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:17,142 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:17,142 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 02:18:17,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:17,142 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:17,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable781 [2022-12-13 02:18:17,142 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 02:18:17,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:17,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1012355433, now seen corresponding path program 1 times [2022-12-13 02:18:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:17,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105939259] [2022-12-13 02:18:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:17,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:17,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:18:17,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:17,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105939259] [2022-12-13 02:18:17,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105939259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:17,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:17,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:17,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684237041] [2022-12-13 02:18:17,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:17,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:17,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:17,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:17,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:17,190 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:17,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:17,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:17,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:17,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:17,267 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:17,267 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:17,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1131 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:17,268 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:17,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:17,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:17,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:17,269 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:17,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:17,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:17,271 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:17,271 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:17,271 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:17,271 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:17,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:17,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:17,277 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:17,277 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:17,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:17,278 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:17,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:17,364 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:17,364 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:17,365 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:17,365 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 02:18:17,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:17,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:17,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable782 [2022-12-13 02:18:17,365 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 02:18:17,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:17,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1040984584, now seen corresponding path program 1 times [2022-12-13 02:18:17,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:17,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526008852] [2022-12-13 02:18:17,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:17,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:17,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:18:17,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:17,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526008852] [2022-12-13 02:18:17,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526008852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:17,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:17,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:17,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672965379] [2022-12-13 02:18:17,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:17,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:17,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:17,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:17,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:17,413 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:17,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:17,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:17,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:17,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:17,487 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:17,487 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:17,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:17,488 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:17,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:17,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:17,489 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:17,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:17,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:17,491 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,491 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:17,492 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:17,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:17,492 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,492 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:17,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:17,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:17,498 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:17,498 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:17,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:17,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:17,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:17,584 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:17,584 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:17,584 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:17,584 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 02:18:17,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:17,585 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:17,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable783 [2022-12-13 02:18:17,585 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 02:18:17,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:17,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1069613735, now seen corresponding path program 1 times [2022-12-13 02:18:17,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:17,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663843440] [2022-12-13 02:18:17,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:17,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:17,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:18:17,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:17,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663843440] [2022-12-13 02:18:17,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663843440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:17,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:17,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:17,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454482730] [2022-12-13 02:18:17,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:17,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:17,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:17,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:17,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:17,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:17,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:17,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:17,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:17,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:17,701 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:17,701 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:17,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:17,702 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:17,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:17,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:17,703 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:17,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:17,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:17,705 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:17,705 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:17,706 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:17,706 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,706 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:17,706 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:17,706 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:17,712 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:17,712 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:17,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:17,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:17,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:17,799 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:17,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:17,800 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:17,800 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 02:18:17,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:17,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:17,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable784 [2022-12-13 02:18:17,800 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 02:18:17,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1098242886, now seen corresponding path program 1 times [2022-12-13 02:18:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:17,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679890749] [2022-12-13 02:18:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:17,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:17,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:18:17,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:17,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679890749] [2022-12-13 02:18:17,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679890749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:17,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:17,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:17,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216107383] [2022-12-13 02:18:17,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:17,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:17,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:17,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:17,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:17,846 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:17,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:17,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:17,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:17,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:17,922 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:17,922 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:17,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:17,923 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:17,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:17,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:17,924 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:17,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:17,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:17,927 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,927 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:17,927 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:17,927 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:17,927 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,927 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:17,927 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:17,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:17,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:17,934 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:17,934 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:17,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:17,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:17,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:18,025 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:18,025 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:18:18,025 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:18,025 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 02:18:18,025 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:18,025 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:18,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable785 [2022-12-13 02:18:18,026 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 02:18:18,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:18,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1126872037, now seen corresponding path program 1 times [2022-12-13 02:18:18,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:18,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802398318] [2022-12-13 02:18:18,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:18,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:18,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:18:18,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:18,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802398318] [2022-12-13 02:18:18,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802398318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:18,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:18,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:18,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932741021] [2022-12-13 02:18:18,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:18,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:18,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:18,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:18,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:18,074 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:18,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:18,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:18,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:18,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:18,150 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:18,151 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:18,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:18,152 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:18,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:18,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:18,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:18,152 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:18,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:18,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:18,155 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:18,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:18,155 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:18,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:18,155 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:18,156 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:18,156 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:18,156 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:18,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:18,162 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:18,163 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:18,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:18,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:18,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:18,250 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:18,250 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:18,250 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:18,250 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 02:18:18,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:18,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:18,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable786 [2022-12-13 02:18:18,251 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 02:18:18,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:18,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1155501188, now seen corresponding path program 1 times [2022-12-13 02:18:18,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:18,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028013257] [2022-12-13 02:18:18,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:18,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:18,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:18:18,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:18,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028013257] [2022-12-13 02:18:18,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028013257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:18,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:18,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:18,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382924160] [2022-12-13 02:18:18,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:18,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:18,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:18,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:18,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:18,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:18,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:18,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:18,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:18,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:18,383 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:18,383 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:18,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:18,384 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:18,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:18,385 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:18,385 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:18,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:18,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:18,387 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:18,388 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:18,388 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:18,388 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:18,388 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:18,388 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:18,388 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:18,388 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:18,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:18,394 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:18,394 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:18,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:18,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:18,394 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:18,482 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:18,482 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:18,482 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:18,482 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 02:18:18,482 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:18,482 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:18,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable787 [2022-12-13 02:18:18,483 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 02:18:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1184130339, now seen corresponding path program 1 times [2022-12-13 02:18:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:18,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620584369] [2022-12-13 02:18:18,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:18,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:18,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:18:18,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:18,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620584369] [2022-12-13 02:18:18,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620584369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:18,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:18,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:18,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984138079] [2022-12-13 02:18:18,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:18,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:18,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:18,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:18,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:18,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:18,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:18,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:18,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:18,597 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:18,597 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:18,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:18,598 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:18,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:18,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:18,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:18,599 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:18,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:18,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:18,602 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:18,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:18,602 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:18,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:18,602 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:18,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:18,602 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:18,602 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:18,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:18,608 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:18,608 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:18,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:18,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:18,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:18,695 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:18,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:18,696 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:18,696 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 02:18:18,696 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:18,696 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:18,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable788 [2022-12-13 02:18:18,696 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 02:18:18,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:18,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1212759490, now seen corresponding path program 1 times [2022-12-13 02:18:18,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:18,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041983620] [2022-12-13 02:18:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:18,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:18,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:18:18,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:18,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041983620] [2022-12-13 02:18:18,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041983620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:18,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:18,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136430212] [2022-12-13 02:18:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:18,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:18,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:18,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:18,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:18,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:18,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:18,806 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:18,806 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:18,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:18,808 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:18,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:18,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:18,808 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:18,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:18,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:18,811 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:18,811 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:18,811 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:18,811 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:18,811 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:18,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:18,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:18,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:18,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:18,817 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:18,817 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:18,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:18,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:18,818 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:18,905 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:18,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:18,905 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:18,905 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 02:18:18,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:18,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:18,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable789 [2022-12-13 02:18:18,905 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 02:18:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1241388641, now seen corresponding path program 1 times [2022-12-13 02:18:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:18,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794759530] [2022-12-13 02:18:18,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:18,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:18,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:18:18,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:18,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794759530] [2022-12-13 02:18:18,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794759530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:18,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:18,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:18,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543272002] [2022-12-13 02:18:18,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:18,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:18,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:18,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:18,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:18,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:18,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:18,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:18,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:18,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:19,018 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:19,018 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:19,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:19,019 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:19,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:19,019 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:19,019 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:19,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:19,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:19,022 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,022 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:19,022 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:19,022 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:19,022 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:19,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:19,022 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:19,028 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:19,028 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:19,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:19,029 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:19,029 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:19,115 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:19,115 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:19,115 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:19,115 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 02:18:19,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:19,115 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:19,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable790 [2022-12-13 02:18:19,116 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 02:18:19,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1270017792, now seen corresponding path program 1 times [2022-12-13 02:18:19,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:19,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377678994] [2022-12-13 02:18:19,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:19,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:19,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:18:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:19,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377678994] [2022-12-13 02:18:19,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377678994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:19,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:19,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:19,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721843727] [2022-12-13 02:18:19,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:19,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:19,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:19,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:19,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:19,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:19,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:19,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:19,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:19,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:19,226 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:19,226 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:19,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:19,227 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:19,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:19,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:19,228 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:19,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:19,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:19,230 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,230 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:19,230 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:19,230 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:19,230 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,231 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:19,231 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:19,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:19,236 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:19,236 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:19,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:19,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:19,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:19,331 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:19,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:18:19,331 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:19,332 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 02:18:19,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:19,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:19,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable791 [2022-12-13 02:18:19,332 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 02:18:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1298646943, now seen corresponding path program 1 times [2022-12-13 02:18:19,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:19,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716091141] [2022-12-13 02:18:19,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:19,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:19,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:18:19,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:19,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716091141] [2022-12-13 02:18:19,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716091141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:19,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:19,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115280163] [2022-12-13 02:18:19,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:19,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:19,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:19,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:19,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:19,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:19,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:19,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:19,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:19,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:19,441 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:19,442 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:19,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:19,443 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:19,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:19,443 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:19,443 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:19,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:19,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:19,446 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,446 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:19,446 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:19,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:19,446 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,446 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:19,446 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:19,446 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:19,452 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:19,452 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:19,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:19,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:19,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:19,538 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:19,539 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:19,539 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:19,539 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 02:18:19,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:19,539 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:19,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable792 [2022-12-13 02:18:19,539 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 02:18:19,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1327276094, now seen corresponding path program 1 times [2022-12-13 02:18:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:19,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153657968] [2022-12-13 02:18:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:19,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:19,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:18:19,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:19,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153657968] [2022-12-13 02:18:19,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153657968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:19,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:19,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:19,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435089211] [2022-12-13 02:18:19,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:19,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:19,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:19,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:19,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:19,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:19,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:19,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:19,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:19,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:19,653 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:19,653 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:19,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:19,654 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:19,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:19,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:19,655 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:19,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:19,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:19,657 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,657 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:19,658 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:19,658 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:19,658 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,658 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:19,658 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:19,658 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:19,663 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:19,664 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:19,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:19,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:19,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:19,754 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:19,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:19,754 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:19,754 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 02:18:19,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:19,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:19,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable793 [2022-12-13 02:18:19,755 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 02:18:19,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:19,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1355905245, now seen corresponding path program 1 times [2022-12-13 02:18:19,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:19,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892100867] [2022-12-13 02:18:19,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:19,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:19,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:18:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:19,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892100867] [2022-12-13 02:18:19,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892100867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:19,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:19,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:19,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990281880] [2022-12-13 02:18:19,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:19,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:19,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:19,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:19,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:19,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:19,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:19,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:19,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:19,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:19,868 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:19,868 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:19,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:19,869 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:19,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:19,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:19,870 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:19,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:19,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:19,872 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,872 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:19,873 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:19,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:19,873 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,873 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:19,873 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:19,873 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:19,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:19,879 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:19,879 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:19,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:19,879 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:19,879 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:19,965 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:19,965 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:19,966 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:19,966 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 02:18:19,966 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:19,966 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:19,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable794 [2022-12-13 02:18:19,966 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 02:18:19,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:19,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1384534396, now seen corresponding path program 1 times [2022-12-13 02:18:19,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:19,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331419796] [2022-12-13 02:18:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:20,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:18:20,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:20,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331419796] [2022-12-13 02:18:20,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331419796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:20,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:20,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:20,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406378881] [2022-12-13 02:18:20,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:20,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:20,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:20,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:20,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:20,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:20,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:20,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:20,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:20,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:20,104 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:20,104 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:20,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:20,105 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:20,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:20,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:20,106 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:20,106 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:20,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:20,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:20,109 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:20,109 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:20,109 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:20,109 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:20,109 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:20,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:20,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:20,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:20,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:20,115 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:20,115 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:20,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:20,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:20,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:20,201 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:20,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:20,202 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:20,202 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 02:18:20,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:20,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:20,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable795 [2022-12-13 02:18:20,202 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 02:18:20,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:20,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1413163547, now seen corresponding path program 1 times [2022-12-13 02:18:20,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:20,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634920361] [2022-12-13 02:18:20,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:20,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:20,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:18:20,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:20,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634920361] [2022-12-13 02:18:20,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634920361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:20,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:20,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:20,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867373675] [2022-12-13 02:18:20,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:20,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:20,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:20,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:20,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:20,264 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:20,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:20,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:20,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:20,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:20,341 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:20,341 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:20,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:20,342 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:20,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:20,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:20,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:20,343 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:20,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:20,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:20,345 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:20,345 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:20,345 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:20,345 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:20,345 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:20,346 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:20,346 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:20,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:20,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:20,354 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:20,354 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:20,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:20,355 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:20,355 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:20,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:20,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:18:20,445 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:20,445 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 02:18:20,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:20,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:20,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable796 [2022-12-13 02:18:20,445 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 02:18:20,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:20,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1441792698, now seen corresponding path program 1 times [2022-12-13 02:18:20,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:20,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132997870] [2022-12-13 02:18:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:20,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:20,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:18:20,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:20,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132997870] [2022-12-13 02:18:20,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132997870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:20,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:20,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:20,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604820294] [2022-12-13 02:18:20,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:20,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:20,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:20,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:20,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:20,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:20,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:20,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:20,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:20,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:20,572 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:20,572 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:20,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:20,573 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:20,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:20,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:20,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:20,574 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:20,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:20,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:20,576 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:20,576 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:20,579 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:20,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:20,579 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:20,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:20,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:20,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:20,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:20,586 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:20,586 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:20,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:20,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:20,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:20,677 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:20,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:18:20,677 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:20,677 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 02:18:20,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:20,677 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:20,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable797 [2022-12-13 02:18:20,678 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 02:18:20,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:20,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1470421849, now seen corresponding path program 1 times [2022-12-13 02:18:20,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:20,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296684280] [2022-12-13 02:18:20,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:20,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:18:20,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:20,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296684280] [2022-12-13 02:18:20,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296684280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:20,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:20,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631978632] [2022-12-13 02:18:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:20,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:20,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:20,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:20,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:20,735 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:20,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:20,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:20,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:20,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:20,813 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:20,813 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:20,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:20,814 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:20,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:20,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:20,815 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:20,815 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:20,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:20,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:20,818 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:20,818 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:20,818 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:20,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:20,818 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:20,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:20,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:20,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:20,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:20,824 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:20,824 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:20,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:20,825 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:20,825 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:20,912 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:20,913 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:20,913 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:20,913 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 02:18:20,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:20,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:20,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable798 [2022-12-13 02:18:20,913 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 02:18:20,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1499051000, now seen corresponding path program 1 times [2022-12-13 02:18:20,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:20,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029692807] [2022-12-13 02:18:20,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:20,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:18:20,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:20,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029692807] [2022-12-13 02:18:20,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029692807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:20,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:20,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:20,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432031576] [2022-12-13 02:18:20,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:20,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:20,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:20,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:20,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:20,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:20,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:20,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:20,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:20,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:21,040 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:21,040 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:21,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:21,041 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:21,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:21,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:21,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:21,042 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:21,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:21,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:21,044 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:21,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:21,044 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:21,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:21,044 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:21,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:21,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:21,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:21,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:21,050 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:21,050 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:21,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:21,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:21,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:21,138 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:21,138 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:21,138 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:21,138 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 02:18:21,139 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:21,139 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:21,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable799 [2022-12-13 02:18:21,139 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 02:18:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1527680151, now seen corresponding path program 1 times [2022-12-13 02:18:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:21,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552381431] [2022-12-13 02:18:21,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:21,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:18:21,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:21,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552381431] [2022-12-13 02:18:21,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552381431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:21,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:21,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:21,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411085165] [2022-12-13 02:18:21,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:21,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:21,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:21,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:21,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:21,195 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:21,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:21,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:21,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:21,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:21,293 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:21,293 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:21,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:21,294 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:21,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:21,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:21,294 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:21,294 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:21,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:21,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:21,297 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:21,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:21,298 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:21,298 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:21,298 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:21,298 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:21,298 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:21,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:21,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:21,304 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:21,304 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:21,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:21,304 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:21,304 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:21,403 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:21,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:18:21,404 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:21,404 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 02:18:21,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:21,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:21,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable800 [2022-12-13 02:18:21,404 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 02:18:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1556309302, now seen corresponding path program 1 times [2022-12-13 02:18:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:21,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113972573] [2022-12-13 02:18:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:21,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:21,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:18:21,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:21,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113972573] [2022-12-13 02:18:21,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113972573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:21,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:21,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974084549] [2022-12-13 02:18:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:21,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:21,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:21,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:21,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:21,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:21,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:21,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:21,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:21,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:21,561 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:21,561 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:21,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:21,575 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:21,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:21,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:21,592 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:21,592 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:21,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:21,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:21,596 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:21,596 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:21,596 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:21,596 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:21,596 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:21,596 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:21,597 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:21,597 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:21,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:21,604 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:21,604 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:21,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:21,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:21,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:21,757 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:21,757 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 02:18:21,757 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:21,758 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 02:18:21,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:21,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:21,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable801 [2022-12-13 02:18:21,758 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 02:18:21,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:21,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1584938453, now seen corresponding path program 1 times [2022-12-13 02:18:21,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:21,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837663690] [2022-12-13 02:18:21,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:21,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:21,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:18:21,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:21,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837663690] [2022-12-13 02:18:21,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837663690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:21,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:21,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946862247] [2022-12-13 02:18:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:21,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:21,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:21,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:21,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:21,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:21,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:21,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:21,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:21,944 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:21,944 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:21,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:21,946 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:21,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:21,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:21,946 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:21,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:21,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:21,950 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:21,950 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:21,950 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:21,950 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:21,950 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:21,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:21,951 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:21,951 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:21,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:21,959 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:21,959 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:21,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:21,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:21,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:22,068 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:22,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:18:22,069 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:22,069 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 02:18:22,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:22,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:22,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable802 [2022-12-13 02:18:22,069 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 02:18:22,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1613567604, now seen corresponding path program 1 times [2022-12-13 02:18:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:22,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159694881] [2022-12-13 02:18:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:22,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:22,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 02:18:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:22,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159694881] [2022-12-13 02:18:22,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159694881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:22,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:22,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:22,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972163946] [2022-12-13 02:18:22,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:22,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:22,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:22,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:22,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:22,130 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:22,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:22,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:22,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:22,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:22,217 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:22,217 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:22,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:22,218 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:22,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:22,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:22,219 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:22,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:22,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:22,222 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:22,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:22,223 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:22,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:22,223 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:22,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:22,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:22,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:22,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:22,231 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:22,231 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:18:22,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:22,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:22,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:22,340 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:22,341 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:18:22,341 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:22,341 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 02:18:22,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:22,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:22,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable803 [2022-12-13 02:18:22,341 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 02:18:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1642196755, now seen corresponding path program 1 times [2022-12-13 02:18:22,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:22,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193767032] [2022-12-13 02:18:22,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:22,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:22,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:18:22,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:22,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193767032] [2022-12-13 02:18:22,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193767032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:22,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:22,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692235015] [2022-12-13 02:18:22,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:22,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:22,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:22,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:22,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:22,398 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:22,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:22,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:22,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:22,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:22,489 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:22,489 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:22,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:22,490 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:22,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:22,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:22,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:22,490 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:22,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:22,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:22,493 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:22,493 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:22,493 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:22,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:22,493 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:22,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:22,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:22,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:22,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:22,501 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:22,501 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:22,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:22,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:22,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:22,589 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:22,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:22,589 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:22,590 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 02:18:22,590 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:22,590 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:22,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable804 [2022-12-13 02:18:22,590 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 02:18:22,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1670825906, now seen corresponding path program 1 times [2022-12-13 02:18:22,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:22,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349221155] [2022-12-13 02:18:22,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:22,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:22,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:18:22,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:22,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349221155] [2022-12-13 02:18:22,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349221155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:22,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:22,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:22,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049705958] [2022-12-13 02:18:22,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:22,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:22,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:22,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:22,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:22,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:22,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:22,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:22,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:22,730 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:22,730 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:22,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:22,731 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:22,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:22,731 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:22,731 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:22,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:22,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:22,734 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:22,734 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:22,734 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:22,734 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:22,734 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:22,735 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:22,735 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:22,735 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:22,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:22,740 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:22,740 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:22,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:22,741 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:22,741 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:22,828 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:22,828 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:22,828 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:22,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:22,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:22,828 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:22,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable805 [2022-12-13 02:18:22,828 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 02:18:22,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:22,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1699455057, now seen corresponding path program 1 times [2022-12-13 02:18:22,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:22,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177635189] [2022-12-13 02:18:22,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:22,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:18:22,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:22,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177635189] [2022-12-13 02:18:22,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177635189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:22,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:22,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:22,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607602913] [2022-12-13 02:18:22,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:22,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:22,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:22,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:22,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:22,876 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:22,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:22,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:22,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:22,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:22,942 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:22,942 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:22,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:22,943 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:22,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:22,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:22,943 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:22,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:22,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:22,946 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:22,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:22,946 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:22,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:22,946 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:22,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:22,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:22,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:22,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:22,952 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:22,952 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:22,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:22,953 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:22,953 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:23,040 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:23,040 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:23,040 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:23,040 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 02:18:23,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:23,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:23,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable806 [2022-12-13 02:18:23,041 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 02:18:23,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:23,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1728084208, now seen corresponding path program 1 times [2022-12-13 02:18:23,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:23,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355359098] [2022-12-13 02:18:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:23,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:23,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:18:23,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:23,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355359098] [2022-12-13 02:18:23,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355359098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:23,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:23,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750215630] [2022-12-13 02:18:23,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:23,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:23,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:23,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:23,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:23,086 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:23,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:23,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:23,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:23,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:23,162 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:23,162 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:23,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:23,163 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:23,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:23,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:23,164 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:23,164 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:23,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:23,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:23,167 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:23,167 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:23,167 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:23,167 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:23,167 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:23,167 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:23,167 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:23,167 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:23,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:23,173 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:23,173 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:23,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:23,174 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:23,174 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:23,262 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:23,262 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:23,262 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:23,263 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 02:18:23,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:23,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:23,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable807 [2022-12-13 02:18:23,263 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 02:18:23,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1756713359, now seen corresponding path program 1 times [2022-12-13 02:18:23,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:23,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863651413] [2022-12-13 02:18:23,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:23,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:18:23,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:23,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863651413] [2022-12-13 02:18:23,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863651413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:23,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:23,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:23,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914091947] [2022-12-13 02:18:23,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:23,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:23,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:23,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:23,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:23,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:23,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:23,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:23,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:23,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:23,384 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:23,385 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:18:23,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:23,386 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:23,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:23,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:23,386 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:23,386 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:23,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:23,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:23,389 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:23,389 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:23,389 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:23,389 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:23,389 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:23,389 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:23,389 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:23,389 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:23,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:23,395 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:23,395 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:23,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:23,395 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:23,396 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:23,484 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:23,485 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:23,485 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:23,485 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 02:18:23,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:23,485 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:23,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable808 [2022-12-13 02:18:23,485 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 02:18:23,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1785342510, now seen corresponding path program 1 times [2022-12-13 02:18:23,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:23,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028329012] [2022-12-13 02:18:23,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:23,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:23,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:18:23,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:23,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028329012] [2022-12-13 02:18:23,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028329012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:23,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:23,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:23,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602479982] [2022-12-13 02:18:23,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:23,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:23,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:23,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:23,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:23,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:23,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:23,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:23,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:23,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:23,610 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:23,610 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:23,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:23,611 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:23,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:23,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:23,612 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:23,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:23,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:23,614 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:23,614 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:23,614 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:23,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:23,614 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:23,615 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:23,615 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:23,615 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:23,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:23,620 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:23,620 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:23,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:23,621 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:23,621 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:23,707 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:23,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:23,708 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:23,708 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 02:18:23,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:23,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:23,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable809 [2022-12-13 02:18:23,708 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 02:18:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1813971661, now seen corresponding path program 1 times [2022-12-13 02:18:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:23,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822008708] [2022-12-13 02:18:23,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:23,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:18:23,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:23,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822008708] [2022-12-13 02:18:23,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822008708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:23,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:23,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:23,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153491008] [2022-12-13 02:18:23,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:23,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:23,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:23,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:23,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:23,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:23,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:23,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:23,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:23,823 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:23,823 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:23,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:23,824 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:23,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:23,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:23,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:23,825 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:23,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:23,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:23,827 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:23,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:23,828 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:23,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:23,828 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:23,828 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:23,828 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:23,828 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:23,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:23,834 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:23,834 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:23,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:23,835 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:23,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:23,933 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:23,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:18:23,933 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:23,933 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 02:18:23,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:23,933 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:23,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable810 [2022-12-13 02:18:23,933 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 02:18:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1842600812, now seen corresponding path program 1 times [2022-12-13 02:18:23,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:23,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905328142] [2022-12-13 02:18:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:23,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:18:23,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:23,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905328142] [2022-12-13 02:18:23,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905328142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:23,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:23,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:23,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481195581] [2022-12-13 02:18:23,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:23,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:23,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:23,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:23,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:23,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:23,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:23,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:23,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:24,045 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:24,045 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:24,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:24,047 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:24,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:24,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:24,047 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:24,047 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:24,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:24,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:24,050 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,050 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:24,050 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:24,050 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:24,050 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,050 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:24,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:24,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:24,056 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:24,056 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:24,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:24,057 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:24,057 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:24,144 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:24,144 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:24,144 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:24,144 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 02:18:24,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:24,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:24,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable811 [2022-12-13 02:18:24,144 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 02:18:24,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:24,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1871229963, now seen corresponding path program 1 times [2022-12-13 02:18:24,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:24,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438491544] [2022-12-13 02:18:24,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:24,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:24,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:18:24,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:24,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438491544] [2022-12-13 02:18:24,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438491544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:24,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:24,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:24,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012072005] [2022-12-13 02:18:24,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:24,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:24,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:24,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:24,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:24,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:24,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:24,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:24,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:24,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:24,258 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:24,258 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:24,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:24,260 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:24,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:24,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:24,260 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:24,260 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:24,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:24,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:24,263 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,263 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:24,263 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:24,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:24,263 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:24,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:24,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:24,275 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:24,276 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:24,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:24,276 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:24,276 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:24,363 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:24,364 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:18:24,364 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:24,364 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 02:18:24,364 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:24,364 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:24,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable812 [2022-12-13 02:18:24,364 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 02:18:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:24,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1899859114, now seen corresponding path program 1 times [2022-12-13 02:18:24,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:24,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034864667] [2022-12-13 02:18:24,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:24,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:24,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:18:24,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:24,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034864667] [2022-12-13 02:18:24,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034864667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:24,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:24,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437238349] [2022-12-13 02:18:24,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:24,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:24,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:24,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:24,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:24,410 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:24,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:24,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:24,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:24,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:24,486 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:24,486 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:24,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:24,487 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:24,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:24,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:24,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:24,488 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:24,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:24,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:24,490 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,490 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:24,491 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:24,491 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:24,491 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,491 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:24,491 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:24,491 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:24,496 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:24,497 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:24,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:24,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:24,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:24,586 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:24,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:24,586 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:24,586 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 02:18:24,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:24,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:24,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable813 [2022-12-13 02:18:24,586 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 02:18:24,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:24,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1928488265, now seen corresponding path program 1 times [2022-12-13 02:18:24,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:24,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341593470] [2022-12-13 02:18:24,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:24,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:24,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:18:24,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:24,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341593470] [2022-12-13 02:18:24,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341593470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:24,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:24,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534008994] [2022-12-13 02:18:24,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:24,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:24,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:24,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:24,633 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:24,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:24,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:24,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:24,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:24,699 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:24,699 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:24,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:24,700 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:24,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:24,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:24,701 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:24,701 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:24,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:24,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:24,703 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:24,704 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:24,704 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:24,704 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,704 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:24,704 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:24,704 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:24,710 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:24,710 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:24,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:24,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:24,710 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:24,799 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:24,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:24,799 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:24,799 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 02:18:24,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:24,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:24,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable814 [2022-12-13 02:18:24,799 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 02:18:24,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1957117416, now seen corresponding path program 1 times [2022-12-13 02:18:24,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:24,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253445303] [2022-12-13 02:18:24,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:24,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:24,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:18:24,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:24,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253445303] [2022-12-13 02:18:24,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253445303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:24,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:24,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:24,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637519146] [2022-12-13 02:18:24,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:24,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:24,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:24,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:24,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:24,846 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:24,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:24,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:24,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:24,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:24,913 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:24,913 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:18:24,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1127 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:24,914 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:24,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:24,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:24,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:24,915 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:24,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:24,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:24,917 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,918 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:24,918 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:24,918 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:24,918 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,918 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:24,918 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:24,918 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:24,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:24,924 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:24,924 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:24,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:24,924 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:24,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:25,013 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:25,013 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:25,013 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:25,013 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 02:18:25,013 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:25,013 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:25,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable815 [2022-12-13 02:18:25,013 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 02:18:25,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:25,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1985746567, now seen corresponding path program 1 times [2022-12-13 02:18:25,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:25,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88165817] [2022-12-13 02:18:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:25,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:18:25,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:25,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88165817] [2022-12-13 02:18:25,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88165817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:25,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:25,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:25,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4134826] [2022-12-13 02:18:25,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:25,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:25,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:25,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:25,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:25,083 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:25,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:25,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:25,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:25,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:25,153 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:25,153 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:25,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:25,154 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:25,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:25,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:25,154 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:25,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:25,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:25,157 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:25,157 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:25,157 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:25,157 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:25,158 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:25,158 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:25,158 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:25,158 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:25,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:25,163 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:25,163 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:25,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:25,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:25,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:25,260 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:25,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:18:25,260 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:25,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:25,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:25,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:25,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable816 [2022-12-13 02:18:25,260 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 02:18:25,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2014375718, now seen corresponding path program 1 times [2022-12-13 02:18:25,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:25,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132189626] [2022-12-13 02:18:25,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:25,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:18:25,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:25,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132189626] [2022-12-13 02:18:25,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132189626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:25,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:25,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:25,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932381435] [2022-12-13 02:18:25,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:25,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:25,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:25,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:25,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:25,307 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:25,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:25,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:25,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:25,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:25,386 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:25,386 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:25,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:25,388 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:25,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:25,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:25,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:25,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:25,388 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:25,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:25,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:25,391 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:25,391 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:25,391 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:25,391 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:25,391 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:25,391 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:25,391 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:25,391 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:25,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:25,397 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:25,397 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:25,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:25,398 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:25,398 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:25,485 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:25,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:25,486 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:25,486 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 02:18:25,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:25,486 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:25,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable817 [2022-12-13 02:18:25,486 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 02:18:25,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:25,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2043004869, now seen corresponding path program 1 times [2022-12-13 02:18:25,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:25,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402067139] [2022-12-13 02:18:25,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:25,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:18:25,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:25,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402067139] [2022-12-13 02:18:25,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402067139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:25,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:25,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:25,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905116803] [2022-12-13 02:18:25,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:25,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:25,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:25,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:25,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:25,536 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:25,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:25,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:25,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:25,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:25,608 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:25,608 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:25,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:25,609 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:25,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:25,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:25,609 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:25,609 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:25,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:25,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:25,612 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:25,612 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:25,612 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:25,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:25,612 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:25,612 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:25,612 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:25,613 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:25,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:25,618 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:25,618 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:25,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:25,619 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:25,619 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:25,705 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:25,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:25,705 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:25,706 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 02:18:25,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:25,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:25,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable818 [2022-12-13 02:18:25,706 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 02:18:25,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:25,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2071634020, now seen corresponding path program 1 times [2022-12-13 02:18:25,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:25,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136010313] [2022-12-13 02:18:25,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:25,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:25,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:18:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:25,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136010313] [2022-12-13 02:18:25,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136010313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:25,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:25,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:25,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840081657] [2022-12-13 02:18:25,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:25,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:25,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:25,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:25,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:25,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:25,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:25,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:25,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:25,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:25,828 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:25,828 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:25,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1093 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:25,829 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:25,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:25,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:25,830 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:25,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:25,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:25,832 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:25,833 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:25,833 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:25,833 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:25,833 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:25,833 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:25,833 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:25,833 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:25,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:25,839 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:25,839 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:25,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:25,839 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:25,839 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:25,928 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:25,928 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:25,928 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:25,928 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 02:18:25,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:25,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:25,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable819 [2022-12-13 02:18:25,928 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 02:18:25,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2100263171, now seen corresponding path program 1 times [2022-12-13 02:18:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:25,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142751267] [2022-12-13 02:18:25,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:25,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:18:25,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:25,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142751267] [2022-12-13 02:18:25,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142751267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:25,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:25,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:25,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184062484] [2022-12-13 02:18:25,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:25,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:25,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:25,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:25,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:25,975 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:25,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:25,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:25,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:25,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:26,051 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:26,051 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:26,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:26,052 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:26,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:26,053 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:26,053 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:26,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:26,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:26,055 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,056 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:26,056 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:26,056 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:26,056 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,056 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:26,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:26,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:26,062 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:26,062 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:26,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:26,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:26,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:26,150 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:26,151 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:26,151 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:26,151 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 02:18:26,151 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:26,151 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:26,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable820 [2022-12-13 02:18:26,151 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 02:18:26,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2128892322, now seen corresponding path program 1 times [2022-12-13 02:18:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:26,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520245059] [2022-12-13 02:18:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:26,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:26,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:18:26,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:26,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520245059] [2022-12-13 02:18:26,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520245059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:26,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:26,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:26,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577741089] [2022-12-13 02:18:26,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:26,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:26,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:26,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:26,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:26,203 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:26,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:26,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:26,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:26,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:26,270 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:26,270 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:26,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:26,271 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:26,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:26,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:26,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:26,272 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:26,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:26,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:26,274 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,274 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:26,274 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:26,274 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:26,274 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,275 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:26,275 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:26,275 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:26,280 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:26,280 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:18:26,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:26,281 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:26,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:26,369 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:26,369 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:26,369 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:26,369 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 02:18:26,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:26,369 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:26,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable821 [2022-12-13 02:18:26,369 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 02:18:26,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:26,370 INFO L85 PathProgramCache]: Analyzing trace with hash -2137445823, now seen corresponding path program 1 times [2022-12-13 02:18:26,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:26,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510749606] [2022-12-13 02:18:26,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:26,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:26,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:18:26,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:26,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510749606] [2022-12-13 02:18:26,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510749606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:26,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:26,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:26,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170622338] [2022-12-13 02:18:26,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:26,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:26,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:26,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:26,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:26,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:26,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:26,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:26,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:26,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:26,484 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:26,485 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:26,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:26,486 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:26,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:26,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:26,486 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:26,486 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:26,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:26,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:26,489 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,489 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:26,489 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:26,489 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:26,489 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,489 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:26,489 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:26,490 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:26,495 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:26,495 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:26,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:26,496 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:26,496 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:26,586 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:26,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:18:26,586 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:26,586 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 02:18:26,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:26,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:26,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable822 [2022-12-13 02:18:26,587 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 02:18:26,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2108816672, now seen corresponding path program 1 times [2022-12-13 02:18:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:26,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746348381] [2022-12-13 02:18:26,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:26,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:26,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:18:26,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:26,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746348381] [2022-12-13 02:18:26,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746348381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:26,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:26,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:26,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561092710] [2022-12-13 02:18:26,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:26,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:26,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:26,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:26,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:26,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:26,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:26,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:26,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:26,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:26,702 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:26,703 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:26,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:26,704 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:26,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:26,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:26,704 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:26,704 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:26,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:26,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:26,707 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:26,707 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:26,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:26,707 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,707 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:26,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:26,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:26,713 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:26,714 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:18:26,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:26,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:26,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:26,800 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:26,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:26,801 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:26,801 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 02:18:26,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:26,801 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:26,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable823 [2022-12-13 02:18:26,801 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 02:18:26,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:26,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2080187521, now seen corresponding path program 1 times [2022-12-13 02:18:26,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:26,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285061985] [2022-12-13 02:18:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:26,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:26,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:18:26,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:26,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285061985] [2022-12-13 02:18:26,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285061985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:26,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:26,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:26,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87255100] [2022-12-13 02:18:26,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:26,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:26,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:26,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:26,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:26,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:26,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:26,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:26,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:26,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:26,925 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:26,925 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:26,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:26,926 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:26,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:26,927 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:26,927 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:26,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:26,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:26,929 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:26,930 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:26,930 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:26,930 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,930 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:26,930 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:26,930 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:26,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:26,936 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:26,936 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:26,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:26,936 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:26,936 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:27,024 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:27,024 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:27,024 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:27,024 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 02:18:27,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:27,024 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:27,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable824 [2022-12-13 02:18:27,024 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 02:18:27,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:27,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2051558370, now seen corresponding path program 1 times [2022-12-13 02:18:27,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:27,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041002024] [2022-12-13 02:18:27,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:27,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:27,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:18:27,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:27,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041002024] [2022-12-13 02:18:27,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041002024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:27,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:27,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:27,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264748922] [2022-12-13 02:18:27,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:27,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:27,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:27,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:27,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:27,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:27,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:27,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:27,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:27,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:27,153 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:27,153 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:27,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:27,154 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:27,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:27,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:27,155 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:27,155 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:27,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:27,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:27,157 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:27,157 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:27,158 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:27,158 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:27,158 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:27,158 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:27,158 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:27,158 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:27,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:27,163 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:27,164 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:27,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:27,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:27,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:27,252 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:27,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:27,253 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:27,253 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 02:18:27,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:27,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:27,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable825 [2022-12-13 02:18:27,253 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 02:18:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:27,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2022929219, now seen corresponding path program 1 times [2022-12-13 02:18:27,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:27,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952136288] [2022-12-13 02:18:27,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:27,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:27,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:18:27,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:27,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952136288] [2022-12-13 02:18:27,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952136288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:27,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:27,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:27,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797111088] [2022-12-13 02:18:27,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:27,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:27,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:27,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:27,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:27,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:27,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:27,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:27,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:27,365 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:27,366 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:27,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:27,367 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:27,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:27,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:27,367 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:27,367 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:27,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:27,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:27,370 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:27,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:27,370 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:27,370 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:27,370 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:27,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:27,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:27,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:27,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:27,376 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:27,376 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:27,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:27,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:27,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:27,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:27,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:27,465 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:27,465 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 02:18:27,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:27,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:27,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable826 [2022-12-13 02:18:27,465 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 02:18:27,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:27,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1994300068, now seen corresponding path program 1 times [2022-12-13 02:18:27,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:27,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925435668] [2022-12-13 02:18:27,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:27,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:27,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 02:18:27,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:27,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925435668] [2022-12-13 02:18:27,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925435668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:27,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:27,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:27,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110886365] [2022-12-13 02:18:27,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:27,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:27,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:27,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:27,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:27,513 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:27,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:27,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:27,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:27,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:27,578 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:27,579 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:27,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:27,580 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:27,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:27,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:27,580 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:27,580 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:27,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:27,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:27,583 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:27,583 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:27,583 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:27,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:27,583 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:27,583 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:27,583 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:27,583 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:27,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:27,589 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:27,589 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:27,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:27,590 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:27,590 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:27,677 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:27,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:27,678 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:27,678 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 02:18:27,678 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:27,678 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:27,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable827 [2022-12-13 02:18:27,678 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 02:18:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1965670917, now seen corresponding path program 1 times [2022-12-13 02:18:27,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:27,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892645429] [2022-12-13 02:18:27,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:27,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:27,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 02:18:27,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:27,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892645429] [2022-12-13 02:18:27,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892645429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:27,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:27,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:27,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179838830] [2022-12-13 02:18:27,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:27,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:27,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:27,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:27,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:27,741 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:27,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:27,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:27,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:27,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:27,816 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:27,816 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:27,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:27,817 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:27,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:27,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:27,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:27,818 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:27,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:27,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:27,820 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:27,821 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:27,821 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:27,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:27,821 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:27,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:27,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:27,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:27,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:27,827 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:27,827 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:27,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:27,827 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:27,828 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:27,914 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:27,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:27,915 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:27,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:27,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:27,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:27,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable828 [2022-12-13 02:18:27,915 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 02:18:27,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:27,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1937041766, now seen corresponding path program 1 times [2022-12-13 02:18:27,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:27,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466843862] [2022-12-13 02:18:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:27,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:27,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:18:27,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:27,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466843862] [2022-12-13 02:18:27,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466843862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:27,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:27,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:27,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442654691] [2022-12-13 02:18:27,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:27,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:27,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:27,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:27,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:27,972 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:27,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:27,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:27,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:27,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:28,038 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:28,038 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:28,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:28,039 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:28,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:28,039 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:28,039 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:28,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:28,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:28,042 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:28,042 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:28,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:28,042 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,043 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:28,043 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:28,043 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:28,049 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:28,049 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:28,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:28,049 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:28,049 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:28,137 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:28,137 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:28,137 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:28,137 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 02:18:28,137 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:28,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:28,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable829 [2022-12-13 02:18:28,138 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 02:18:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1908412615, now seen corresponding path program 1 times [2022-12-13 02:18:28,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:28,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404922720] [2022-12-13 02:18:28,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:28,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:28,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:18:28,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:28,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404922720] [2022-12-13 02:18:28,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404922720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:28,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:28,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:28,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036513502] [2022-12-13 02:18:28,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:28,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:28,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:28,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:28,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:28,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:28,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:28,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:28,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:28,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:28,284 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:28,284 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:28,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:28,286 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:28,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:28,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:28,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:28,286 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:28,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:28,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:28,289 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,289 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:28,289 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:28,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:28,289 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,289 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:28,289 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:28,290 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:28,295 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:28,295 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:28,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:28,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:28,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:28,382 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:28,382 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:28,382 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:28,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:28,382 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:28,382 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:28,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable830 [2022-12-13 02:18:28,383 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 02:18:28,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:28,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1879783464, now seen corresponding path program 1 times [2022-12-13 02:18:28,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:28,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781698121] [2022-12-13 02:18:28,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:28,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:28,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:18:28,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:28,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781698121] [2022-12-13 02:18:28,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781698121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:28,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:28,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748030138] [2022-12-13 02:18:28,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:28,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:28,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:28,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:28,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:28,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:28,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:28,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:28,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:28,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:28,494 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:28,494 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:28,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:28,495 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:28,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:28,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:28,496 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:28,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:28,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:28,498 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:28,499 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:28,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:28,499 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:28,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:28,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:28,505 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:28,505 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:28,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:28,505 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:28,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:28,594 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:28,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:28,594 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:28,594 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 02:18:28,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:28,594 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:28,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable831 [2022-12-13 02:18:28,594 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 02:18:28,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1851154313, now seen corresponding path program 1 times [2022-12-13 02:18:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:28,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9578627] [2022-12-13 02:18:28,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:28,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:28,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:18:28,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:28,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9578627] [2022-12-13 02:18:28,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9578627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:28,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:28,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867739371] [2022-12-13 02:18:28,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:28,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:28,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:28,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:28,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:28,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:28,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:28,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:28,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:28,738 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:28,738 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:28,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:28,739 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:28,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:28,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:28,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:28,739 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:28,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:28,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:28,742 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:28,742 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:28,742 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:28,742 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,742 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:28,742 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:28,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:28,748 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:28,748 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:28,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:28,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:28,749 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:28,836 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:28,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:28,836 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:28,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:28,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:28,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:28,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable832 [2022-12-13 02:18:28,836 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 02:18:28,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1822525162, now seen corresponding path program 1 times [2022-12-13 02:18:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:28,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776736957] [2022-12-13 02:18:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:28,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:18:28,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:28,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776736957] [2022-12-13 02:18:28,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776736957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:28,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:28,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:28,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089382056] [2022-12-13 02:18:28,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:28,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:28,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:28,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:28,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:28,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:28,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:28,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:28,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:28,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:28,966 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:28,966 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:28,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:28,967 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:28,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:28,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:28,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:28,968 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:28,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:28,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:28,970 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,970 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:28,971 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:28,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:28,971 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:28,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:28,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:28,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:28,977 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:28,977 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:28,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:28,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:28,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:29,063 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:29,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:29,064 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:29,064 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 02:18:29,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:29,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:29,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable833 [2022-12-13 02:18:29,064 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 02:18:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1793896011, now seen corresponding path program 1 times [2022-12-13 02:18:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:29,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198950082] [2022-12-13 02:18:29,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:29,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:29,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:18:29,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:29,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198950082] [2022-12-13 02:18:29,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198950082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:29,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:29,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:29,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168151090] [2022-12-13 02:18:29,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:29,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:29,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:29,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:29,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:29,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:29,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:29,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:29,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:29,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:29,216 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:29,217 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:29,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:29,218 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:29,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:29,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:29,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:29,219 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:29,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:29,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:29,223 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:29,223 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:29,223 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:29,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:29,223 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:29,224 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:29,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:29,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:29,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:29,232 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:29,232 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:29,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:29,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:29,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:29,341 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:29,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:18:29,342 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:29,342 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 02:18:29,342 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:29,342 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:29,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable834 [2022-12-13 02:18:29,342 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 02:18:29,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:29,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1765266860, now seen corresponding path program 1 times [2022-12-13 02:18:29,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:29,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151792837] [2022-12-13 02:18:29,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:29,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:29,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:18:29,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:29,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151792837] [2022-12-13 02:18:29,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151792837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:29,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:29,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:29,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964674092] [2022-12-13 02:18:29,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:29,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:29,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:29,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:29,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:29,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:29,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:29,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:29,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:29,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:29,474 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:29,474 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:29,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:29,476 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:29,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:29,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:29,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:29,476 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:29,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:29,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:29,480 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:29,480 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:29,480 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:29,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:29,480 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:29,481 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:29,481 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:29,481 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:29,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:29,488 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:29,489 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:29,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:29,489 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:29,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:29,594 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:29,595 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:18:29,595 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:29,595 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 02:18:29,595 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:29,595 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:29,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable835 [2022-12-13 02:18:29,595 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 02:18:29,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1736637709, now seen corresponding path program 1 times [2022-12-13 02:18:29,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:29,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601637795] [2022-12-13 02:18:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:29,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:29,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:18:29,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:29,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601637795] [2022-12-13 02:18:29,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601637795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:29,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:29,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:29,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8759062] [2022-12-13 02:18:29,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:29,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:29,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:29,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:29,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:29,654 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:29,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:29,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:29,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:29,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:29,741 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:29,742 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:29,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:29,743 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:29,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:29,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:29,743 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:29,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:29,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:29,746 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:29,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:29,746 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:29,746 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:29,746 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:29,746 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:29,746 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:29,747 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:29,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:29,752 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:29,752 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:29,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:29,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:29,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:29,843 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:29,843 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:18:29,843 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:29,843 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 02:18:29,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:29,844 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:29,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable836 [2022-12-13 02:18:29,844 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 02:18:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1708008558, now seen corresponding path program 1 times [2022-12-13 02:18:29,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:29,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005628580] [2022-12-13 02:18:29,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:29,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:18:29,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:29,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005628580] [2022-12-13 02:18:29,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005628580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:29,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:29,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:29,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606508860] [2022-12-13 02:18:29,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:29,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:29,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:29,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:29,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:29,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:29,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:29,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:29,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:29,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:29,984 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:29,985 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:29,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:29,986 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:29,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:29,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:29,986 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:29,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:29,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:29,989 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:29,989 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:29,989 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:29,989 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:29,989 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:29,989 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:29,989 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:29,990 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:29,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:29,995 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:29,995 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:29,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:29,996 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:29,996 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:30,082 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:30,083 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:30,083 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:30,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:30,083 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:30,083 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:30,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable837 [2022-12-13 02:18:30,083 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 02:18:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1679379407, now seen corresponding path program 1 times [2022-12-13 02:18:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:30,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003344254] [2022-12-13 02:18:30,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:30,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:30,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:18:30,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:30,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003344254] [2022-12-13 02:18:30,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003344254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:30,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:30,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541655216] [2022-12-13 02:18:30,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:30,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:30,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:30,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:30,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:30,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:30,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:30,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:30,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:30,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:30,224 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:30,225 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:30,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:30,226 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:30,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:30,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:30,226 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:30,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:30,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:30,229 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:30,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:30,229 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:30,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:30,229 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:30,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:30,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:30,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:30,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:30,235 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:30,235 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:30,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:30,236 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:30,236 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:30,323 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:30,323 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:30,323 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:30,323 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 02:18:30,323 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:30,323 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:30,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable838 [2022-12-13 02:18:30,324 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 02:18:30,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1650750256, now seen corresponding path program 1 times [2022-12-13 02:18:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:30,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404288478] [2022-12-13 02:18:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:30,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:18:30,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:30,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404288478] [2022-12-13 02:18:30,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404288478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:30,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:30,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:30,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972025239] [2022-12-13 02:18:30,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:30,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:30,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:30,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:30,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:30,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:30,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:30,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:30,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:30,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:30,440 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:30,440 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:30,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:30,441 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:30,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:30,441 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:30,442 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:30,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:30,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:30,444 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:30,444 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:30,444 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:30,444 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:30,444 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:30,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:30,445 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:30,445 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:30,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:30,450 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:30,450 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:30,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:30,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:30,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:30,538 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:30,538 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:30,538 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:30,538 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 02:18:30,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:30,539 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:30,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable839 [2022-12-13 02:18:30,539 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 02:18:30,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:30,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1622121105, now seen corresponding path program 1 times [2022-12-13 02:18:30,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:30,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306077776] [2022-12-13 02:18:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:30,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:30,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:18:30,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:30,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306077776] [2022-12-13 02:18:30,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306077776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:30,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:30,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:30,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754104921] [2022-12-13 02:18:30,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:30,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:30,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:30,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:30,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:30,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:30,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:30,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:30,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:30,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:30,688 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:30,689 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:30,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:30,690 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:30,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:30,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:30,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:30,690 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:30,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:30,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:30,693 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:30,693 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:30,693 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:30,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:30,693 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:30,694 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:30,694 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:30,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:30,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:30,699 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:30,699 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:30,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:30,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:30,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:30,787 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:30,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:30,788 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:30,788 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 02:18:30,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:30,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:30,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable840 [2022-12-13 02:18:30,788 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 02:18:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:30,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1593491954, now seen corresponding path program 1 times [2022-12-13 02:18:30,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:30,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686399042] [2022-12-13 02:18:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:30,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:30,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:18:30,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:30,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686399042] [2022-12-13 02:18:30,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686399042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:30,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:30,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:30,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004435593] [2022-12-13 02:18:30,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:30,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:30,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:30,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:30,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:30,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:30,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:30,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:30,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:30,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:30,948 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:30,948 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:30,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:30,950 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:30,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:30,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:30,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:30,951 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:30,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:30,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:30,954 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:30,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:30,954 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:30,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:30,954 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:30,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:30,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:30,955 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:30,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:30,962 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:30,963 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:18:30,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:30,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:30,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:31,072 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:31,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:18:31,073 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:31,073 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 02:18:31,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:31,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:31,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable841 [2022-12-13 02:18:31,073 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 02:18:31,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:31,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1564862803, now seen corresponding path program 1 times [2022-12-13 02:18:31,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:31,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934832761] [2022-12-13 02:18:31,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:18:31,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:31,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934832761] [2022-12-13 02:18:31,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934832761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:31,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:31,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442897194] [2022-12-13 02:18:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:31,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:31,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:31,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:31,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:31,152 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:31,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:31,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:31,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:31,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:31,254 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:31,254 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:31,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:31,256 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:31,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:31,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:31,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:31,256 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:31,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:31,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:31,259 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:31,259 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:31,259 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:31,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:31,259 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:31,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:31,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:31,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:31,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:31,265 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:31,265 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:31,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:31,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:31,266 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:31,353 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:31,354 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:31,354 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:31,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:31,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:31,354 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:31,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable842 [2022-12-13 02:18:31,354 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 02:18:31,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1536233652, now seen corresponding path program 1 times [2022-12-13 02:18:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:31,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767746093] [2022-12-13 02:18:31,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:31,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18: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:18:31,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:31,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767746093] [2022-12-13 02:18:31,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767746093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:31,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:31,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:31,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938152317] [2022-12-13 02:18:31,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:31,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:31,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:31,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:31,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:31,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:31,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:31,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:31,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:31,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:31,468 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:31,468 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:31,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:31,469 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:31,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:31,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:31,469 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:31,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:31,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:31,472 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:31,472 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:31,473 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:31,473 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:31,473 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:31,473 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:31,473 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:31,473 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:31,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:31,482 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:31,482 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:18:31,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 442 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:31,483 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:31,483 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:31,585 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:31,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:18:31,586 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:31,586 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 02:18:31,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:31,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:31,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable843 [2022-12-13 02:18:31,586 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:18:31,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1507604501, now seen corresponding path program 1 times [2022-12-13 02:18:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:31,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852026646] [2022-12-13 02:18:31,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:31,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:31,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:18:31,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:31,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852026646] [2022-12-13 02:18:31,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852026646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:31,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:31,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:31,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360293283] [2022-12-13 02:18:31,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:31,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:31,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:31,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:31,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:31,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:31,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:31,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:31,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:31,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:31,784 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:31,784 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:31,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:31,785 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:31,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:31,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:31,786 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:31,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:31,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:31,790 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:31,790 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:31,790 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:31,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:31,790 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:31,790 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:31,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:31,791 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:31,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:31,798 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:31,798 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:31,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:31,799 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:31,799 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:31,898 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:31,898 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:18:31,898 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:31,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:31,898 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:31,898 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:31,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable844 [2022-12-13 02:18:31,898 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:18:31,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:31,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1478975350, now seen corresponding path program 1 times [2022-12-13 02:18:31,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:31,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047566212] [2022-12-13 02:18:31,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:31,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:18:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:31,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047566212] [2022-12-13 02:18:31,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047566212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:31,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:31,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:31,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291321900] [2022-12-13 02:18:31,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:31,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:31,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:31,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:31,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:31,944 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:31,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:31,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:31,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:31,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:32,015 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:32,016 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:32,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:32,017 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:32,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:32,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:32,017 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:32,017 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:32,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:32,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:32,020 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,020 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:32,020 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:32,020 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:32,020 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,020 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:32,020 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:32,020 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:32,026 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:32,026 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:32,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:32,027 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:32,027 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:32,111 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:32,111 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:18:32,111 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:32,111 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 02:18:32,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:32,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:32,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable845 [2022-12-13 02:18:32,112 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:18:32,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:32,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1450346199, now seen corresponding path program 1 times [2022-12-13 02:18:32,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:32,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177006163] [2022-12-13 02:18:32,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:32,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:32,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:18:32,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:32,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177006163] [2022-12-13 02:18:32,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177006163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:32,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:32,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798141144] [2022-12-13 02:18:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:32,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:32,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:32,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:32,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:32,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:32,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:32,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:32,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:32,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:32,220 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:32,221 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:32,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:32,222 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:32,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:32,222 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:32,222 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:32,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:32,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:32,225 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,225 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:32,225 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:32,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:32,225 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,225 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:32,225 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:32,225 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:32,231 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:32,231 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:32,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:32,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:32,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:32,316 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:32,316 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:18:32,316 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:32,316 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 02:18:32,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:32,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:32,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable846 [2022-12-13 02:18:32,317 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:18:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1421717048, now seen corresponding path program 1 times [2022-12-13 02:18:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:32,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314293851] [2022-12-13 02:18:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:32,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18: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:18:32,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:32,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314293851] [2022-12-13 02:18:32,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314293851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:32,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:32,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:32,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610484385] [2022-12-13 02:18:32,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:32,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:32,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:32,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:32,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:32,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:32,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:32,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:32,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:32,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:32,441 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:32,441 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:32,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:32,442 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:32,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:32,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:32,442 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:32,442 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:32,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:32,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:32,445 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,445 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:32,445 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:32,445 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:32,445 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:32,445 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:32,445 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:32,451 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:32,451 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:32,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:32,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:32,452 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:32,538 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:32,538 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:32,538 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:32,538 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 02:18:32,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:32,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:32,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable847 [2022-12-13 02:18:32,539 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:18:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:32,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1393087897, now seen corresponding path program 1 times [2022-12-13 02:18:32,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:32,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484991263] [2022-12-13 02:18:32,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:32,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:32,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:18:32,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:32,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484991263] [2022-12-13 02:18:32,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484991263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:32,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:32,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:32,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231929876] [2022-12-13 02:18:32,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:32,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:32,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:32,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:32,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:32,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:32,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:32,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:32,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:32,661 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:32,661 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:32,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:32,662 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:32,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:32,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:32,663 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:32,663 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:32,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:32,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:32,666 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,666 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:32,666 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:32,666 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:32,666 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,666 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:32,666 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:32,666 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:32,672 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:32,672 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:32,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:32,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:32,673 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:32,784 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:32,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:18:32,784 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:32,784 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 02:18:32,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:32,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:32,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable848 [2022-12-13 02:18:32,785 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:18:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:32,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1364458746, now seen corresponding path program 1 times [2022-12-13 02:18:32,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:32,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410519993] [2022-12-13 02:18:32,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:32,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:32,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:18:32,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:32,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410519993] [2022-12-13 02:18:32,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410519993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:32,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:32,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:32,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667846532] [2022-12-13 02:18:32,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:32,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:32,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:32,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:32,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:32,833 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:32,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:32,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:32,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:32,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:32,907 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:32,907 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:32,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:32,908 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:32,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:32,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:32,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:32,908 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:32,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:32,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:32,911 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,911 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:32,911 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:32,911 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:32,911 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:32,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:32,912 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:32,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:32,917 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:32,917 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:32,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:32,918 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:32,918 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:33,004 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:33,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:33,005 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:33,005 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 02:18:33,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:33,005 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:33,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable849 [2022-12-13 02:18:33,005 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:18:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:33,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1335829595, now seen corresponding path program 1 times [2022-12-13 02:18:33,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:33,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150771804] [2022-12-13 02:18:33,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:33,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:33,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:18:33,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:33,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150771804] [2022-12-13 02:18:33,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150771804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:33,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:33,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:33,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483062202] [2022-12-13 02:18:33,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:33,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:33,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:33,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:33,053 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:33,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:33,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:33,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:33,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:33,127 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:33,127 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:33,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:33,128 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:33,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:33,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:33,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:33,129 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:33,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:33,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:33,132 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:33,132 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:33,132 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:33,132 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:33,132 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:33,132 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:33,132 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:33,132 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:33,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:33,138 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:33,138 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:33,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:33,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:33,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:33,224 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:33,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:33,225 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:33,225 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 02:18:33,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:33,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:33,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable850 [2022-12-13 02:18:33,225 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:18:33,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:33,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1307200444, now seen corresponding path program 1 times [2022-12-13 02:18:33,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:33,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190199902] [2022-12-13 02:18:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:33,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:33,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:18:33,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:33,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190199902] [2022-12-13 02:18:33,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190199902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:33,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:33,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:33,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573969414] [2022-12-13 02:18:33,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:33,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:33,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:33,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:33,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:33,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:33,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:33,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:33,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:33,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:33,338 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:33,338 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:33,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:33,339 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:33,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:33,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:33,340 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:33,340 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:33,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:33,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:33,343 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:33,343 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:33,343 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:33,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:33,343 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:33,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:33,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:33,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:33,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:33,349 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:33,349 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:33,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:33,350 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:33,350 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:33,435 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:33,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:33,436 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:33,436 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 02:18:33,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:33,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:33,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable851 [2022-12-13 02:18:33,436 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:18:33,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1278571293, now seen corresponding path program 1 times [2022-12-13 02:18:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:33,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706473699] [2022-12-13 02:18:33,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:33,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:18:33,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:33,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706473699] [2022-12-13 02:18:33,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706473699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:33,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:33,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:33,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859431860] [2022-12-13 02:18:33,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:33,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:33,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:33,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:33,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:33,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:33,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:33,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:33,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:33,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:33,559 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:33,559 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:33,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:33,561 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:33,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:33,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:33,561 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:33,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:33,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:33,564 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:33,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:33,564 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:33,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:33,564 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:33,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:33,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:33,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:33,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:33,570 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:33,570 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:33,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:33,571 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:33,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:33,657 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:33,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:33,657 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:33,658 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 02:18:33,658 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:33,658 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:33,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable852 [2022-12-13 02:18:33,658 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:18:33,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:33,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1249942142, now seen corresponding path program 1 times [2022-12-13 02:18:33,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:33,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159628766] [2022-12-13 02:18:33,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:33,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:33,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:18:33,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:33,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159628766] [2022-12-13 02:18:33,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159628766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:33,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:33,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:33,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565610192] [2022-12-13 02:18:33,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:33,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:33,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:33,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:33,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:33,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:33,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:33,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:33,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:33,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:33,769 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:33,769 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:33,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:33,771 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:33,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:33,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:33,771 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:33,771 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:33,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:33,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:33,774 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:33,774 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:33,774 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:33,774 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:33,774 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:33,775 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:33,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:33,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:33,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:33,790 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:33,791 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:33,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:33,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:33,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:33,906 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:33,906 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:18:33,906 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:33,906 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 02:18:33,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:33,907 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:33,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable853 [2022-12-13 02:18:33,907 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:18:33,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:33,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1221312991, now seen corresponding path program 1 times [2022-12-13 02:18:33,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:33,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421535414] [2022-12-13 02:18:33,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:33,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:33,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:18:33,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:33,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421535414] [2022-12-13 02:18:33,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421535414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:33,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:33,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:33,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589995540] [2022-12-13 02:18:33,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:33,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:33,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:33,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:33,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:33,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:33,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:33,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:33,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:33,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:34,049 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:34,049 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:34,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:34,050 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:34,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:34,051 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:34,051 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:34,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:34,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:34,054 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,054 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:34,054 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:34,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:34,054 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:34,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:34,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:34,060 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:34,060 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:34,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:34,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:34,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:34,147 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:34,147 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:34,147 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:34,147 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 02:18:34,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:34,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:34,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable854 [2022-12-13 02:18:34,148 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:18:34,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:34,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1192683840, now seen corresponding path program 1 times [2022-12-13 02:18:34,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:34,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199696211] [2022-12-13 02:18:34,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:34,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:34,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 02:18:34,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:34,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199696211] [2022-12-13 02:18:34,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199696211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:34,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:34,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:34,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991240893] [2022-12-13 02:18:34,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:34,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:34,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:34,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:34,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:34,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:34,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:34,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:34,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:34,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:34,279 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:34,280 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:34,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:34,281 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:34,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:34,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:34,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:34,281 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:34,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:34,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:34,284 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,284 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:34,284 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:34,284 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:34,284 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:34,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:34,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:34,290 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:34,290 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:34,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:34,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:34,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:34,378 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:34,378 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:34,378 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:34,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:34,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:34,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:34,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable855 [2022-12-13 02:18:34,379 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:18:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:34,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1164054689, now seen corresponding path program 1 times [2022-12-13 02:18:34,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:34,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973998770] [2022-12-13 02:18:34,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:34,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:18:34,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:34,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973998770] [2022-12-13 02:18:34,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973998770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:34,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:34,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:34,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034651331] [2022-12-13 02:18:34,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:34,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:34,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:34,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:34,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:34,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:34,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:34,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:34,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:34,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:34,494 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:34,494 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:34,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:34,495 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:34,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:34,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:34,496 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:34,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:34,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:34,499 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:34,499 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:34,500 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:34,500 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:34,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:34,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:34,508 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:34,508 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:34,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:34,509 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:34,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:34,594 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:34,595 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:34,595 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:34,595 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 02:18:34,595 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:34,595 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:34,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable856 [2022-12-13 02:18:34,595 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:18:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1135425538, now seen corresponding path program 1 times [2022-12-13 02:18:34,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:34,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590433211] [2022-12-13 02:18:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:34,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:18:34,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:34,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590433211] [2022-12-13 02:18:34,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590433211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:34,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:34,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694127923] [2022-12-13 02:18:34,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:34,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:34,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:34,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:34,642 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:34,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:34,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:34,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:34,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:34,717 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:34,717 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:34,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:34,718 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:34,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:34,719 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:34,719 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:34,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:34,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:34,721 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,721 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:34,722 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:34,722 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:34,722 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,722 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:34,722 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:34,722 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:34,728 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:34,728 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:34,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:34,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:34,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:34,829 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:34,830 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:18:34,830 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:34,830 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 02:18:34,830 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:34,830 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:34,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable857 [2022-12-13 02:18:34,830 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:18:34,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:34,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1106796387, now seen corresponding path program 1 times [2022-12-13 02:18:34,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:34,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63786687] [2022-12-13 02:18:34,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:34,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:18:34,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:34,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63786687] [2022-12-13 02:18:34,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63786687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:34,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:34,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612468228] [2022-12-13 02:18:34,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:34,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:34,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:34,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:34,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:34,894 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:34,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:34,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:34,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:34,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:34,990 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:34,990 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:34,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:34,991 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:34,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:34,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:34,991 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:34,992 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:34,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:34,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:34,994 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,994 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:34,994 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:34,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:34,995 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:34,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:34,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:34,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:35,000 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:35,001 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:35,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:35,001 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:35,001 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:35,088 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:35,089 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:35,089 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:35,089 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 02:18:35,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:35,089 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:35,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable858 [2022-12-13 02:18:35,089 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:18:35,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:35,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1078167236, now seen corresponding path program 1 times [2022-12-13 02:18:35,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:35,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166226643] [2022-12-13 02:18:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:35,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:18:35,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:35,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166226643] [2022-12-13 02:18:35,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166226643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:35,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:35,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:35,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524899759] [2022-12-13 02:18:35,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:35,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:35,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:35,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:35,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:35,135 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:35,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:35,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:35,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:35,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:35,200 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:35,200 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:35,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:35,201 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:35,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:35,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:35,202 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:35,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:35,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:35,205 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:35,205 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:35,205 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:35,205 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:35,205 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:35,205 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:35,205 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:35,205 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:35,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:35,211 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:35,211 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:35,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:35,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:35,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:35,298 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:35,298 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:35,298 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:35,298 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 02:18:35,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:35,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:35,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable859 [2022-12-13 02:18:35,298 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:18:35,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:35,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1049538085, now seen corresponding path program 1 times [2022-12-13 02:18:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:35,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695587289] [2022-12-13 02:18:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:35,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:35,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:18:35,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:35,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695587289] [2022-12-13 02:18:35,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695587289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:35,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:35,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:35,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928248789] [2022-12-13 02:18:35,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:35,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:35,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:35,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:35,347 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:35,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:35,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:35,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:35,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:35,421 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:35,422 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:35,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:35,423 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:35,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:35,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:35,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:35,423 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:35,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:35,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:35,426 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:35,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:35,426 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:35,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:35,426 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:35,426 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:35,426 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:35,426 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:35,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:35,432 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:35,432 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:18:35,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:35,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:35,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:35,517 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:35,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:35,518 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:35,518 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 02:18:35,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:35,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:35,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable860 [2022-12-13 02:18:35,518 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:18:35,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:35,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1020908934, now seen corresponding path program 1 times [2022-12-13 02:18:35,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:35,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537093498] [2022-12-13 02:18:35,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:35,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:35,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:18:35,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:35,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537093498] [2022-12-13 02:18:35,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537093498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:35,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:35,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:35,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035019042] [2022-12-13 02:18:35,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:35,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:35,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:35,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:35,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:35,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:35,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:35,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:35,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:35,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:35,640 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:35,640 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:35,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:35,642 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:35,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:35,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:35,642 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:35,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:35,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:35,645 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:35,645 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:35,645 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:35,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:35,645 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:35,645 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:35,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:35,645 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:35,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:35,651 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:35,651 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:35,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:35,652 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:35,652 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:35,737 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:35,738 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:35,738 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:35,738 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 02:18:35,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:35,738 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:35,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable861 [2022-12-13 02:18:35,738 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:18:35,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:35,738 INFO L85 PathProgramCache]: Analyzing trace with hash -992279783, now seen corresponding path program 1 times [2022-12-13 02:18:35,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:35,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554012972] [2022-12-13 02:18:35,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:35,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:35,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:18:35,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:35,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554012972] [2022-12-13 02:18:35,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554012972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:35,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:35,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:35,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017002127] [2022-12-13 02:18:35,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:35,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:35,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:35,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:35,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:35,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:35,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:35,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:35,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:35,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:35,856 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:35,856 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:35,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:35,857 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:35,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:35,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:35,858 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:35,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:35,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:35,860 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:35,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:35,860 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:35,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:35,861 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:35,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:35,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:35,861 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:35,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:35,866 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:35,867 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:18:35,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:35,867 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:35,867 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:35,953 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:35,954 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:35,954 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:35,954 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 02:18:35,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:35,954 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:35,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable862 [2022-12-13 02:18:35,954 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:18:35,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:35,954 INFO L85 PathProgramCache]: Analyzing trace with hash -963650632, now seen corresponding path program 1 times [2022-12-13 02:18:35,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:35,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185864818] [2022-12-13 02:18:35,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:35,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:36,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:18:36,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:36,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185864818] [2022-12-13 02:18:36,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185864818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:36,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:36,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:36,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978504787] [2022-12-13 02:18:36,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:36,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:36,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:36,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:36,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:36,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:36,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:36,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:36,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:36,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:36,069 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:36,070 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:36,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:36,071 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:36,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:36,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:36,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:36,071 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:36,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:36,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:36,074 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:36,074 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:36,074 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:36,074 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:36,074 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:36,074 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:36,074 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:36,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:36,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:36,080 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:36,080 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:36,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:36,081 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:36,081 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:36,169 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:36,169 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:36,169 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:36,170 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 02:18:36,170 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:36,170 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:36,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable863 [2022-12-13 02:18:36,170 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:18:36,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:36,170 INFO L85 PathProgramCache]: Analyzing trace with hash -935021481, now seen corresponding path program 1 times [2022-12-13 02:18:36,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:36,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896594239] [2022-12-13 02:18:36,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:36,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:36,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:18:36,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:36,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896594239] [2022-12-13 02:18:36,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896594239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:36,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:36,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:36,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252991536] [2022-12-13 02:18:36,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:36,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:36,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:36,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:36,218 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:36,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:36,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:36,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:36,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:36,293 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:36,293 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:36,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:36,295 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:36,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:36,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:36,295 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:36,295 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:36,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:36,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:36,298 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:36,298 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:36,298 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:36,298 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:36,298 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:36,298 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:36,298 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:36,299 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:36,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:36,304 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:36,304 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:36,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:36,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:36,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:36,393 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:36,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:36,393 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:36,393 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 02:18:36,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:36,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:36,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable864 [2022-12-13 02:18:36,393 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:18:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:36,394 INFO L85 PathProgramCache]: Analyzing trace with hash -906392330, now seen corresponding path program 1 times [2022-12-13 02:18:36,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:36,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538842164] [2022-12-13 02:18:36,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:36,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:36,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:18:36,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:36,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538842164] [2022-12-13 02:18:36,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538842164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:36,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:36,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:36,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83989104] [2022-12-13 02:18:36,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:36,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:36,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:36,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:36,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:36,441 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:36,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:36,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:36,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:36,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:36,518 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:36,518 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:36,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:36,520 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:36,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:36,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:36,520 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:36,520 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:36,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:36,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:36,523 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:36,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:36,523 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:36,523 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:36,523 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:36,523 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:36,523 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:36,523 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:36,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:36,529 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:36,529 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:18:36,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:36,530 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:36,530 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:36,617 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:36,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:36,617 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:36,617 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 02:18:36,617 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:36,617 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:36,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable865 [2022-12-13 02:18:36,617 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:18:36,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:36,618 INFO L85 PathProgramCache]: Analyzing trace with hash -877763179, now seen corresponding path program 1 times [2022-12-13 02:18:36,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:36,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835632832] [2022-12-13 02:18:36,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:36,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:36,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:18:36,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:36,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835632832] [2022-12-13 02:18:36,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835632832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:36,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:36,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:36,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183441579] [2022-12-13 02:18:36,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:36,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:36,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:36,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:36,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:36,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:36,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:36,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:36,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:36,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:36,747 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:36,747 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:36,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1128 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:36,748 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:36,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:36,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:36,748 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:36,749 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:36,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:36,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:36,751 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:36,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:36,751 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:36,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:36,752 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:36,752 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:36,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:36,752 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:36,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:36,757 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:36,757 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:36,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:36,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:36,758 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:36,845 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:36,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:36,846 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:36,846 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 02:18:36,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:36,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:36,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable866 [2022-12-13 02:18:36,846 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:18:36,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:36,846 INFO L85 PathProgramCache]: Analyzing trace with hash -849134028, now seen corresponding path program 1 times [2022-12-13 02:18:36,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:36,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785371613] [2022-12-13 02:18:36,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:36,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:18:36,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:36,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785371613] [2022-12-13 02:18:36,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785371613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:36,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:36,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:36,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558123803] [2022-12-13 02:18:36,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:36,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:36,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:36,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:36,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:36,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:36,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:36,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:36,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:36,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:36,996 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:36,996 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:36,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:36,997 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:36,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:36,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:36,997 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:36,998 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:36,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:37,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:37,000 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:37,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:37,000 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:37,000 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:37,000 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:37,001 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:37,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:37,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:37,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:37,006 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:37,006 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:37,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:37,007 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:37,007 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:37,096 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:37,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:37,096 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:37,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:37,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:37,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:37,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable867 [2022-12-13 02:18:37,097 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:18:37,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:37,097 INFO L85 PathProgramCache]: Analyzing trace with hash -820504877, now seen corresponding path program 1 times [2022-12-13 02:18:37,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:37,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771384502] [2022-12-13 02:18:37,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:37,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:37,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:18:37,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:37,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771384502] [2022-12-13 02:18:37,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771384502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:37,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:37,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:37,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572353766] [2022-12-13 02:18:37,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:37,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:37,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:37,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:37,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:37,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:37,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:37,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:37,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:37,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:37,230 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:37,231 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:37,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:37,232 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:37,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:37,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:37,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:37,233 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:37,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:37,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:37,237 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:37,237 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:37,237 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:37,237 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:37,237 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:37,238 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:37,238 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:37,238 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:37,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:37,246 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:37,246 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:37,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:37,247 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:37,247 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:37,351 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:37,352 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:18:37,352 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:37,352 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 02:18:37,352 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:37,352 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:37,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable868 [2022-12-13 02:18:37,352 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:18:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash -791875726, now seen corresponding path program 1 times [2022-12-13 02:18:37,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:37,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176526223] [2022-12-13 02:18:37,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:37,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:18:37,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:37,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176526223] [2022-12-13 02:18:37,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176526223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:37,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:37,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:37,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206245152] [2022-12-13 02:18:37,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:37,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:37,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:37,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:37,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:37,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:37,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:37,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:37,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:37,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:37,507 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:37,507 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:37,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:37,508 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:37,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:37,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:37,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:37,509 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:37,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:37,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:37,511 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:37,511 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:37,512 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:37,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:37,512 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:37,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:37,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:37,512 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:37,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:37,517 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:37,518 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:37,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:37,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:37,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:37,606 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:37,607 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:37,607 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:37,607 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 02:18:37,607 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:37,607 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:37,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable869 [2022-12-13 02:18:37,607 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:18:37,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:37,607 INFO L85 PathProgramCache]: Analyzing trace with hash -763246575, now seen corresponding path program 1 times [2022-12-13 02:18:37,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:37,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583623348] [2022-12-13 02:18:37,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:37,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:37,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:18:37,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:37,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583623348] [2022-12-13 02:18:37,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583623348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:37,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:37,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:37,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118396366] [2022-12-13 02:18:37,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:37,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:37,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:37,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:37,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:37,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:37,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:37,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:37,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:37,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:37,768 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:37,768 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:37,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:37,769 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:37,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:37,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:37,769 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:37,770 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:37,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:37,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:37,772 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:37,772 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:37,773 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:37,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:37,773 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:37,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:37,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:37,773 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:37,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:37,779 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:37,779 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:37,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:37,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:37,780 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:37,867 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:37,868 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:37,868 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:37,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:37,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:37,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:37,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable870 [2022-12-13 02:18:37,868 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:18:37,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:37,868 INFO L85 PathProgramCache]: Analyzing trace with hash -734617424, now seen corresponding path program 1 times [2022-12-13 02:18:37,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:37,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109553565] [2022-12-13 02:18:37,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:37,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:37,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:18:37,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:37,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109553565] [2022-12-13 02:18:37,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109553565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:37,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:37,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:37,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749411439] [2022-12-13 02:18:37,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:37,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:37,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:37,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:37,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:37,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:37,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:37,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:37,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:37,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:38,012 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:38,012 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:38,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:38,013 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:38,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:38,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:38,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:38,014 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:38,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:38,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:38,016 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,017 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:38,017 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:38,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:38,017 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:38,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:38,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:38,023 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:38,023 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:38,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:38,023 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:38,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:38,110 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:38,111 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:38,111 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:38,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:38,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:38,111 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:38,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable871 [2022-12-13 02:18:38,111 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:18:38,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:38,112 INFO L85 PathProgramCache]: Analyzing trace with hash -705988273, now seen corresponding path program 1 times [2022-12-13 02:18:38,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:38,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926409233] [2022-12-13 02:18:38,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:38,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:38,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:18:38,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:38,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926409233] [2022-12-13 02:18:38,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926409233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:38,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:38,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520603662] [2022-12-13 02:18:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:38,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:38,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:38,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:38,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:38,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:38,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:38,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:38,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:38,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:38,255 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:38,255 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:38,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:38,256 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:38,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:38,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:38,257 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:38,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:38,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:38,259 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,260 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:38,260 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:38,260 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:38,260 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:38,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:38,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:38,266 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:38,266 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:38,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:38,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:38,266 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:38,353 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:38,354 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:38,354 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:38,354 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 02:18:38,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:38,354 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:38,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable872 [2022-12-13 02:18:38,354 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:18:38,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:38,354 INFO L85 PathProgramCache]: Analyzing trace with hash -677359122, now seen corresponding path program 1 times [2022-12-13 02:18:38,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:38,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002585928] [2022-12-13 02:18:38,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:38,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:38,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:18:38,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:38,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002585928] [2022-12-13 02:18:38,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002585928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:38,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:38,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:38,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31516563] [2022-12-13 02:18:38,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:38,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:38,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:38,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:38,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:38,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:38,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:38,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:38,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:38,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:38,494 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:38,495 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:38,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:38,496 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:38,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:38,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:38,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:38,496 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:38,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:38,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:38,499 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:38,499 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:38,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:38,499 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:38,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:38,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:38,505 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:38,505 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:38,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:38,506 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:38,506 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:38,592 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:38,592 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:38,592 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:38,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:38,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:38,593 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:38,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable873 [2022-12-13 02:18:38,593 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:18:38,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:38,593 INFO L85 PathProgramCache]: Analyzing trace with hash -648729971, now seen corresponding path program 1 times [2022-12-13 02:18:38,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:38,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985107923] [2022-12-13 02:18:38,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:38,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:38,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:18:38,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:38,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985107923] [2022-12-13 02:18:38,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985107923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:38,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:38,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589206429] [2022-12-13 02:18:38,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:38,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:38,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:38,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:38,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:38,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:38,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:38,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:38,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:38,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:38,713 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:38,713 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:38,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:38,714 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:38,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:38,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:38,714 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:38,715 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:38,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:38,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:38,717 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,717 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:38,717 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:38,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:38,717 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:38,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:38,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:38,723 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:38,723 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:38,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:38,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:38,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:38,810 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:38,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:38,811 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:38,811 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 02:18:38,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:38,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:38,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable874 [2022-12-13 02:18:38,811 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:18:38,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:38,811 INFO L85 PathProgramCache]: Analyzing trace with hash -620100820, now seen corresponding path program 1 times [2022-12-13 02:18:38,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:38,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820301507] [2022-12-13 02:18:38,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:38,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:38,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:18:38,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:38,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820301507] [2022-12-13 02:18:38,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820301507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:38,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:38,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130491342] [2022-12-13 02:18:38,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:38,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:38,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:38,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:38,860 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:38,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:38,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:38,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:38,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:38,927 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:38,927 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:38,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:38,928 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:38,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:38,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:38,928 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:38,928 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:38,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:38,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:38,931 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:38,931 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:38,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:38,931 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:38,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:38,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:38,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:38,937 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:38,937 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:38,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:38,938 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:38,938 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:39,025 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:39,025 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:39,025 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:39,026 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 02:18:39,026 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:39,026 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:39,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable875 [2022-12-13 02:18:39,026 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:18:39,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:39,026 INFO L85 PathProgramCache]: Analyzing trace with hash -591471669, now seen corresponding path program 1 times [2022-12-13 02:18:39,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:39,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421577233] [2022-12-13 02:18:39,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:39,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:39,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:18:39,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:39,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421577233] [2022-12-13 02:18:39,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421577233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:39,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:39,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:39,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937504251] [2022-12-13 02:18:39,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:39,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:39,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:39,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:39,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:39,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:39,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:39,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:39,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:39,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:39,139 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:39,139 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:39,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:39,140 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:39,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:39,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:39,141 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:39,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:39,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:39,143 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:39,143 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:39,143 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:39,143 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:39,143 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:39,144 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:39,144 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:39,144 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:39,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:39,149 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:39,149 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:39,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:39,150 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:39,150 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:39,237 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:39,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:39,237 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:39,237 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 02:18:39,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:39,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:39,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable876 [2022-12-13 02:18:39,238 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:18:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash -562842518, now seen corresponding path program 1 times [2022-12-13 02:18:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:39,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002546707] [2022-12-13 02:18:39,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:39,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:39,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:18:39,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:39,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002546707] [2022-12-13 02:18:39,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002546707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:39,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:39,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:39,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904000682] [2022-12-13 02:18:39,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:39,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:39,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:39,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:39,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:39,285 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:39,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:39,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:39,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:39,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:39,352 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:39,352 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:39,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:39,353 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:39,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:39,354 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:39,354 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:39,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:39,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:39,357 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:39,357 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:39,357 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:39,357 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:39,357 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:39,357 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:39,357 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:39,357 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:39,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:39,363 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:39,363 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:39,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:39,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:39,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:39,451 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:39,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:39,451 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:39,451 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 02:18:39,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:39,451 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:39,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable877 [2022-12-13 02:18:39,451 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:18:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash -534213367, now seen corresponding path program 1 times [2022-12-13 02:18:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:39,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590482386] [2022-12-13 02:18:39,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:39,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:39,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:18:39,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:39,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590482386] [2022-12-13 02:18:39,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590482386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:39,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:39,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:39,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032931186] [2022-12-13 02:18:39,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:39,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:39,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:39,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:39,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:39,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:39,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:39,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:39,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:39,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:39,584 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:39,584 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:39,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:39,585 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:39,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:39,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:39,586 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:39,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:39,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:39,588 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:39,588 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:39,589 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:39,589 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:39,589 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:39,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:39,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:39,589 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:39,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:39,594 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:39,594 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:18:39,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:39,595 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:39,595 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:39,683 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:39,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:39,684 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:39,684 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 02:18:39,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:39,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:39,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable878 [2022-12-13 02:18:39,684 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:18:39,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:39,684 INFO L85 PathProgramCache]: Analyzing trace with hash -505584216, now seen corresponding path program 1 times [2022-12-13 02:18:39,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:39,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136583461] [2022-12-13 02:18:39,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:39,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:39,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:18:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:39,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136583461] [2022-12-13 02:18:39,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136583461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:39,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:39,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:39,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507591465] [2022-12-13 02:18:39,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:39,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:39,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:39,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:39,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:39,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:39,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:39,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:39,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:39,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:39,810 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:39,810 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:39,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:39,811 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:39,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:39,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:39,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:39,812 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:39,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:39,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:39,814 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:39,814 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:39,814 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:39,814 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:39,814 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:39,815 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:39,815 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:39,815 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:39,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:39,823 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:39,823 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:39,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:39,824 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:39,824 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:39,921 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:39,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:18:39,922 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:39,922 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 02:18:39,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:39,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:39,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable879 [2022-12-13 02:18:39,922 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:18:39,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:39,922 INFO L85 PathProgramCache]: Analyzing trace with hash -476955065, now seen corresponding path program 1 times [2022-12-13 02:18:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:39,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595771624] [2022-12-13 02:18:39,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:39,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:18:39,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:39,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595771624] [2022-12-13 02:18:39,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595771624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:39,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:39,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:39,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935182489] [2022-12-13 02:18:39,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:39,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:39,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:39,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:39,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:39,972 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:39,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:39,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:39,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:39,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:40,040 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:40,040 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:40,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:40,041 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:40,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:40,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:40,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:40,042 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:40,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:40,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:40,044 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:40,044 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:40,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:40,044 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:40,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:40,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:40,050 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:40,050 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:40,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:40,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:40,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:40,139 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:40,139 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:40,139 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:40,139 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 02:18:40,139 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:40,139 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:40,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable880 [2022-12-13 02:18:40,140 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:18:40,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:40,140 INFO L85 PathProgramCache]: Analyzing trace with hash -448325914, now seen corresponding path program 1 times [2022-12-13 02:18:40,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:40,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165791372] [2022-12-13 02:18:40,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:40,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:40,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:18:40,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:40,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165791372] [2022-12-13 02:18:40,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165791372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:40,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:40,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:40,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797313218] [2022-12-13 02:18:40,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:40,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:40,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:40,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:40,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:40,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:40,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:40,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:40,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:40,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:40,266 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:40,267 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:40,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:40,268 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:40,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:40,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:40,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:40,268 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:40,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:40,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:40,271 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:40,271 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:40,271 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:40,271 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,271 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:40,271 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:40,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:40,277 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:40,277 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:40,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:40,278 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:40,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:40,365 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:40,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:40,365 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:40,365 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 02:18:40,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:40,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:40,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable881 [2022-12-13 02:18:40,366 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:18:40,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:40,366 INFO L85 PathProgramCache]: Analyzing trace with hash -419696763, now seen corresponding path program 1 times [2022-12-13 02:18:40,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:40,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053029198] [2022-12-13 02:18:40,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:40,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:40,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 02:18:40,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:40,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053029198] [2022-12-13 02:18:40,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053029198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:40,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:40,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:40,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490641773] [2022-12-13 02:18:40,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:40,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:40,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:40,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:40,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:40,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:40,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:40,494 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:40,494 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:40,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:40,496 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:40,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:40,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:40,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:40,496 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:40,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:40,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:40,499 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:40,499 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:40,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:40,499 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:40,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:40,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:40,505 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:40,505 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:40,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:40,505 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:40,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:40,593 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:40,593 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:40,593 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:40,593 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 02:18:40,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:40,593 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:40,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable882 [2022-12-13 02:18:40,593 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:18:40,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:40,594 INFO L85 PathProgramCache]: Analyzing trace with hash -391067612, now seen corresponding path program 1 times [2022-12-13 02:18:40,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:40,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852890095] [2022-12-13 02:18:40,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:40,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:40,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:18:40,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:40,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852890095] [2022-12-13 02:18:40,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852890095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:40,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:40,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:40,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306819501] [2022-12-13 02:18:40,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:40,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:40,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:40,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:40,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:40,642 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:40,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:40,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:40,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:40,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:40,718 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:40,718 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:40,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:40,719 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:40,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:40,720 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:40,720 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:40,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:40,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:40,722 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:40,722 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:40,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:40,723 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:40,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:40,723 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:40,728 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:40,728 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:40,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:40,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:40,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:40,816 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:40,816 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:40,816 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:40,817 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 02:18:40,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:40,817 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:40,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable883 [2022-12-13 02:18:40,817 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:18:40,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:40,817 INFO L85 PathProgramCache]: Analyzing trace with hash -362438461, now seen corresponding path program 1 times [2022-12-13 02:18:40,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:40,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932356544] [2022-12-13 02:18:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:40,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:40,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:18:40,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:40,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932356544] [2022-12-13 02:18:40,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932356544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:40,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:40,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:40,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823675790] [2022-12-13 02:18:40,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:40,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:40,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:40,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:40,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:40,865 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:40,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:40,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:40,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:40,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:40,942 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:40,942 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:40,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:40,943 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:40,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:40,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:40,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:40,944 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:40,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:40,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:40,946 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:40,947 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:40,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:40,947 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:40,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:40,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:40,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:40,953 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:40,953 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:40,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:40,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:40,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:41,044 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:41,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:18:41,045 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:41,045 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 02:18:41,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:41,045 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:41,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable884 [2022-12-13 02:18:41,045 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:18:41,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:41,045 INFO L85 PathProgramCache]: Analyzing trace with hash -333809310, now seen corresponding path program 1 times [2022-12-13 02:18:41,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:41,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736638558] [2022-12-13 02:18:41,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:41,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:41,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:18:41,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:41,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736638558] [2022-12-13 02:18:41,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736638558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:41,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:41,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:41,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958934403] [2022-12-13 02:18:41,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:41,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:41,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:41,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:41,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:41,092 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:41,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:41,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:41,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:41,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:41,158 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:41,158 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:41,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:41,159 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:41,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:41,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:41,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:41,160 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:41,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:41,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:41,162 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:41,162 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:41,163 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:41,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:41,163 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:41,163 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:41,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:41,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:41,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:41,169 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:41,169 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:41,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:41,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:41,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:41,257 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:41,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:41,257 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:41,257 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 02:18:41,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:41,257 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:41,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable885 [2022-12-13 02:18:41,257 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:18:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash -305180159, now seen corresponding path program 1 times [2022-12-13 02:18:41,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:41,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508073970] [2022-12-13 02:18:41,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:41,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:41,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:18:41,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:41,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508073970] [2022-12-13 02:18:41,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508073970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:41,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:41,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:41,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144610877] [2022-12-13 02:18:41,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:41,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:41,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:41,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:41,307 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:41,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:41,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:41,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:41,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:41,380 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:41,381 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:41,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:41,382 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:41,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:41,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:41,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:41,382 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:41,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:41,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:41,385 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:41,385 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:41,385 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:41,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:41,385 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:41,385 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:41,386 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:41,386 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:41,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:41,391 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:41,391 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:41,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:41,392 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:41,392 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:41,480 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:41,481 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:41,481 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:41,481 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 02:18:41,481 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:41,481 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:41,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable886 [2022-12-13 02:18:41,481 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:18:41,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:41,481 INFO L85 PathProgramCache]: Analyzing trace with hash -276551008, now seen corresponding path program 1 times [2022-12-13 02:18:41,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:41,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521704454] [2022-12-13 02:18:41,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:41,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:41,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:18:41,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:41,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521704454] [2022-12-13 02:18:41,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521704454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:41,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:41,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:41,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903002948] [2022-12-13 02:18:41,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:41,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:41,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:41,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:41,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:41,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:41,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:41,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:41,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:41,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:41,595 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:41,595 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:41,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:41,596 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:41,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:41,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:41,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:41,597 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:41,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:41,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:41,599 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:41,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:41,600 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:41,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:41,600 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:41,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:41,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:41,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:41,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:41,605 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:41,606 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:41,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:41,606 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:41,606 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:41,692 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:41,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:41,692 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:41,692 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 02:18:41,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:41,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:41,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable887 [2022-12-13 02:18:41,692 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:18:41,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:41,693 INFO L85 PathProgramCache]: Analyzing trace with hash -247921857, now seen corresponding path program 1 times [2022-12-13 02:18:41,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:41,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239721416] [2022-12-13 02:18:41,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:41,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:41,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 02:18:41,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:41,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239721416] [2022-12-13 02:18:41,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239721416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:41,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:41,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:41,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542405822] [2022-12-13 02:18:41,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:41,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:41,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:41,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:41,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:41,741 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:41,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:41,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:41,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:41,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:41,814 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:41,814 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:41,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:41,816 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:41,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:41,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:41,816 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:41,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:41,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:41,820 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:41,820 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:41,820 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:41,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:41,820 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:41,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:41,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:41,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:41,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:41,828 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:41,828 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:18:41,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:41,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:41,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:41,915 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:41,916 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:41,916 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:41,916 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 02:18:41,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:41,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:41,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable888 [2022-12-13 02:18:41,916 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:18:41,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:41,916 INFO L85 PathProgramCache]: Analyzing trace with hash -219292706, now seen corresponding path program 1 times [2022-12-13 02:18:41,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:41,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998954258] [2022-12-13 02:18:41,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:41,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:41,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:18:41,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:41,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998954258] [2022-12-13 02:18:41,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998954258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:41,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:41,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:41,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952813703] [2022-12-13 02:18:41,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:41,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:41,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:41,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:41,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:41,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:41,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:41,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:41,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:41,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:42,032 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:42,032 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:42,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:42,033 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:42,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:42,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:42,034 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:42,034 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:42,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:42,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:42,036 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,036 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:42,036 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:42,036 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:42,036 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,037 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:42,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:42,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:42,042 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:42,042 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:42,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:42,043 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:42,043 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:42,130 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:42,130 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:42,130 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:42,131 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 02:18:42,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:42,131 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:42,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable889 [2022-12-13 02:18:42,131 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:18:42,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:42,131 INFO L85 PathProgramCache]: Analyzing trace with hash -190663555, now seen corresponding path program 1 times [2022-12-13 02:18:42,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:42,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625021996] [2022-12-13 02:18:42,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:42,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:42,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:18:42,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:42,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625021996] [2022-12-13 02:18:42,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625021996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:42,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:42,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:42,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78469847] [2022-12-13 02:18:42,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:42,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:42,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:42,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:42,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:42,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:42,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:42,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:42,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:42,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:42,263 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:42,263 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:42,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:42,264 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:42,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:42,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:42,265 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:42,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:42,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:42,267 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,267 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:42,267 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:42,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:42,267 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,268 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:42,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:42,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:42,273 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:42,273 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:18:42,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:42,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:42,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:42,360 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:42,361 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:42,361 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:42,361 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 02:18:42,361 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:42,361 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:42,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable890 [2022-12-13 02:18:42,361 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:18:42,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:42,361 INFO L85 PathProgramCache]: Analyzing trace with hash -162034404, now seen corresponding path program 1 times [2022-12-13 02:18:42,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:42,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527167690] [2022-12-13 02:18:42,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:42,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:18:42,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:42,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527167690] [2022-12-13 02:18:42,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527167690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:42,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:42,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:42,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057922244] [2022-12-13 02:18:42,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:42,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:42,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:42,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:42,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:42,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:42,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:42,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:42,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:42,475 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:42,475 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:18:42,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:42,476 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:42,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:42,477 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:42,477 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:42,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:42,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:42,480 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,480 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:42,480 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:42,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:42,480 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,480 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:42,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:42,480 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:42,486 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:42,486 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:42,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:42,486 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:42,486 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:42,573 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:42,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:42,574 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:42,574 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 02:18:42,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:42,574 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:42,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable891 [2022-12-13 02:18:42,574 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:18:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash -133405253, now seen corresponding path program 1 times [2022-12-13 02:18:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:42,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348948437] [2022-12-13 02:18:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:42,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:42,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:18:42,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:42,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348948437] [2022-12-13 02:18:42,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348948437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:42,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:42,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:42,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488558422] [2022-12-13 02:18:42,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:42,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:42,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:42,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:42,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:42,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:42,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:42,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:42,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:42,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:42,698 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:42,698 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:42,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:42,700 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:42,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:42,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:42,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:42,700 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:42,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:42,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:42,703 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:42,703 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:42,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:42,703 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,704 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:42,704 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:42,704 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:42,710 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:42,710 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:42,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:42,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:42,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:42,798 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:42,798 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:42,798 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:42,799 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 02:18:42,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:42,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:42,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable892 [2022-12-13 02:18:42,799 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:18:42,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash -104776102, now seen corresponding path program 1 times [2022-12-13 02:18:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:42,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142416208] [2022-12-13 02:18:42,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:42,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:18:42,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:42,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142416208] [2022-12-13 02:18:42,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142416208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:42,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:42,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:42,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046203908] [2022-12-13 02:18:42,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:42,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:42,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:42,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:42,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:42,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:42,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:42,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:42,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:42,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:42,923 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:42,923 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:42,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:42,924 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:42,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:42,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:42,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:42,925 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:42,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:42,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:42,927 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,928 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:42,928 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:42,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:42,928 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,928 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:42,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:42,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:42,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:42,934 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:42,934 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:42,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:42,934 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:42,934 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:43,023 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:43,023 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:43,023 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:43,023 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 02:18:43,023 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:43,023 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:43,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable893 [2022-12-13 02:18:43,023 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:18:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash -76146951, now seen corresponding path program 1 times [2022-12-13 02:18:43,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:43,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160543923] [2022-12-13 02:18:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:43,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:43,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:18:43,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:43,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160543923] [2022-12-13 02:18:43,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160543923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:43,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:43,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:43,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564182375] [2022-12-13 02:18:43,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:43,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:43,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:43,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:43,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:43,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:43,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:43,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:43,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:43,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:43,180 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:43,180 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:43,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:43,181 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:43,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:43,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:43,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:43,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:43,182 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:43,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:43,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:43,185 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:43,185 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:43,185 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:43,185 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:43,185 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:43,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:43,185 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:43,185 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:43,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:43,191 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:43,191 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:43,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:43,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:43,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:43,283 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:43,284 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:18:43,284 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:43,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:43,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:43,284 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:43,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable894 [2022-12-13 02:18:43,284 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:18:43,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:43,287 INFO L85 PathProgramCache]: Analyzing trace with hash -47517800, now seen corresponding path program 1 times [2022-12-13 02:18:43,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:43,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648625651] [2022-12-13 02:18:43,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:43,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:43,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:18:43,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:43,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648625651] [2022-12-13 02:18:43,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648625651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:43,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:43,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:43,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077633250] [2022-12-13 02:18:43,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:43,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:43,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:43,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:43,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:43,341 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:43,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:43,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:43,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:43,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:43,423 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:43,423 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:43,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:43,424 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:43,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:43,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:43,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:43,425 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:43,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:43,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:43,428 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:43,428 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:43,428 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:43,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:43,428 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:43,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:43,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:43,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:43,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:43,434 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:43,434 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:43,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:43,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:43,435 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:43,522 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:43,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:43,522 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:43,522 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 02:18:43,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:43,523 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:43,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable895 [2022-12-13 02:18:43,523 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:18:43,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:43,523 INFO L85 PathProgramCache]: Analyzing trace with hash -18888649, now seen corresponding path program 1 times [2022-12-13 02:18:43,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:43,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495310550] [2022-12-13 02:18:43,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:43,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:43,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:18:43,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:43,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495310550] [2022-12-13 02:18:43,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495310550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:43,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:43,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:43,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957624250] [2022-12-13 02:18:43,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:43,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:43,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:43,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:43,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:43,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:43,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:43,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:43,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:43,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:43,650 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:43,650 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:43,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:43,652 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:43,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:43,652 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:43,652 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:43,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:43,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:43,655 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:43,655 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:43,655 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:43,655 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:43,655 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:43,656 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:43,656 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:43,656 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:43,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:43,663 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:43,663 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:43,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:43,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:43,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:43,751 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:43,751 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:43,752 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:43,752 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 02:18:43,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:43,752 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:43,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable896 [2022-12-13 02:18:43,752 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:18:43,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash 9740502, now seen corresponding path program 1 times [2022-12-13 02:18:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:43,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687918633] [2022-12-13 02:18:43,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:43,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:18:43,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:43,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687918633] [2022-12-13 02:18:43,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687918633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:43,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:43,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252107393] [2022-12-13 02:18:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:43,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:43,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:43,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:43,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:43,799 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:43,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:43,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:43,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:43,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:43,867 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:43,867 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:43,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:43,868 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:43,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:43,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:43,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:43,869 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:43,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:43,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:43,871 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:43,872 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:43,872 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:43,872 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:43,872 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:43,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:43,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:43,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:43,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:43,878 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:43,878 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:43,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:43,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:43,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:43,966 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:43,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:43,967 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:43,967 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 02:18:43,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:43,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:43,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable897 [2022-12-13 02:18:43,967 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:18:43,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:43,967 INFO L85 PathProgramCache]: Analyzing trace with hash 38369653, now seen corresponding path program 1 times [2022-12-13 02:18:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:43,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791790673] [2022-12-13 02:18:43,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:43,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:44,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:18:44,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:44,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791790673] [2022-12-13 02:18:44,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791790673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:44,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:44,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733260103] [2022-12-13 02:18:44,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:44,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:44,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:44,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:44,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:44,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:44,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:44,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:44,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:44,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:44,094 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:44,094 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:44,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:44,095 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:44,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:44,096 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:44,096 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:44,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:44,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:44,098 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,098 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:44,098 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:44,098 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:44,098 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,099 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:44,099 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:44,099 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:44,111 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:44,111 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:44,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:44,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:44,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:44,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:44,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:18:44,200 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:44,200 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 02:18:44,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:44,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:44,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable898 [2022-12-13 02:18:44,200 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:18:44,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:44,200 INFO L85 PathProgramCache]: Analyzing trace with hash 66998804, now seen corresponding path program 1 times [2022-12-13 02:18:44,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:44,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230401501] [2022-12-13 02:18:44,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:44,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:44,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:18:44,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:44,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230401501] [2022-12-13 02:18:44,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230401501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:44,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:44,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:44,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735334960] [2022-12-13 02:18:44,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:44,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:44,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:44,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:44,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:44,249 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:44,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:44,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:44,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:44,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:44,325 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:44,325 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:44,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:44,327 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:44,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:44,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:44,327 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:44,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:44,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:44,330 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,330 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:44,330 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:44,330 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:44,330 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:44,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:44,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:44,336 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:44,336 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:18:44,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:44,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:44,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:44,425 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:44,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:44,425 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:44,425 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 02:18:44,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:44,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:44,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable899 [2022-12-13 02:18:44,425 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:18:44,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash 95627955, now seen corresponding path program 1 times [2022-12-13 02:18:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:44,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339730329] [2022-12-13 02:18:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:44,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:18:44,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:44,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339730329] [2022-12-13 02:18:44,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339730329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:44,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:44,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:44,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058742903] [2022-12-13 02:18:44,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:44,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:44,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:44,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:44,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:44,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:44,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:44,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:44,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:44,539 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:44,539 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:44,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:44,540 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:44,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:44,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:44,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:44,541 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:44,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:44,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:44,543 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,544 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:44,544 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:44,544 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:44,544 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:44,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:44,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:44,550 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:44,550 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:44,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:44,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:44,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:44,639 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:44,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:44,639 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:44,639 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 02:18:44,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:44,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:44,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable900 [2022-12-13 02:18:44,640 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:18:44,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:44,640 INFO L85 PathProgramCache]: Analyzing trace with hash 124257106, now seen corresponding path program 1 times [2022-12-13 02:18:44,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:44,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028154419] [2022-12-13 02:18:44,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:44,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:44,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:18:44,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:44,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028154419] [2022-12-13 02:18:44,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028154419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:44,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:44,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:44,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928521372] [2022-12-13 02:18:44,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:44,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:44,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:44,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:44,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:44,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:44,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:44,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:44,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:44,754 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:44,754 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:44,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1129 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:44,755 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:44,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:44,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:44,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:44,756 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:44,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:44,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:44,758 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:44,759 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:44,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:44,759 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,759 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:44,759 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:44,759 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:44,765 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:44,765 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:44,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:44,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:44,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:44,855 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:44,855 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:44,855 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:44,855 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 02:18:44,855 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:44,856 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:44,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable901 [2022-12-13 02:18:44,856 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:18:44,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash 152886257, now seen corresponding path program 1 times [2022-12-13 02:18:44,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:44,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564437950] [2022-12-13 02:18:44,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:44,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:44,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:18:44,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:44,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564437950] [2022-12-13 02:18:44,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564437950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:44,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:44,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477033419] [2022-12-13 02:18:44,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:44,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:44,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:44,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:44,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:44,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:44,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:44,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:44,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:44,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:44,972 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:44,972 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:44,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:44,973 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:44,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:44,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:44,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:44,974 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:44,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:44,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:44,976 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,976 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:44,976 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:44,976 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:44,976 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:44,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:44,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:44,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:44,982 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:44,982 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:44,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:44,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:44,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:45,078 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:45,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:18:45,078 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:45,078 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 02:18:45,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:45,078 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:45,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable902 [2022-12-13 02:18:45,078 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:18:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:45,078 INFO L85 PathProgramCache]: Analyzing trace with hash 181515408, now seen corresponding path program 1 times [2022-12-13 02:18:45,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:45,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136039307] [2022-12-13 02:18:45,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:45,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:45,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:18:45,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:45,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136039307] [2022-12-13 02:18:45,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136039307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:45,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:45,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:45,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464069327] [2022-12-13 02:18:45,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:45,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:45,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:45,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:45,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:45,135 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:45,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:45,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:45,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:45,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:45,204 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:45,205 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:45,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:45,206 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:45,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:45,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:45,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:45,206 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:45,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:45,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:45,209 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:45,209 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:45,209 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:45,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:45,209 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:45,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:45,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:45,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:45,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:45,215 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:45,215 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:45,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:45,215 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:45,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:45,303 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:45,304 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:45,304 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:45,304 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 02:18:45,304 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:45,304 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:45,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable903 [2022-12-13 02:18:45,304 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:18:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:45,304 INFO L85 PathProgramCache]: Analyzing trace with hash 210144559, now seen corresponding path program 1 times [2022-12-13 02:18:45,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:45,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883911129] [2022-12-13 02:18:45,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:45,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:45,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:18:45,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:45,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883911129] [2022-12-13 02:18:45,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883911129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:45,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:45,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:45,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765282681] [2022-12-13 02:18:45,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:45,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:45,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:45,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:45,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:45,351 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:45,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:45,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:45,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:45,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:45,427 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:45,427 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:45,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:45,428 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:45,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:45,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:45,428 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:45,428 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:45,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:45,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:45,431 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:45,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:45,431 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:45,431 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:45,431 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:45,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:45,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:45,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:45,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:45,437 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:45,437 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:18:45,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:45,438 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:45,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:45,525 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:45,525 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:45,525 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:45,525 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 02:18:45,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:45,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:45,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable904 [2022-12-13 02:18:45,526 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:18:45,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:45,526 INFO L85 PathProgramCache]: Analyzing trace with hash 238773710, now seen corresponding path program 1 times [2022-12-13 02:18:45,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:45,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388699308] [2022-12-13 02:18:45,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:45,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:45,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:18:45,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:45,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388699308] [2022-12-13 02:18:45,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388699308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:45,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:45,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403118128] [2022-12-13 02:18:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:45,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:45,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:45,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:45,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:45,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:45,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:45,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:45,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:45,649 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:45,649 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:45,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:45,650 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:45,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:45,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:45,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:45,651 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:45,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:45,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:45,653 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:45,653 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:45,653 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:45,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:45,653 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:45,654 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:45,654 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:45,654 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:45,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:45,659 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:45,659 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:45,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:45,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:45,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:45,747 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:45,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:45,747 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:45,748 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 02:18:45,748 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:45,748 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:45,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable905 [2022-12-13 02:18:45,748 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:18:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:45,748 INFO L85 PathProgramCache]: Analyzing trace with hash 267402861, now seen corresponding path program 1 times [2022-12-13 02:18:45,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:45,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495173774] [2022-12-13 02:18:45,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:45,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:45,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:18:45,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:45,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495173774] [2022-12-13 02:18:45,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495173774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:45,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:45,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694240466] [2022-12-13 02:18:45,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:45,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:45,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:45,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:45,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:45,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:45,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:45,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:45,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:45,861 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:45,861 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:45,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:45,862 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:45,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:45,863 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:45,863 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:45,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:45,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:45,866 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:45,866 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:45,866 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:45,866 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:45,866 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:45,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:45,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:45,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:45,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:45,872 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:45,872 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:45,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:45,872 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:45,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:45,959 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:45,960 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:45,960 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:45,960 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 02:18:45,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:45,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:45,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable906 [2022-12-13 02:18:45,960 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:18:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash 296032012, now seen corresponding path program 1 times [2022-12-13 02:18:45,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:45,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803567283] [2022-12-13 02:18:45,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:45,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:46,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:18:46,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:46,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803567283] [2022-12-13 02:18:46,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803567283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:46,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:46,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:46,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864611635] [2022-12-13 02:18:46,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:46,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:46,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:46,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:46,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:46,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:46,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:46,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:46,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:46,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:46,110 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:46,110 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:46,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:46,111 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:46,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:46,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:46,112 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:46,112 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:46,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:46,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:46,115 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,115 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:46,115 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:46,115 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:46,115 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,115 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:46,115 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:46,115 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:46,121 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:46,121 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:46,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:46,122 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:46,122 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:46,209 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:46,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:46,210 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:46,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:46,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:46,210 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:46,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable907 [2022-12-13 02:18:46,210 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:18:46,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:46,210 INFO L85 PathProgramCache]: Analyzing trace with hash 324661163, now seen corresponding path program 1 times [2022-12-13 02:18:46,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:46,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083033579] [2022-12-13 02:18:46,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:46,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:46,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 02:18:46,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:46,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083033579] [2022-12-13 02:18:46,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083033579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:46,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:46,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379331334] [2022-12-13 02:18:46,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:46,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:46,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:46,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:46,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:46,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:46,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:46,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:46,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:46,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:46,325 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:46,325 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:46,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:46,326 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:46,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:46,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:46,327 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:46,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:46,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:46,329 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,330 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:46,330 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:46,330 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:46,330 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:46,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:46,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:46,336 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:46,336 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:46,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:46,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:46,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:46,423 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:46,423 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:46,423 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:46,423 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 02:18:46,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:46,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:46,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable908 [2022-12-13 02:18:46,424 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:18:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash 353290314, now seen corresponding path program 1 times [2022-12-13 02:18:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:46,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705567457] [2022-12-13 02:18:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:46,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:18:46,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:46,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705567457] [2022-12-13 02:18:46,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705567457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:46,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:46,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:46,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643215546] [2022-12-13 02:18:46,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:46,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:46,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:46,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:46,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:46,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:46,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:46,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:46,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:46,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:46,538 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:46,538 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:46,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:46,540 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:46,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:46,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:46,540 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:46,540 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:46,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:46,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:46,543 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,543 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:46,543 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:46,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:46,543 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:46,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:46,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:46,549 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:46,549 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:46,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:46,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:46,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:46,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:46,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:46,638 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:46,638 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 02:18:46,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:46,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:46,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable909 [2022-12-13 02:18:46,639 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:18:46,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash 381919465, now seen corresponding path program 1 times [2022-12-13 02:18:46,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:46,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139337476] [2022-12-13 02:18:46,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:46,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:46,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:18:46,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:46,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139337476] [2022-12-13 02:18:46,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139337476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:46,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:46,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:46,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236495327] [2022-12-13 02:18:46,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:46,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:46,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:46,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:46,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:46,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:46,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:46,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:46,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:46,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:46,754 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:46,754 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:46,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:46,756 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:46,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:46,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:46,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:46,756 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:46,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:46,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:46,759 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:46,759 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:46,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:46,759 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,759 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:46,759 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:46,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:46,765 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:46,765 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:46,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:46,766 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:46,766 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:46,853 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:46,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:46,854 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:46,854 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 02:18:46,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:46,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:46,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable910 [2022-12-13 02:18:46,854 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:18:46,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:46,854 INFO L85 PathProgramCache]: Analyzing trace with hash 410548616, now seen corresponding path program 1 times [2022-12-13 02:18:46,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:46,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399683630] [2022-12-13 02:18:46,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:46,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:46,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:18:46,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:46,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399683630] [2022-12-13 02:18:46,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399683630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:46,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:46,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:46,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644972846] [2022-12-13 02:18:46,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:46,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:46,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:46,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:46,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:46,913 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:46,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:46,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:46,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:46,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:46,980 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:46,981 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:46,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:46,982 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:46,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:46,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:46,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:46,982 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:46,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:46,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:46,985 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,985 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:46,985 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:46,985 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:46,985 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:46,986 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:46,986 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:46,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:46,991 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:46,991 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:46,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:46,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:46,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:47,080 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:47,081 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:47,081 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:47,081 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 02:18:47,081 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:47,081 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:47,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable911 [2022-12-13 02:18:47,081 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:18:47,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:47,081 INFO L85 PathProgramCache]: Analyzing trace with hash 439177767, now seen corresponding path program 1 times [2022-12-13 02:18:47,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:47,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134740178] [2022-12-13 02:18:47,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:47,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:47,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:18:47,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:47,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134740178] [2022-12-13 02:18:47,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134740178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:47,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:47,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:47,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066268456] [2022-12-13 02:18:47,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:47,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:47,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:47,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:47,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:47,137 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:47,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:47,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:47,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:47,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:47,204 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:47,204 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:47,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:47,206 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:47,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:47,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:47,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:47,206 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:47,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:47,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:47,209 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:47,209 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:47,209 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:47,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:47,209 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:47,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:47,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:47,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:47,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:47,215 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:47,215 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:47,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:47,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:47,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:47,307 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:47,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:18:47,308 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:47,308 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 02:18:47,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:47,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:47,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable912 [2022-12-13 02:18:47,308 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:18:47,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash 467806918, now seen corresponding path program 1 times [2022-12-13 02:18:47,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:47,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797559474] [2022-12-13 02:18:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:47,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:47,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:18:47,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:47,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797559474] [2022-12-13 02:18:47,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797559474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:47,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:47,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:47,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139444984] [2022-12-13 02:18:47,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:47,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:47,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:47,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:47,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:47,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:47,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:47,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:47,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:47,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:47,433 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:47,434 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:47,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:47,435 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:47,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:47,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:47,435 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:47,435 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:47,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:47,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:47,438 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:47,438 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:47,438 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:47,438 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:47,438 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:47,438 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:47,438 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:47,439 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:47,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:47,444 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:47,444 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:47,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:47,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:47,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:47,532 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:47,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:47,533 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:47,533 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 02:18:47,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:47,533 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:47,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable913 [2022-12-13 02:18:47,533 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:18:47,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:47,533 INFO L85 PathProgramCache]: Analyzing trace with hash 496436069, now seen corresponding path program 1 times [2022-12-13 02:18:47,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:47,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595978536] [2022-12-13 02:18:47,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:47,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:47,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:18:47,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:47,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595978536] [2022-12-13 02:18:47,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595978536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:47,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:47,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:47,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502934710] [2022-12-13 02:18:47,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:47,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:47,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:47,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:47,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:47,581 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:47,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:47,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:47,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:47,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:47,655 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:47,656 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:47,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:47,657 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:47,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:47,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:47,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:47,657 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:47,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:47,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:47,660 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:47,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:47,660 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:47,660 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:47,660 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:47,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:47,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:47,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:47,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:47,666 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:47,666 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:47,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:47,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:47,667 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:47,753 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:47,753 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:47,753 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:47,753 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 02:18:47,753 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:47,753 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:47,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable914 [2022-12-13 02:18:47,753 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:18:47,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:47,754 INFO L85 PathProgramCache]: Analyzing trace with hash 525065220, now seen corresponding path program 1 times [2022-12-13 02:18:47,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:47,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639166812] [2022-12-13 02:18:47,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:47,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:47,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:18:47,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:47,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639166812] [2022-12-13 02:18:47,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639166812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:47,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:47,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:47,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679075646] [2022-12-13 02:18:47,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:47,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:47,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:47,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:47,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:47,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:47,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:47,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:47,886 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:47,886 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:47,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:47,887 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:47,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:47,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:47,888 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:47,888 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:47,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:47,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:47,891 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:47,891 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:47,891 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:47,891 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:47,891 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:47,891 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:47,891 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:47,891 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:47,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:47,897 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:47,897 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:47,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:47,897 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:47,897 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:47,984 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:47,984 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:47,984 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:47,985 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 02:18:47,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:47,985 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:47,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable915 [2022-12-13 02:18:47,985 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:18:47,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:47,985 INFO L85 PathProgramCache]: Analyzing trace with hash 553694371, now seen corresponding path program 1 times [2022-12-13 02:18:47,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:47,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882113531] [2022-12-13 02:18:47,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:47,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:48,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:18:48,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:48,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882113531] [2022-12-13 02:18:48,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882113531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:48,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:48,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:48,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516772283] [2022-12-13 02:18:48,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:48,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:48,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:48,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:48,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:48,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:48,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:48,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:48,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:48,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:48,115 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:48,115 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:48,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:48,116 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:48,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:48,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:48,117 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:48,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:48,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:48,119 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:48,119 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:48,120 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:48,120 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:48,120 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:48,120 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:48,120 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:48,120 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:48,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:48,126 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:48,126 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:48,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:48,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:48,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:48,214 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:48,214 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:48,214 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:48,214 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 02:18:48,214 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:48,215 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:48,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable916 [2022-12-13 02:18:48,215 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:18:48,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash 582323522, now seen corresponding path program 1 times [2022-12-13 02:18:48,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:48,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585368051] [2022-12-13 02:18:48,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:48,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:48,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:18:48,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:48,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585368051] [2022-12-13 02:18:48,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585368051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:48,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:48,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:48,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492294521] [2022-12-13 02:18:48,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:48,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:48,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:48,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:48,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:48,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:48,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:48,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:48,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:48,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:48,326 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:48,326 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:48,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:48,327 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:48,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:48,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:48,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:48,328 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:48,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:48,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:48,331 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:48,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:48,331 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:48,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:48,331 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:48,331 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:48,331 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:48,331 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:48,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:48,337 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:48,337 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:48,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:48,337 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:48,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:48,427 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:48,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:48,427 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:48,427 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 02:18:48,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:48,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:48,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable917 [2022-12-13 02:18:48,427 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:18:48,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash 610952673, now seen corresponding path program 1 times [2022-12-13 02:18:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:48,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373934315] [2022-12-13 02:18:48,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:48,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:48,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:18:48,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:48,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373934315] [2022-12-13 02:18:48,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373934315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:48,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:48,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916753958] [2022-12-13 02:18:48,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:48,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:48,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:48,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:48,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:48,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:48,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:48,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:48,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:48,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:48,551 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:48,551 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:48,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:48,552 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:48,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:48,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:48,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:48,553 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:48,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:48,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:48,555 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:48,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:48,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:48,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:48,555 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:48,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:48,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:48,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:48,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:48,561 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:48,561 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:48,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:48,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:48,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:48,648 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:48,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:48,649 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:48,649 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 02:18:48,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:48,649 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:48,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable918 [2022-12-13 02:18:48,649 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:18:48,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:48,649 INFO L85 PathProgramCache]: Analyzing trace with hash 639581824, now seen corresponding path program 1 times [2022-12-13 02:18:48,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:48,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340519881] [2022-12-13 02:18:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:48,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:48,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:18:48,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:48,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340519881] [2022-12-13 02:18:48,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340519881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:48,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:48,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:48,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800008636] [2022-12-13 02:18:48,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:48,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:48,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:48,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:48,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:48,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:48,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:48,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:48,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:48,821 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:48,821 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:48,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:48,822 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:48,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:48,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:48,823 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:48,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:48,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:48,827 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:48,827 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:48,827 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:48,827 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:48,827 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:48,828 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:48,828 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:48,828 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:48,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:48,835 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:48,836 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:48,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:48,836 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:48,837 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:48,932 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:48,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:18:48,932 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:48,933 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 02:18:48,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:48,933 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:48,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable919 [2022-12-13 02:18:48,933 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:18:48,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash 668210975, now seen corresponding path program 1 times [2022-12-13 02:18:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:48,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057880] [2022-12-13 02:18:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:48,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:48,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:18:48,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:48,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057880] [2022-12-13 02:18:48,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:48,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:48,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:48,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324682456] [2022-12-13 02:18:48,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:48,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:48,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:48,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:48,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:48,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:48,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:48,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:48,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:48,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:49,044 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:49,045 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:18:49,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:49,046 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:49,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:49,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:49,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:49,046 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:49,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:49,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:49,048 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,049 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:49,049 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:49,049 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:49,049 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:49,049 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:49,049 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:49,055 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:49,055 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:49,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:49,055 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:49,055 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:49,141 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:49,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:49,142 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:49,142 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 02:18:49,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:49,142 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:49,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable920 [2022-12-13 02:18:49,142 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:18:49,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:49,142 INFO L85 PathProgramCache]: Analyzing trace with hash 696840126, now seen corresponding path program 1 times [2022-12-13 02:18:49,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:49,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721978974] [2022-12-13 02:18:49,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:49,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:18:49,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:49,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721978974] [2022-12-13 02:18:49,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721978974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:49,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:49,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703771942] [2022-12-13 02:18:49,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:49,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:49,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:49,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:49,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:49,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:49,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:49,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:49,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:49,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:49,257 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:49,257 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:49,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1107 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:49,258 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:49,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:49,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:49,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:49,258 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:49,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:49,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:49,261 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,261 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:49,261 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:49,261 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:49,261 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,261 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:49,261 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:49,261 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:49,267 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:49,267 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:18:49,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:49,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:49,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:49,353 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:49,353 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:49,353 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:49,353 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 02:18:49,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:49,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:49,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable921 [2022-12-13 02:18:49,353 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:18:49,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:49,354 INFO L85 PathProgramCache]: Analyzing trace with hash 725469277, now seen corresponding path program 1 times [2022-12-13 02:18:49,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:49,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666083959] [2022-12-13 02:18:49,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:49,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:49,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:18:49,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:49,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666083959] [2022-12-13 02:18:49,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666083959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:49,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:49,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:49,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635296007] [2022-12-13 02:18:49,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:49,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:49,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:49,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:49,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:49,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:49,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:49,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:49,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:49,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:49,493 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:49,494 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:49,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:49,495 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:49,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:49,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:49,495 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:49,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:49,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:49,498 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:49,498 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:49,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:49,498 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,498 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:49,498 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:49,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:49,504 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:49,504 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:49,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:49,505 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:49,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:49,590 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:49,591 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:49,591 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:49,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:49,591 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:49,591 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:49,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable922 [2022-12-13 02:18:49,591 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:18:49,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash 754098428, now seen corresponding path program 1 times [2022-12-13 02:18:49,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:49,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432874653] [2022-12-13 02:18:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:49,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:49,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:18:49,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:49,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432874653] [2022-12-13 02:18:49,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432874653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:49,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:49,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:49,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756754575] [2022-12-13 02:18:49,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:49,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:49,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:49,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:49,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:49,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:49,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:49,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:49,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:49,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:49,746 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:49,746 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:49,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:49,747 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:49,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:49,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:49,748 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:49,748 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:49,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:49,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:49,750 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:49,750 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:49,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:49,750 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,751 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:49,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:49,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:49,756 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:49,756 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:49,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:49,757 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:49,757 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:49,842 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:49,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:49,843 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:49,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:49,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:49,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:49,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable923 [2022-12-13 02:18:49,843 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:18:49,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:49,843 INFO L85 PathProgramCache]: Analyzing trace with hash 782727579, now seen corresponding path program 1 times [2022-12-13 02:18:49,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:49,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608846161] [2022-12-13 02:18:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:49,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:49,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:18:49,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:49,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608846161] [2022-12-13 02:18:49,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608846161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:49,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:49,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:49,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487886805] [2022-12-13 02:18:49,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:49,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:49,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:49,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:49,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:49,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:49,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:49,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:49,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:49,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:49,966 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:49,966 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:49,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:49,968 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:49,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:49,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:49,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:49,968 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:49,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:49,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:49,971 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:49,971 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:49,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:49,971 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:49,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:49,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:49,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:49,977 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:49,977 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:49,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:49,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:49,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:50,063 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:50,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:50,064 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:50,064 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 02:18:50,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:50,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:50,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable924 [2022-12-13 02:18:50,064 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:18:50,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:50,064 INFO L85 PathProgramCache]: Analyzing trace with hash 811356730, now seen corresponding path program 1 times [2022-12-13 02:18:50,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:50,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310859995] [2022-12-13 02:18:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:50,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:18:50,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:50,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310859995] [2022-12-13 02:18:50,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310859995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:50,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:50,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:50,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544707523] [2022-12-13 02:18:50,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:50,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:50,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:50,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:50,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:50,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:50,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:50,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:50,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:50,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:50,176 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:50,176 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:50,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:50,177 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:50,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:50,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:50,178 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:50,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:50,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:50,180 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:50,180 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:50,181 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:50,181 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:50,181 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:50,181 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:50,181 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:50,181 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:50,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:50,187 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:50,187 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:50,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:50,187 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:50,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:50,274 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:50,274 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:50,274 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:50,274 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 02:18:50,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:50,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:50,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable925 [2022-12-13 02:18:50,274 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:18:50,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:50,275 INFO L85 PathProgramCache]: Analyzing trace with hash 839985881, now seen corresponding path program 1 times [2022-12-13 02:18:50,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:50,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812107091] [2022-12-13 02:18:50,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:50,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:50,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:18:50,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:50,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812107091] [2022-12-13 02:18:50,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812107091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:50,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:50,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76115793] [2022-12-13 02:18:50,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:50,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:50,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:50,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:50,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:50,338 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:50,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:50,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:50,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:50,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:50,416 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:50,417 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:50,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:50,418 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:50,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:50,418 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:50,418 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:50,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:50,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:50,421 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:50,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:50,421 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:50,421 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:50,421 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:50,422 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:50,422 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:50,422 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:50,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:50,427 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:50,427 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:50,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:50,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:50,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:50,515 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:50,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:50,515 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:50,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:50,516 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:50,516 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:50,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable926 [2022-12-13 02:18:50,516 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:18:50,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:50,516 INFO L85 PathProgramCache]: Analyzing trace with hash 868615032, now seen corresponding path program 1 times [2022-12-13 02:18:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:50,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034176509] [2022-12-13 02:18:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:50,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:18:50,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:50,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034176509] [2022-12-13 02:18:50,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034176509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:50,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:50,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:50,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589567358] [2022-12-13 02:18:50,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:50,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:50,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:50,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:50,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:50,570 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:50,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:50,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:50,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:50,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:50,634 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:50,634 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:50,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:50,635 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:50,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:50,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:50,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:50,636 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:50,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:50,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:50,638 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:50,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:50,638 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:50,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:50,639 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:50,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:50,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:50,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:50,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:50,644 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:50,644 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:50,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:50,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:50,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:50,732 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:50,733 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:50,733 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:50,733 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 02:18:50,733 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:50,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:50,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable927 [2022-12-13 02:18:50,733 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:18:50,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:50,733 INFO L85 PathProgramCache]: Analyzing trace with hash 897244183, now seen corresponding path program 1 times [2022-12-13 02:18:50,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:50,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146540275] [2022-12-13 02:18:50,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:50,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18: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:18:50,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:50,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146540275] [2022-12-13 02:18:50,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146540275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:50,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:50,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:50,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810778815] [2022-12-13 02:18:50,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:50,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:50,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:50,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:50,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:50,781 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:50,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:50,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:50,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:50,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:50,857 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:50,857 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:50,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:50,858 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:50,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:50,859 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:50,859 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:50,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:50,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:50,861 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:50,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:50,862 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:50,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:50,862 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:50,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:50,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:50,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:50,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:50,867 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:50,868 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:50,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:50,868 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:50,868 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:50,960 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:50,960 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:18:50,960 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:50,960 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 02:18:50,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:50,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:50,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable928 [2022-12-13 02:18:50,961 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:18:50,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:50,961 INFO L85 PathProgramCache]: Analyzing trace with hash 925873334, now seen corresponding path program 1 times [2022-12-13 02:18:50,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:50,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313659063] [2022-12-13 02:18:50,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:50,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:51,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:18:51,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:51,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313659063] [2022-12-13 02:18:51,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313659063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:51,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:51,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:51,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305867209] [2022-12-13 02:18:51,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:51,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:51,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:51,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:51,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:51,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:51,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:51,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:51,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:51,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:51,097 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:51,097 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:51,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:51,098 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:51,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:51,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:51,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:51,099 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:51,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:51,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:51,101 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:51,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:51,101 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:51,101 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:51,101 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:51,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:51,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:51,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:51,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:51,107 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:51,107 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:51,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:51,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:51,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:51,196 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:51,196 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:51,196 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:51,196 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 02:18:51,196 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:51,196 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:51,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable929 [2022-12-13 02:18:51,197 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:18:51,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:51,197 INFO L85 PathProgramCache]: Analyzing trace with hash 954502485, now seen corresponding path program 1 times [2022-12-13 02:18:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:51,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201827651] [2022-12-13 02:18:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:51,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:51,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 02:18:51,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:51,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201827651] [2022-12-13 02:18:51,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201827651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:51,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:51,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:51,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985521373] [2022-12-13 02:18:51,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:51,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:51,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:51,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:51,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:51,243 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:51,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:51,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:51,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:51,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:51,307 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:51,308 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:51,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:51,309 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:51,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:51,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:51,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:51,309 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:51,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:51,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:51,312 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:51,312 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:51,312 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:51,312 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:51,312 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:51,312 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:51,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:51,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:51,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:51,318 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:51,318 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:51,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:51,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:51,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:51,431 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:51,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:18:51,431 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:51,431 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 02:18:51,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:51,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:51,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable930 [2022-12-13 02:18:51,432 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:18:51,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:51,432 INFO L85 PathProgramCache]: Analyzing trace with hash 983131636, now seen corresponding path program 1 times [2022-12-13 02:18:51,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:51,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079958802] [2022-12-13 02:18:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:51,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:51,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:18:51,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:51,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079958802] [2022-12-13 02:18:51,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079958802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:51,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:51,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:51,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318804221] [2022-12-13 02:18:51,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:51,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:51,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:51,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:51,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:51,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:51,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:51,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:51,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:51,552 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:51,553 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:51,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:51,554 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:51,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:51,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:51,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:51,554 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:51,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:51,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:51,557 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:51,557 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:51,557 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:51,557 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:51,557 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:51,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:51,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:51,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:51,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:51,563 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:51,563 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:51,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:51,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:51,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:51,654 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:51,654 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:18:51,654 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:51,654 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 02:18:51,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:51,654 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:51,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable931 [2022-12-13 02:18:51,655 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:18:51,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1011760787, now seen corresponding path program 1 times [2022-12-13 02:18:51,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:51,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093445379] [2022-12-13 02:18:51,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:51,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:51,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:18:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:51,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093445379] [2022-12-13 02:18:51,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093445379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:51,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:51,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802885956] [2022-12-13 02:18:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:51,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:51,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:51,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:51,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:51,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:51,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:51,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:51,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:51,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:51,779 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:51,779 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:51,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:51,780 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:51,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:51,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:51,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:51,781 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:51,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:51,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:51,783 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:51,783 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:51,783 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:51,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:51,784 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:51,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:51,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:51,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:51,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:51,789 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:51,790 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:51,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:51,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:51,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:51,903 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:51,903 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:18:51,903 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:51,903 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 02:18:51,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:51,904 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:51,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable932 [2022-12-13 02:18:51,904 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:18:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1040389938, now seen corresponding path program 1 times [2022-12-13 02:18:51,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:51,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911319055] [2022-12-13 02:18:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:51,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:51,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:18:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:51,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911319055] [2022-12-13 02:18:51,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911319055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:51,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:51,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:51,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420974267] [2022-12-13 02:18:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:51,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:51,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:51,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:51,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:51,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:51,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:51,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:51,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:52,018 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:52,018 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:52,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:52,019 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:52,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:52,020 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:52,020 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:52,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:52,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:52,023 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,023 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:52,023 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:52,023 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:52,023 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,023 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:52,023 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:52,024 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:52,029 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:52,029 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:52,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:52,030 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:52,030 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:52,117 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:52,118 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:52,118 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:52,118 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 02:18:52,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:52,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:52,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable933 [2022-12-13 02:18:52,118 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:18:52,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:52,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1069019089, now seen corresponding path program 1 times [2022-12-13 02:18:52,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:52,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98709502] [2022-12-13 02:18:52,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:52,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:52,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:18:52,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:52,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98709502] [2022-12-13 02:18:52,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98709502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:52,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:52,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:52,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868317546] [2022-12-13 02:18:52,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:52,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:52,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:52,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:52,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:52,165 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:52,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:52,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:52,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:52,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:52,233 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:52,234 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:52,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:52,235 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:52,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:52,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:52,235 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:52,235 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:52,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:52,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:52,238 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,238 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:52,238 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:52,238 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:52,238 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,238 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:52,238 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:52,238 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:52,244 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:52,244 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:52,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:52,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:52,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:52,333 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:52,333 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:52,333 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:52,333 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 02:18:52,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:52,333 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:52,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable934 [2022-12-13 02:18:52,333 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:18:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:52,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1097648240, now seen corresponding path program 1 times [2022-12-13 02:18:52,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:52,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15506294] [2022-12-13 02:18:52,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:52,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:52,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:18:52,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:52,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15506294] [2022-12-13 02:18:52,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15506294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:52,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:52,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:52,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183898387] [2022-12-13 02:18:52,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:52,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:52,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:52,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:52,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:52,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:52,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:52,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:52,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:52,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:52,449 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:52,449 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:52,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:52,458 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:52,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:52,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:52,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:52,459 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:52,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:52,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:52,461 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,461 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:52,461 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:52,461 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:52,461 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,461 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:52,461 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:52,462 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:52,467 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:52,467 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:52,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:52,468 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:52,468 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:52,556 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:52,556 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:52,556 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:52,557 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 02:18:52,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:52,557 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:52,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable935 [2022-12-13 02:18:52,557 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:18:52,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:52,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1126277391, now seen corresponding path program 1 times [2022-12-13 02:18:52,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:52,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452909599] [2022-12-13 02:18:52,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:52,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:52,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:18:52,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:52,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452909599] [2022-12-13 02:18:52,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452909599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:52,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:52,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:52,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359194505] [2022-12-13 02:18:52,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:52,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:52,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:52,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:52,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:52,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:52,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:52,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:52,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:52,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:52,699 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:52,699 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:52,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:52,700 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:52,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:52,701 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:52,701 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:52,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:52,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:52,703 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:52,703 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:52,704 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:52,704 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,704 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:52,704 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:52,704 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:52,709 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:52,710 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:52,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:52,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:52,710 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:52,797 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:52,798 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:52,798 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:52,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:52,798 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:52,798 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:52,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable936 [2022-12-13 02:18:52,798 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:18:52,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:52,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1154906542, now seen corresponding path program 1 times [2022-12-13 02:18:52,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:52,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483273236] [2022-12-13 02:18:52,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:52,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:52,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:18:52,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:52,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483273236] [2022-12-13 02:18:52,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483273236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:52,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:52,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:52,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028975072] [2022-12-13 02:18:52,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:52,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:52,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:52,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:52,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:52,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:52,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:52,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:52,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:52,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:52,914 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:52,915 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:52,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:52,916 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:52,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:52,916 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:52,916 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:52,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:52,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:52,919 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:52,919 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:52,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:52,919 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,920 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:52,920 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:52,920 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:52,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:52,925 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:52,925 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:52,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:52,926 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:52,926 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:53,014 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:53,015 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:53,015 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:53,015 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 02:18:53,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:53,015 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:53,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable937 [2022-12-13 02:18:53,015 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:18:53,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:53,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1183535693, now seen corresponding path program 1 times [2022-12-13 02:18:53,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:53,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105500158] [2022-12-13 02:18:53,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:53,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:53,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:18:53,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:53,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105500158] [2022-12-13 02:18:53,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105500158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:53,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:53,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20335019] [2022-12-13 02:18:53,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:53,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:53,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:53,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:53,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:53,064 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:53,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:53,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:53,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:53,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:53,140 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:53,140 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:53,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:53,141 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:53,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:53,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:53,142 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:53,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:53,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:53,144 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:53,144 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:53,144 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:53,144 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:53,144 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:53,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:53,145 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:53,145 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:53,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:53,150 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:53,150 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:53,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:53,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:53,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:53,239 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:53,239 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:53,239 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:53,239 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 02:18:53,239 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:53,239 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:53,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable938 [2022-12-13 02:18:53,239 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:18:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1212164844, now seen corresponding path program 1 times [2022-12-13 02:18:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:53,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045798482] [2022-12-13 02:18:53,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:53,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:53,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:18:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:53,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045798482] [2022-12-13 02:18:53,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045798482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:53,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:53,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114390334] [2022-12-13 02:18:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:53,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:53,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:53,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:53,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:53,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:53,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:53,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:53,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:53,356 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:53,356 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:53,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:53,365 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:53,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:53,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:53,366 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:53,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:53,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:53,368 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:53,368 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:53,369 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:53,369 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:53,369 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:53,369 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:53,369 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:53,369 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:53,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:53,375 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:53,375 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:53,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:53,375 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:53,375 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:53,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:53,464 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:53,464 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:53,464 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 02:18:53,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:53,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:53,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable939 [2022-12-13 02:18:53,465 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:18:53,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1240793995, now seen corresponding path program 1 times [2022-12-13 02:18:53,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:53,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978295677] [2022-12-13 02:18:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:53,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:18:53,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:53,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978295677] [2022-12-13 02:18:53,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978295677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:53,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:53,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:53,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454674197] [2022-12-13 02:18:53,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:53,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:53,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:53,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:53,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:53,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:53,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:53,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:53,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:53,577 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:53,578 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:53,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:53,579 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:53,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:53,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:53,579 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:53,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:53,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:53,583 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:53,583 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:53,583 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:53,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:53,584 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:53,584 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:53,584 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:53,584 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:53,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:53,592 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:53,592 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:53,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:53,593 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:53,593 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:53,701 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:53,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:18:53,702 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:53,702 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 02:18:53,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:53,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:53,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable940 [2022-12-13 02:18:53,702 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:18:53,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1269423146, now seen corresponding path program 1 times [2022-12-13 02:18:53,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:53,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265753204] [2022-12-13 02:18:53,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:53,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:53,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:18:53,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:53,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265753204] [2022-12-13 02:18:53,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265753204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:53,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:53,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:53,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425014222] [2022-12-13 02:18:53,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:53,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:53,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:53,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:53,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:53,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:53,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:53,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:53,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:53,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:53,817 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:53,817 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:53,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:53,818 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:53,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:53,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:53,818 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:53,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:53,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:53,821 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:53,821 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:53,821 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:53,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:53,821 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:53,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:53,822 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:53,822 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:53,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:53,827 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:53,827 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:53,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:53,828 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:53,828 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:53,917 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:53,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:53,917 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:53,917 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 02:18:53,918 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:53,918 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:53,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable941 [2022-12-13 02:18:53,918 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:18:53,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:53,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1298052297, now seen corresponding path program 1 times [2022-12-13 02:18:53,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:53,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848063280] [2022-12-13 02:18:53,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:53,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:53,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:18:53,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:53,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848063280] [2022-12-13 02:18:53,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848063280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:53,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:53,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:53,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703370416] [2022-12-13 02:18:53,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:53,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:53,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:53,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:53,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:53,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:53,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:53,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:53,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:53,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:54,057 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:54,057 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:54,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:54,058 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:54,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:54,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:54,058 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:54,059 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:54,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:54,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:54,061 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,061 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:54,061 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:54,061 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:54,061 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,061 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:54,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:54,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:54,067 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:54,067 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:54,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:54,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:54,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:54,154 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:54,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:54,155 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:54,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:54,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:54,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:54,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable942 [2022-12-13 02:18:54,155 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:18:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:54,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1326681448, now seen corresponding path program 1 times [2022-12-13 02:18:54,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:54,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972946489] [2022-12-13 02:18:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:54,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:54,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:18:54,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:54,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972946489] [2022-12-13 02:18:54,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972946489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:54,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:54,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:54,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409744724] [2022-12-13 02:18:54,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:54,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:54,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:54,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:54,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:54,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:54,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:54,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:54,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:54,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:54,267 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:54,267 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:54,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:54,268 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:54,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:54,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:54,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:54,269 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:54,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:54,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:54,272 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:54,272 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:54,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:54,272 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:54,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:54,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:54,284 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:54,284 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:54,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:54,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:54,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:54,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:54,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:18:54,372 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:54,372 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 02:18:54,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:54,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:54,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable943 [2022-12-13 02:18:54,372 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:18:54,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:54,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1355310599, now seen corresponding path program 1 times [2022-12-13 02:18:54,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:54,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28221220] [2022-12-13 02:18:54,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:54,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:54,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 02:18:54,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:54,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28221220] [2022-12-13 02:18:54,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28221220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:54,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:54,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:54,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384393605] [2022-12-13 02:18:54,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:54,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:54,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:54,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:54,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:54,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:54,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:54,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:54,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:54,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:54,485 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:54,485 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:54,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:54,486 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:54,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:54,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:54,487 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:54,487 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:54,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:54,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:54,489 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,489 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:54,490 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:54,490 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:54,490 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,490 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:54,490 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:54,490 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:54,495 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:54,496 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:54,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:54,496 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:54,496 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:54,583 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:54,583 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:54,583 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:54,583 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 02:18:54,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:54,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:54,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable944 [2022-12-13 02:18:54,583 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:18:54,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:54,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1383939750, now seen corresponding path program 1 times [2022-12-13 02:18:54,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:54,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90356942] [2022-12-13 02:18:54,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:54,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:54,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:18:54,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:54,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90356942] [2022-12-13 02:18:54,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90356942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:54,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:54,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:54,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405352386] [2022-12-13 02:18:54,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:54,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:54,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:54,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:54,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:54,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:54,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:54,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:54,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:54,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:54,695 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:54,695 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:18:54,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:54,696 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:54,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:54,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:54,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:54,697 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:54,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:54,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:54,699 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,699 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:54,700 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:54,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:54,700 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:54,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:54,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:54,705 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:54,706 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:54,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:54,706 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:54,706 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:54,794 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:54,794 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:54,794 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:54,794 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 02:18:54,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:54,794 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:54,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable945 [2022-12-13 02:18:54,794 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:18:54,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:54,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1412568901, now seen corresponding path program 1 times [2022-12-13 02:18:54,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:54,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188478891] [2022-12-13 02:18:54,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:54,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:54,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:18:54,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:54,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188478891] [2022-12-13 02:18:54,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188478891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:54,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:54,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81773578] [2022-12-13 02:18:54,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:54,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:54,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:54,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:54,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:54,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:54,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:54,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:54,920 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:54,920 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:54,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:54,922 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:54,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:54,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:54,922 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:54,922 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:54,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:54,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:54,925 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,925 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:54,925 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:54,925 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:54,925 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,925 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:54,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:54,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:54,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:54,931 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:54,931 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:54,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:54,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:54,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:55,018 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:55,019 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:55,019 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:55,019 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 02:18:55,019 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:55,019 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:55,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable946 [2022-12-13 02:18:55,019 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:18:55,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:55,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1441198052, now seen corresponding path program 1 times [2022-12-13 02:18:55,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:55,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372426442] [2022-12-13 02:18:55,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:55,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:55,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:18:55,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:55,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372426442] [2022-12-13 02:18:55,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372426442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:55,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:55,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:55,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887694468] [2022-12-13 02:18:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:55,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:55,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:55,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:55,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:55,066 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:55,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:55,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:55,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:55,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:55,131 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:55,132 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:18:55,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:55,133 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:55,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:55,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:55,133 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:55,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:55,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:55,136 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:55,136 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:55,136 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:55,136 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:55,136 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:55,136 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:55,136 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:55,136 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:55,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:55,142 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:55,142 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:18:55,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:55,143 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:55,143 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:55,237 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:55,238 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:18:55,238 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:55,238 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 02:18:55,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:55,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:55,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable947 [2022-12-13 02:18:55,238 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:18:55,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:55,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1469827203, now seen corresponding path program 1 times [2022-12-13 02:18:55,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:55,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535812901] [2022-12-13 02:18:55,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:55,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:55,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:18:55,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:55,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535812901] [2022-12-13 02:18:55,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535812901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:55,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:55,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:55,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893553015] [2022-12-13 02:18:55,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:55,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:55,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:55,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:55,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:55,288 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:55,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:55,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:55,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:55,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:55,363 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:55,363 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:55,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:55,365 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:55,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:55,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:55,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:55,365 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:55,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:55,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:55,368 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:55,368 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:55,368 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:55,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:55,368 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:55,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:55,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:55,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:55,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:55,374 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:55,374 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:55,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:55,375 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:55,375 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:55,462 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:55,462 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:55,462 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:55,462 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 02:18:55,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:55,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:55,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable948 [2022-12-13 02:18:55,463 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:18:55,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:55,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1498456354, now seen corresponding path program 1 times [2022-12-13 02:18:55,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:55,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652375651] [2022-12-13 02:18:55,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:55,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:55,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:18:55,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:55,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652375651] [2022-12-13 02:18:55,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652375651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:55,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:55,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:55,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126115974] [2022-12-13 02:18:55,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:55,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:55,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:55,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:55,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:55,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:55,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:55,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:55,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:55,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:55,586 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:55,586 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:55,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:55,587 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:55,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:55,588 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:55,588 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:55,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:55,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:55,590 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:55,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:55,590 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:55,591 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:55,591 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:55,591 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:55,591 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:55,591 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:55,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:55,596 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:55,596 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:55,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:55,597 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:55,597 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:55,685 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:55,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:55,686 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:55,686 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 02:18:55,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:55,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:55,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable949 [2022-12-13 02:18:55,686 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:18:55,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1527085505, now seen corresponding path program 1 times [2022-12-13 02:18:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:55,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928694353] [2022-12-13 02:18:55,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:55,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:55,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:18:55,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:55,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928694353] [2022-12-13 02:18:55,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928694353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:55,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:55,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:55,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256273094] [2022-12-13 02:18:55,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:55,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:55,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:55,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:55,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:55,736 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:55,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:55,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:55,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:55,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:55,801 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:55,801 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:55,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:55,802 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:55,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:55,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:55,803 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:55,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:55,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:55,805 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:55,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:55,806 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:55,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:55,806 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:55,806 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:55,806 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:55,806 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:55,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:55,812 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:55,812 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:55,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:55,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:55,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:55,900 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:55,901 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:55,901 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:55,901 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 02:18:55,901 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:55,901 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:55,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable950 [2022-12-13 02:18:55,901 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:18:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1555714656, now seen corresponding path program 1 times [2022-12-13 02:18:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:55,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35622506] [2022-12-13 02:18:55,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:55,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:18:55,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:55,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35622506] [2022-12-13 02:18:55,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35622506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:55,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:55,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:55,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401586858] [2022-12-13 02:18:55,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:55,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:55,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:55,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:55,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:55,969 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:55,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:55,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:55,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:55,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:56,056 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:56,056 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:56,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:56,057 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:56,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:56,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:56,058 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:56,058 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:56,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:56,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:56,060 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:56,060 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:56,061 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:56,061 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,061 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:56,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:56,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:56,066 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:56,067 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:56,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:56,067 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:56,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:56,162 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:56,163 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:18:56,163 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:56,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:56,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:56,163 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:56,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable951 [2022-12-13 02:18:56,163 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:18:56,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:56,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1584343807, now seen corresponding path program 1 times [2022-12-13 02:18:56,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:56,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909110326] [2022-12-13 02:18:56,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:56,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:56,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 02:18:56,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:56,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909110326] [2022-12-13 02:18:56,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909110326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:56,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:56,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:56,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891352616] [2022-12-13 02:18:56,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:56,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:56,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:56,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:56,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:56,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:56,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:56,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:56,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:56,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:56,277 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:56,277 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:56,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:56,278 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:56,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:56,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:56,279 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:56,279 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:56,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:56,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:56,281 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:56,282 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:56,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:56,282 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:56,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:56,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:56,287 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:56,288 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:56,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:56,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:56,288 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:56,375 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:56,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:56,375 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:56,376 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 02:18:56,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:56,376 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:56,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable952 [2022-12-13 02:18:56,376 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:18:56,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:56,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1612972958, now seen corresponding path program 1 times [2022-12-13 02:18:56,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:56,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679835640] [2022-12-13 02:18:56,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:18:56,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:56,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679835640] [2022-12-13 02:18:56,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679835640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:56,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:56,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327996231] [2022-12-13 02:18:56,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:56,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:56,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:56,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:56,423 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:56,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:56,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:56,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:56,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:56,488 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:56,488 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:56,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:56,489 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:56,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:56,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:56,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:56,490 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:56,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:56,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:56,492 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,492 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:56,493 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:56,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:56,493 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:56,493 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:56,493 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:56,498 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:56,499 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:18:56,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:56,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:56,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:56,586 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:56,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:56,587 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:56,587 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 02:18:56,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:56,587 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:56,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable953 [2022-12-13 02:18:56,587 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:18:56,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:56,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1641602109, now seen corresponding path program 1 times [2022-12-13 02:18:56,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:56,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052833274] [2022-12-13 02:18:56,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:56,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:56,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:18:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:56,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052833274] [2022-12-13 02:18:56,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052833274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:56,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:56,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:56,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494808416] [2022-12-13 02:18:56,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:56,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:56,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:56,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:56,635 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:56,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:56,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:56,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:56,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:56,700 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:56,700 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:56,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:56,701 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:56,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:56,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:56,702 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:56,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:56,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:56,704 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,704 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:56,704 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:56,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:56,705 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,705 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:56,705 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:56,705 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:56,710 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:56,710 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:18:56,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:56,711 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:56,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:56,798 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:56,798 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:56,798 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:56,798 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 02:18:56,798 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:56,798 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:56,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable954 [2022-12-13 02:18:56,799 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:18:56,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1670231260, now seen corresponding path program 1 times [2022-12-13 02:18:56,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:56,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644720519] [2022-12-13 02:18:56,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:56,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:56,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:18:56,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:56,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644720519] [2022-12-13 02:18:56,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644720519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:56,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:56,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:56,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505645982] [2022-12-13 02:18:56,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:56,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:56,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:56,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:56,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:56,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:56,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:56,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:56,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:56,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:56,914 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:56,914 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:18:56,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:56,915 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:56,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:56,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:56,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:56,916 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:56,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:56,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:56,918 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,918 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:56,918 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:56,918 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:56,918 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,918 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:56,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:56,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:56,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:56,924 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:56,924 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:18:56,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:56,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:56,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:57,013 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:57,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:57,014 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:57,014 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 02:18:57,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:57,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:57,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable955 [2022-12-13 02:18:57,014 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:18:57,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1698860411, now seen corresponding path program 1 times [2022-12-13 02:18:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:57,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146533446] [2022-12-13 02:18:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:57,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:18:57,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:57,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146533446] [2022-12-13 02:18:57,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146533446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:57,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:57,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:57,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653441224] [2022-12-13 02:18:57,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:57,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:57,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:57,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:57,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:57,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:57,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:57,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:57,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:57,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:57,145 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:57,146 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:57,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:57,147 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:57,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:57,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:57,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:57,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:57,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:57,147 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:57,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:57,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:57,150 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:57,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:57,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:57,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:57,150 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:57,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:57,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:57,150 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:57,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:57,156 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:57,156 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:57,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:57,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:57,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:57,244 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:57,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:18:57,245 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:57,245 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 02:18:57,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:57,245 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:57,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable956 [2022-12-13 02:18:57,245 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:18:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:57,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1727489562, now seen corresponding path program 1 times [2022-12-13 02:18:57,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:57,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196400933] [2022-12-13 02:18:57,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:57,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:57,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:18:57,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:57,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196400933] [2022-12-13 02:18:57,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196400933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:57,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:57,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:57,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637846658] [2022-12-13 02:18:57,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:57,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:57,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:57,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:57,293 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:57,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:57,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:57,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:57,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:57,369 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:57,370 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:57,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:57,371 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:57,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:57,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:57,371 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:57,371 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:57,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:57,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:57,374 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:57,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:57,374 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:57,374 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:57,374 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:57,374 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:57,374 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:57,375 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:57,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:57,380 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:57,381 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:57,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:57,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:57,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:57,469 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:57,470 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:18:57,470 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:57,470 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 02:18:57,470 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:57,470 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:57,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable957 [2022-12-13 02:18:57,470 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:18:57,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:57,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1756118713, now seen corresponding path program 1 times [2022-12-13 02:18:57,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:57,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408036279] [2022-12-13 02:18:57,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:57,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:57,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:18:57,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:57,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408036279] [2022-12-13 02:18:57,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408036279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:57,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:57,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:57,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223446146] [2022-12-13 02:18:57,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:57,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:57,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:57,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:57,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:57,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:57,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:57,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:57,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:57,582 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:57,582 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:18:57,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:57,583 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:57,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:57,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:57,584 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:57,584 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:57,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:57,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:57,586 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:57,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:57,587 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:57,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:57,587 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:57,587 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:57,587 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:57,587 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:57,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:57,592 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:57,592 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:57,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:57,593 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:57,593 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:57,680 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:57,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:57,681 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:57,681 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 02:18:57,681 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:57,681 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:57,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable958 [2022-12-13 02:18:57,681 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:18:57,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1784747864, now seen corresponding path program 1 times [2022-12-13 02:18:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:57,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637313052] [2022-12-13 02:18:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:57,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:57,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:18:57,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:57,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637313052] [2022-12-13 02:18:57,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637313052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:57,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:57,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:57,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340701288] [2022-12-13 02:18:57,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:57,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:57,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:57,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:57,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:57,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:57,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:57,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:57,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:57,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:57,801 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:57,801 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:57,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:57,802 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:57,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:57,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:57,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:57,803 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:57,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:57,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:57,806 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:57,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:57,806 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:57,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:57,806 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:57,806 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:57,806 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:57,806 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:57,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:57,812 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:57,812 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:57,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:57,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:57,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:57,899 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:57,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:57,900 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:57,900 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 02:18:57,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:57,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:57,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable959 [2022-12-13 02:18:57,900 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:18:57,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:57,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1813377015, now seen corresponding path program 1 times [2022-12-13 02:18:57,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:57,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843913240] [2022-12-13 02:18:57,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:57,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:57,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:18:57,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:57,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843913240] [2022-12-13 02:18:57,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843913240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:57,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:57,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:57,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018850501] [2022-12-13 02:18:57,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:57,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:57,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:57,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:57,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:57,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:57,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:57,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:57,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:57,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:58,051 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:58,051 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:58,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:58,052 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:58,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:58,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:58,053 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:58,053 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:58,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:58,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:58,055 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,055 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:58,055 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:58,056 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:58,056 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,056 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:58,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:58,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:58,061 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:58,062 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:18:58,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:58,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:58,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:58,149 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:58,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:58,149 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:58,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:58,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:58,149 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:58,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable960 [2022-12-13 02:18:58,149 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:18:58,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:58,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1842006166, now seen corresponding path program 1 times [2022-12-13 02:18:58,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:58,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209321371] [2022-12-13 02:18:58,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:58,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:58,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:18:58,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:58,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209321371] [2022-12-13 02:18:58,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209321371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:58,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:58,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:18:58,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235795971] [2022-12-13 02:18:58,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:58,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:18:58,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:58,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:18:58,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:18:58,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:58,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:58,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:58,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:58,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:58,290 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:58,290 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:58,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:58,291 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:58,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:58,291 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:58,292 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:58,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:58,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:58,294 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,294 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:58,294 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:58,294 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:58,294 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,295 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:58,295 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:58,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:58,300 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:58,300 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:58,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:58,301 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:58,301 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:58,386 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:58,386 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:58,386 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:58,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:18:58,387 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:58,387 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:58,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable961 [2022-12-13 02:18:58,387 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:18:58,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:58,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1870635317, now seen corresponding path program 1 times [2022-12-13 02:18:58,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:58,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128787883] [2022-12-13 02:18:58,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:58,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:58,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:18:58,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:58,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128787883] [2022-12-13 02:18:58,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128787883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:58,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:58,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:58,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189220755] [2022-12-13 02:18:58,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:58,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:58,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:58,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:58,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:58,435 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:58,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:58,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:58,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:58,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:58,501 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:58,501 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:58,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:58,502 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:58,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:58,502 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:58,502 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:58,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:58,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:58,505 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,505 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:58,505 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:58,505 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:58,505 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,505 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:58,505 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:58,505 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:58,511 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:58,511 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:58,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:58,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:58,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:58,604 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:58,604 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:18:58,604 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:58,604 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 02:18:58,604 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:58,604 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:58,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable962 [2022-12-13 02:18:58,605 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:18:58,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:58,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1899264468, now seen corresponding path program 1 times [2022-12-13 02:18:58,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:58,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002990236] [2022-12-13 02:18:58,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:58,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:58,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:18:58,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:58,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002990236] [2022-12-13 02:18:58,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002990236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:58,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:58,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:58,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40240464] [2022-12-13 02:18:58,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:58,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:58,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:58,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:58,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:58,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:58,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:58,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:58,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:58,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:58,718 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:58,719 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:58,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:58,720 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:58,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:58,720 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:58,720 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:58,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:58,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:58,723 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,723 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:58,723 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:58,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:58,723 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:58,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:58,723 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:58,729 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:58,729 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:58,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:58,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:58,730 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:58,817 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:58,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:18:58,817 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:58,818 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 02:18:58,818 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:58,818 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:58,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable963 [2022-12-13 02:18:58,818 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:18:58,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:58,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1927893619, now seen corresponding path program 1 times [2022-12-13 02:18:58,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:58,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668105161] [2022-12-13 02:18:58,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:58,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:58,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 02:18:58,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:58,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668105161] [2022-12-13 02:18:58,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668105161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:58,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:58,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016036487] [2022-12-13 02:18:58,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:58,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:58,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:58,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:58,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:58,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:58,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:58,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:58,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:58,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:58,949 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:58,949 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:58,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:58,950 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:58,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:58,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:58,951 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:58,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:58,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:58,954 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:58,954 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:58,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:58,954 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:58,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:58,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:58,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:58,960 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:58,960 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:18:58,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:58,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:58,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:59,046 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:59,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:59,046 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:59,046 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 02:18:59,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:59,046 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:59,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable964 [2022-12-13 02:18:59,047 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:18:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:59,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1956522770, now seen corresponding path program 1 times [2022-12-13 02:18:59,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:59,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511132938] [2022-12-13 02:18:59,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:59,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:59,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:18:59,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:59,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511132938] [2022-12-13 02:18:59,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511132938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:59,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:59,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:59,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066608997] [2022-12-13 02:18:59,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:59,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:59,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:59,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:59,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:59,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:59,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:59,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:59,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:59,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:59,158 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:59,159 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:18:59,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:59,160 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:59,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:59,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:59,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:59,160 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:59,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:59,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:59,163 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:59,163 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:59,163 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:59,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:59,163 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:59,163 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:59,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:59,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:59,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:59,169 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:59,169 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:59,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:59,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:59,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:59,255 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:59,256 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:59,256 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:59,256 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 02:18:59,256 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:59,256 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:59,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable965 [2022-12-13 02:18:59,256 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:18:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:59,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1985151921, now seen corresponding path program 1 times [2022-12-13 02:18:59,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:59,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959741392] [2022-12-13 02:18:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:59,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:59,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:18:59,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:59,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959741392] [2022-12-13 02:18:59,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959741392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:59,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:59,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:59,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408297404] [2022-12-13 02:18:59,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:59,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:59,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:59,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:59,305 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:59,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:59,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:59,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:59,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:59,380 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:59,380 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:59,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:59,381 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:59,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:59,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:59,382 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:59,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:59,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:59,384 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:59,385 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:59,385 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:59,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:59,385 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:59,385 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:59,385 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:59,385 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:59,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:59,391 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:59,391 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:59,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:59,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:59,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:59,477 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:59,477 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:18:59,477 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:59,478 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 02:18:59,478 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:59,478 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:59,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable966 [2022-12-13 02:18:59,478 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:18:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2013781072, now seen corresponding path program 1 times [2022-12-13 02:18:59,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:59,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860710728] [2022-12-13 02:18:59,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:59,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:18:59,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:59,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860710728] [2022-12-13 02:18:59,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860710728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:59,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:59,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:59,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540064923] [2022-12-13 02:18:59,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:59,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:59,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:59,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:59,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:59,526 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:59,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:59,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:59,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:59,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:59,604 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:59,604 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:18:59,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:59,605 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:59,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:59,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:59,606 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:59,606 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:59,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:59,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:59,608 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:59,608 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:59,608 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:59,608 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:59,608 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:59,609 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:59,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:59,609 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:59,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:59,614 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:59,614 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:18:59,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:59,615 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:59,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:59,700 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:59,701 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:59,701 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:59,701 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 02:18:59,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:59,701 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:59,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable967 [2022-12-13 02:18:59,701 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:18:59,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:59,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2042410223, now seen corresponding path program 1 times [2022-12-13 02:18:59,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:59,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110201151] [2022-12-13 02:18:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:59,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:59,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:18:59,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:59,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110201151] [2022-12-13 02:18:59,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110201151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:59,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:59,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:59,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401595012] [2022-12-13 02:18:59,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:59,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:59,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:59,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:59,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:59,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:59,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:18:59,827 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:18:59,827 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:18:59,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:18:59,828 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:18:59,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:18:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:18:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:18:59,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:18:59,829 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:18:59,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:18:59,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:18:59,831 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:59,831 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:18:59,832 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:18:59,832 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:18:59,832 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:59,832 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:18:59,832 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:18:59,832 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:18:59,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:59,838 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:18:59,838 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:18:59,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:18:59,838 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:18:59,838 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:18:59,924 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:18:59,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:18:59,925 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:18:59,925 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 02:18:59,925 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:18:59,925 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:18:59,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable968 [2022-12-13 02:18:59,925 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:18:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:18:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2071039374, now seen corresponding path program 1 times [2022-12-13 02:18:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:18:59,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069195095] [2022-12-13 02:18:59,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:18:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:18:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:18:59,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:18:59,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:18:59,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069195095] [2022-12-13 02:18:59,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069195095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:18:59,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:18:59,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:18:59,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148657100] [2022-12-13 02:18:59,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:18:59,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:18:59,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:18:59,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:18:59,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:18:59,971 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:18:59,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:18:59,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:18:59,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:18:59,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:00,045 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:00,045 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:00,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:00,046 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:00,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:00,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:00,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:00,046 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:00,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:00,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:00,049 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,049 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:00,049 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:00,049 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:00,049 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,050 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:00,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:00,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:00,055 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:00,055 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:00,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:00,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:00,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:00,141 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:00,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:00,142 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:00,142 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 02:19:00,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:00,142 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:00,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable969 [2022-12-13 02:19:00,142 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:19:00,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2099668525, now seen corresponding path program 1 times [2022-12-13 02:19:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:00,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79489988] [2022-12-13 02:19:00,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:00,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:19:00,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:00,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79489988] [2022-12-13 02:19:00,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79489988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:00,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:00,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:00,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595481423] [2022-12-13 02:19:00,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:00,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:00,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:00,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:00,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:00,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:00,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:00,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:00,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:00,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:00,267 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:00,267 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:00,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:00,268 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:00,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:00,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:00,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:00,269 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:00,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:00,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:00,271 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:00,272 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:00,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:00,272 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:00,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:00,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:00,278 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:00,278 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:00,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:00,278 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:00,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:00,363 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:00,364 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:00,364 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:00,364 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 02:19:00,364 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:00,364 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:00,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable970 [2022-12-13 02:19:00,364 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:19:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:00,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2128297676, now seen corresponding path program 1 times [2022-12-13 02:19:00,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:00,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027162180] [2022-12-13 02:19:00,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:00,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:00,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:19:00,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:00,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027162180] [2022-12-13 02:19:00,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027162180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:00,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:00,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467223432] [2022-12-13 02:19:00,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:00,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:00,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:00,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:00,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:00,412 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:00,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:00,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:00,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:00,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:00,485 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:00,486 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:00,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:00,487 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:00,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:00,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:00,487 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:00,487 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:00,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:00,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:00,490 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,490 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:00,490 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:00,490 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:00,490 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,490 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:00,490 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:00,490 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:00,496 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:00,496 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:00,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:00,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:00,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:00,583 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:00,583 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:00,583 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:00,583 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 02:19:00,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:00,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:00,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable971 [2022-12-13 02:19:00,583 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:19:00,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2138040469, now seen corresponding path program 1 times [2022-12-13 02:19:00,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:00,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641413528] [2022-12-13 02:19:00,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:00,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:00,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 02:19:00,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:00,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641413528] [2022-12-13 02:19:00,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641413528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:00,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:00,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:00,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011113480] [2022-12-13 02:19:00,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:00,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:00,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:00,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:00,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:00,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:00,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:00,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:00,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:00,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:00,716 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:00,716 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:00,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:00,717 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:00,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:00,718 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:00,718 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:00,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:00,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:00,720 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,721 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:00,721 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:00,721 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:00,721 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,721 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:00,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:00,721 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:00,726 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:00,727 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:00,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:00,727 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:00,727 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:00,813 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:00,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:00,814 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:00,814 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 02:19:00,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:00,814 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:00,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable972 [2022-12-13 02:19:00,814 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:19:00,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2109411318, now seen corresponding path program 1 times [2022-12-13 02:19:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:00,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934467054] [2022-12-13 02:19:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:00,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:00,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:19:00,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:00,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934467054] [2022-12-13 02:19:00,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934467054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:00,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:00,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943548178] [2022-12-13 02:19:00,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:00,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:00,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:00,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:00,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:00,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:00,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:00,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:00,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:00,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:00,926 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:00,926 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:00,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:00,927 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:00,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:00,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:00,928 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:00,928 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:00,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:00,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:00,930 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:00,931 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:00,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:00,931 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:00,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:00,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:00,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:00,937 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:00,937 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:00,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:00,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:00,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:01,023 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:01,024 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:01,024 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:01,024 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 02:19:01,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:01,024 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:01,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable973 [2022-12-13 02:19:01,024 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:19:01,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2080782167, now seen corresponding path program 1 times [2022-12-13 02:19:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:01,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56625521] [2022-12-13 02:19:01,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19: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:19:01,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:01,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56625521] [2022-12-13 02:19:01,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56625521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:01,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:01,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:01,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673707771] [2022-12-13 02:19:01,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:01,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:01,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:01,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:01,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:01,069 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:01,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:01,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:01,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:01,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:01,132 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:01,132 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:01,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:01,133 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:01,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:01,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:01,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:01,133 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:01,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:01,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:01,136 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:01,136 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:01,136 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:01,136 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:01,136 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:01,136 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:01,136 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:01,137 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:01,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:01,142 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:01,142 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:01,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:01,143 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:01,143 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:01,228 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:01,228 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:01,228 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:01,228 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 02:19:01,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:01,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:01,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable974 [2022-12-13 02:19:01,228 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:19:01,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2052153016, now seen corresponding path program 1 times [2022-12-13 02:19:01,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:01,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987174977] [2022-12-13 02:19:01,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:01,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:01,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:19:01,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:01,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987174977] [2022-12-13 02:19:01,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987174977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:01,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:01,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:01,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931914062] [2022-12-13 02:19:01,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:01,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:01,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:01,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:01,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:01,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:01,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:01,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:01,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:01,367 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:01,367 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:01,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:01,368 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:01,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:01,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:01,369 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:01,369 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:01,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:01,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:01,371 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:01,371 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:01,371 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:01,372 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:01,372 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:01,372 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:01,372 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:01,372 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:01,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:01,377 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:01,377 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:01,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:01,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:01,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:01,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:01,464 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:01,464 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:01,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:01,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:01,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:01,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable975 [2022-12-13 02:19:01,464 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:19:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2023523865, now seen corresponding path program 1 times [2022-12-13 02:19:01,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:01,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217786385] [2022-12-13 02:19:01,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:01,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:01,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:19:01,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:01,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217786385] [2022-12-13 02:19:01,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217786385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:01,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:01,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320833015] [2022-12-13 02:19:01,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:01,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:01,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:01,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:01,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:01,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:01,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:01,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:01,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:01,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:01,587 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:01,588 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:19:01,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:01,589 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:01,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:01,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:01,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:01,589 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:01,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:01,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:01,592 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:01,592 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:01,592 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:01,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:01,592 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:01,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:01,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:01,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:01,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:01,598 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:01,598 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:19:01,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:01,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:01,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:01,685 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:01,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:01,685 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:01,686 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 02:19:01,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:01,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:01,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable976 [2022-12-13 02:19:01,686 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:19:01,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:01,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1994894714, now seen corresponding path program 1 times [2022-12-13 02:19:01,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:01,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308311687] [2022-12-13 02:19:01,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:01,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:19:01,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:01,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308311687] [2022-12-13 02:19:01,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308311687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:01,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:01,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:01,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911787093] [2022-12-13 02:19:01,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:01,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:01,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:01,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:01,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:01,735 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:01,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:01,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:01,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:01,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:01,801 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:01,802 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:01,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:01,803 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:01,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:01,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:01,803 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:01,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:01,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:01,806 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:01,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:01,806 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:01,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:01,806 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:01,806 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:01,806 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:01,806 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:01,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:01,812 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:01,812 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:01,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:01,813 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:01,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:01,905 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:01,906 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:19:01,906 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:01,906 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 02:19:01,906 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:01,906 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:01,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable977 [2022-12-13 02:19:01,906 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:19:01,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1966265563, now seen corresponding path program 1 times [2022-12-13 02:19:01,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:01,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86432494] [2022-12-13 02:19:01,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:01,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 02:19:01,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:01,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86432494] [2022-12-13 02:19:01,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86432494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:01,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:01,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:01,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013198451] [2022-12-13 02:19:01,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:01,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:01,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:01,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:01,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:01,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:01,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:01,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:01,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:01,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:02,030 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:02,030 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:02,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:02,032 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:02,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:02,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:02,032 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:02,032 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:02,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:02,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:02,035 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,035 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:02,035 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:02,035 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:02,035 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,035 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:02,035 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:02,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:02,041 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:02,041 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:02,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:02,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:02,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:02,129 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:02,130 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:02,130 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:02,130 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 02:19:02,130 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:02,130 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:02,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable978 [2022-12-13 02:19:02,130 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:19:02,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:02,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1937636412, now seen corresponding path program 1 times [2022-12-13 02:19:02,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:02,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348414403] [2022-12-13 02:19:02,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:02,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:19:02,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:02,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348414403] [2022-12-13 02:19:02,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348414403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:02,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:02,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:02,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841964527] [2022-12-13 02:19:02,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:02,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:02,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:02,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:02,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:02,178 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:02,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:02,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:02,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:02,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:02,253 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:02,253 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:02,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:02,254 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:02,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:02,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:02,255 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:02,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:02,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:02,257 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,257 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:02,257 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:02,257 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:02,257 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,258 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:02,258 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:02,258 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:02,263 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:02,263 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:02,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:02,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:02,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:02,351 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:02,351 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:02,351 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:02,351 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 02:19:02,351 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:02,351 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:02,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable979 [2022-12-13 02:19:02,352 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:19:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1909007261, now seen corresponding path program 1 times [2022-12-13 02:19:02,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:02,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497124880] [2022-12-13 02:19:02,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:02,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:19:02,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:02,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497124880] [2022-12-13 02:19:02,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497124880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:02,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:02,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:02,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015805969] [2022-12-13 02:19:02,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:02,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:02,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:02,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:02,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:02,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:02,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:02,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:02,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:02,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:02,482 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:02,482 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:02,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:02,483 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:02,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:02,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:02,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:02,483 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:02,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:02,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:02,486 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,486 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:02,486 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:02,486 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:02,486 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,486 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:02,486 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:02,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:02,492 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:02,492 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:19:02,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:02,493 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:02,493 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:02,580 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:02,580 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:02,580 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:02,580 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 02:19:02,580 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:02,580 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:02,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable980 [2022-12-13 02:19:02,580 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:19:02,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1880378110, now seen corresponding path program 1 times [2022-12-13 02:19:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:02,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445765924] [2022-12-13 02:19:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:02,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:02,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:19:02,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:02,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445765924] [2022-12-13 02:19:02,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445765924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:02,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:02,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:02,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144390045] [2022-12-13 02:19:02,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:02,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:02,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:02,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:02,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:02,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:02,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:02,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:02,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:02,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:02,692 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:02,693 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:02,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:02,694 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:02,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:02,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:02,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:02,694 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:02,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:02,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:02,697 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,697 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:02,697 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:02,697 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:02,697 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,697 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:02,697 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:02,698 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:02,703 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:02,703 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:02,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:02,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:02,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:02,799 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:02,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:19:02,800 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:02,800 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 02:19:02,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:02,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:02,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable981 [2022-12-13 02:19:02,800 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:19:02,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1851748959, now seen corresponding path program 1 times [2022-12-13 02:19:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:02,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141158976] [2022-12-13 02:19:02,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:02,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:02,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:19:02,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:02,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141158976] [2022-12-13 02:19:02,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141158976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:02,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:02,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:02,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790377396] [2022-12-13 02:19:02,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:02,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:02,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:02,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:02,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:02,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:02,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:02,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:02,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:02,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:02,919 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:02,919 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:02,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:02,921 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:02,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:02,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:02,921 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:02,921 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:02,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:02,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:02,924 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:02,924 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:02,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:02,924 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,924 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:02,924 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:02,924 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:02,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:02,930 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:02,930 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:02,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:02,930 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:02,930 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:03,016 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:03,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:03,017 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:03,017 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 02:19:03,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:03,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:03,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable982 [2022-12-13 02:19:03,017 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:19:03,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:03,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1823119808, now seen corresponding path program 1 times [2022-12-13 02:19:03,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:03,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894681268] [2022-12-13 02:19:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:03,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:03,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 02:19:03,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:03,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894681268] [2022-12-13 02:19:03,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894681268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:03,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:03,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:03,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289063076] [2022-12-13 02:19:03,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:03,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:03,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:03,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:03,082 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:03,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:03,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:03,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:03,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:03,159 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:03,159 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:03,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:03,160 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:03,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:03,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:03,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:03,161 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:03,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:03,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:03,163 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:03,163 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:03,164 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:03,164 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:03,164 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:03,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:03,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:03,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:03,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:03,170 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:03,170 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:03,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:03,170 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:03,170 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:03,259 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:03,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:19:03,260 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:03,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:03,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:03,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:03,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable983 [2022-12-13 02:19:03,260 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:19:03,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:03,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1794490657, now seen corresponding path program 1 times [2022-12-13 02:19:03,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:03,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910292247] [2022-12-13 02:19:03,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:03,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:03,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:19:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:03,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910292247] [2022-12-13 02:19:03,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910292247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:03,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:03,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:03,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053556926] [2022-12-13 02:19:03,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:03,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:03,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:03,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:03,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:03,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:03,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:03,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:03,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:03,393 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:03,393 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:03,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:03,394 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:03,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:03,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:03,395 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:03,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:03,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:03,397 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:03,397 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:03,397 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:03,398 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:03,398 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:03,398 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:03,398 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:03,398 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:03,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:03,403 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:03,403 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:03,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:03,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:03,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:03,494 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:03,494 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:19:03,494 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:03,494 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 02:19:03,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:03,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:03,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable984 [2022-12-13 02:19:03,494 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:19:03,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:03,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1765861506, now seen corresponding path program 1 times [2022-12-13 02:19:03,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:03,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000579171] [2022-12-13 02:19:03,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:03,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:03,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:19:03,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:03,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000579171] [2022-12-13 02:19:03,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000579171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:03,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:03,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:03,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992283562] [2022-12-13 02:19:03,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:03,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:03,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:03,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:03,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:03,540 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:03,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:03,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:03,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:03,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:03,605 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:03,605 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:19:03,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:03,606 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:03,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:03,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:03,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:03,607 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:03,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:03,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:03,609 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:03,609 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:03,609 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:03,610 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:03,610 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:03,610 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:03,610 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:03,610 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:03,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:03,615 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:03,615 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:19:03,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:03,616 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:03,616 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:03,703 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:03,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:03,703 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:03,704 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 02:19:03,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:03,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:03,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable985 [2022-12-13 02:19:03,704 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:19:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:03,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1737232355, now seen corresponding path program 1 times [2022-12-13 02:19:03,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:03,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909169123] [2022-12-13 02:19:03,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:03,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:03,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:19:03,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:03,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909169123] [2022-12-13 02:19:03,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909169123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:03,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:03,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:03,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076174007] [2022-12-13 02:19:03,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:03,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:03,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:03,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:03,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:03,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:03,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:03,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:03,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:03,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:03,814 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:03,814 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:03,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:03,815 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:03,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:03,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:03,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:03,816 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:03,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:03,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:03,818 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:03,818 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:03,818 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:03,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:03,818 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:03,819 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:03,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:03,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:03,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:03,824 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:03,824 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:03,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:03,825 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:03,825 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:03,911 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:03,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:03,912 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:03,912 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 02:19:03,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:03,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:03,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable986 [2022-12-13 02:19:03,912 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:19:03,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:03,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1708603204, now seen corresponding path program 1 times [2022-12-13 02:19:03,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:03,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440267775] [2022-12-13 02:19:03,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:03,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:03,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:19:03,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:03,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440267775] [2022-12-13 02:19:03,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440267775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:03,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:03,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:03,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004300076] [2022-12-13 02:19:03,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:03,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:03,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:03,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:03,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:03,961 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:03,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:03,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:03,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:03,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:04,037 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:04,037 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:04,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:04,038 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:04,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:04,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:04,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:04,038 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:04,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:04,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:04,041 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,041 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:04,041 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:04,041 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:04,041 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,041 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:04,041 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:04,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:04,047 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:04,047 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:04,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:04,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:04,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:04,135 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:04,135 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:04,135 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:04,135 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 02:19:04,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:04,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:04,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable987 [2022-12-13 02:19:04,135 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:19:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:04,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1679974053, now seen corresponding path program 1 times [2022-12-13 02:19:04,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:04,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65254688] [2022-12-13 02:19:04,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:04,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:04,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:19:04,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:04,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65254688] [2022-12-13 02:19:04,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65254688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:04,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:04,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:04,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831919612] [2022-12-13 02:19:04,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:04,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:04,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:04,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:04,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:04,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:04,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:04,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:04,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:04,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:04,286 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:04,286 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:04,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1125 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:04,288 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:04,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:04,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:04,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:04,288 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:04,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:04,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:04,291 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,291 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:04,291 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:04,291 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:04,291 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,291 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:04,291 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:04,291 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:04,297 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:04,297 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:04,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:04,298 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:04,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:04,384 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:04,385 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:04,385 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:04,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:04,385 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:04,385 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:04,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable988 [2022-12-13 02:19:04,385 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:19:04,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:04,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1651344902, now seen corresponding path program 1 times [2022-12-13 02:19:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:04,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765848980] [2022-12-13 02:19:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:19:04,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:04,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765848980] [2022-12-13 02:19:04,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765848980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:04,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:04,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:04,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524348296] [2022-12-13 02:19:04,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:04,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:04,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:04,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:04,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:04,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:04,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:04,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:04,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:04,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:04,511 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:04,511 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:04,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:04,512 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:04,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:04,513 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:04,513 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:04,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:04,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:04,515 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,515 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:04,515 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:04,515 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:04,515 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:04,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:04,516 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:04,521 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:04,521 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:19:04,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:04,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:04,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:04,608 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:04,608 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:04,608 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:04,609 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 02:19:04,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:04,609 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:04,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable989 [2022-12-13 02:19:04,609 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:19:04,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1622715751, now seen corresponding path program 1 times [2022-12-13 02:19:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:04,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858954212] [2022-12-13 02:19:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:04,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:04,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 02:19:04,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:04,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858954212] [2022-12-13 02:19:04,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858954212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:04,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:04,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:04,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459865574] [2022-12-13 02:19:04,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:04,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:04,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:04,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:04,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:04,658 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:04,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:04,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:04,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:04,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:04,733 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:04,734 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:04,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1127 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:04,735 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:04,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:04,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:04,735 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:04,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:04,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:04,737 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,737 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:04,738 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:04,738 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:04,738 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:04,738 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:04,738 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:04,744 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:04,744 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:04,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:04,744 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:04,744 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:04,830 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:04,830 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:04,830 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:04,831 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 02:19:04,831 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:04,831 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:04,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable990 [2022-12-13 02:19:04,831 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:19:04,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:04,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1594086600, now seen corresponding path program 1 times [2022-12-13 02:19:04,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:04,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978179120] [2022-12-13 02:19:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:04,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:04,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:19:04,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:04,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978179120] [2022-12-13 02:19:04,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978179120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:04,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:04,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:04,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261755174] [2022-12-13 02:19:04,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:04,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:04,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:04,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:04,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:04,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:04,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:04,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:04,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:04,943 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:04,943 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:04,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:04,944 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:04,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:04,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:04,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:04,944 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:04,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:04,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:04,947 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:04,947 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:04,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:04,947 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,948 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:04,948 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:04,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:04,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:04,953 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:04,953 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:04,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:04,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:04,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:05,040 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:05,040 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:05,040 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:05,040 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 02:19:05,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:05,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:05,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable991 [2022-12-13 02:19:05,041 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:19:05,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:05,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1565457449, now seen corresponding path program 1 times [2022-12-13 02:19:05,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:05,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150326518] [2022-12-13 02:19:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:05,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:05,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:19:05,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:05,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150326518] [2022-12-13 02:19:05,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150326518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:05,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:05,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:05,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300600999] [2022-12-13 02:19:05,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:05,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:05,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:05,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:05,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:05,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:05,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:05,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:05,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:05,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:05,170 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:05,170 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:05,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:05,172 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:05,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:05,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:05,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:05,172 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:05,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:05,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:05,175 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:05,175 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:05,175 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:05,175 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:05,175 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:05,175 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:05,175 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:05,175 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:05,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:05,181 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:05,181 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:05,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:05,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:05,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:05,267 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:05,267 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:05,267 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:05,267 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 02:19:05,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:05,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:05,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable992 [2022-12-13 02:19:05,267 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:19:05,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:05,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1536828298, now seen corresponding path program 1 times [2022-12-13 02:19:05,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:05,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280867060] [2022-12-13 02:19:05,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:05,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:05,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:19:05,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:05,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280867060] [2022-12-13 02:19:05,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280867060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:05,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:05,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:05,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048002152] [2022-12-13 02:19:05,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:05,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:05,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:05,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:05,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:05,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:05,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:05,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:05,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:05,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:05,409 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:05,409 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:05,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:05,410 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:05,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:05,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:05,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:05,411 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:05,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:05,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:05,413 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:05,413 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:05,413 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:05,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:05,413 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:05,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:05,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:05,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:05,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:05,419 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:05,419 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:05,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:05,420 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:05,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:05,507 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:05,507 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:05,507 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:05,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:05,507 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:05,507 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:05,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable993 [2022-12-13 02:19:05,507 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:19:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1508199147, now seen corresponding path program 1 times [2022-12-13 02:19:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:05,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049878152] [2022-12-13 02:19:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:05,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:05,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:19:05,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:05,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049878152] [2022-12-13 02:19:05,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049878152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:05,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:05,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:05,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52129464] [2022-12-13 02:19:05,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:05,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:05,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:05,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:05,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:05,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:05,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:05,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:05,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:05,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:05,631 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:05,631 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:05,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:05,632 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:05,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:05,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:05,633 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:05,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:05,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:05,635 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:05,635 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:05,636 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:05,636 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:05,636 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:05,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:05,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:05,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:05,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:05,641 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:05,642 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:05,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:05,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:05,642 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:05,729 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:05,729 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:05,729 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:05,729 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 02:19:05,730 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:05,730 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:05,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable994 [2022-12-13 02:19:05,730 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:19:05,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:05,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1479569996, now seen corresponding path program 1 times [2022-12-13 02:19:05,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:05,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663759807] [2022-12-13 02:19:05,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:05,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:05,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:19:05,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:05,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663759807] [2022-12-13 02:19:05,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663759807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:05,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:05,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:05,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575604701] [2022-12-13 02:19:05,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:05,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:05,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:05,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:05,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:05,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:05,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:05,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:05,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:05,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:05,854 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:05,854 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:05,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:05,856 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:05,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:05,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:05,856 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:05,856 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:05,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:05,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:05,859 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:05,859 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:05,859 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:05,859 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:05,859 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:05,859 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:05,859 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:05,859 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:05,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:05,865 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:05,865 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:05,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:05,865 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:05,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:05,954 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:05,955 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:19:05,955 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:05,955 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 02:19:05,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:05,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:05,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable995 [2022-12-13 02:19:05,955 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:19:05,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1450940845, now seen corresponding path program 1 times [2022-12-13 02:19:05,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:05,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302964685] [2022-12-13 02:19:05,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:06,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:19:06,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:06,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302964685] [2022-12-13 02:19:06,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302964685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:06,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:06,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100142640] [2022-12-13 02:19:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:06,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:06,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:06,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:06,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:06,004 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:06,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:06,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:06,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:06,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:06,088 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:06,088 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:06,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:06,089 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:06,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:06,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:06,089 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:06,089 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:06,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:06,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:06,092 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:06,092 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:06,092 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:06,092 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:06,092 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:06,092 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:06,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:06,092 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:06,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:06,098 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:06,098 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:06,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:06,099 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:06,099 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:06,191 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:06,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:19:06,191 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:06,191 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 02:19:06,191 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:06,191 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:06,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable996 [2022-12-13 02:19:06,191 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:19:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1422311694, now seen corresponding path program 1 times [2022-12-13 02:19:06,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:06,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008427337] [2022-12-13 02:19:06,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:06,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:06,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:19:06,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:06,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008427337] [2022-12-13 02:19:06,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008427337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:06,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:06,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419012827] [2022-12-13 02:19:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:06,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:06,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:06,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:06,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:06,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:06,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:06,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:06,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:06,315 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:06,315 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:06,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:06,317 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:06,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:06,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:06,317 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:06,317 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:06,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:06,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:06,320 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:06,320 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:06,320 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:06,320 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:06,320 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:06,320 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:06,320 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:06,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:06,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:06,326 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:06,326 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:06,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:06,326 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:06,326 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:06,413 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:06,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:06,414 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:06,414 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 02:19:06,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:06,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:06,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable997 [2022-12-13 02:19:06,414 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:19:06,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1393682543, now seen corresponding path program 1 times [2022-12-13 02:19:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:06,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488238342] [2022-12-13 02:19:06,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:06,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:06,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:19:06,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:06,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488238342] [2022-12-13 02:19:06,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488238342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:06,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:06,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:06,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127338741] [2022-12-13 02:19:06,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:06,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:06,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:06,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:06,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:06,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:06,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:06,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:06,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:06,529 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:06,529 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:06,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:06,530 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:06,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:06,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:06,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:06,531 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:06,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:06,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:06,534 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:06,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:06,534 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:06,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:06,534 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:06,534 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:06,534 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:06,534 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:06,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:06,540 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:06,540 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:19:06,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:06,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:06,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:06,627 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:06,627 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:06,627 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:06,627 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 02:19:06,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:06,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:06,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable998 [2022-12-13 02:19:06,628 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:19:06,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1365053392, now seen corresponding path program 1 times [2022-12-13 02:19:06,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:06,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120268261] [2022-12-13 02:19:06,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:06,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:06,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:19:06,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:06,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120268261] [2022-12-13 02:19:06,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120268261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:06,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:06,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:06,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189918167] [2022-12-13 02:19:06,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:06,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:06,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:06,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:06,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:06,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:06,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:06,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:06,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:06,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:06,752 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:06,752 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:06,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1125 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:06,753 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:06,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:06,754 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:06,754 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:06,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:06,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:06,756 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:06,756 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:06,756 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:06,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:06,756 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:06,757 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:06,757 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:06,757 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:06,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:06,762 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:06,762 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:06,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:06,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:06,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:06,849 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:06,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:06,849 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:06,849 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 02:19:06,849 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:06,849 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:06,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable999 [2022-12-13 02:19:06,849 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:19:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:06,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1336424241, now seen corresponding path program 1 times [2022-12-13 02:19:06,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:06,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245778694] [2022-12-13 02:19:06,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:06,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:06,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:19:06,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:06,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245778694] [2022-12-13 02:19:06,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245778694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:06,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:06,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:06,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817972121] [2022-12-13 02:19:06,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:06,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:06,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:06,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:06,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:06,914 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:06,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:06,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:06,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:06,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:07,005 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:07,005 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:07,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:07,006 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:07,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:07,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:07,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:07,007 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:07,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:07,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:07,009 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:07,009 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:07,009 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:07,009 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:07,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:07,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:07,015 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:07,015 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:07,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:07,016 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:07,016 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:07,103 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:07,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:07,103 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:07,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:07,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:07,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:07,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1000 [2022-12-13 02:19:07,104 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:19:07,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1307795090, now seen corresponding path program 1 times [2022-12-13 02:19:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:07,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650313772] [2022-12-13 02:19:07,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:07,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:07,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:19:07,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:07,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650313772] [2022-12-13 02:19:07,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650313772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:07,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:07,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:07,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264191270] [2022-12-13 02:19:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:07,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:07,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:07,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:07,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:07,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:07,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:07,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:07,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:07,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:07,244 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:07,244 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:07,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:07,245 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:07,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:07,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:07,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:07,245 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:07,245 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:07,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:07,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:07,248 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,248 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:07,248 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:07,248 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:07,248 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,248 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:07,248 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:07,248 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:07,254 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:07,254 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:07,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:07,254 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:07,254 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:07,340 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:07,341 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:07,341 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:07,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:07,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:07,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:07,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1001 [2022-12-13 02:19:07,341 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:19:07,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:07,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1279165939, now seen corresponding path program 1 times [2022-12-13 02:19:07,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:07,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399391984] [2022-12-13 02:19:07,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:07,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:07,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:19:07,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:07,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399391984] [2022-12-13 02:19:07,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399391984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:07,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:07,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:07,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270138446] [2022-12-13 02:19:07,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:07,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:07,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:07,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:07,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:07,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:07,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:07,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:07,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:07,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:07,487 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:07,487 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:07,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:07,488 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:07,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:07,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:07,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:07,489 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:07,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:07,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:07,491 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,491 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:07,491 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:07,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:07,492 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,492 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:07,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:07,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:07,497 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:07,498 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:07,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:07,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:07,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:07,584 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:07,584 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:07,584 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:07,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:07,585 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:07,585 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:07,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1002 [2022-12-13 02:19:07,585 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:19:07,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:07,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1250536788, now seen corresponding path program 1 times [2022-12-13 02:19:07,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:07,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437625872] [2022-12-13 02:19:07,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:07,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:07,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:19:07,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:07,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437625872] [2022-12-13 02:19:07,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437625872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:07,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:07,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:07,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179324712] [2022-12-13 02:19:07,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:07,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:07,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:07,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:07,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:07,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:07,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:07,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:07,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:07,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:07,699 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:07,699 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:07,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:07,700 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:07,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:07,701 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:07,701 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:07,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:07,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:07,704 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,704 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:07,704 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:07,704 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:07,704 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,704 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:07,704 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:07,704 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:07,710 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:07,710 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:07,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:07,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:07,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:07,796 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:07,797 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:07,797 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:07,797 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 02:19:07,797 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:07,797 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:07,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1003 [2022-12-13 02:19:07,797 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:19:07,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1221907637, now seen corresponding path program 1 times [2022-12-13 02:19:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:07,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282006966] [2022-12-13 02:19:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:07,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:07,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:19:07,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:07,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282006966] [2022-12-13 02:19:07,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282006966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:07,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:07,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:07,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832584859] [2022-12-13 02:19:07,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:07,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:07,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:07,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:07,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:07,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:07,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:07,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:07,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:07,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:07,918 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:07,918 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:07,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:07,919 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:07,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:07,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:07,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:07,920 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:07,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:07,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:07,922 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,922 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:07,922 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:07,922 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:07,922 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,922 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:07,922 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:07,923 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:07,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:07,928 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:07,928 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:07,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:07,929 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:07,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:08,014 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:08,015 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:08,015 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:08,015 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 02:19:08,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:08,015 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:08,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1004 [2022-12-13 02:19:08,015 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:19:08,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1193278486, now seen corresponding path program 1 times [2022-12-13 02:19:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:08,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636495722] [2022-12-13 02:19:08,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:08,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:19:08,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:08,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636495722] [2022-12-13 02:19:08,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636495722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:08,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:08,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:08,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571448709] [2022-12-13 02:19:08,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:08,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:08,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:08,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:08,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:08,063 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:08,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:08,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:08,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:08,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:08,128 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:08,129 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:08,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:08,130 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:08,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:08,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:08,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:08,130 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:08,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:08,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:08,133 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,133 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:08,133 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:08,133 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:08,133 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,133 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:08,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:08,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:08,139 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:08,139 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:08,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:08,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:08,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:08,227 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:08,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:08,227 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:08,227 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 02:19:08,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:08,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:08,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1005 [2022-12-13 02:19:08,227 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:19:08,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1164649335, now seen corresponding path program 1 times [2022-12-13 02:19:08,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:08,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738713425] [2022-12-13 02:19:08,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:08,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:08,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:19:08,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:08,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738713425] [2022-12-13 02:19:08,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738713425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:08,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:08,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:08,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933447556] [2022-12-13 02:19:08,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:08,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:08,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:08,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:08,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:08,276 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:08,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:08,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:08,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:08,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:08,341 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:08,341 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:08,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:08,342 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:08,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:08,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:08,343 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:08,343 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:08,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:08,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:08,345 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,345 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:08,345 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:08,346 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:08,346 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,346 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:08,346 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:08,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:08,351 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:08,351 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:08,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:08,352 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:08,352 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:08,441 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:08,441 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:08,441 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:08,441 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 02:19:08,441 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:08,441 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:08,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1006 [2022-12-13 02:19:08,441 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:19:08,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:08,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1136020184, now seen corresponding path program 1 times [2022-12-13 02:19:08,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:08,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617589625] [2022-12-13 02:19:08,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:08,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:08,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:19:08,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:08,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617589625] [2022-12-13 02:19:08,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617589625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:08,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:08,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:08,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695827929] [2022-12-13 02:19:08,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:08,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:08,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:08,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:08,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:08,488 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:08,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:08,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:08,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:08,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:08,556 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:08,556 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:08,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:08,557 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:08,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:08,558 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:08,558 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:08,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:08,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:08,560 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,561 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:08,561 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:08,561 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:08,561 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,561 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:08,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:08,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:08,566 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:08,567 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:08,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:08,567 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:08,567 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:08,652 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:08,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:08,653 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:08,653 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 02:19:08,653 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:08,653 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:08,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1007 [2022-12-13 02:19:08,653 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:19:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1107391033, now seen corresponding path program 1 times [2022-12-13 02:19:08,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:08,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043357856] [2022-12-13 02:19:08,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:08,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:08,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:19:08,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:08,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043357856] [2022-12-13 02:19:08,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043357856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:08,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:08,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:08,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254752724] [2022-12-13 02:19:08,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:08,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:08,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:08,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:08,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:08,698 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:08,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:08,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:08,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:08,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:08,770 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:08,771 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:08,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:08,772 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:08,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:08,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:08,772 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:08,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:08,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:08,775 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:08,775 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:08,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:08,775 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,775 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:08,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:08,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:08,781 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:08,781 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:08,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:08,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:08,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:08,867 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:08,867 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:08,868 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:08,868 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 02:19:08,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:08,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:08,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1008 [2022-12-13 02:19:08,868 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:19:08,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1078761882, now seen corresponding path program 1 times [2022-12-13 02:19:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:08,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543244816] [2022-12-13 02:19:08,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:08,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:08,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:19:08,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:08,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543244816] [2022-12-13 02:19:08,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543244816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:08,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:08,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746616652] [2022-12-13 02:19:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:08,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:08,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:08,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:08,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:08,913 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:08,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:08,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:08,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:08,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:08,977 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:08,977 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:08,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:08,979 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:08,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:08,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:08,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:08,979 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:08,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:08,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:08,982 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,982 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:08,982 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:08,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:08,982 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:08,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:08,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:08,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:08,988 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:08,988 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:08,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:08,989 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:08,989 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:09,076 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:09,076 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:09,076 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:09,076 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 02:19:09,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:09,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:09,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1009 [2022-12-13 02:19:09,076 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:19:09,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1050132731, now seen corresponding path program 1 times [2022-12-13 02:19:09,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:09,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307319184] [2022-12-13 02:19:09,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:09,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:09,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:19:09,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:09,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307319184] [2022-12-13 02:19:09,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307319184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:09,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:09,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:09,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350790585] [2022-12-13 02:19:09,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:09,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:09,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:09,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:09,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:09,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:09,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:09,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:09,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:09,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:09,200 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:09,200 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:09,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:09,201 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:09,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:09,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:09,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:09,202 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:09,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:09,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:09,204 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:09,204 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:09,205 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:09,205 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:09,205 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:09,205 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:09,205 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:09,205 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:09,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:09,211 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:09,211 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:09,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:09,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:09,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:09,298 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:09,298 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:09,298 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:09,298 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 02:19:09,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:09,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:09,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1010 [2022-12-13 02:19:09,299 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:19:09,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:09,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1021503580, now seen corresponding path program 1 times [2022-12-13 02:19:09,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:09,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817709536] [2022-12-13 02:19:09,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:09,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:09,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:19:09,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:09,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817709536] [2022-12-13 02:19:09,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817709536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:09,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:09,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:09,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426444279] [2022-12-13 02:19:09,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:09,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:09,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:09,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:09,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:09,363 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:09,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:09,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:09,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:09,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:09,438 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:09,438 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:09,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:09,440 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:09,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:09,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:09,440 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:09,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:09,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:09,442 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:09,443 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:09,443 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:09,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:09,443 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:09,443 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:09,443 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:09,443 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:09,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:09,449 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:09,449 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:19:09,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:09,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:09,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:09,535 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:09,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:09,536 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:09,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:09,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:09,536 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:09,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1011 [2022-12-13 02:19:09,536 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:19:09,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash -992874429, now seen corresponding path program 1 times [2022-12-13 02:19:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:09,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189008503] [2022-12-13 02:19:09,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:09,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:09,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:19:09,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:09,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189008503] [2022-12-13 02:19:09,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189008503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:09,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:09,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:09,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493124414] [2022-12-13 02:19:09,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:09,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:09,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:09,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:09,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:09,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:09,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:09,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:09,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:09,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:09,654 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:09,655 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:09,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:09,656 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:09,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:09,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:09,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:09,656 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:09,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:09,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:09,659 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:09,659 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:09,659 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:09,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:09,659 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:09,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:09,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:09,659 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:09,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:09,665 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:09,665 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:09,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:09,666 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:09,666 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:09,752 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:09,753 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:09,753 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:09,753 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 02:19:09,753 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:09,753 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:09,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1012 [2022-12-13 02:19:09,753 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:19:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -964245278, now seen corresponding path program 1 times [2022-12-13 02:19:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:09,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412466585] [2022-12-13 02:19:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:09,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:19:09,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:09,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412466585] [2022-12-13 02:19:09,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412466585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:09,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:09,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:09,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195074541] [2022-12-13 02:19:09,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:09,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:09,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:09,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:09,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:09,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:09,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:09,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:09,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:09,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:09,878 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:09,878 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:09,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:09,879 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:09,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:09,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:09,880 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:09,880 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:09,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:09,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:09,882 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:09,882 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:09,882 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:09,882 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:09,883 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:09,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:09,883 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:09,883 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:09,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:09,888 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:09,888 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:09,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:09,889 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:09,889 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:09,975 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:09,975 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:09,975 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:09,975 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 02:19:09,975 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:09,976 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:09,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1013 [2022-12-13 02:19:09,976 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:19:09,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash -935616127, now seen corresponding path program 1 times [2022-12-13 02:19:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:09,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99493817] [2022-12-13 02:19:09,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:09,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:10,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:19:10,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:10,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99493817] [2022-12-13 02:19:10,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99493817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:10,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:10,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:10,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648131156] [2022-12-13 02:19:10,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:10,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:10,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:10,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:10,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:10,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:10,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:10,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:10,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:10,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:10,101 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:10,101 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:10,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:10,102 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:10,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:10,103 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:10,103 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:10,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:10,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:10,105 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,106 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:10,106 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:10,106 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:10,106 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,106 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:10,106 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:10,106 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:10,112 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:10,112 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:10,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:10,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:10,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:10,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:10,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:10,200 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:10,200 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 02:19:10,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:10,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:10,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1014 [2022-12-13 02:19:10,200 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:19:10,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:10,201 INFO L85 PathProgramCache]: Analyzing trace with hash -906986976, now seen corresponding path program 1 times [2022-12-13 02:19:10,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:10,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797933911] [2022-12-13 02:19:10,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:10,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:10,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:19:10,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:10,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797933911] [2022-12-13 02:19:10,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797933911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:10,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:10,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:10,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083001201] [2022-12-13 02:19:10,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:10,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:10,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:10,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:10,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:10,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:10,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:10,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:10,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:10,322 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:10,322 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:10,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:10,323 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:10,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:10,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:10,323 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:10,323 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:10,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:10,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:10,326 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:10,326 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:10,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:10,326 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:10,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:10,327 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:10,332 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:10,332 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:10,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:10,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:10,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:10,420 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:10,420 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:10,421 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:10,421 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 02:19:10,421 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:10,421 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:10,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1015 [2022-12-13 02:19:10,421 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:19:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash -878357825, now seen corresponding path program 1 times [2022-12-13 02:19:10,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:10,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509681401] [2022-12-13 02:19:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:10,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:10,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:19:10,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:10,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509681401] [2022-12-13 02:19:10,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509681401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:10,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:10,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:10,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965373601] [2022-12-13 02:19:10,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:10,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:10,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:10,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:10,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:10,470 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:10,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:10,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:10,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:10,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:10,544 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:10,544 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:10,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:10,545 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:10,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:10,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:10,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:10,545 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:10,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:10,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:10,548 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,548 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:10,548 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:10,548 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:10,548 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,549 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:10,549 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:10,549 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:10,554 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:10,554 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:10,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:10,555 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:10,555 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:10,642 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:10,643 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:10,643 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:10,643 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 02:19:10,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:10,643 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:10,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1016 [2022-12-13 02:19:10,643 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:19:10,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:10,643 INFO L85 PathProgramCache]: Analyzing trace with hash -849728674, now seen corresponding path program 1 times [2022-12-13 02:19:10,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:10,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752011475] [2022-12-13 02:19:10,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:10,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:10,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:19:10,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:10,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752011475] [2022-12-13 02:19:10,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752011475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:10,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:10,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621362199] [2022-12-13 02:19:10,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:10,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:10,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:10,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:10,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:10,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:10,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:10,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:10,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:10,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:10,769 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:10,769 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:10,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:10,770 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:10,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:10,771 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:10,771 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:10,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:10,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:10,773 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:10,773 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:10,774 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:10,774 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,774 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:10,774 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:10,774 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:10,779 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:10,780 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:10,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:10,780 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:10,780 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:10,867 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:10,867 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:10,867 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:10,867 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 02:19:10,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:10,867 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:10,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1017 [2022-12-13 02:19:10,867 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:19:10,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash -821099523, now seen corresponding path program 1 times [2022-12-13 02:19:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:10,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405447167] [2022-12-13 02:19:10,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:10,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:10,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:19:10,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:10,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405447167] [2022-12-13 02:19:10,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405447167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:10,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:10,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:10,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798317616] [2022-12-13 02:19:10,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:10,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:10,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:10,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:10,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:10,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:10,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:10,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:10,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:10,991 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:10,992 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:10,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:10,993 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:10,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:10,993 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:10,993 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:10,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:10,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:10,996 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,996 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:10,996 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:10,996 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:10,996 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:10,997 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:10,997 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:10,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:11,002 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:11,002 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:11,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:11,003 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:11,003 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:11,090 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:11,091 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:11,091 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:11,091 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 02:19:11,091 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:11,091 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:11,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1018 [2022-12-13 02:19:11,091 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:19:11,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:11,091 INFO L85 PathProgramCache]: Analyzing trace with hash -792470372, now seen corresponding path program 1 times [2022-12-13 02:19:11,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:11,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014723131] [2022-12-13 02:19:11,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:11,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:19:11,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:11,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014723131] [2022-12-13 02:19:11,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014723131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:11,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:11,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:11,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766738101] [2022-12-13 02:19:11,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:11,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:11,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:11,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:11,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:11,140 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:11,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:11,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:11,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:11,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:11,206 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:11,207 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:11,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:11,208 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:11,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:11,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:11,208 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:11,208 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:11,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:11,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:11,211 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:11,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:11,211 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:11,211 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:11,211 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:11,211 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:11,211 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:11,211 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:11,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:11,217 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:11,217 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:11,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:11,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:11,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:11,307 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:11,307 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:19:11,308 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:11,308 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 02:19:11,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:11,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:11,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1019 [2022-12-13 02:19:11,308 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:19:11,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash -763841221, now seen corresponding path program 1 times [2022-12-13 02:19:11,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:11,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756295147] [2022-12-13 02:19:11,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:11,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:11,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:19:11,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:11,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756295147] [2022-12-13 02:19:11,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756295147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:11,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:11,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:11,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184589578] [2022-12-13 02:19:11,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:11,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:11,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:11,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:11,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:11,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:11,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:11,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:11,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:11,431 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:11,431 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:11,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:11,432 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:11,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:11,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:11,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:11,433 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:11,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:11,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:11,436 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:11,436 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:11,436 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:11,436 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:11,436 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:11,436 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:11,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:11,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:11,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:11,442 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:11,442 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:11,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:11,442 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:11,442 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:11,528 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:11,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:11,529 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:11,529 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 02:19:11,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:11,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:11,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1020 [2022-12-13 02:19:11,529 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:19:11,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:11,529 INFO L85 PathProgramCache]: Analyzing trace with hash -735212070, now seen corresponding path program 1 times [2022-12-13 02:19:11,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:11,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365795943] [2022-12-13 02:19:11,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:11,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:11,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:19:11,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:11,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365795943] [2022-12-13 02:19:11,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365795943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:11,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:11,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:11,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588599635] [2022-12-13 02:19:11,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:11,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:11,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:11,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:11,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:11,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:11,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:11,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:11,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:11,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:11,650 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:11,650 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:19:11,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:11,651 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:11,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:11,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:11,651 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:11,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:11,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:11,654 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:11,654 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:11,654 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:11,654 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:11,654 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:11,654 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:11,654 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:11,654 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:11,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:11,660 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:11,660 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:11,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:11,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:11,661 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:11,747 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:11,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:11,747 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:11,747 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 02:19:11,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:11,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:11,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1021 [2022-12-13 02:19:11,747 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:19:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash -706582919, now seen corresponding path program 1 times [2022-12-13 02:19:11,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:11,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559566108] [2022-12-13 02:19:11,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:11,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:11,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:19:11,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:11,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559566108] [2022-12-13 02:19:11,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559566108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:11,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:11,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:11,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137256315] [2022-12-13 02:19:11,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:11,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:11,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:11,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:11,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:11,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:11,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:11,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:11,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:11,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:11,869 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:11,870 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:11,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:11,871 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:11,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:11,871 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:11,871 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:11,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:11,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:11,874 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:11,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:11,874 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:11,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:11,874 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:11,874 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:11,874 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:11,874 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:11,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:11,880 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:11,880 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:11,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:11,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:11,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:11,967 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:11,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:11,968 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:11,968 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 02:19:11,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:11,968 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:11,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1022 [2022-12-13 02:19:11,968 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:19:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash -677953768, now seen corresponding path program 1 times [2022-12-13 02:19:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:11,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254811490] [2022-12-13 02:19:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:12,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:19:12,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:12,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254811490] [2022-12-13 02:19:12,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254811490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:12,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:12,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:12,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323722291] [2022-12-13 02:19:12,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:12,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:12,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:12,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:12,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:12,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:12,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:12,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:12,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:12,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:12,106 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:12,106 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:12,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:12,107 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:12,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:12,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:12,108 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:12,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:12,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:12,110 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:12,110 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:12,110 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:12,111 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:12,111 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:12,111 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:12,111 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:12,111 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:12,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:12,116 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:12,116 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:12,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:12,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:12,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:12,202 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:12,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:12,202 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:12,202 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 02:19:12,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:12,203 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:12,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1023 [2022-12-13 02:19:12,203 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:19:12,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash -649324617, now seen corresponding path program 1 times [2022-12-13 02:19:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:12,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659585386] [2022-12-13 02:19:12,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:12,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 02:19:12,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:12,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659585386] [2022-12-13 02:19:12,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659585386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:12,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:12,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:12,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764836083] [2022-12-13 02:19:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:12,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:12,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:12,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:12,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:12,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:12,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:12,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:12,358 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:12,358 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:12,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:12,359 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:12,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:12,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:12,360 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:12,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:12,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:12,362 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:12,362 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:12,362 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:12,362 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:12,362 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:12,363 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:12,363 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:12,363 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:12,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:12,368 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:12,368 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:12,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:12,369 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:12,369 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:12,457 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:12,457 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:12,457 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:12,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:12,458 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:12,458 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:12,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1024 [2022-12-13 02:19:12,458 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:19:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:12,458 INFO L85 PathProgramCache]: Analyzing trace with hash -620695466, now seen corresponding path program 1 times [2022-12-13 02:19:12,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:12,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593170268] [2022-12-13 02:19:12,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:12,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:12,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:19:12,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:12,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593170268] [2022-12-13 02:19:12,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593170268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:12,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:12,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:12,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373138956] [2022-12-13 02:19:12,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:12,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:12,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:12,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:12,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:12,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:12,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:12,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:12,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:12,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:12,572 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:12,573 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:12,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:12,574 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:12,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:12,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:12,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:12,574 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:12,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:12,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:12,577 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:12,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:12,577 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:12,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:12,577 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:12,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:12,577 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:12,578 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:12,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:12,583 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:12,583 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:12,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:12,584 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:12,584 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:12,671 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:12,672 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:12,672 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:12,672 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 02:19:12,672 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:12,672 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:12,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1025 [2022-12-13 02:19:12,672 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:19:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash -592066315, now seen corresponding path program 1 times [2022-12-13 02:19:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:12,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198314216] [2022-12-13 02:19:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:12,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:12,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:19:12,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:12,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198314216] [2022-12-13 02:19:12,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198314216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:12,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:12,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:12,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58354402] [2022-12-13 02:19:12,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:12,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:12,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:12,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:12,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:12,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:12,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:12,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:12,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:12,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:12,793 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:12,793 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:12,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:12,794 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:12,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:12,795 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:12,795 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:12,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:12,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:12,797 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:12,798 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:12,798 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:12,798 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:12,798 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:12,798 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:12,798 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:12,798 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:12,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:12,804 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:12,804 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:12,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:12,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:12,804 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:12,891 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:12,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:12,892 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:12,892 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 02:19:12,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:12,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:12,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1026 [2022-12-13 02:19:12,892 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:19:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:12,892 INFO L85 PathProgramCache]: Analyzing trace with hash -563437164, now seen corresponding path program 1 times [2022-12-13 02:19:12,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:12,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889637500] [2022-12-13 02:19:12,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:12,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:12,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:19:12,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:12,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889637500] [2022-12-13 02:19:12,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889637500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:12,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:12,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:12,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008651181] [2022-12-13 02:19:12,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:12,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:12,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:12,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:12,956 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:12,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:12,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:12,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:12,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:13,037 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:13,037 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:13,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:13,038 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:13,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:13,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:13,039 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:13,039 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:13,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:13,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:13,042 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:13,042 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:13,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:13,042 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,042 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:13,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:13,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:13,048 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:13,048 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:13,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:13,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:13,049 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:13,135 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:13,136 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:13,136 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:13,136 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 02:19:13,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:13,136 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:13,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1027 [2022-12-13 02:19:13,136 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:19:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash -534808013, now seen corresponding path program 1 times [2022-12-13 02:19:13,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:13,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508454156] [2022-12-13 02:19:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:13,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:19:13,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:13,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508454156] [2022-12-13 02:19:13,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508454156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:13,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:13,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:13,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487644249] [2022-12-13 02:19:13,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:13,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:13,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:13,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:13,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:13,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:13,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:13,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:13,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:13,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:13,264 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:13,264 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:13,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:13,265 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:13,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:13,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:13,265 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:13,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:13,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:13,268 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,268 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:13,268 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:13,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:13,268 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,268 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:13,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:13,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:13,274 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:13,274 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:13,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:13,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:13,275 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:13,362 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:13,362 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:13,362 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:13,362 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 02:19:13,363 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:13,363 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:13,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1028 [2022-12-13 02:19:13,363 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:19:13,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash -506178862, now seen corresponding path program 1 times [2022-12-13 02:19:13,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:13,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747269181] [2022-12-13 02:19:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:13,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:13,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:19:13,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:13,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747269181] [2022-12-13 02:19:13,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747269181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:13,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:13,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:13,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466176349] [2022-12-13 02:19:13,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:13,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:13,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:13,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:13,410 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:13,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:13,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:13,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:13,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:13,475 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:13,475 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:13,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:13,476 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:13,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:13,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:13,477 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:13,477 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:13,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:13,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:13,479 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,479 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:13,480 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:13,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:13,480 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,480 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:13,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:13,480 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:13,485 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:13,486 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:13,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:13,486 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:13,486 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:13,575 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:13,575 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:13,575 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:13,575 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 02:19:13,575 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:13,575 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:13,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1029 [2022-12-13 02:19:13,575 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:19:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash -477549711, now seen corresponding path program 1 times [2022-12-13 02:19:13,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:13,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753151197] [2022-12-13 02:19:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:13,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:13,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:19:13,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:13,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753151197] [2022-12-13 02:19:13,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753151197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:13,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:13,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:13,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618499578] [2022-12-13 02:19:13,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:13,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:13,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:13,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:13,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:13,624 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:13,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:13,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:13,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:13,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:13,700 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:13,700 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:19:13,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:13,701 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:13,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:13,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:13,702 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:13,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:13,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:13,704 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:13,705 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:13,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:13,705 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,705 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:13,705 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:13,705 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:13,711 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:13,711 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:13,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:13,711 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:13,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:13,799 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:13,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:13,799 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:13,799 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 02:19:13,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:13,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:13,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1030 [2022-12-13 02:19:13,800 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:19:13,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:13,800 INFO L85 PathProgramCache]: Analyzing trace with hash -448920560, now seen corresponding path program 1 times [2022-12-13 02:19:13,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:13,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51856224] [2022-12-13 02:19:13,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:13,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:13,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:19:13,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:13,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51856224] [2022-12-13 02:19:13,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51856224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:13,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:13,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041850537] [2022-12-13 02:19:13,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:13,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:13,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:13,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:13,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:13,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:13,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:13,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:13,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:13,924 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:13,924 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:13,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:13,926 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:13,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:13,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:13,926 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:13,926 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:13,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:13,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:13,929 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,929 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:13,929 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:13,929 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:13,929 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,929 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:13,929 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:13,929 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:13,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:13,935 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:13,935 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:13,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:13,936 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:13,936 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:14,023 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:14,024 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:14,024 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:14,024 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 02:19:14,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:14,024 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:14,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1031 [2022-12-13 02:19:14,024 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:19:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash -420291409, now seen corresponding path program 1 times [2022-12-13 02:19:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:14,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584737421] [2022-12-13 02:19:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:14,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:19:14,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:14,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584737421] [2022-12-13 02:19:14,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584737421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:14,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:14,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:14,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18759668] [2022-12-13 02:19:14,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:14,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:14,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:14,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:14,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:14,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:14,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:14,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:14,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:14,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:14,139 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:14,140 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:19:14,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:14,141 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:14,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:14,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:14,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:14,141 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:14,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:14,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:14,150 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:14,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:14,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:14,151 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:14,151 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:14,151 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:14,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:14,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:14,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:14,157 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:14,157 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:14,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:14,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:14,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:14,244 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:14,244 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:14,244 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:14,244 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 02:19:14,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:14,245 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:14,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1032 [2022-12-13 02:19:14,245 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:19:14,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash -391662258, now seen corresponding path program 1 times [2022-12-13 02:19:14,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:14,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231319776] [2022-12-13 02:19:14,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:14,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:19:14,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:14,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231319776] [2022-12-13 02:19:14,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231319776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:14,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:14,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:14,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806460297] [2022-12-13 02:19:14,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:14,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:14,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:14,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:14,292 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:14,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:14,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:14,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:14,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:14,367 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:14,367 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:14,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:14,368 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:14,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:14,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:14,369 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:14,369 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:14,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:14,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:14,371 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:14,371 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:14,371 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:14,371 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:14,372 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:14,372 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:14,372 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:14,372 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:14,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:14,377 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:14,377 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:14,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:14,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:14,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:14,466 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:14,467 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:19:14,467 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:14,467 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 02:19:14,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:14,467 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:14,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1033 [2022-12-13 02:19:14,467 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:19:14,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash -363033107, now seen corresponding path program 1 times [2022-12-13 02:19:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:14,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039449410] [2022-12-13 02:19:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:14,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:14,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:19:14,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:14,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039449410] [2022-12-13 02:19:14,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039449410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:14,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:14,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:14,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646088747] [2022-12-13 02:19:14,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:14,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:14,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:14,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:14,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:14,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:14,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:14,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:14,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:14,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:14,593 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:14,594 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:14,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:14,595 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:14,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:14,595 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:14,595 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:14,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:14,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:14,598 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:14,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:14,598 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:14,598 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:14,598 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:14,598 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:14,598 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:14,598 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:14,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:14,604 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:14,604 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:14,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:14,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:14,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:14,690 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:14,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:14,691 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:14,691 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 02:19:14,691 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:14,691 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:14,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1034 [2022-12-13 02:19:14,691 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:19:14,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:14,691 INFO L85 PathProgramCache]: Analyzing trace with hash -334403956, now seen corresponding path program 1 times [2022-12-13 02:19:14,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:14,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629177125] [2022-12-13 02:19:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:14,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:14,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:19:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:14,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629177125] [2022-12-13 02:19:14,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629177125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:14,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:14,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:14,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719359162] [2022-12-13 02:19:14,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:14,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:14,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:14,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:14,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:14,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:14,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:14,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:14,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:14,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:14,815 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:14,815 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:14,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:14,816 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:14,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:14,817 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:14,817 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:14,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:14,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:14,819 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:14,819 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:14,820 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:14,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:14,820 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:14,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:14,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:14,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:14,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:14,826 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:14,826 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:14,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:14,826 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:14,826 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:14,913 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:14,913 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:14,913 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:14,914 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 02:19:14,914 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:14,914 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:14,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1035 [2022-12-13 02:19:14,914 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:19:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash -305774805, now seen corresponding path program 1 times [2022-12-13 02:19:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:14,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032193251] [2022-12-13 02:19:14,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:14,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:14,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:19:14,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:14,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032193251] [2022-12-13 02:19:14,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032193251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:14,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:14,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:14,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164564431] [2022-12-13 02:19:14,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:14,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:14,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:14,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:14,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:14,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:14,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:14,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:14,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:14,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:15,030 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:15,030 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:15,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:15,031 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:15,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:15,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:15,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:15,031 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:15,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:15,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:15,034 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,034 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:15,034 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:15,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:15,034 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:15,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:15,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:15,047 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:15,048 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:15,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:15,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:15,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:15,134 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:15,134 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:19:15,134 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:15,134 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 02:19:15,134 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:15,134 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:15,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1036 [2022-12-13 02:19:15,134 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:19:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash -277145654, now seen corresponding path program 1 times [2022-12-13 02:19:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:15,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874318751] [2022-12-13 02:19:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:15,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:15,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:19:15,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:15,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874318751] [2022-12-13 02:19:15,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874318751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:15,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:15,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:15,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682591915] [2022-12-13 02:19:15,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:15,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:15,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:15,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:15,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:15,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:15,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:15,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:15,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:15,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:15,274 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:15,274 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:15,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:15,275 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:15,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:15,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:15,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:15,276 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:15,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:15,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:15,278 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:15,278 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:15,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:15,279 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,279 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:15,279 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:15,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:15,284 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:15,284 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:15,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:15,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:15,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:15,372 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:15,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:15,372 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:15,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:15,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:15,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:15,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1037 [2022-12-13 02:19:15,372 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:19:15,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:15,372 INFO L85 PathProgramCache]: Analyzing trace with hash -248516503, now seen corresponding path program 1 times [2022-12-13 02:19:15,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:15,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582409635] [2022-12-13 02:19:15,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:15,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:15,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:19:15,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:15,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582409635] [2022-12-13 02:19:15,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582409635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:15,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:15,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:15,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537207067] [2022-12-13 02:19:15,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:15,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:15,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:15,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:15,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:15,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:15,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:15,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:15,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:15,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:15,497 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:15,497 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:15,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:15,498 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:15,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:15,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:15,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:15,499 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:15,499 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:15,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:15,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:15,501 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,502 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:15,502 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:15,502 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:15,502 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,502 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:15,502 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:15,502 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:15,508 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:15,508 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:15,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:15,508 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:15,508 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:15,595 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:15,596 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:15,596 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:15,596 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 02:19:15,596 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:15,596 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:15,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1038 [2022-12-13 02:19:15,596 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:19:15,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:15,596 INFO L85 PathProgramCache]: Analyzing trace with hash -219887352, now seen corresponding path program 1 times [2022-12-13 02:19:15,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:15,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874722371] [2022-12-13 02:19:15,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:15,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:15,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:19:15,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:15,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874722371] [2022-12-13 02:19:15,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874722371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:15,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:15,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488587202] [2022-12-13 02:19:15,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:15,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:15,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:15,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:15,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:15,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:15,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:15,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:15,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:15,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:15,717 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:15,717 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:15,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:15,718 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:15,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:15,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:15,719 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:15,719 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:15,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:15,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:15,722 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:15,722 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:15,722 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:15,722 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,722 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:15,722 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:15,722 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:15,728 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:15,728 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:15,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:15,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:15,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:15,838 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:15,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:19:15,838 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:15,839 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 02:19:15,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:15,839 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:15,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1039 [2022-12-13 02:19:15,839 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:19:15,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:15,839 INFO L85 PathProgramCache]: Analyzing trace with hash -191258201, now seen corresponding path program 1 times [2022-12-13 02:19:15,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:15,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767459060] [2022-12-13 02:19:15,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:15,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:15,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:19:15,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:15,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767459060] [2022-12-13 02:19:15,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767459060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:15,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:15,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:15,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343939552] [2022-12-13 02:19:15,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:15,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:15,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:15,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:15,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:15,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:15,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:15,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:15,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:15,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:15,987 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:15,987 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:15,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:15,988 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:15,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:15,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:15,989 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:15,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:15,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:15,992 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,992 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:15,992 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:15,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:15,992 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:15,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:15,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:15,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:16,005 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:16,005 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:16,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:16,006 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:16,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:16,093 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:16,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:19:16,095 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:16,095 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 02:19:16,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:16,095 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:16,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1040 [2022-12-13 02:19:16,095 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:19:16,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:16,095 INFO L85 PathProgramCache]: Analyzing trace with hash -162629050, now seen corresponding path program 1 times [2022-12-13 02:19:16,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:16,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366328405] [2022-12-13 02:19:16,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:19:16,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:16,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366328405] [2022-12-13 02:19:16,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366328405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:16,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:16,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:16,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404047825] [2022-12-13 02:19:16,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:16,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:16,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:16,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:16,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:16,145 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:16,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:16,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:16,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:16,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:16,211 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:16,211 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:16,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:16,212 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:16,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:16,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:16,213 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:16,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:16,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:16,215 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:16,215 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:16,216 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:16,216 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:16,216 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:16,216 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:16,216 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:16,216 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:16,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:16,221 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:16,222 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:16,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:16,222 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:16,222 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:16,309 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:16,310 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:16,310 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:16,310 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 02:19:16,310 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:16,310 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:16,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1041 [2022-12-13 02:19:16,310 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:19:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:16,310 INFO L85 PathProgramCache]: Analyzing trace with hash -133999899, now seen corresponding path program 1 times [2022-12-13 02:19:16,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:16,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852445020] [2022-12-13 02:19:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:16,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:16,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:19:16,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:16,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852445020] [2022-12-13 02:19:16,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852445020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:16,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:16,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:16,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136465706] [2022-12-13 02:19:16,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:16,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:16,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:16,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:16,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:16,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:16,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:16,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:16,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:16,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:16,425 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:16,425 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:16,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:16,426 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:16,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:16,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:16,427 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:16,427 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:16,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:16,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:16,429 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:16,429 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:16,429 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:16,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:16,430 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:16,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:16,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:16,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:16,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:16,435 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:16,435 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:16,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:16,436 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:16,436 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:16,524 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:16,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:16,524 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:16,524 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 02:19:16,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:16,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:16,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1042 [2022-12-13 02:19:16,524 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:19:16,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:16,524 INFO L85 PathProgramCache]: Analyzing trace with hash -105370748, now seen corresponding path program 1 times [2022-12-13 02:19:16,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:16,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480932126] [2022-12-13 02:19:16,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:16,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:16,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:19:16,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:16,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480932126] [2022-12-13 02:19:16,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480932126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:16,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:16,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052827258] [2022-12-13 02:19:16,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:16,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:16,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:16,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:16,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:16,573 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:16,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:16,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:16,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:16,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:16,648 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:16,648 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:16,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:16,650 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:16,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:16,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:16,650 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:16,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:16,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:16,653 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:16,653 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:16,653 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:16,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:16,653 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:16,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:16,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:16,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:16,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:16,659 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:16,659 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:16,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:16,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:16,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:16,747 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:16,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:16,747 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:16,747 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 02:19:16,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:16,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:16,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1043 [2022-12-13 02:19:16,747 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:19:16,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash -76741597, now seen corresponding path program 1 times [2022-12-13 02:19:16,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:16,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55447349] [2022-12-13 02:19:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:16,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:19:16,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:16,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55447349] [2022-12-13 02:19:16,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55447349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:16,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:16,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116095911] [2022-12-13 02:19:16,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:16,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:16,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:16,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:16,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:16,813 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:16,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:16,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:16,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:16,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:16,881 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:16,881 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:16,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:16,882 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:16,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:16,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:16,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:16,882 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:16,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:16,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:16,885 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:16,885 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:16,885 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:16,885 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:16,885 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:16,886 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:16,886 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:16,886 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:16,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:16,898 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:16,898 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:16,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:16,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:16,899 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:16,986 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:16,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:19:16,986 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:16,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:16,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:16,987 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:16,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1044 [2022-12-13 02:19:16,987 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:19:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash -48112446, now seen corresponding path program 1 times [2022-12-13 02:19:16,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:16,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534695559] [2022-12-13 02:19:16,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:16,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19: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:19:17,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:17,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534695559] [2022-12-13 02:19:17,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534695559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:17,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:17,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:17,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580076794] [2022-12-13 02:19:17,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:17,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:17,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:17,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:17,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:17,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:17,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:17,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:17,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:17,135 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:17,135 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:17,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:17,137 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:17,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:17,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:17,137 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:17,137 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:17,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:17,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:17,140 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:17,140 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:17,140 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:17,140 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:17,140 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:17,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:17,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:17,140 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:17,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:17,146 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:17,146 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:17,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:17,147 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:17,147 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:17,234 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:17,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:17,235 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:17,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:17,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:17,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:17,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1045 [2022-12-13 02:19:17,235 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:19:17,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash -19483295, now seen corresponding path program 1 times [2022-12-13 02:19:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:17,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175892122] [2022-12-13 02:19:17,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:17,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:17,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:19:17,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:17,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175892122] [2022-12-13 02:19:17,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175892122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:17,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:17,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:17,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249415968] [2022-12-13 02:19:17,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:17,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:17,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:17,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:17,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:17,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:17,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:17,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:17,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:17,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:17,359 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:17,359 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:17,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:17,360 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:17,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:17,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:17,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:17,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:17,361 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:17,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:17,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:17,363 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:17,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:17,364 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:17,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:17,364 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:17,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:17,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:17,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:17,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:17,369 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:17,369 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:19:17,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:17,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:17,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:17,458 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:17,458 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:17,458 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:17,458 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 02:19:17,458 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:17,458 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:17,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1046 [2022-12-13 02:19:17,458 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:19:17,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash 9145856, now seen corresponding path program 1 times [2022-12-13 02:19:17,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:17,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346933563] [2022-12-13 02:19:17,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:17,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:17,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:19:17,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:17,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346933563] [2022-12-13 02:19:17,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346933563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:17,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:17,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:17,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964427931] [2022-12-13 02:19:17,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:17,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:17,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:17,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:17,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:17,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:17,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:17,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:17,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:17,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:17,583 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:17,583 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:17,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:17,584 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:17,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:17,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:17,585 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:17,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:17,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:17,588 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:17,588 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:17,588 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:17,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:17,588 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:17,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:17,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:17,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:17,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:17,594 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:17,594 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:17,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:17,594 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:17,594 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:17,683 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:17,683 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:17,683 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:17,683 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 02:19:17,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:17,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:17,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1047 [2022-12-13 02:19:17,684 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:19:17,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:17,684 INFO L85 PathProgramCache]: Analyzing trace with hash 37775007, now seen corresponding path program 1 times [2022-12-13 02:19:17,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:17,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248680412] [2022-12-13 02:19:17,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:17,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:17,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:19:17,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:17,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248680412] [2022-12-13 02:19:17,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248680412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:17,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:17,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:17,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183648729] [2022-12-13 02:19:17,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:17,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:17,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:17,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:17,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:17,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:17,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:17,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:17,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:17,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:17,799 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:17,799 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:17,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:17,800 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:17,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:17,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:17,801 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:17,801 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:17,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:17,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:17,812 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:17,812 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:17,812 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:17,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:17,812 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:17,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:17,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:17,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:17,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:17,818 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:17,818 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:17,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:17,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:17,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:17,907 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:17,907 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:17,907 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:17,907 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 02:19:17,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:17,907 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:17,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1048 [2022-12-13 02:19:17,907 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:19:17,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:17,908 INFO L85 PathProgramCache]: Analyzing trace with hash 66404158, now seen corresponding path program 1 times [2022-12-13 02:19:17,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:17,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350929427] [2022-12-13 02:19:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:17,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:19:17,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:17,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350929427] [2022-12-13 02:19:17,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350929427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:17,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:17,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:17,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544684135] [2022-12-13 02:19:17,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:17,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:17,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:17,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:17,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:17,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:17,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:17,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:17,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:18,024 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:18,025 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:18,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:18,026 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:18,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:18,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:18,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:18,026 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:18,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:18,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:18,029 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,029 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:18,029 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:18,029 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:18,029 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,029 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:18,029 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:18,029 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:18,035 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:18,035 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:18,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:18,036 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:18,036 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:18,124 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:18,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:19:18,125 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:18,125 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 02:19:18,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:18,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:18,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1049 [2022-12-13 02:19:18,125 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:19:18,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:18,125 INFO L85 PathProgramCache]: Analyzing trace with hash 95033309, now seen corresponding path program 1 times [2022-12-13 02:19:18,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:18,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677457134] [2022-12-13 02:19:18,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:18,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:18,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:19:18,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:18,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677457134] [2022-12-13 02:19:18,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677457134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:18,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:18,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:18,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388682964] [2022-12-13 02:19:18,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:18,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:18,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:18,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:18,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:18,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:18,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:18,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:18,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:18,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:18,251 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:18,252 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:18,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:18,253 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:18,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:18,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:18,253 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:18,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:18,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:18,256 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,256 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:18,256 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:18,256 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:18,256 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,256 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:18,256 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:18,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:18,262 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:18,262 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:18,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:18,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:18,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:18,350 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:18,351 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:18,351 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:18,351 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 02:19:18,351 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:18,351 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:18,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1050 [2022-12-13 02:19:18,351 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:19:18,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:18,351 INFO L85 PathProgramCache]: Analyzing trace with hash 123662460, now seen corresponding path program 1 times [2022-12-13 02:19:18,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:18,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36922096] [2022-12-13 02:19:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:18,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:18,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:19:18,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:18,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36922096] [2022-12-13 02:19:18,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36922096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:18,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:18,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883424799] [2022-12-13 02:19:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:18,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:18,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:18,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:18,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:18,398 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:18,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:18,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:18,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:18,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:18,465 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:18,465 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:18,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1109 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:18,466 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:18,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:18,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:18,467 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:18,467 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:18,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:18,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:18,469 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,469 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:18,469 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:18,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:18,469 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,469 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:18,469 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:18,470 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:18,475 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:18,475 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:19:18,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:18,476 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:18,476 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:18,563 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:18,563 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:18,563 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:18,564 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 02:19:18,564 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:18,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:18,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1051 [2022-12-13 02:19:18,564 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:19:18,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash 152291611, now seen corresponding path program 1 times [2022-12-13 02:19:18,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:18,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842660279] [2022-12-13 02:19:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:18,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:18,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:19:18,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:18,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842660279] [2022-12-13 02:19:18,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842660279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:18,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:18,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:18,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50173043] [2022-12-13 02:19:18,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:18,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:18,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:18,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:18,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:18,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:18,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:18,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:18,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:18,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:18,688 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:18,688 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:18,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:18,689 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:18,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:18,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:18,690 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:18,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:18,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:18,692 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,693 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:18,693 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:18,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:18,693 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:18,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:18,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:18,707 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:18,707 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:18,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:18,708 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:18,708 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:18,795 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:18,796 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:19:18,796 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:18,796 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 02:19:18,796 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:18,796 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:18,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1052 [2022-12-13 02:19:18,796 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:19:18,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:18,796 INFO L85 PathProgramCache]: Analyzing trace with hash 180920762, now seen corresponding path program 1 times [2022-12-13 02:19:18,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:18,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936210476] [2022-12-13 02:19:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:18,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:18,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 02:19:18,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:18,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936210476] [2022-12-13 02:19:18,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936210476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:18,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:18,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:18,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249179324] [2022-12-13 02:19:18,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:18,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:18,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:18,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:18,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:18,843 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:18,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:18,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:18,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:18,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:18,908 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:18,909 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:18,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:18,910 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:18,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:18,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:18,910 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:18,910 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:18,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:18,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:18,913 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,913 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:18,913 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:18,913 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:18,913 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,913 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:18,913 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:18,913 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:18,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:18,919 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:18,919 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:19:18,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:18,919 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:18,919 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:19,007 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:19,007 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:19,007 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:19,007 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 02:19:19,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:19,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:19,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1053 [2022-12-13 02:19:19,007 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:19:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:19,008 INFO L85 PathProgramCache]: Analyzing trace with hash 209549913, now seen corresponding path program 1 times [2022-12-13 02:19:19,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:19,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414675842] [2022-12-13 02:19:19,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:19,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:19,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:19:19,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:19,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414675842] [2022-12-13 02:19:19,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414675842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:19,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:19,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:19,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573942409] [2022-12-13 02:19:19,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:19,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:19,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:19,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:19,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:19,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:19,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:19,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:19,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:19,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:19,144 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:19,144 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:19,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:19,145 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:19,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:19,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:19,146 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:19,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:19,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:19,149 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:19,149 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:19,149 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:19,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:19,149 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:19,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:19,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:19,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:19,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:19,155 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:19,155 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:19,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:19,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:19,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:19,242 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:19,242 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:19,243 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:19,243 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 02:19:19,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:19,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:19,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1054 [2022-12-13 02:19:19,243 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:19:19,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:19,243 INFO L85 PathProgramCache]: Analyzing trace with hash 238179064, now seen corresponding path program 1 times [2022-12-13 02:19:19,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:19,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330236520] [2022-12-13 02:19:19,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:19,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:19,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:19:19,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:19,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330236520] [2022-12-13 02:19:19,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330236520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:19,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:19,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:19,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645793714] [2022-12-13 02:19:19,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:19,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:19,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:19,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:19,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:19,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:19,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:19,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:19,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:19,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:19,356 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:19,356 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:19,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:19,357 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:19,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:19,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:19,357 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:19,358 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:19,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:19,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:19,360 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:19,360 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:19,360 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:19,360 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:19,360 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:19,360 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:19,360 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:19,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:19,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:19,366 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:19,366 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:19,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:19,367 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:19,367 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:19,452 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:19,452 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:19,452 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:19,452 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 02:19:19,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:19,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:19,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1055 [2022-12-13 02:19:19,452 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:19:19,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:19,453 INFO L85 PathProgramCache]: Analyzing trace with hash 266808215, now seen corresponding path program 1 times [2022-12-13 02:19:19,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:19,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742928494] [2022-12-13 02:19:19,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:19,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:19,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:19:19,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:19,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742928494] [2022-12-13 02:19:19,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742928494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:19,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:19,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:19,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502592057] [2022-12-13 02:19:19,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:19,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:19,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:19,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:19,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:19,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:19,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:19,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:19,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:19,576 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:19,576 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:19,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:19,577 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:19,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:19,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:19,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:19,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:19,578 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:19,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:19,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:19,580 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:19,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:19,580 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:19,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:19,580 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:19,581 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:19,581 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:19,581 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:19,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:19,586 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:19,586 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:19,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:19,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:19,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:19,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:19,681 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:19:19,681 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:19,681 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 02:19:19,681 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:19,681 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:19,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1056 [2022-12-13 02:19:19,681 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:19:19,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash 295437366, now seen corresponding path program 1 times [2022-12-13 02:19:19,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:19,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718855884] [2022-12-13 02:19:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:19,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:19,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:19:19,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:19,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718855884] [2022-12-13 02:19:19,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718855884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:19,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:19,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:19,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466100229] [2022-12-13 02:19:19,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:19,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:19,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:19,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:19,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:19,731 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:19,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:19,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:19,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:19,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:19,796 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:19,796 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:19,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:19,797 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:19,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:19,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:19,797 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:19,797 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:19,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:19,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:19,800 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:19,800 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:19,800 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:19,800 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:19,800 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:19,800 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:19,800 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:19,801 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:19,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:19,806 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:19,806 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:19,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:19,807 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:19,807 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:19,893 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:19,893 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:19,893 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:19,893 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 02:19:19,893 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:19,894 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:19,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1057 [2022-12-13 02:19:19,894 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:19:19,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:19,894 INFO L85 PathProgramCache]: Analyzing trace with hash 324066517, now seen corresponding path program 1 times [2022-12-13 02:19:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:19,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606955343] [2022-12-13 02:19:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:19,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:19:19,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:19,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606955343] [2022-12-13 02:19:19,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606955343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:19,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:19,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:19,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724834388] [2022-12-13 02:19:19,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:19,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:19,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:19,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:19,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:19,944 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:19,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:19,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:19,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:19,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:20,019 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:20,020 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:20,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:20,021 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:20,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:20,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:20,021 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:20,021 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:20,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:20,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:20,024 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,024 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:20,024 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:20,024 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:20,024 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,024 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:20,024 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:20,025 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:20,030 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:20,030 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:19:20,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:20,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:20,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:20,116 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:20,116 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:20,116 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:20,116 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 02:19:20,116 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:20,116 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:20,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1058 [2022-12-13 02:19:20,117 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:19:20,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:20,117 INFO L85 PathProgramCache]: Analyzing trace with hash 352695668, now seen corresponding path program 1 times [2022-12-13 02:19:20,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:20,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340749332] [2022-12-13 02:19:20,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:20,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:20,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:19:20,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:20,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340749332] [2022-12-13 02:19:20,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340749332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:20,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:20,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:20,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919593762] [2022-12-13 02:19:20,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:20,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:20,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:20,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:20,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:20,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:20,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:20,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:20,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:20,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:20,232 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:20,232 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:19:20,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:20,233 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:20,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:20,234 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:20,234 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:20,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:20,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:20,236 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,236 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:20,237 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:20,237 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:20,237 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:20,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:20,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:20,242 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:20,243 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:19:20,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:20,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:20,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:20,329 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:20,330 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:20,330 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:20,330 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 02:19:20,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:20,330 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:20,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1059 [2022-12-13 02:19:20,330 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:19:20,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:20,330 INFO L85 PathProgramCache]: Analyzing trace with hash 381324819, now seen corresponding path program 1 times [2022-12-13 02:19:20,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:20,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940486398] [2022-12-13 02:19:20,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:20,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:20,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:19:20,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:20,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940486398] [2022-12-13 02:19:20,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940486398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:20,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:20,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:20,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259459400] [2022-12-13 02:19:20,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:20,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:20,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:20,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:20,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:20,378 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:20,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:20,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:20,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:20,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:20,452 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:20,452 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:20,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:20,453 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:20,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:20,453 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:20,453 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:20,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:20,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:20,456 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,456 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:20,456 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:20,456 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:20,456 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:20,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:20,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:20,462 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:20,462 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:20,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:20,463 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:20,463 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:20,558 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:20,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:19:20,559 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:20,559 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 02:19:20,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:20,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:20,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1060 [2022-12-13 02:19:20,559 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:19:20,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:20,559 INFO L85 PathProgramCache]: Analyzing trace with hash 409953970, now seen corresponding path program 1 times [2022-12-13 02:19:20,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:20,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653957486] [2022-12-13 02:19:20,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:20,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 02:19:20,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:20,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653957486] [2022-12-13 02:19:20,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653957486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:20,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:20,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:20,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212715596] [2022-12-13 02:19:20,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:20,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:20,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:20,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:20,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:20,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:20,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:20,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:20,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:20,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:20,685 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:20,686 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:20,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:20,687 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:20,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:20,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:20,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:20,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:20,687 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:20,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:20,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:20,690 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,690 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:20,690 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:20,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:20,690 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:20,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:20,690 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:20,696 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:20,696 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:20,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:20,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:20,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:20,784 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:20,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:20,784 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:20,784 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 02:19:20,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:20,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:20,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1061 [2022-12-13 02:19:20,785 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:19:20,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:20,785 INFO L85 PathProgramCache]: Analyzing trace with hash 438583121, now seen corresponding path program 1 times [2022-12-13 02:19:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:20,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702154815] [2022-12-13 02:19:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:20,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:19:20,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:20,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702154815] [2022-12-13 02:19:20,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702154815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:20,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:20,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:20,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449727340] [2022-12-13 02:19:20,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:20,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:20,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:20,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:20,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:20,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:20,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:20,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:20,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:20,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:20,917 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:20,917 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:20,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:20,918 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:20,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:20,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:20,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:20,918 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:20,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:20,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:20,921 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,921 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:20,921 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:20,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:20,921 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,922 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:20,922 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:20,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:20,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:20,927 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:20,927 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:20,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:20,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:20,928 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:21,014 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:21,015 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:21,015 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:21,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:21,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:21,015 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:21,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1062 [2022-12-13 02:19:21,015 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:19:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash 467212272, now seen corresponding path program 1 times [2022-12-13 02:19:21,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:21,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395524571] [2022-12-13 02:19:21,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:21,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:19:21,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:21,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395524571] [2022-12-13 02:19:21,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395524571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:21,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:21,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:21,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38786999] [2022-12-13 02:19:21,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:21,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:21,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:21,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:21,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:21,064 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:21,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:21,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:21,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:21,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:21,130 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:21,130 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:21,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:21,131 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:21,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:21,132 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:21,132 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:21,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:21,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:21,134 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:21,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:21,135 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:21,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:21,135 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:21,135 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:21,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:21,135 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:21,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:21,141 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:21,141 INFO L131 PetriNetUnfolder]: For 435/453 co-relation queries the response was YES. [2022-12-13 02:19:21,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/453 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:21,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:21,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:21,228 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:21,229 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:21,229 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:21,229 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 02:19:21,229 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:21,229 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:21,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1063 [2022-12-13 02:19:21,229 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:19:21,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:21,229 INFO L85 PathProgramCache]: Analyzing trace with hash 495841423, now seen corresponding path program 1 times [2022-12-13 02:19:21,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:21,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067106993] [2022-12-13 02:19:21,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:21,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:21,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:19:21,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:21,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067106993] [2022-12-13 02:19:21,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067106993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:21,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:21,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:21,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883931988] [2022-12-13 02:19:21,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:21,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:21,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:21,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:21,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:21,279 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:21,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:21,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:21,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:21,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:21,354 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:21,354 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:21,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:21,355 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:21,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:21,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:21,355 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:21,355 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:21,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:21,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:21,358 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:21,358 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:21,358 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:21,358 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:21,358 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:21,358 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:21,358 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:21,358 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:21,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:21,364 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:21,364 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:21,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:21,365 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:21,365 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:21,460 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:21,460 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:19:21,460 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:21,461 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 02:19:21,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:21,461 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:21,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1064 [2022-12-13 02:19:21,461 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:19:21,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 524470574, now seen corresponding path program 1 times [2022-12-13 02:19:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:21,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459144882] [2022-12-13 02:19:21,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:21,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:19:21,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:21,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459144882] [2022-12-13 02:19:21,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459144882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:21,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:21,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:21,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703077374] [2022-12-13 02:19:21,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:21,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:21,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:21,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:21,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:21,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:21,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:21,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:21,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:21,620 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:21,620 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:21,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:21,621 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:21,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:21,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:21,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:21,622 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:21,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:21,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:21,624 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:21,624 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:21,624 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:21,624 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:21,625 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:21,625 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:21,625 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:21,625 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:21,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:21,630 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:21,630 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:21,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:21,631 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:21,631 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:21,718 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:21,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:21,719 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:21,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:21,719 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:21,719 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:21,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1065 [2022-12-13 02:19:21,719 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:19:21,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:21,719 INFO L85 PathProgramCache]: Analyzing trace with hash 553099725, now seen corresponding path program 1 times [2022-12-13 02:19:21,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:21,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839640537] [2022-12-13 02:19:21,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:21,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:21,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 02:19:21,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:21,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839640537] [2022-12-13 02:19:21,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839640537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:21,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:21,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:21,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455442862] [2022-12-13 02:19:21,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:21,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:21,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:21,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:21,767 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:21,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:21,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:21,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:21,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:21,842 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:21,842 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:21,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:21,843 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:21,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:21,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:21,844 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:21,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:21,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:21,847 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:21,847 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:21,847 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:21,847 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:21,847 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:21,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:21,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:21,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:21,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:21,853 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:21,853 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:21,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:21,853 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:21,853 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:21,940 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:21,940 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:21,940 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:21,940 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 02:19:21,941 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:21,941 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:21,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1066 [2022-12-13 02:19:21,941 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:19:21,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash 581728876, now seen corresponding path program 1 times [2022-12-13 02:19:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:21,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150447380] [2022-12-13 02:19:21,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:21,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:22,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:19:22,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:22,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150447380] [2022-12-13 02:19:22,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150447380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:22,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:22,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74687172] [2022-12-13 02:19:22,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:22,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:22,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:22,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:22,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:22,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:22,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:22,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:22,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:22,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:22,081 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:22,081 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:22,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:22,082 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:22,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:22,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:22,083 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:22,083 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:22,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:22,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:22,085 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:22,085 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:22,086 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:22,086 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,086 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:22,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:22,086 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:22,091 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:22,091 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:22,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:22,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:22,092 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:22,179 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:22,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:22,179 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:22,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:22,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:22,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:22,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1067 [2022-12-13 02:19:22,180 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:19:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:22,180 INFO L85 PathProgramCache]: Analyzing trace with hash 610358027, now seen corresponding path program 1 times [2022-12-13 02:19:22,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:22,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208055736] [2022-12-13 02:19:22,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:22,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19: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:19:22,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:22,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208055736] [2022-12-13 02:19:22,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208055736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:22,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:22,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:22,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894257405] [2022-12-13 02:19:22,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:22,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:22,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:22,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:22,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:22,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:22,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:22,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:22,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:22,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:22,293 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:22,293 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:22,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:22,294 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:22,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:22,294 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:22,294 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:22,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:22,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:22,297 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:22,297 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:22,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:22,297 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:22,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:22,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:22,310 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:22,310 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:22,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:22,311 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:22,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:22,398 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:22,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:19:22,398 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:22,398 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 02:19:22,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:22,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:22,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1068 [2022-12-13 02:19:22,398 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:19:22,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash 638987178, now seen corresponding path program 1 times [2022-12-13 02:19:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:22,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402204550] [2022-12-13 02:19:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:22,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:19:22,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:22,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402204550] [2022-12-13 02:19:22,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402204550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:22,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:22,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:22,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862700957] [2022-12-13 02:19:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:22,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:22,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:22,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:22,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:22,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:22,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:22,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:22,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:22,515 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:22,515 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:22,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:22,516 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:22,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:22,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:22,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:22,516 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:22,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:22,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:22,519 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,519 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:22,519 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:22,519 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:22,519 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,520 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:22,520 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:22,520 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:22,525 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:22,525 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:22,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:22,526 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:22,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:22,614 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:22,615 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:19:22,615 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:22,615 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 02:19:22,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:22,615 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:22,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1069 [2022-12-13 02:19:22,615 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:19:22,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:22,615 INFO L85 PathProgramCache]: Analyzing trace with hash 667616329, now seen corresponding path program 1 times [2022-12-13 02:19:22,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:22,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643444594] [2022-12-13 02:19:22,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:22,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:22,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:19:22,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:22,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643444594] [2022-12-13 02:19:22,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643444594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:22,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:22,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:22,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163013741] [2022-12-13 02:19:22,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:22,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:22,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:22,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:22,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:22,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:22,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:22,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:22,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:22,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:22,740 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:22,740 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:22,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:22,741 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:22,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:22,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:22,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:22,741 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:22,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:22,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:22,744 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,744 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:22,744 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:22,744 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:22,744 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:22,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:22,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:22,750 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:22,750 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:22,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:22,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:22,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:22,837 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:22,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:22,838 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:22,838 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 02:19:22,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:22,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:22,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1070 [2022-12-13 02:19:22,838 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:19:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:22,838 INFO L85 PathProgramCache]: Analyzing trace with hash 696245480, now seen corresponding path program 1 times [2022-12-13 02:19:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:22,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137653362] [2022-12-13 02:19:22,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:22,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:22,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:19:22,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:22,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137653362] [2022-12-13 02:19:22,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137653362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:22,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:22,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:22,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695394495] [2022-12-13 02:19:22,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:22,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:22,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:22,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:22,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:22,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:22,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:22,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:22,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:22,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:22,963 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:22,963 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:22,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:22,965 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:22,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:22,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:22,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:22,965 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:22,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:22,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:22,967 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,968 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:22,968 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:22,968 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:22,968 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,968 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:22,968 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:22,968 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:22,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:22,974 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:22,974 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:19:22,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:22,974 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:22,974 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:23,061 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:23,062 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:23,062 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:23,062 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 02:19:23,062 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:23,062 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:23,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1071 [2022-12-13 02:19:23,062 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:19:23,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:23,062 INFO L85 PathProgramCache]: Analyzing trace with hash 724874631, now seen corresponding path program 1 times [2022-12-13 02:19:23,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:23,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711603121] [2022-12-13 02:19:23,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:23,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:23,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 02:19:23,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:23,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711603121] [2022-12-13 02:19:23,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711603121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:23,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:23,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:23,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344807047] [2022-12-13 02:19:23,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:23,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:23,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:23,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:23,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:23,111 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:23,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:23,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:23,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:23,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:23,176 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:23,176 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:23,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:23,177 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:23,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:23,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:23,177 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:23,177 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:23,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:23,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:23,180 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:23,180 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:23,180 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:23,180 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:23,180 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:23,180 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:23,181 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:23,181 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:23,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:23,194 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:23,194 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:23,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:23,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:23,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:23,280 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:23,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:19:23,281 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:23,281 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 02:19:23,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:23,281 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:23,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1072 [2022-12-13 02:19:23,281 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:19:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash 753503782, now seen corresponding path program 1 times [2022-12-13 02:19:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:23,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269135793] [2022-12-13 02:19:23,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:23,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:23,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:19:23,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:23,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269135793] [2022-12-13 02:19:23,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269135793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:23,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:23,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:23,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104773494] [2022-12-13 02:19:23,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:23,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:23,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:23,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:23,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:23,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:23,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:23,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:23,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:23,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:23,399 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:23,399 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:23,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:23,400 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:23,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:23,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:23,401 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:23,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:23,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:23,403 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:23,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:23,403 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:23,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:23,404 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:23,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:23,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:23,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:23,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:23,409 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:23,409 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:23,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:23,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:23,410 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:23,495 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:23,496 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:23,496 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:23,496 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 02:19:23,496 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:23,496 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:23,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1073 [2022-12-13 02:19:23,496 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:19:23,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash 782132933, now seen corresponding path program 1 times [2022-12-13 02:19:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:23,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035624020] [2022-12-13 02:19:23,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:23,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:19:23,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:23,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035624020] [2022-12-13 02:19:23,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035624020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:23,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:23,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:23,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736153345] [2022-12-13 02:19:23,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:23,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:23,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:23,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:23,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:23,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:23,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:23,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:23,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:23,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:23,623 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:23,623 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:23,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:23,624 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:23,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:23,624 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:23,624 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:23,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:23,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:23,627 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:23,627 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:23,627 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:23,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:23,627 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:23,627 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:23,627 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:23,627 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:23,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:23,633 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:23,633 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:23,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:23,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:23,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:23,719 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:23,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:23,719 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:23,720 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 02:19:23,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:23,720 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:23,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1074 [2022-12-13 02:19:23,720 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:19:23,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:23,720 INFO L85 PathProgramCache]: Analyzing trace with hash 810762084, now seen corresponding path program 1 times [2022-12-13 02:19:23,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:23,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727135914] [2022-12-13 02:19:23,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:23,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:23,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:19:23,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:23,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727135914] [2022-12-13 02:19:23,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727135914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:23,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:23,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:23,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103626709] [2022-12-13 02:19:23,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:23,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:23,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:23,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:23,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:23,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:23,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:23,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:23,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:23,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:23,867 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:23,867 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:23,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:23,868 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:23,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:23,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:23,869 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:23,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:23,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:23,871 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:23,872 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:23,872 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:23,872 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:23,872 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:23,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:23,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:23,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:23,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:23,878 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:23,878 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:19:23,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:23,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:23,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:23,965 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:23,965 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:23,965 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:23,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:23,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:23,965 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:23,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1075 [2022-12-13 02:19:23,966 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:19:23,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:23,966 INFO L85 PathProgramCache]: Analyzing trace with hash 839391235, now seen corresponding path program 1 times [2022-12-13 02:19:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:23,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911367912] [2022-12-13 02:19:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:24,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:19:24,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:24,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911367912] [2022-12-13 02:19:24,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911367912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:24,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:24,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:24,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455617238] [2022-12-13 02:19:24,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:24,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:24,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:24,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:24,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:24,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:24,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:24,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:24,077 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:24,077 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:24,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:24,078 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:24,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:24,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:24,079 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:24,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:24,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:24,081 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,081 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:24,082 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:24,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:24,082 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:24,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:24,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:24,094 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:24,095 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:19:24,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:24,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:24,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:24,181 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:24,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:19:24,181 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:24,182 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 02:19:24,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:24,182 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:24,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1076 [2022-12-13 02:19:24,182 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:19:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:24,182 INFO L85 PathProgramCache]: Analyzing trace with hash 868020386, now seen corresponding path program 1 times [2022-12-13 02:19:24,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:24,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654437954] [2022-12-13 02:19:24,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:24,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:24,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:19:24,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:24,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654437954] [2022-12-13 02:19:24,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654437954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:24,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:24,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:24,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127134531] [2022-12-13 02:19:24,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:24,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:24,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:24,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:24,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:24,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:24,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:24,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:24,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:24,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:24,314 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:24,314 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:19:24,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:24,315 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:24,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:24,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:24,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:24,316 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:24,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:24,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:24,318 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,318 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:24,318 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:24,318 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:24,318 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,319 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:24,319 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:24,319 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:24,324 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:24,324 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:19:24,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:24,325 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:24,325 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:24,411 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:24,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:24,411 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:24,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:24,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:24,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:24,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1077 [2022-12-13 02:19:24,412 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:19:24,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash 896649537, now seen corresponding path program 1 times [2022-12-13 02:19:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:24,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372688145] [2022-12-13 02:19:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:24,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:24,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:19:24,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:24,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372688145] [2022-12-13 02:19:24,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372688145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:24,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:24,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:24,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108454232] [2022-12-13 02:19:24,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:24,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:24,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:24,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:24,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:24,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:24,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:24,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:24,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:24,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:24,527 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:24,528 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:24,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:24,529 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:24,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:24,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:24,529 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:24,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:24,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:24,532 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,532 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:24,532 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:24,532 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:24,532 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,532 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:24,533 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:24,533 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:24,538 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:24,538 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:24,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:24,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:24,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:24,625 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:24,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:24,626 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:24,626 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 02:19:24,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:24,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:24,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1078 [2022-12-13 02:19:24,626 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:19:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash 925278688, now seen corresponding path program 1 times [2022-12-13 02:19:24,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:24,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692211459] [2022-12-13 02:19:24,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:24,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:19:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:24,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692211459] [2022-12-13 02:19:24,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692211459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:24,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:24,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:24,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072690201] [2022-12-13 02:19:24,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:24,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:24,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:24,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:24,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:24,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:24,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:24,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:24,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:24,751 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:24,751 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:24,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1126 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:24,752 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:24,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:24,753 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:24,753 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:24,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:24,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:24,755 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,755 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:24,756 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:24,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:24,756 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:24,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:24,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:24,761 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:24,762 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:24,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:24,762 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:24,762 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:24,849 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:24,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:24,849 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:24,849 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 02:19:24,849 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:24,849 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:24,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1079 [2022-12-13 02:19:24,849 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:19:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:24,850 INFO L85 PathProgramCache]: Analyzing trace with hash 953907839, now seen corresponding path program 1 times [2022-12-13 02:19:24,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:24,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015497663] [2022-12-13 02:19:24,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:24,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:24,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:19:24,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:24,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015497663] [2022-12-13 02:19:24,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015497663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:24,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:24,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:24,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512900910] [2022-12-13 02:19:24,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:24,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:24,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:24,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:24,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:24,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:24,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:24,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:24,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:24,964 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:24,964 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:24,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:24,965 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:24,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:24,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:24,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:24,966 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:24,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:24,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:24,968 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,968 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:24,968 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:24,968 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:24,968 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,969 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:24,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:24,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:24,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:24,981 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:24,981 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:24,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:24,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:24,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:25,069 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:25,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:19:25,070 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:25,070 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 02:19:25,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:25,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:25,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1080 [2022-12-13 02:19:25,070 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:19:25,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:25,070 INFO L85 PathProgramCache]: Analyzing trace with hash 982536990, now seen corresponding path program 1 times [2022-12-13 02:19:25,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:25,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043864939] [2022-12-13 02:19:25,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:25,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:25,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:19:25,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:25,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043864939] [2022-12-13 02:19:25,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043864939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:25,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:25,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:25,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970907086] [2022-12-13 02:19:25,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:25,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:25,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:25,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:25,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:25,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:25,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:25,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:25,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:25,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:25,195 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:25,195 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:25,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:25,196 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:25,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:25,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:25,197 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:25,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:25,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:25,199 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:25,199 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:25,199 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:25,199 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:25,199 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:25,200 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:25,200 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:25,200 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:25,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:25,205 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:25,205 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:25,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:25,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:25,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:25,293 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:25,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:25,294 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:25,294 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 02:19:25,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:25,294 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:25,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1081 [2022-12-13 02:19:25,294 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:19:25,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:25,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1011166141, now seen corresponding path program 1 times [2022-12-13 02:19:25,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:25,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298909616] [2022-12-13 02:19:25,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:25,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:25,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 02:19:25,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:25,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298909616] [2022-12-13 02:19:25,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298909616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:25,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:25,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045996814] [2022-12-13 02:19:25,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:25,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:25,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:25,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:25,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:25,342 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:25,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:25,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:25,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:25,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:25,419 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:25,419 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:25,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1107 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:25,420 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:25,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:25,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:25,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:25,421 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:25,421 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:25,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:25,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:25,423 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:25,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:25,424 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:25,424 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:25,424 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:25,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:25,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:25,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:25,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:25,429 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:25,430 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:19:25,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:25,430 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:25,430 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:25,517 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:25,517 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:25,517 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:25,517 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 02:19:25,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:25,517 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:25,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1082 [2022-12-13 02:19:25,518 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:19:25,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:25,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1039795292, now seen corresponding path program 1 times [2022-12-13 02:19:25,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:25,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959148801] [2022-12-13 02:19:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:25,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:25,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:19:25,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:25,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959148801] [2022-12-13 02:19:25,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959148801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:25,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:25,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:25,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575327185] [2022-12-13 02:19:25,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:25,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:25,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:25,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:25,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:25,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:25,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:25,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:25,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:25,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:25,657 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:25,657 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:25,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:25,658 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:25,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:25,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:25,658 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:25,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:25,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:25,661 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:25,661 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:25,661 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:25,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:25,661 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:25,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:25,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:25,662 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:25,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:25,667 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:25,667 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:25,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:25,668 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:25,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:25,753 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:25,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:25,754 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:25,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:25,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:25,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:25,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1083 [2022-12-13 02:19:25,754 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:19:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1068424443, now seen corresponding path program 1 times [2022-12-13 02:19:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:25,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146143496] [2022-12-13 02:19:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:25,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:19:25,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:25,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146143496] [2022-12-13 02:19:25,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146143496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:25,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:25,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:25,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394208545] [2022-12-13 02:19:25,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:25,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:25,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:25,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:25,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:25,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:25,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:25,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:25,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:25,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:25,865 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:25,865 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:25,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:25,866 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:25,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:25,875 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:25,875 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:25,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:25,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:25,877 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:25,877 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:25,877 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:25,877 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:25,877 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:25,878 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:25,878 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:25,878 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:25,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:25,884 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:25,884 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:25,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:25,884 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:25,884 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:25,971 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:25,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:25,971 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:25,971 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 02:19:25,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:25,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:25,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1084 [2022-12-13 02:19:25,971 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:19:25,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1097053594, now seen corresponding path program 1 times [2022-12-13 02:19:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:25,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913816087] [2022-12-13 02:19:25,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:25,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:26,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 02:19:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:26,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913816087] [2022-12-13 02:19:26,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913816087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:26,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:26,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:26,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552882696] [2022-12-13 02:19:26,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:26,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:26,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:26,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:26,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:26,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:26,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:26,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:26,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:26,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:26,097 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:26,097 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:26,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:26,098 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:26,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:26,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:26,099 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:26,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:26,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:26,101 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:26,101 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:26,101 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:26,101 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:26,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:26,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:26,107 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:26,107 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:19:26,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:26,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:26,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:26,194 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:26,195 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:26,195 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:26,195 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 02:19:26,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:26,195 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:26,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1085 [2022-12-13 02:19:26,195 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:19:26,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:26,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1125682745, now seen corresponding path program 1 times [2022-12-13 02:19:26,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:26,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577976921] [2022-12-13 02:19:26,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:26,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:26,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:19:26,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:26,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577976921] [2022-12-13 02:19:26,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577976921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:26,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:26,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:26,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222129038] [2022-12-13 02:19:26,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:26,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:26,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:26,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:26,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:26,242 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:26,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:26,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:26,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:26,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:26,320 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:26,320 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:26,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:26,321 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:26,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:26,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:26,322 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:26,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:26,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:26,324 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,324 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:26,324 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:26,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:26,325 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,325 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:26,325 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:26,325 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:26,330 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:26,330 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:26,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:26,331 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:26,331 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:26,417 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:26,418 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:26,418 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:26,418 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 02:19:26,418 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:26,418 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:26,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1086 [2022-12-13 02:19:26,418 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:19:26,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:26,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1154311896, now seen corresponding path program 1 times [2022-12-13 02:19:26,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:26,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431197616] [2022-12-13 02:19:26,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:26,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:26,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:19:26,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:26,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431197616] [2022-12-13 02:19:26,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431197616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:26,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:26,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743975537] [2022-12-13 02:19:26,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:26,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:26,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:26,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:26,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:26,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:26,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:26,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:26,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:26,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:26,532 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:26,533 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:26,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:26,534 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:26,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:26,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:26,534 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:26,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:26,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:26,537 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,537 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:26,537 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:26,537 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:26,537 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:26,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:26,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:26,543 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:26,543 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:26,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:26,543 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:26,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:26,630 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:26,631 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:26,631 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:26,631 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 02:19:26,631 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:26,631 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:26,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1087 [2022-12-13 02:19:26,631 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:19:26,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:26,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1182941047, now seen corresponding path program 1 times [2022-12-13 02:19:26,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:26,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343205089] [2022-12-13 02:19:26,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:19:26,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:26,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343205089] [2022-12-13 02:19:26,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343205089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:26,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:26,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:26,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593836116] [2022-12-13 02:19:26,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:26,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:26,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:26,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:26,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:26,680 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:26,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:26,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:26,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:26,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:26,746 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:26,746 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:26,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:26,747 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:26,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:26,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:26,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:26,748 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:26,748 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:26,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:26,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:26,750 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:26,751 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:26,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:26,751 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,751 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:26,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:26,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:26,763 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:26,763 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:26,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:26,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:26,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:26,851 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:26,852 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:19:26,852 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:26,852 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 02:19:26,852 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:26,852 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:26,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1088 [2022-12-13 02:19:26,852 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:19:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:26,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1211570198, now seen corresponding path program 1 times [2022-12-13 02:19:26,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:26,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277560121] [2022-12-13 02:19:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:26,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:26,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:19:26,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:26,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277560121] [2022-12-13 02:19:26,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277560121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:26,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:26,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:26,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214219135] [2022-12-13 02:19:26,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:26,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:26,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:26,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:26,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:26,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:26,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:26,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:26,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:26,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:26,976 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:26,976 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:26,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:26,977 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:26,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:26,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:26,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:26,978 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:26,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:26,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:26,980 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:26,981 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:26,981 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:26,981 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:26,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:26,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:26,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:26,987 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:26,987 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:26,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:26,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:26,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:27,075 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:27,076 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:27,076 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:27,076 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 02:19:27,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:27,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:27,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1089 [2022-12-13 02:19:27,076 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:19:27,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1240199349, now seen corresponding path program 1 times [2022-12-13 02:19:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:27,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960337288] [2022-12-13 02:19:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:27,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:19:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:27,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960337288] [2022-12-13 02:19:27,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960337288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:27,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:27,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:27,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909335243] [2022-12-13 02:19:27,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:27,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:27,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:27,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:27,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:27,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:27,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:27,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:27,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:27,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:27,189 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:27,189 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:27,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1129 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:27,190 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:27,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:27,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:27,191 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:27,191 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:27,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:27,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:27,193 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:27,193 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:27,193 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:27,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:27,194 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:27,194 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:27,194 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:27,194 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:27,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:27,199 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:27,200 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:27,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:27,200 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:27,200 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:27,286 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:27,287 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:27,287 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:27,287 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 02:19:27,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:27,287 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:27,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1090 [2022-12-13 02:19:27,287 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:19:27,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1268828500, now seen corresponding path program 1 times [2022-12-13 02:19:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:27,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885224717] [2022-12-13 02:19:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:27,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:27,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:19:27,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:27,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885224717] [2022-12-13 02:19:27,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885224717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:27,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:27,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:27,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610431412] [2022-12-13 02:19:27,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:27,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:27,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:27,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:27,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:27,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:27,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:27,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:27,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:27,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:27,399 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:27,399 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:27,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:27,400 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:27,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:27,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:27,401 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:27,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:27,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:27,403 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:27,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:27,403 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:27,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:27,403 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:27,403 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:27,403 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:27,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:27,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:27,409 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:27,409 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:27,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:27,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:27,410 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:27,495 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:27,495 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:27,495 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:27,495 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 02:19:27,496 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:27,496 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:27,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1091 [2022-12-13 02:19:27,496 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:19:27,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1297457651, now seen corresponding path program 1 times [2022-12-13 02:19:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:27,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042662610] [2022-12-13 02:19:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:27,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:27,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:19:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:27,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042662610] [2022-12-13 02:19:27,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042662610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:27,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:27,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968363808] [2022-12-13 02:19:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:27,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:27,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:27,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:27,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:27,544 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:27,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:27,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:27,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:27,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:27,620 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:27,620 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:27,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:27,621 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:27,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:27,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:27,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:27,622 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:27,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:27,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:27,624 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:27,624 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:27,624 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:27,625 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:27,625 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:27,625 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:27,625 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:27,625 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:27,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:27,630 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:27,630 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:27,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:27,631 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:27,631 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:27,725 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:27,725 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:19:27,725 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:27,725 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 02:19:27,725 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:27,726 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:27,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1092 [2022-12-13 02:19:27,726 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:19:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:27,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1326086802, now seen corresponding path program 1 times [2022-12-13 02:19:27,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:27,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337595483] [2022-12-13 02:19:27,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:27,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:27,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:19:27,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:27,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337595483] [2022-12-13 02:19:27,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337595483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:27,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:27,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356813900] [2022-12-13 02:19:27,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:27,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:27,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:27,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:27,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:27,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:27,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:27,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:27,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:27,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:27,858 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:27,858 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:27,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:27,859 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:27,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:27,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:27,860 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:27,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:27,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:27,862 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:27,863 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:27,863 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:27,863 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:27,863 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:27,863 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:27,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:27,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:27,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:27,869 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:27,869 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:27,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:27,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:27,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:27,956 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:27,956 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:27,956 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:27,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:27,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:27,956 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:27,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1093 [2022-12-13 02:19:27,957 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:19:27,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1354715953, now seen corresponding path program 1 times [2022-12-13 02:19:27,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:27,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546972498] [2022-12-13 02:19:27,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:27,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:28,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:19:28,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:28,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546972498] [2022-12-13 02:19:28,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546972498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:28,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:28,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:28,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178664327] [2022-12-13 02:19:28,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:28,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:28,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:28,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:28,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:28,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:28,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:28,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:28,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:28,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:28,071 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:28,071 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:28,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:28,072 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:28,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:28,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:28,072 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:28,072 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:28,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:28,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:28,075 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,075 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:28,075 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:28,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:28,076 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,076 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:28,076 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:28,076 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:28,081 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:28,081 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:19:28,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:28,082 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:28,082 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:28,168 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:28,169 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:28,169 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:28,169 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 02:19:28,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:28,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:28,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1094 [2022-12-13 02:19:28,169 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:19:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:28,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1383345104, now seen corresponding path program 1 times [2022-12-13 02:19:28,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:28,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815331880] [2022-12-13 02:19:28,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:28,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:28,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:19:28,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:28,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815331880] [2022-12-13 02:19:28,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815331880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:28,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:28,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:28,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023924808] [2022-12-13 02:19:28,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:28,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:28,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:28,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:28,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:28,219 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:28,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:28,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:28,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:28,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:28,294 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:28,294 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:19:28,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1127 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:28,295 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:28,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:28,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:28,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:28,296 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:28,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:28,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:28,298 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,299 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:28,299 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:28,299 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:28,299 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,299 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:28,299 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:28,299 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:28,305 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:28,305 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:19:28,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:28,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:28,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:28,392 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:28,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:28,393 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:28,393 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 02:19:28,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:28,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:28,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1095 [2022-12-13 02:19:28,393 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:19:28,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:28,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1411974255, now seen corresponding path program 1 times [2022-12-13 02:19:28,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:28,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754073635] [2022-12-13 02:19:28,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:28,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:28,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:19:28,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:28,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754073635] [2022-12-13 02:19:28,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754073635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:28,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:28,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:28,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542408884] [2022-12-13 02:19:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:28,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:28,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:28,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:28,442 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:28,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:28,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:28,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:28,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:28,507 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:28,507 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:28,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:28,508 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:28,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:28,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:28,509 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:28,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:28,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:28,512 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:28,512 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:28,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:28,512 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:28,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:28,512 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:28,525 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:28,525 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:28,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:28,526 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:28,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:28,615 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:28,615 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:19:28,615 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:28,615 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 02:19:28,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:28,615 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:28,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1096 [2022-12-13 02:19:28,616 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:19:28,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:28,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1440603406, now seen corresponding path program 1 times [2022-12-13 02:19:28,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:28,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551476717] [2022-12-13 02:19:28,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:28,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:19:28,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:28,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551476717] [2022-12-13 02:19:28,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551476717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:28,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:28,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:28,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782353592] [2022-12-13 02:19:28,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:28,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:28,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:28,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:28,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:28,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:28,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:28,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:28,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:28,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:28,732 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:28,732 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:28,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:28,733 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:28,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:28,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:28,733 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:28,733 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:28,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:28,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:28,736 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,736 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:28,736 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:28,736 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:28,736 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,736 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:28,736 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:28,736 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:28,742 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:28,742 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:28,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:28,742 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:28,743 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:28,827 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:28,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:19:28,828 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:28,828 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 02:19:28,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:28,828 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:28,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1097 [2022-12-13 02:19:28,828 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:19:28,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:28,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1469232557, now seen corresponding path program 1 times [2022-12-13 02:19:28,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:28,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492912069] [2022-12-13 02:19:28,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:28,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:28,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:19:28,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:28,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492912069] [2022-12-13 02:19:28,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492912069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:28,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:28,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:28,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010433722] [2022-12-13 02:19:28,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:28,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:28,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:28,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:28,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:28,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:28,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:28,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:28,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:28,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:28,974 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:28,975 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:28,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:28,976 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:28,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:28,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:28,976 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:28,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:28,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:28,979 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,979 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:28,979 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:28,979 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:28,979 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:28,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:28,980 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:28,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:28,985 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:28,985 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:28,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:28,986 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:28,986 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:29,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:29,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:29,071 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:29,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:29,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:29,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:29,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1098 [2022-12-13 02:19:29,071 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:19:29,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:29,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1497861708, now seen corresponding path program 1 times [2022-12-13 02:19:29,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:29,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689030296] [2022-12-13 02:19:29,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:29,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:29,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:19:29,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:29,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689030296] [2022-12-13 02:19:29,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689030296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:29,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:29,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:29,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103949553] [2022-12-13 02:19:29,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:29,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:29,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:29,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:29,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:29,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:29,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:29,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:29,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:29,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:29,195 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:29,195 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:19:29,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1129 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:29,196 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:29,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:29,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:29,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:29,197 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:29,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:29,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:29,199 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:29,199 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:29,199 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:29,200 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:29,200 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:29,200 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:29,200 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:29,200 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:29,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:29,205 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:29,206 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:19:29,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:29,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:29,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:29,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:29,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:29,292 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:29,292 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 02:19:29,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:29,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:29,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1099 [2022-12-13 02:19:29,292 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:19:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1526490859, now seen corresponding path program 1 times [2022-12-13 02:19:29,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:29,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514896380] [2022-12-13 02:19:29,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:29,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:29,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:19:29,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:29,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514896380] [2022-12-13 02:19:29,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514896380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:29,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:29,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:29,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369945047] [2022-12-13 02:19:29,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:29,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:29,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:29,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:29,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:29,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:29,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:29,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:29,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:29,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:29,403 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:29,403 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:29,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:29,404 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:29,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:29,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:29,405 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:29,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:29,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:29,408 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:29,408 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:29,408 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:29,408 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:29,408 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:29,408 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:29,408 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:29,408 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:29,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:29,421 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:29,421 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:29,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:29,422 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:29,422 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:29,506 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:29,507 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:19:29,507 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:29,507 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 02:19:29,507 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:29,507 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:29,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1100 [2022-12-13 02:19:29,507 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:19:29,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:29,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1555120010, now seen corresponding path program 1 times [2022-12-13 02:19:29,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:29,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595716444] [2022-12-13 02:19:29,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:29,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:29,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 02:19:29,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:29,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595716444] [2022-12-13 02:19:29,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595716444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:29,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:29,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:29,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527002842] [2022-12-13 02:19:29,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:29,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:29,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:29,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:29,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:29,569 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:29,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:29,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:29,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:29,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:29,649 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:29,649 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:29,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:29,650 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:29,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:29,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:29,650 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:29,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:29,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:29,653 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:29,653 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:29,653 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:29,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:29,654 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:29,654 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:29,654 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:29,654 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:29,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:29,660 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:29,660 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:29,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:29,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:29,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:29,747 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:29,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:29,747 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:29,747 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 02:19:29,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:29,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:29,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1101 [2022-12-13 02:19:29,747 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:19:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:29,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1583749161, now seen corresponding path program 1 times [2022-12-13 02:19:29,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:29,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209824980] [2022-12-13 02:19:29,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:29,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:19:29,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:29,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209824980] [2022-12-13 02:19:29,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209824980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:29,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:29,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:29,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770529417] [2022-12-13 02:19:29,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:29,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:29,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:29,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:29,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:29,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:29,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:29,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:29,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:29,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:29,861 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:29,861 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:29,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:29,862 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:29,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:29,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:29,863 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:29,863 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:29,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:29,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:29,865 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:29,865 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:29,865 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:29,865 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:29,866 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:29,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:29,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:29,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:29,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:29,871 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:29,871 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:29,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:29,872 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:29,872 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:29,957 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:29,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:29,957 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:29,957 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 02:19:29,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:29,957 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:29,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1102 [2022-12-13 02:19:29,957 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:19:29,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:29,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1612378312, now seen corresponding path program 1 times [2022-12-13 02:19:29,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:29,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975482034] [2022-12-13 02:19:29,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:29,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:30,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:19:30,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:30,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975482034] [2022-12-13 02:19:30,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975482034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:30,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:30,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:30,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685307714] [2022-12-13 02:19:30,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:30,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:30,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:30,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:30,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:30,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:30,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:30,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:30,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:30,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:30,098 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:30,098 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:30,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:30,099 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:30,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:30,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:30,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:30,099 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:30,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:30,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:30,102 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,102 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:30,102 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:30,102 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:30,102 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:30,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:30,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:30,108 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:30,108 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:19:30,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:30,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:30,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:30,194 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:30,195 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:30,195 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:30,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:30,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:30,195 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:30,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1103 [2022-12-13 02:19:30,195 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:19:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1641007463, now seen corresponding path program 1 times [2022-12-13 02:19:30,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:30,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850935705] [2022-12-13 02:19:30,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:30,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:19:30,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:30,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850935705] [2022-12-13 02:19:30,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850935705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:30,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:30,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:30,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865495283] [2022-12-13 02:19:30,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:30,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:30,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:30,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:30,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:30,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:30,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:30,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:30,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:30,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:30,312 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:30,312 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:30,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:30,314 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:30,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:30,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:30,314 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:30,314 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:30,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:30,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:30,317 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,317 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:30,317 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:30,317 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:30,317 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,317 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:30,317 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:30,317 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:30,329 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:30,329 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:30,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:30,330 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:30,330 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:30,415 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:30,415 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:19:30,415 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:30,415 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 02:19:30,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:30,415 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:30,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1104 [2022-12-13 02:19:30,416 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:19:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1669636614, now seen corresponding path program 1 times [2022-12-13 02:19:30,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:30,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511341520] [2022-12-13 02:19:30,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:30,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19: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:19:30,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:30,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511341520] [2022-12-13 02:19:30,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511341520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:30,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:30,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:30,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865337050] [2022-12-13 02:19:30,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:30,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:30,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:30,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:30,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:30,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:30,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:30,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:30,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:30,535 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:30,536 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:30,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:30,537 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:30,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:30,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:30,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:30,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:30,537 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:30,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:30,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:30,540 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,540 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:30,540 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:30,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:30,540 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,540 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:30,540 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:30,541 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:30,546 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:30,546 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:30,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:30,547 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:30,547 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:30,631 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:30,632 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:30,632 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:30,632 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 02:19:30,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:30,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:30,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1105 [2022-12-13 02:19:30,632 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:19:30,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:30,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1698265765, now seen corresponding path program 1 times [2022-12-13 02:19:30,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:30,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535002078] [2022-12-13 02:19:30,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:30,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:30,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:19:30,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:30,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535002078] [2022-12-13 02:19:30,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535002078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:30,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:30,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:30,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600879060] [2022-12-13 02:19:30,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:30,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:30,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:30,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:30,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:30,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:30,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:30,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:30,747 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:30,747 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:30,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:30,748 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:30,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:30,748 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:30,748 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:30,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:30,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:30,751 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:30,751 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:30,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:30,751 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,751 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:30,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:30,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:30,757 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:30,757 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:30,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:30,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:30,758 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:30,843 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:30,843 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:30,843 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:30,843 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 02:19:30,844 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:30,844 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:30,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1106 [2022-12-13 02:19:30,844 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:19:30,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:30,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1726894916, now seen corresponding path program 1 times [2022-12-13 02:19:30,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:30,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7588015] [2022-12-13 02:19:30,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:30,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:30,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:19:30,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:30,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7588015] [2022-12-13 02:19:30,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7588015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:30,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:30,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:30,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131548832] [2022-12-13 02:19:30,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:30,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:30,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:30,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:30,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:30,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:30,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:30,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:30,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:30,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:30,967 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:30,967 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:30,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:30,968 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:30,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:30,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:30,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:30,969 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:30,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:30,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:30,972 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,972 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:30,972 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:30,972 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:30,972 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,972 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:30,972 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:30,972 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:30,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:30,977 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:30,978 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:30,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:30,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:30,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:31,063 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:31,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:31,064 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:31,064 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 02:19:31,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:31,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:31,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1107 [2022-12-13 02:19:31,064 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:19:31,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:31,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1755524067, now seen corresponding path program 1 times [2022-12-13 02:19:31,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:31,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917181843] [2022-12-13 02:19:31,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:31,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:31,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 02:19:31,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:31,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917181843] [2022-12-13 02:19:31,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917181843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:31,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:31,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:31,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676246737] [2022-12-13 02:19:31,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:31,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:31,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:31,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:31,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:31,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:31,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:31,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:31,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:31,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:31,214 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:31,214 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:31,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:31,215 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:31,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:31,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:31,216 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:31,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:31,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:31,218 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:31,218 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:31,218 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:31,218 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:31,218 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:31,218 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:31,218 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:31,218 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:31,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:31,224 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:31,224 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:31,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:31,225 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:31,225 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:31,310 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:31,310 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:31,310 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:31,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:31,310 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:31,310 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:31,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1108 [2022-12-13 02:19:31,310 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:19:31,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:31,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1784153218, now seen corresponding path program 1 times [2022-12-13 02:19:31,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:31,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563068998] [2022-12-13 02:19:31,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:31,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:31,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:19:31,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:31,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563068998] [2022-12-13 02:19:31,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563068998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:31,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:31,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:31,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176987837] [2022-12-13 02:19:31,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:31,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:31,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:31,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:31,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:31,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:31,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:31,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:31,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:31,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:31,435 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:31,435 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:31,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:31,436 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:31,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:31,436 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:31,436 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:31,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:31,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:31,439 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:31,439 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:31,439 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:31,439 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:31,439 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:31,440 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:31,440 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:31,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:31,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:31,445 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:31,445 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:31,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:31,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:31,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:31,532 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:31,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:31,533 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:31,533 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 02:19:31,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:31,533 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:31,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1109 [2022-12-13 02:19:31,533 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:19:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:31,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1812782369, now seen corresponding path program 1 times [2022-12-13 02:19:31,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:31,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974698684] [2022-12-13 02:19:31,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:31,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:31,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:19:31,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:31,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974698684] [2022-12-13 02:19:31,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974698684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:31,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:31,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256261818] [2022-12-13 02:19:31,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:31,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:31,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:31,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:31,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:31,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:31,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:31,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:31,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:31,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:31,658 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:31,659 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:31,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:31,660 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:31,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:31,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:31,660 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:31,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:31,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:31,663 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:31,663 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:31,663 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:31,663 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:31,663 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:31,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:31,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:31,664 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:31,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:31,669 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:31,669 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:31,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:31,670 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:31,670 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:31,755 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:31,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:31,756 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:31,756 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 02:19:31,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:31,756 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:31,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1110 [2022-12-13 02:19:31,756 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:19:31,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1841411520, now seen corresponding path program 1 times [2022-12-13 02:19:31,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:31,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328830408] [2022-12-13 02:19:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:31,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:31,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 02:19:31,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:31,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328830408] [2022-12-13 02:19:31,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328830408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:31,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:31,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:31,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503368926] [2022-12-13 02:19:31,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:31,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:31,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:31,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:31,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:31,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:31,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:31,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:31,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:31,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:31,871 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:31,871 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:31,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:31,872 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:31,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:31,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:31,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:31,873 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:31,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:31,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:31,875 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:31,875 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:31,875 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:31,875 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:31,876 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:31,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:31,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:31,876 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:31,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:31,882 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:31,882 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:31,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:31,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:31,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:31,966 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:31,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:31,967 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:31,967 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 02:19:31,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:31,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:31,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1111 [2022-12-13 02:19:31,967 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:19:31,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:31,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1870040671, now seen corresponding path program 1 times [2022-12-13 02:19:31,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:31,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745582812] [2022-12-13 02:19:31,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:31,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:32,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:19:32,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:32,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745582812] [2022-12-13 02:19:32,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745582812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:32,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:32,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:32,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788761126] [2022-12-13 02:19:32,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:32,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:32,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:32,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:32,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:32,014 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:32,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:32,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:32,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:32,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:32,094 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:32,095 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:32,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:32,096 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:32,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:32,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:32,096 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:32,096 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:32,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:32,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:32,099 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,099 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:32,099 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:32,099 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:32,099 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,099 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:32,099 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:32,099 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:32,105 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:32,105 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:32,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:32,105 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:32,105 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:32,190 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:32,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:19:32,191 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:32,191 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 02:19:32,191 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:32,191 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:32,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1112 [2022-12-13 02:19:32,191 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:19:32,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:32,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1898669822, now seen corresponding path program 1 times [2022-12-13 02:19:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:32,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035879877] [2022-12-13 02:19:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:32,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:19:32,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:32,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035879877] [2022-12-13 02:19:32,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035879877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:32,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:32,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:32,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698957572] [2022-12-13 02:19:32,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:32,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:32,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:32,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:32,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:32,238 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:32,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:32,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:32,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:32,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:32,302 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:32,302 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:32,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:32,303 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:32,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:32,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:32,303 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:32,303 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:32,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:32,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:32,306 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,306 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:32,306 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:32,306 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:32,306 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,306 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:32,306 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:32,306 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:32,312 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:32,312 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:19:32,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:32,313 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:32,313 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:32,397 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:32,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:32,398 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:32,398 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 02:19:32,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:32,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:32,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1113 [2022-12-13 02:19:32,398 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:19:32,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1927298973, now seen corresponding path program 1 times [2022-12-13 02:19:32,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:32,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356991293] [2022-12-13 02:19:32,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:32,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:19:32,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:32,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356991293] [2022-12-13 02:19:32,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356991293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:32,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:32,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:32,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301848109] [2022-12-13 02:19:32,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:32,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:32,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:32,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:32,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:32,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:32,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:32,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:32,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:32,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:32,547 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:32,547 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:32,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:32,548 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:32,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:32,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:32,549 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:32,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:32,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:32,551 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,551 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:32,551 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:32,551 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:32,551 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,552 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:32,552 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:32,552 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:32,557 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:32,557 INFO L131 PetriNetUnfolder]: For 435/444 co-relation queries the response was YES. [2022-12-13 02:19:32,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/444 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:32,558 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:32,558 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:32,643 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:32,644 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:32,644 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:32,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:32,644 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:32,644 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:32,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1114 [2022-12-13 02:19:32,644 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:19:32,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:32,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1955928124, now seen corresponding path program 1 times [2022-12-13 02:19:32,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:32,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665316785] [2022-12-13 02:19:32,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:32,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:32,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:19:32,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:32,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665316785] [2022-12-13 02:19:32,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665316785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:32,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:32,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:32,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034462791] [2022-12-13 02:19:32,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:32,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:32,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:32,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:32,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:32,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:32,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:32,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:32,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:32,759 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:32,759 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:32,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:32,760 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:32,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:32,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:32,761 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:32,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:32,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:32,763 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,763 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:32,763 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:32,763 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:32,764 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:32,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:32,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:32,769 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:32,769 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:19:32,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:32,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:32,770 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:32,856 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:32,856 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:32,856 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:32,856 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 02:19:32,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:32,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:32,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1115 [2022-12-13 02:19:32,857 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:19:32,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:32,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1984557275, now seen corresponding path program 1 times [2022-12-13 02:19:32,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:32,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887407540] [2022-12-13 02:19:32,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:32,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:32,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:19:32,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:32,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887407540] [2022-12-13 02:19:32,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887407540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:32,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:32,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:32,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350022607] [2022-12-13 02:19:32,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:32,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:32,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:32,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:32,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:32,906 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:32,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:32,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:32,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:32,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:32,989 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:32,989 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:32,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:32,990 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:32,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:32,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:32,991 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:32,991 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:32,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:32,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:32,993 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:32,993 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:32,993 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:32,993 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,994 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:32,994 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:32,994 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:32,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:32,999 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:32,999 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:32,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:33,000 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:33,000 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:33,085 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:33,085 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:33,085 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:33,085 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 02:19:33,085 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:33,086 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:33,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1116 [2022-12-13 02:19:33,086 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:19:33,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:33,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2013186426, now seen corresponding path program 1 times [2022-12-13 02:19:33,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:33,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132087918] [2022-12-13 02:19:33,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:33,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:19:33,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:33,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132087918] [2022-12-13 02:19:33,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132087918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:33,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:33,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:33,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311764404] [2022-12-13 02:19:33,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:33,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:33,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:33,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:33,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:33,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:33,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:33,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:33,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:33,227 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:33,227 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:33,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:33,228 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:33,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:33,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:33,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:33,228 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:33,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:33,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:33,231 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:33,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:33,231 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:33,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:33,231 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:33,231 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:33,231 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:33,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:33,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:33,237 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:33,237 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:33,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:33,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:33,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:33,323 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:33,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:33,324 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:33,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:33,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:33,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:33,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1117 [2022-12-13 02:19:33,324 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:19:33,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:33,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2041815577, now seen corresponding path program 1 times [2022-12-13 02:19:33,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:33,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006398656] [2022-12-13 02:19:33,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:33,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:33,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:19:33,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:33,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006398656] [2022-12-13 02:19:33,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006398656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:33,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:33,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:33,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399835849] [2022-12-13 02:19:33,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:33,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:33,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:33,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:33,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:33,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:33,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:33,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:33,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:33,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:33,449 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:33,450 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:33,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:33,451 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:33,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:33,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:33,451 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:33,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:33,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:33,454 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:33,454 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:33,454 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:33,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:33,454 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:33,454 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:33,454 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:33,454 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:33,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:33,460 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:33,460 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:33,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:33,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:33,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:33,546 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:33,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:33,547 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:33,547 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 02:19:33,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:33,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:33,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1118 [2022-12-13 02:19:33,547 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:19:33,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:33,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2070444728, now seen corresponding path program 1 times [2022-12-13 02:19:33,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:33,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676786278] [2022-12-13 02:19:33,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:33,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:33,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:19:33,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:33,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676786278] [2022-12-13 02:19:33,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676786278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:33,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:33,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:33,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404132976] [2022-12-13 02:19:33,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:33,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:33,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:33,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:33,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:33,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:33,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:33,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:33,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:33,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:33,659 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:33,659 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:33,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:33,660 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:33,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:33,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:33,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:33,660 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:33,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:33,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:33,663 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:33,663 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:33,663 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:33,663 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:33,663 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:33,664 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:33,664 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:33,664 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:33,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:33,669 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:33,669 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:33,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:33,670 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:33,670 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:33,758 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:33,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:19:33,759 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:33,759 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 02:19:33,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:33,759 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:33,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1119 [2022-12-13 02:19:33,759 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:19:33,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2099073879, now seen corresponding path program 1 times [2022-12-13 02:19:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:33,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149653117] [2022-12-13 02:19:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:33,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:33,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:19:33,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:33,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149653117] [2022-12-13 02:19:33,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149653117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:33,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:33,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:33,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929192776] [2022-12-13 02:19:33,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:33,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:33,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:33,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:33,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:33,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:33,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:33,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:33,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:33,889 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:33,889 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:33,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1129 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:33,890 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:33,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:33,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:33,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:33,891 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:33,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:33,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:33,893 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:33,893 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:33,894 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:33,894 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:33,894 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:33,894 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:33,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:33,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:33,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:33,900 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:33,900 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:33,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:33,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:33,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:33,988 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:33,988 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:33,988 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:33,988 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 02:19:33,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:33,988 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:33,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1120 [2022-12-13 02:19:33,988 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:19:33,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:33,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2127703030, now seen corresponding path program 1 times [2022-12-13 02:19:33,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:33,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166050086] [2022-12-13 02:19:33,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:33,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:34,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:19:34,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:34,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166050086] [2022-12-13 02:19:34,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166050086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:34,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:34,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:34,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696224412] [2022-12-13 02:19:34,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:34,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:34,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:34,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:34,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:34,038 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:34,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:34,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:34,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:34,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:34,105 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:34,106 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:34,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:34,107 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:34,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:34,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:34,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:34,107 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:34,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:34,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:34,110 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:34,110 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:34,110 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:34,110 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:34,110 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:34,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:34,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:34,111 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:34,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:34,116 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:34,116 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:34,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:34,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:34,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:34,202 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:34,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:34,203 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:34,203 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 02:19:34,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:34,203 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:34,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1121 [2022-12-13 02:19:34,203 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:19:34,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2138635115, now seen corresponding path program 1 times [2022-12-13 02:19:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:34,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378179381] [2022-12-13 02:19:34,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:34,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:34,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:19:34,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:34,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378179381] [2022-12-13 02:19:34,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378179381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:34,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:34,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:34,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741786230] [2022-12-13 02:19:34,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:34,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:34,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:34,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:34,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:34,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:34,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:34,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:34,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:34,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:34,328 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:34,328 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:34,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:34,329 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:34,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:34,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:34,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:34,330 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:34,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:34,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:34,333 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:34,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:34,333 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:34,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:34,333 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:34,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:34,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:34,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:34,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:34,339 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:34,339 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:34,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:34,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:34,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:34,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:34,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:34,426 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:34,426 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 02:19:34,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:34,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:34,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1122 [2022-12-13 02:19:34,427 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:19:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2110005964, now seen corresponding path program 1 times [2022-12-13 02:19:34,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:34,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131323860] [2022-12-13 02:19:34,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:34,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:34,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:19:34,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:34,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131323860] [2022-12-13 02:19:34,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131323860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:34,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:34,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:34,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587137431] [2022-12-13 02:19:34,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:34,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:34,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:34,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:34,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:34,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:34,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:34,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:34,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:34,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:34,559 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:34,560 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:34,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:34,561 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:34,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:34,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:34,561 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:34,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:34,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:34,564 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:34,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:34,564 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:34,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:34,564 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:34,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:34,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:34,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:34,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:34,570 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:34,570 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:19:34,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:34,571 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:34,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:34,657 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:34,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:34,657 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:34,657 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 02:19:34,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:34,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:34,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1123 [2022-12-13 02:19:34,657 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:19:34,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:34,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2081376813, now seen corresponding path program 1 times [2022-12-13 02:19:34,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:34,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828535131] [2022-12-13 02:19:34,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:34,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:34,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:19:34,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:34,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828535131] [2022-12-13 02:19:34,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828535131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:34,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:34,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:34,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886448607] [2022-12-13 02:19:34,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:34,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:34,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:34,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:34,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:34,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:34,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:34,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:34,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:34,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:34,788 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:34,788 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:34,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:34,789 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:34,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:34,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:34,789 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:34,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:34,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:34,792 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:34,792 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:34,792 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:34,792 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:34,792 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:34,792 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:34,793 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:34,793 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:34,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:34,798 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:34,798 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:34,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:34,799 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:34,799 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:34,885 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:34,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:34,886 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:34,886 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 02:19:34,886 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:34,886 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:34,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1124 [2022-12-13 02:19:34,886 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:19:34,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:34,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2052747662, now seen corresponding path program 1 times [2022-12-13 02:19:34,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:34,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306544428] [2022-12-13 02:19:34,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:34,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:34,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:19:34,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:34,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306544428] [2022-12-13 02:19:34,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306544428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:34,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:34,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:34,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903250206] [2022-12-13 02:19:34,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:34,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:34,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:34,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:34,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:34,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:34,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:34,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:34,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:34,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:35,010 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:35,010 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:35,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:35,011 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:35,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:35,012 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:35,012 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:35,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:35,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:35,014 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,014 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:35,015 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:35,015 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:35,015 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,015 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:35,015 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:35,015 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:35,020 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:35,021 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:35,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:35,021 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:35,021 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:35,106 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:35,107 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:35,107 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:35,107 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 02:19:35,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:35,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:35,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1125 [2022-12-13 02:19:35,107 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:19:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2024118511, now seen corresponding path program 1 times [2022-12-13 02:19:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:35,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670285008] [2022-12-13 02:19:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:35,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:35,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:19:35,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:35,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670285008] [2022-12-13 02:19:35,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670285008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:35,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:35,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:35,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282467007] [2022-12-13 02:19:35,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:35,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:35,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:35,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:35,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:35,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:35,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:35,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:35,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:35,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:35,232 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:35,232 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:35,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:35,233 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:35,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:35,234 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:35,234 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:35,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:35,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:35,236 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,236 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:35,236 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:35,237 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:35,237 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:35,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:35,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:35,242 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:35,242 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:35,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:35,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:35,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:35,330 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:35,330 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:35,330 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:35,330 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 02:19:35,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:35,330 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:35,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1126 [2022-12-13 02:19:35,330 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:19:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:35,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1995489360, now seen corresponding path program 1 times [2022-12-13 02:19:35,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:35,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389873537] [2022-12-13 02:19:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:35,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:19:35,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:35,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389873537] [2022-12-13 02:19:35,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389873537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:35,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:35,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:35,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81058162] [2022-12-13 02:19:35,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:35,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:35,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:35,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:35,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:35,392 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:35,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:35,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:35,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:35,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:35,467 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:35,467 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:35,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:35,468 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:35,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:35,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:35,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:35,469 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:35,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:35,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:35,471 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,472 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:35,472 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:35,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:35,472 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:35,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:35,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:35,478 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:35,478 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:35,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:35,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:35,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:35,565 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:35,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:35,565 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:35,565 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 02:19:35,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:35,565 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:35,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1127 [2022-12-13 02:19:35,566 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:19:35,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1966860209, now seen corresponding path program 1 times [2022-12-13 02:19:35,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:35,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129308998] [2022-12-13 02:19:35,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:35,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:35,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:19:35,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:35,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129308998] [2022-12-13 02:19:35,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129308998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:35,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:35,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:35,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358384470] [2022-12-13 02:19:35,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:35,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:35,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:35,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:35,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:35,615 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:35,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:35,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:35,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:35,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:35,690 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:35,690 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:35,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1125 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:35,691 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:35,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:35,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:35,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:35,692 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:35,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:35,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:35,694 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,694 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:35,694 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:35,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:35,694 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:35,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:35,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:35,700 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:35,700 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:35,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:35,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:35,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:35,788 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:35,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:35,788 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:35,788 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 02:19:35,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:35,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:35,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1128 [2022-12-13 02:19:35,788 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:19:35,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:35,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1938231058, now seen corresponding path program 1 times [2022-12-13 02:19:35,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:35,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74502004] [2022-12-13 02:19:35,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:35,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:35,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:19:35,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:35,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74502004] [2022-12-13 02:19:35,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74502004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:35,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:35,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:35,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558203243] [2022-12-13 02:19:35,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:35,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:35,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:35,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:35,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:35,839 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:35,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:35,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:35,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:35,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:35,904 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:35,904 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:35,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:35,906 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:35,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:35,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:35,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:35,906 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:35,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:35,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:35,908 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,909 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:35,909 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:35,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:35,909 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:35,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:35,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:35,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:35,915 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:35,915 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:35,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:35,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:35,915 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:36,001 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:36,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:36,002 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:36,002 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 02:19:36,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:36,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:36,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1129 [2022-12-13 02:19:36,002 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:19:36,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1909601907, now seen corresponding path program 1 times [2022-12-13 02:19:36,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:36,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628557303] [2022-12-13 02:19:36,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:36,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:36,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:19:36,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:36,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628557303] [2022-12-13 02:19:36,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628557303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:36,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:36,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44850971] [2022-12-13 02:19:36,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:36,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:36,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:36,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:36,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:36,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:36,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:36,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:36,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:36,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:36,116 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:36,116 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:36,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:36,117 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:36,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:36,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:36,118 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:36,118 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:36,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:36,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:36,120 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:36,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:36,120 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:36,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:36,121 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:36,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:36,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:36,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:36,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:36,126 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:36,126 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:36,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:36,127 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:36,127 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:36,212 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:36,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:19:36,213 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:36,213 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 02:19:36,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:36,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:36,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1130 [2022-12-13 02:19:36,213 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:19:36,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1880972756, now seen corresponding path program 1 times [2022-12-13 02:19:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:36,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793188129] [2022-12-13 02:19:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:36,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:36,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:19:36,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:36,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793188129] [2022-12-13 02:19:36,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793188129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:36,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:36,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:36,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507925993] [2022-12-13 02:19:36,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:36,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:36,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:36,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:36,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:36,263 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:36,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:36,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:36,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:36,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:36,338 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:36,338 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:36,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:36,339 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:36,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:36,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:36,339 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:36,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:36,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:36,342 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:36,342 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:36,342 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:36,342 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:36,342 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:36,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:36,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:36,342 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:36,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:36,348 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:36,348 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:36,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:36,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:36,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:36,434 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:36,435 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:36,435 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:36,435 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 02:19:36,435 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:36,435 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:36,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1131 [2022-12-13 02:19:36,435 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:19:36,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:36,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1852343605, now seen corresponding path program 1 times [2022-12-13 02:19:36,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:36,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981412657] [2022-12-13 02:19:36,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:36,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:36,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:19:36,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:36,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981412657] [2022-12-13 02:19:36,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981412657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:36,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:36,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:36,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631387399] [2022-12-13 02:19:36,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:36,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:36,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:36,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:36,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:36,482 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:36,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:36,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:36,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:36,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:36,566 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:36,567 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:36,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:36,568 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:36,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:36,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:36,568 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:36,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:36,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:36,571 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:36,571 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:36,571 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:36,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:36,571 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:36,571 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:36,571 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:36,571 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:36,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:36,577 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:36,577 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:36,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:36,577 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:36,577 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:36,664 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:36,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:36,664 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:36,665 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 02:19:36,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:36,665 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:36,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1132 [2022-12-13 02:19:36,665 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:19:36,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:36,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1823714454, now seen corresponding path program 1 times [2022-12-13 02:19:36,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:36,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510105706] [2022-12-13 02:19:36,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:36,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:36,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:19:36,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:36,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510105706] [2022-12-13 02:19:36,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510105706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:36,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:36,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:36,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328426153] [2022-12-13 02:19:36,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:36,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:36,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:36,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:36,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:36,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:36,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:36,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:36,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:36,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:36,803 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:36,804 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:36,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:36,805 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:36,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:36,805 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:36,805 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:36,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:36,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:36,808 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:36,808 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:36,808 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:36,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:36,808 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:36,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:36,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:36,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:36,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:36,814 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:36,814 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:36,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:36,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:36,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:36,900 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:36,901 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:36,901 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:36,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:36,901 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:36,901 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:36,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1133 [2022-12-13 02:19:36,901 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:19:36,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:36,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1795085303, now seen corresponding path program 1 times [2022-12-13 02:19:36,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:36,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713794575] [2022-12-13 02:19:36,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:36,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:36,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:19:36,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:36,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713794575] [2022-12-13 02:19:36,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713794575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:36,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:36,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:36,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640190898] [2022-12-13 02:19:36,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:36,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:36,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:36,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:36,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:36,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:36,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:36,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:36,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:37,016 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:37,016 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:37,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:37,017 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:37,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:37,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:37,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:37,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:37,018 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:37,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:37,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:37,021 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,021 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:37,021 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:37,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:37,021 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,021 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:37,021 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:37,021 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:37,027 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:37,027 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:37,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 442 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:37,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:37,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:37,114 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:37,115 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:37,115 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:37,115 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 02:19:37,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:37,115 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:37,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1134 [2022-12-13 02:19:37,115 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:19:37,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:37,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1766456152, now seen corresponding path program 1 times [2022-12-13 02:19:37,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:37,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643512032] [2022-12-13 02:19:37,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:37,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:37,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:19:37,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:37,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643512032] [2022-12-13 02:19:37,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643512032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:37,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:37,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:37,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245088816] [2022-12-13 02:19:37,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:37,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:37,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:37,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:37,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:37,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:37,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:37,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:37,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:37,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:37,238 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:37,238 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:37,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:37,239 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:37,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:37,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:37,240 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:37,240 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:37,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:37,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:37,242 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,243 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:37,243 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:37,243 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:37,243 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:37,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:37,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:37,249 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:37,249 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:37,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:37,249 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:37,249 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:37,335 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:37,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:37,335 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:37,335 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 02:19:37,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:37,335 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:37,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1135 [2022-12-13 02:19:37,335 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:19:37,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:37,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1737827001, now seen corresponding path program 1 times [2022-12-13 02:19:37,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:37,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266443234] [2022-12-13 02:19:37,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:37,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:37,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:19:37,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:37,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266443234] [2022-12-13 02:19:37,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266443234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:37,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:37,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:37,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823211000] [2022-12-13 02:19:37,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:37,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:37,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:37,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:37,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:37,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:37,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:37,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:37,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:37,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:37,490 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:37,491 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:37,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:37,492 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:37,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:37,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:37,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:37,492 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:37,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:37,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:37,495 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,495 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:37,495 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:37,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:37,495 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:37,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:37,495 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:37,501 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:37,501 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:37,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:37,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:37,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:37,588 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:37,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:37,588 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:37,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:37,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:37,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:37,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1136 [2022-12-13 02:19:37,589 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:19:37,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:37,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1709197850, now seen corresponding path program 1 times [2022-12-13 02:19:37,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:37,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896928147] [2022-12-13 02:19:37,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:37,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:19:37,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:37,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896928147] [2022-12-13 02:19:37,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896928147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:37,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:37,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163135727] [2022-12-13 02:19:37,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:37,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:37,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:37,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:37,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:37,638 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:37,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:37,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:37,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:37,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:37,714 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:37,714 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:37,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:37,715 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:37,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:37,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:37,716 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:37,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:37,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:37,718 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,718 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:37,718 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:37,718 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:37,718 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:37,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:37,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:37,724 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:37,724 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:37,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:37,725 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:37,725 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:37,810 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:37,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:37,811 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:37,811 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 02:19:37,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:37,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:37,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1137 [2022-12-13 02:19:37,811 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:19:37,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:37,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1680568699, now seen corresponding path program 1 times [2022-12-13 02:19:37,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:37,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229764563] [2022-12-13 02:19:37,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:37,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:37,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:19:37,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:37,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229764563] [2022-12-13 02:19:37,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229764563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:37,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:37,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286390711] [2022-12-13 02:19:37,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:37,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:37,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:37,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:37,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:37,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:37,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:37,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:37,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:37,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:37,926 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:37,926 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:37,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:37,927 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:37,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:37,928 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:37,928 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:37,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:37,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:37,930 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:37,931 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:37,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:37,931 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:37,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:37,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:37,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:37,936 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:37,937 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:37,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:37,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:37,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:38,023 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:38,023 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:38,023 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:38,023 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 02:19:38,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:38,024 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:38,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1138 [2022-12-13 02:19:38,024 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:19:38,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:38,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1651939548, now seen corresponding path program 1 times [2022-12-13 02:19:38,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:38,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293357701] [2022-12-13 02:19:38,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:38,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:38,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:19:38,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:38,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293357701] [2022-12-13 02:19:38,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293357701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:38,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:38,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:38,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571276314] [2022-12-13 02:19:38,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:38,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:38,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:38,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:38,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:38,071 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:38,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:38,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:38,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:38,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:38,137 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:38,137 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:38,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:38,138 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:38,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:38,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:38,139 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:38,139 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:38,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:38,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:38,141 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:38,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:38,141 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:38,141 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:38,142 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:38,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:38,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:38,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:38,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:38,147 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:38,147 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:38,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:38,148 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:38,148 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:38,234 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:38,234 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:38,234 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:38,234 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 02:19:38,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:38,234 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:38,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1139 [2022-12-13 02:19:38,234 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:19:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:38,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1623310397, now seen corresponding path program 1 times [2022-12-13 02:19:38,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:38,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226105034] [2022-12-13 02:19:38,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:38,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:38,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:19:38,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:38,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226105034] [2022-12-13 02:19:38,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226105034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:38,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:38,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:38,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344547916] [2022-12-13 02:19:38,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:38,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:38,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:38,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:38,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:38,281 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:38,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:38,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:38,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:38,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:38,355 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:38,355 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:38,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:38,356 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:38,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:38,357 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:38,357 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:38,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:38,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:38,359 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:38,359 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:38,359 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:38,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:38,359 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:38,359 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:38,359 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:38,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:38,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:38,365 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:38,365 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:38,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:38,366 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:38,366 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:38,451 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:38,452 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:38,452 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:38,452 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 02:19:38,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:38,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:38,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1140 [2022-12-13 02:19:38,452 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:19:38,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:38,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1594681246, now seen corresponding path program 1 times [2022-12-13 02:19:38,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:38,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092091373] [2022-12-13 02:19:38,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:38,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:38,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:19:38,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:38,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092091373] [2022-12-13 02:19:38,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092091373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:38,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:38,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:38,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479079627] [2022-12-13 02:19:38,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:38,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:38,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:38,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:38,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:38,498 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:38,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:38,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:38,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:38,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:38,571 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:38,571 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:38,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:38,572 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:38,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:38,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:38,573 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:38,573 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:38,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:38,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:38,575 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:38,575 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:38,576 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:38,576 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:38,576 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:38,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:38,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:38,576 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:38,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:38,581 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:38,581 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:19:38,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:38,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:38,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:38,666 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:38,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:19:38,667 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:38,667 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 02:19:38,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:38,667 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:38,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1141 [2022-12-13 02:19:38,667 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:19:38,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:38,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1566052095, now seen corresponding path program 1 times [2022-12-13 02:19:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:38,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623061169] [2022-12-13 02:19:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:38,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:19:38,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:38,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623061169] [2022-12-13 02:19:38,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623061169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:38,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:38,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:38,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749369146] [2022-12-13 02:19:38,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:38,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:38,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:38,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:38,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:38,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:38,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:38,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:38,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:38,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:38,789 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:38,789 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:38,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:38,790 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:38,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:38,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:38,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:38,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:38,791 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:38,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:38,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:38,793 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:38,793 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:38,794 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:38,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:38,794 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:38,794 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:38,794 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:38,794 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:38,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:38,799 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:38,800 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:38,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:38,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:38,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:38,885 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:38,886 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:38,886 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:38,886 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 02:19:38,886 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:38,886 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:38,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1142 [2022-12-13 02:19:38,886 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:19:38,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:38,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1537422944, now seen corresponding path program 1 times [2022-12-13 02:19:38,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:38,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652442973] [2022-12-13 02:19:38,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:38,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:38,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:19:38,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:38,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652442973] [2022-12-13 02:19:38,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652442973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:38,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:38,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:38,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755551805] [2022-12-13 02:19:38,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:38,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:38,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:38,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:38,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:38,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:38,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:38,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:38,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:38,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:39,024 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:39,024 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:39,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:39,025 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:39,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:39,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:39,026 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:39,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:39,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:39,028 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,029 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:39,029 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:39,029 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:39,029 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,029 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:39,029 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:39,029 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:39,035 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:39,035 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:39,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:39,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:39,035 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:39,121 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:39,121 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:39,121 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:39,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:39,122 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:39,122 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:39,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1143 [2022-12-13 02:19:39,122 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:19:39,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:39,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1508793793, now seen corresponding path program 1 times [2022-12-13 02:19:39,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:39,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275058543] [2022-12-13 02:19:39,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:39,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:39,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:19:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:39,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275058543] [2022-12-13 02:19:39,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275058543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:39,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:39,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026706577] [2022-12-13 02:19:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:39,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:39,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:39,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:39,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:39,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:39,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:39,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:39,245 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:39,245 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:39,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:39,246 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:39,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:39,247 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:39,247 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:39,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:39,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:39,249 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,249 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:39,249 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:39,250 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:39,250 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,250 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:39,250 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:39,250 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:39,255 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:39,256 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:39,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:39,256 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:39,256 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:39,342 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:39,343 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:39,343 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:39,343 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 02:19:39,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:39,343 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:39,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1144 [2022-12-13 02:19:39,343 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:19:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:39,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1480164642, now seen corresponding path program 1 times [2022-12-13 02:19:39,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:39,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2401240] [2022-12-13 02:19:39,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:39,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:39,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:19:39,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:39,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2401240] [2022-12-13 02:19:39,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2401240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:39,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:39,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:39,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736326493] [2022-12-13 02:19:39,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:39,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:39,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:39,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:39,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:39,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:39,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:39,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:39,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:39,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:39,464 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:39,464 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:39,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:39,466 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:39,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:39,466 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:39,466 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:39,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:39,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:39,469 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,469 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:39,469 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:39,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:39,469 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,469 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:39,469 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:39,469 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:39,475 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:39,475 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:39,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:39,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:39,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:39,560 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:39,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:19:39,560 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:39,560 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 02:19:39,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:39,560 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:39,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1145 [2022-12-13 02:19:39,560 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:19:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:39,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1451535491, now seen corresponding path program 1 times [2022-12-13 02:19:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:39,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112588735] [2022-12-13 02:19:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:39,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:39,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:19:39,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:39,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112588735] [2022-12-13 02:19:39,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112588735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:39,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:39,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:39,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878235574] [2022-12-13 02:19:39,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:39,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:39,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:39,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:39,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:39,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:39,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:39,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:39,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:39,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:39,672 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:39,673 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:39,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:39,674 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:39,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:39,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:39,674 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:39,674 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:39,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:39,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:39,677 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:39,677 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:39,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:39,677 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:39,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:39,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:39,683 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:39,683 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:39,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:39,684 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:39,684 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:39,768 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:39,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:39,769 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:39,769 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 02:19:39,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:39,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:39,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1146 [2022-12-13 02:19:39,769 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:19:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:39,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1422906340, now seen corresponding path program 1 times [2022-12-13 02:19:39,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:39,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340469346] [2022-12-13 02:19:39,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:39,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:39,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:19:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340469346] [2022-12-13 02:19:39,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340469346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:39,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:39,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636107555] [2022-12-13 02:19:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:39,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:39,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:39,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:39,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:39,816 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:39,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:39,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:39,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:39,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:39,879 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:39,879 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:39,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:39,880 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:39,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:39,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:39,881 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:39,881 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:39,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:39,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:39,884 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,884 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:39,884 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:39,884 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:39,884 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:39,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:39,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:39,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:39,890 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:39,890 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:39,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:39,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:39,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:39,979 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:39,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:39,979 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:39,979 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 02:19:39,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:39,979 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:39,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1147 [2022-12-13 02:19:39,979 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:19:39,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:39,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1394277189, now seen corresponding path program 1 times [2022-12-13 02:19:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:39,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201684469] [2022-12-13 02:19:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:40,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:19:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:40,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201684469] [2022-12-13 02:19:40,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201684469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:40,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:40,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:40,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613329411] [2022-12-13 02:19:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:40,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:40,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:40,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:40,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:40,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:40,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:40,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:40,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:40,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:40,102 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:40,102 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:40,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:40,103 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:40,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:40,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:40,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:40,104 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:40,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:40,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:40,107 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,107 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:40,107 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:40,107 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:40,107 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,107 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:40,107 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:40,107 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:40,113 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:40,113 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:40,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:40,113 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:40,113 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:40,199 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:40,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:40,200 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:40,200 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 02:19:40,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:40,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:40,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1148 [2022-12-13 02:19:40,200 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:19:40,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:40,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1365648038, now seen corresponding path program 1 times [2022-12-13 02:19:40,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:40,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767141191] [2022-12-13 02:19:40,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:40,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:19:40,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:40,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767141191] [2022-12-13 02:19:40,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767141191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:40,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:40,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:40,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608928577] [2022-12-13 02:19:40,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:40,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:40,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:40,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:40,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:40,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:40,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:40,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:40,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:40,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:40,322 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:40,322 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:40,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:40,323 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:40,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:40,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:40,323 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:40,323 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:40,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:40,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:40,326 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:40,326 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:40,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:40,326 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:40,327 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:40,327 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:40,332 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:40,332 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:40,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:40,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:40,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:40,420 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:40,420 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:40,421 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:40,421 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 02:19:40,421 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:40,421 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:40,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1149 [2022-12-13 02:19:40,421 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:19:40,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:40,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1337018887, now seen corresponding path program 1 times [2022-12-13 02:19:40,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:40,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133838486] [2022-12-13 02:19:40,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:40,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:19:40,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:40,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133838486] [2022-12-13 02:19:40,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133838486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:40,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:40,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:40,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593886797] [2022-12-13 02:19:40,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:40,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:40,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:40,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:40,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:40,470 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:40,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:40,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:40,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:40,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:40,545 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:40,545 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:40,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:40,547 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:40,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:40,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:40,547 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:40,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:40,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:40,550 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,550 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:40,550 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:40,550 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:40,550 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,550 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:40,550 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:40,550 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:40,556 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:40,556 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:19:40,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:40,556 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:40,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:40,642 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:40,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:40,642 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:40,642 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 02:19:40,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:40,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:40,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1150 [2022-12-13 02:19:40,643 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:19:40,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:40,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1308389736, now seen corresponding path program 1 times [2022-12-13 02:19:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:40,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634190535] [2022-12-13 02:19:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:40,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 02:19:40,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:40,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634190535] [2022-12-13 02:19:40,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634190535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:40,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:40,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:40,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916002990] [2022-12-13 02:19:40,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:40,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:40,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:40,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:40,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:40,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:40,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:40,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:40,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:40,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:40,763 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:40,764 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:40,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:40,765 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:40,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:40,765 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:40,765 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:40,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:40,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:40,768 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,768 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:40,768 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:40,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:40,768 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:40,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:40,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:40,774 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:40,774 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:40,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:40,775 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:40,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:40,860 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:40,860 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:40,860 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:40,860 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 02:19:40,860 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:40,861 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:40,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1151 [2022-12-13 02:19:40,861 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:19:40,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:40,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1279760585, now seen corresponding path program 1 times [2022-12-13 02:19:40,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:40,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121914618] [2022-12-13 02:19:40,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:40,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:40,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:19:40,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:40,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121914618] [2022-12-13 02:19:40,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121914618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:40,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:40,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:40,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435118008] [2022-12-13 02:19:40,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:40,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:40,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:40,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:40,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:40,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:40,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:40,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:40,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:40,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:40,984 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:40,984 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:40,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:40,985 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:40,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:40,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:40,986 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:40,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:40,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:40,988 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,988 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:40,989 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:40,989 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:40,989 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,989 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:40,989 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:40,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:40,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:40,994 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:40,994 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:40,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:40,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:40,995 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:41,082 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:41,082 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:41,082 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:41,082 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 02:19:41,082 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:41,082 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:41,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1152 [2022-12-13 02:19:41,082 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:19:41,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1251131434, now seen corresponding path program 1 times [2022-12-13 02:19:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:41,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032549189] [2022-12-13 02:19:41,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:41,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:41,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:19:41,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:41,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032549189] [2022-12-13 02:19:41,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032549189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:41,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:41,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:41,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647243755] [2022-12-13 02:19:41,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:41,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:41,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:41,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:41,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:41,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:41,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:41,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:41,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:41,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:41,206 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:41,207 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:41,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:41,208 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:41,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:41,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:41,208 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:41,208 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:41,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:41,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:41,211 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:41,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:41,211 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:41,211 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:41,211 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:41,211 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:41,211 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:41,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:41,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:41,217 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:41,217 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:41,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:41,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:41,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:41,303 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:41,304 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:41,304 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:41,304 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 02:19:41,304 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:41,304 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:41,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1153 [2022-12-13 02:19:41,304 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:19:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1222502283, now seen corresponding path program 1 times [2022-12-13 02:19:41,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:41,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894121290] [2022-12-13 02:19:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:41,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:41,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:19:41,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:41,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894121290] [2022-12-13 02:19:41,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894121290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:41,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:41,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:41,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111108017] [2022-12-13 02:19:41,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:41,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:41,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:41,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:41,352 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:41,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:41,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:41,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:41,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:41,426 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:41,426 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:41,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:41,427 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:41,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:41,427 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:41,428 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:41,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:41,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:41,430 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:41,430 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:41,430 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:41,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:41,430 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:41,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:41,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:41,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:41,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:41,436 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:41,436 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:41,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:41,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:41,437 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:41,522 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:41,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:41,522 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:41,522 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 02:19:41,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:41,523 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:41,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1154 [2022-12-13 02:19:41,523 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:19:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1193873132, now seen corresponding path program 1 times [2022-12-13 02:19:41,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:41,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308375303] [2022-12-13 02:19:41,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:41,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19: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:19:41,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:41,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308375303] [2022-12-13 02:19:41,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308375303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:41,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:41,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:41,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538879214] [2022-12-13 02:19:41,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:41,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:41,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:41,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:41,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:41,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:41,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:41,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:41,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:41,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:41,636 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:41,636 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:41,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:41,637 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:41,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:41,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:41,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:41,638 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:41,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:41,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:41,640 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:41,640 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:41,641 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:41,641 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:41,641 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:41,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:41,641 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:41,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:41,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:41,646 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:41,647 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:41,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:41,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:41,647 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:41,733 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:41,733 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:41,733 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:41,733 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 02:19:41,734 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:41,734 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:41,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1155 [2022-12-13 02:19:41,734 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:19:41,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:41,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1165243981, now seen corresponding path program 1 times [2022-12-13 02:19:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:41,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624216175] [2022-12-13 02:19:41,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:41,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:41,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:19:41,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:41,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624216175] [2022-12-13 02:19:41,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624216175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:41,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:41,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:41,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396118418] [2022-12-13 02:19:41,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:41,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:41,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:41,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:41,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:41,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:41,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:41,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:41,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:41,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:41,882 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:41,882 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:41,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:41,883 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:41,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:41,884 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:41,884 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:41,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:41,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:41,886 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:41,886 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:41,886 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:41,886 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:41,887 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:41,887 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:41,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:41,887 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:41,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:41,892 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:41,892 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:19:41,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:41,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:41,893 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:41,979 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:41,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:41,979 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:41,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:41,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:41,979 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:41,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1156 [2022-12-13 02:19:41,979 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:19:41,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1136614830, now seen corresponding path program 1 times [2022-12-13 02:19:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:41,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659366053] [2022-12-13 02:19:41,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:41,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19: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 02:19:42,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:42,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659366053] [2022-12-13 02:19:42,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659366053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:42,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:42,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781473241] [2022-12-13 02:19:42,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:42,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:42,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:42,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:42,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:42,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:42,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:42,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:42,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:42,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:42,104 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:42,104 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:42,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:42,105 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:42,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:42,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:42,105 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:42,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:42,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:42,108 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,108 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:42,108 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:42,108 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:42,108 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:42,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:42,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:42,114 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:42,114 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:42,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:42,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:42,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:42,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:42,201 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:42,201 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:42,201 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 02:19:42,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:42,201 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:42,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1157 [2022-12-13 02:19:42,201 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:19:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1107985679, now seen corresponding path program 1 times [2022-12-13 02:19:42,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:42,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981476606] [2022-12-13 02:19:42,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:42,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:42,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:19:42,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:42,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981476606] [2022-12-13 02:19:42,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981476606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:42,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:42,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:42,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037365764] [2022-12-13 02:19:42,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:42,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:42,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:42,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:42,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:42,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:42,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:42,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:42,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:42,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:42,319 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:42,319 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:42,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:42,320 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:42,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:42,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:42,320 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:42,320 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:42,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:42,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:42,323 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:42,323 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:42,323 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:42,323 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,323 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:42,323 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:42,324 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:42,329 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:42,329 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:42,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:42,330 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:42,330 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:42,415 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:42,416 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:42,416 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:42,416 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 02:19:42,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:42,416 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:42,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1158 [2022-12-13 02:19:42,416 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:19:42,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1079356528, now seen corresponding path program 1 times [2022-12-13 02:19:42,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:42,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102922687] [2022-12-13 02:19:42,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:42,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:42,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:19:42,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:42,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102922687] [2022-12-13 02:19:42,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102922687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:42,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:42,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:42,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109534433] [2022-12-13 02:19:42,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:42,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:42,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:42,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:42,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:42,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:42,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:42,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:42,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:42,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:42,524 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:42,524 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:42,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:42,525 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:42,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:42,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:42,526 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:42,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:42,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:42,528 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:42,528 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:42,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:42,529 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:42,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:42,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:42,534 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:42,534 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:42,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:42,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:42,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:42,620 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:42,621 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:42,621 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:42,621 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 02:19:42,621 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:42,621 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:42,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1159 [2022-12-13 02:19:42,621 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:19:42,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1050727377, now seen corresponding path program 1 times [2022-12-13 02:19:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:42,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157122525] [2022-12-13 02:19:42,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:42,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:42,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:19:42,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:42,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157122525] [2022-12-13 02:19:42,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157122525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:42,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:42,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:42,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350906711] [2022-12-13 02:19:42,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:42,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:42,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:42,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:42,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:42,669 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:42,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:42,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:42,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:42,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:42,742 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:42,742 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:42,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:42,743 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:42,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:42,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:42,744 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:42,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:42,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:42,746 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:42,746 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:42,746 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:42,746 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,746 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:42,746 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:42,747 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:42,752 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:42,752 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:42,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:42,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:42,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:42,837 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:42,837 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:19:42,837 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:42,837 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 02:19:42,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:42,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:42,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1160 [2022-12-13 02:19:42,838 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:19:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:42,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1022098226, now seen corresponding path program 1 times [2022-12-13 02:19:42,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:42,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604900498] [2022-12-13 02:19:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:42,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:42,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:19:42,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:42,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604900498] [2022-12-13 02:19:42,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604900498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:42,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:42,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:42,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947344384] [2022-12-13 02:19:42,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:42,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:42,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:42,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:42,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:42,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:42,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:42,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:42,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:42,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:42,952 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:42,953 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:42,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:42,954 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:42,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:42,954 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:42,954 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:42,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:42,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:42,957 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,957 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:42,957 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:42,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:42,957 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:42,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:42,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:42,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:42,963 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:42,963 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:42,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:42,963 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:42,963 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:43,050 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:43,050 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:43,050 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:43,050 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 02:19:43,050 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:43,050 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:43,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1161 [2022-12-13 02:19:43,050 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:19:43,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:43,051 INFO L85 PathProgramCache]: Analyzing trace with hash -993469075, now seen corresponding path program 1 times [2022-12-13 02:19:43,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:43,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827822448] [2022-12-13 02:19:43,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:43,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:43,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:19:43,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:43,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827822448] [2022-12-13 02:19:43,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827822448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:43,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:43,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:43,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274434229] [2022-12-13 02:19:43,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:43,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:43,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:43,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:43,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:43,099 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:43,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:43,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:43,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:43,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:43,165 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:43,165 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:19:43,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:43,166 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:43,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:43,166 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:43,166 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:43,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:43,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:43,169 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:43,169 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:43,169 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:43,169 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:43,169 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:43,169 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:43,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:43,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:43,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:43,175 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:43,175 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:19:43,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:43,176 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:43,176 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:43,261 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:43,262 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:43,262 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:43,262 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 02:19:43,262 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:43,262 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:43,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1162 [2022-12-13 02:19:43,262 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:19:43,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:43,262 INFO L85 PathProgramCache]: Analyzing trace with hash -964839924, now seen corresponding path program 1 times [2022-12-13 02:19:43,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:43,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399262833] [2022-12-13 02:19:43,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:43,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:43,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:19:43,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:43,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399262833] [2022-12-13 02:19:43,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399262833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:43,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:43,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023297454] [2022-12-13 02:19:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:43,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:43,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:43,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:43,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:43,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:43,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:43,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:43,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:43,377 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:43,377 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:43,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:43,378 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:43,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:43,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:43,379 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:43,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:43,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:43,381 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:43,381 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:43,381 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:43,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:43,381 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:43,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:43,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:43,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:43,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:43,387 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:43,387 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:43,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:43,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:43,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:43,473 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:43,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:43,474 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:43,474 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 02:19:43,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:43,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:43,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1163 [2022-12-13 02:19:43,474 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:19:43,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:43,474 INFO L85 PathProgramCache]: Analyzing trace with hash -936210773, now seen corresponding path program 1 times [2022-12-13 02:19:43,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:43,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781293931] [2022-12-13 02:19:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:43,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:43,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:19:43,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:43,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781293931] [2022-12-13 02:19:43,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781293931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:43,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:43,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:43,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558658256] [2022-12-13 02:19:43,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:43,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:43,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:43,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:43,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:43,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:43,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:43,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:43,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:43,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:43,606 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:43,606 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:43,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:43,607 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:43,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:43,608 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:43,608 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:43,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:43,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:43,610 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:43,610 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:43,611 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:43,611 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:43,611 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:43,611 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:43,611 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:43,611 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:43,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:43,617 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:43,617 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:43,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:43,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:43,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:43,704 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:43,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:43,705 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:43,705 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 02:19:43,705 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:43,705 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:43,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1164 [2022-12-13 02:19:43,705 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:19:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash -907581622, now seen corresponding path program 1 times [2022-12-13 02:19:43,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:43,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112518686] [2022-12-13 02:19:43,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:43,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:43,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:19:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:43,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112518686] [2022-12-13 02:19:43,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112518686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:43,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:43,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:43,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851051840] [2022-12-13 02:19:43,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:43,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:43,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:43,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:43,751 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:43,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:43,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:43,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:43,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:43,816 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:43,816 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:43,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:43,817 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:43,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:43,817 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:43,817 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:43,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:43,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:43,820 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:43,820 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:43,820 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:43,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:43,820 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:43,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:43,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:43,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:43,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:43,826 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:43,826 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:43,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:43,827 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:43,827 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:43,913 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:43,913 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:43,913 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:43,913 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 02:19:43,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:43,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:43,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1165 [2022-12-13 02:19:43,914 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:19:43,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:43,914 INFO L85 PathProgramCache]: Analyzing trace with hash -878952471, now seen corresponding path program 1 times [2022-12-13 02:19:43,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:43,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82540325] [2022-12-13 02:19:43,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:43,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:43,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:19:43,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:43,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82540325] [2022-12-13 02:19:43,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82540325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:43,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:43,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:43,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166785216] [2022-12-13 02:19:43,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:43,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:43,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:43,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:43,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:43,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:43,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:43,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:43,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:43,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:44,052 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:44,052 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:44,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:44,053 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:44,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:44,054 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:44,054 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:44,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:44,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:44,056 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,056 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:44,057 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:44,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:44,057 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:44,057 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:44,057 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:44,062 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:44,062 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:44,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:44,063 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:44,063 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:44,149 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:44,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:44,149 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:44,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:44,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:44,149 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:44,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1166 [2022-12-13 02:19:44,149 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:19:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:44,150 INFO L85 PathProgramCache]: Analyzing trace with hash -850323320, now seen corresponding path program 1 times [2022-12-13 02:19:44,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:44,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902029077] [2022-12-13 02:19:44,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:44,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:44,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:19:44,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:44,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902029077] [2022-12-13 02:19:44,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902029077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:44,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:44,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:44,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803010671] [2022-12-13 02:19:44,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:44,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:44,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:44,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:44,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:44,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:44,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:44,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:44,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:44,273 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:44,273 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:44,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:44,275 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:44,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:44,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:44,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:44,275 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:44,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:44,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:44,278 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:44,278 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:44,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:44,278 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:44,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:44,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:44,284 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:44,284 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:44,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:44,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:44,284 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:44,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:44,371 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:44,371 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:44,371 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 02:19:44,371 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:44,371 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:44,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1167 [2022-12-13 02:19:44,371 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:19:44,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:44,371 INFO L85 PathProgramCache]: Analyzing trace with hash -821694169, now seen corresponding path program 1 times [2022-12-13 02:19:44,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:44,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886117537] [2022-12-13 02:19:44,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:44,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:44,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:19:44,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:44,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886117537] [2022-12-13 02:19:44,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886117537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:44,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:44,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:44,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409678785] [2022-12-13 02:19:44,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:44,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:44,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:44,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:44,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:44,418 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:44,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:44,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:44,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:44,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:44,491 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:44,492 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:44,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:44,493 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:44,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:44,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:44,493 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:44,493 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:44,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:44,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:44,496 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,496 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:44,496 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:44,496 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:44,496 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,496 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:44,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:44,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:44,502 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:44,502 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:19:44,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:44,503 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:44,503 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:44,588 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:44,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:44,589 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:44,589 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 02:19:44,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:44,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:44,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1168 [2022-12-13 02:19:44,589 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:19:44,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:44,589 INFO L85 PathProgramCache]: Analyzing trace with hash -793065018, now seen corresponding path program 1 times [2022-12-13 02:19:44,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:44,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849439852] [2022-12-13 02:19:44,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:44,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:44,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:19:44,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:44,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849439852] [2022-12-13 02:19:44,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849439852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:44,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:44,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:44,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586962940] [2022-12-13 02:19:44,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:44,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:44,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:44,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:44,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:44,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:44,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:44,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:44,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:44,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:44,727 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:44,727 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:44,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:44,728 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:44,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:44,729 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:44,729 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:44,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:44,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:44,731 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,731 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:44,731 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:44,731 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:44,731 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:44,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:44,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:44,737 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:44,737 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:44,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:44,738 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:44,738 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:44,824 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:44,824 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:44,824 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:44,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:44,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:44,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:44,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1169 [2022-12-13 02:19:44,825 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:19:44,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash -764435867, now seen corresponding path program 1 times [2022-12-13 02:19:44,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:44,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716289871] [2022-12-13 02:19:44,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:44,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:44,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:19:44,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:44,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716289871] [2022-12-13 02:19:44,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716289871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:44,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:44,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:44,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874890116] [2022-12-13 02:19:44,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:44,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:44,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:44,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:44,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:44,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:44,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:44,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:44,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:44,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:44,952 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:44,952 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:44,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:44,953 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:44,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:44,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:44,954 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:44,954 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:44,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:44,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:44,956 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,956 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:44,956 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:44,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:44,956 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:44,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:44,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:44,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:44,962 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:44,962 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:44,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:44,963 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:44,963 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:45,050 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:45,050 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:45,050 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:45,050 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 02:19:45,050 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:45,050 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:45,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1170 [2022-12-13 02:19:45,050 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:19:45,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:45,051 INFO L85 PathProgramCache]: Analyzing trace with hash -735806716, now seen corresponding path program 1 times [2022-12-13 02:19:45,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:45,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333790633] [2022-12-13 02:19:45,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:45,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:45,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:19:45,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:45,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333790633] [2022-12-13 02:19:45,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333790633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:45,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:45,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:45,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155006475] [2022-12-13 02:19:45,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:45,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:45,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:45,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:45,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:45,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:45,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:45,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:45,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:45,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:45,175 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:45,176 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:45,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:45,177 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:45,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:45,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:45,177 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:45,177 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:45,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:45,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:45,180 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:45,180 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:45,180 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:45,180 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:45,180 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:45,180 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:45,180 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:45,180 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:45,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:45,186 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:45,186 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:45,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:45,187 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:45,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:45,272 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:45,273 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:45,273 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:45,273 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 02:19:45,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:45,273 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:45,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1171 [2022-12-13 02:19:45,273 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:19:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash -707177565, now seen corresponding path program 1 times [2022-12-13 02:19:45,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:45,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656469636] [2022-12-13 02:19:45,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:45,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:45,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:19:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:45,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656469636] [2022-12-13 02:19:45,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656469636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:45,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:45,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:45,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315370134] [2022-12-13 02:19:45,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:45,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:45,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:45,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:45,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:45,324 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:45,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:45,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:45,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:45,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:45,395 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:45,396 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:45,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:45,397 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:45,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:45,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:45,397 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:45,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:45,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:45,400 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:45,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:45,400 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:45,400 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:45,400 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:45,400 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:45,400 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:45,400 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:45,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:45,406 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:45,406 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:45,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:45,407 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:45,407 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:45,494 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:45,494 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:45,494 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:45,494 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 02:19:45,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:45,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:45,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1172 [2022-12-13 02:19:45,494 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:19:45,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:45,495 INFO L85 PathProgramCache]: Analyzing trace with hash -678548414, now seen corresponding path program 1 times [2022-12-13 02:19:45,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:45,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114767286] [2022-12-13 02:19:45,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:45,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:45,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 02:19:45,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:45,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114767286] [2022-12-13 02:19:45,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114767286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:45,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:45,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:45,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881865528] [2022-12-13 02:19:45,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:45,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:45,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:45,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:45,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:45,543 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:45,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:45,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:45,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:45,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:45,608 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:45,608 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:45,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:45,609 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:45,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:45,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:45,610 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:45,610 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:45,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:45,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:45,612 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:45,612 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:45,612 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:45,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:45,612 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:45,613 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:45,613 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:45,613 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:45,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:45,618 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:45,618 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:45,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:45,619 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:45,619 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:45,704 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:45,704 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:45,704 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:45,704 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 02:19:45,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:45,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:45,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1173 [2022-12-13 02:19:45,705 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:19:45,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:45,705 INFO L85 PathProgramCache]: Analyzing trace with hash -649919263, now seen corresponding path program 1 times [2022-12-13 02:19:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:45,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736326383] [2022-12-13 02:19:45,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:45,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:45,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:19:45,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:45,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736326383] [2022-12-13 02:19:45,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736326383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:45,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:45,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245543294] [2022-12-13 02:19:45,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:45,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:45,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:45,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:45,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:45,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:45,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:45,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:45,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:45,850 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:45,850 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:45,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:45,851 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:45,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:45,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:45,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:45,852 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:45,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:45,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:45,854 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:45,854 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:45,854 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:45,854 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:45,855 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:45,855 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:45,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:45,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:45,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:45,860 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:45,860 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:19:45,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:45,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:45,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:45,947 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:45,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:45,947 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:45,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:45,947 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:45,947 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:45,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1174 [2022-12-13 02:19:45,947 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:19:45,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:45,948 INFO L85 PathProgramCache]: Analyzing trace with hash -621290112, now seen corresponding path program 1 times [2022-12-13 02:19:45,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:45,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607591416] [2022-12-13 02:19:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:45,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:45,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:19:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:45,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607591416] [2022-12-13 02:19:45,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607591416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:45,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:45,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:45,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242640989] [2022-12-13 02:19:45,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:45,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:45,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:45,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:45,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:45,997 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:45,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:45,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:45,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:45,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:46,073 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:46,073 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:46,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:46,074 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:46,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:46,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:46,075 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:46,075 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:46,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:46,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:46,077 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:46,077 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:46,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:46,077 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,078 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:46,078 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:46,078 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:46,083 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:46,084 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:46,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:46,084 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:46,084 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:46,170 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:46,170 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:46,170 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:46,170 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 02:19:46,170 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:46,171 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:46,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1175 [2022-12-13 02:19:46,171 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:19:46,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:46,171 INFO L85 PathProgramCache]: Analyzing trace with hash -592660961, now seen corresponding path program 1 times [2022-12-13 02:19:46,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:46,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833832926] [2022-12-13 02:19:46,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:46,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:46,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 02:19:46,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:46,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833832926] [2022-12-13 02:19:46,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833832926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:46,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:46,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:46,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155383149] [2022-12-13 02:19:46,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:46,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:46,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:46,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:46,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:46,243 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:46,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:46,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:46,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:46,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:46,317 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:46,317 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:46,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:46,318 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:46,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:46,319 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:46,319 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:46,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:46,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:46,322 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,322 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:46,322 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:46,322 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:46,322 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,322 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:46,322 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:46,322 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:46,328 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:46,328 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:46,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:46,328 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:46,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:46,415 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:46,415 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:46,415 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:46,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:46,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:46,415 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:46,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1176 [2022-12-13 02:19:46,416 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:19:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash -564031810, now seen corresponding path program 1 times [2022-12-13 02:19:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:46,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600642423] [2022-12-13 02:19:46,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:46,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:46,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:19:46,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:46,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600642423] [2022-12-13 02:19:46,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600642423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:46,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:46,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:46,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024404170] [2022-12-13 02:19:46,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:46,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:46,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:46,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:46,466 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:46,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:46,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:46,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:46,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:46,532 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:46,532 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:46,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:46,533 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:46,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:46,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:46,534 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:46,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:46,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:46,537 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,537 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:46,537 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:46,537 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:46,537 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:46,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:46,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:46,543 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:46,543 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:46,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:46,543 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:46,543 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:46,635 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:46,636 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:19:46,636 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:46,636 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 02:19:46,636 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:46,636 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:46,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1177 [2022-12-13 02:19:46,636 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:19:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash -535402659, now seen corresponding path program 1 times [2022-12-13 02:19:46,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:46,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437296362] [2022-12-13 02:19:46,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:46,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 02:19:46,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:46,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437296362] [2022-12-13 02:19:46,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437296362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:46,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:46,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:46,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667953521] [2022-12-13 02:19:46,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:46,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:46,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:46,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:46,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:46,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:46,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:46,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:46,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:46,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:46,780 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:46,780 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:46,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:46,781 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:46,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:46,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:46,782 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:46,782 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:46,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:46,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:46,785 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,785 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:46,785 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:46,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:46,785 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,785 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:46,785 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:46,785 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:46,791 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:46,791 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:46,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:46,791 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:46,791 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:46,876 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:46,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:46,877 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:46,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:46,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:46,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:46,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1178 [2022-12-13 02:19:46,877 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:19:46,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:46,877 INFO L85 PathProgramCache]: Analyzing trace with hash -506773508, now seen corresponding path program 1 times [2022-12-13 02:19:46,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:46,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540830944] [2022-12-13 02:19:46,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:46,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:46,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:19:46,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:46,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540830944] [2022-12-13 02:19:46,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540830944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:46,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:46,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:46,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614801362] [2022-12-13 02:19:46,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:46,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:46,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:46,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:46,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:46,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:46,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:46,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:46,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:46,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:46,994 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:46,994 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:46,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:46,995 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:46,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:46,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:46,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:46,996 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:46,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:46,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:46,998 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,998 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:46,998 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:46,999 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:46,999 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,999 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:46,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:46,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:46,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:47,004 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:47,005 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:19:47,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:47,005 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:47,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:47,090 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:47,091 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:47,091 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:47,091 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 02:19:47,091 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:47,091 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:47,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1179 [2022-12-13 02:19:47,091 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:19:47,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:47,091 INFO L85 PathProgramCache]: Analyzing trace with hash -478144357, now seen corresponding path program 1 times [2022-12-13 02:19:47,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:47,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45192297] [2022-12-13 02:19:47,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:47,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:47,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:19:47,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:47,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45192297] [2022-12-13 02:19:47,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45192297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:47,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:47,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:47,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757183439] [2022-12-13 02:19:47,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:47,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:47,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:47,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:47,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:47,148 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:47,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:47,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:47,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:47,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:47,222 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:47,222 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:47,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:47,223 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:47,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:47,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:47,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:47,224 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:47,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:47,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:47,227 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:47,227 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:47,227 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:47,227 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:47,227 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:47,227 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:47,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:47,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:47,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:47,233 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:47,233 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:47,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:47,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:47,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:47,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:47,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:47,320 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:47,320 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 02:19:47,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:47,320 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:47,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1180 [2022-12-13 02:19:47,320 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:19:47,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash -449515206, now seen corresponding path program 1 times [2022-12-13 02:19:47,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:47,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948310092] [2022-12-13 02:19:47,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:47,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:47,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:19:47,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:47,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948310092] [2022-12-13 02:19:47,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948310092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:47,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:47,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:47,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788044079] [2022-12-13 02:19:47,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:47,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:47,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:47,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:47,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:47,369 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:47,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:47,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:47,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:47,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:47,444 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:47,444 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:47,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:47,445 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:47,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:47,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:47,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:47,446 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:47,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:47,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:47,449 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:47,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:47,449 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:47,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:47,449 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:47,449 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:47,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:47,449 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:47,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:47,455 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:47,455 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:19:47,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:47,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:47,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:47,601 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:47,601 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-13 02:19:47,601 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:47,602 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 02:19:47,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:47,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:47,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1181 [2022-12-13 02:19:47,602 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:19:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash -420886055, now seen corresponding path program 1 times [2022-12-13 02:19:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:47,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555488990] [2022-12-13 02:19:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:47,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:47,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:19:47,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:47,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555488990] [2022-12-13 02:19:47,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555488990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:47,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:47,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:47,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362044693] [2022-12-13 02:19:47,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:47,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:47,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:47,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:47,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:47,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:47,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:47,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:47,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:47,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:47,749 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:47,749 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:19:47,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:47,751 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:47,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:47,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:47,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:47,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:47,751 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:47,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:47,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:47,755 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:47,755 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:47,755 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:47,755 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:47,755 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:47,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:47,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:47,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:47,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:47,762 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:47,762 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:19:47,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:47,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:47,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:47,863 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:47,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:19:47,864 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:47,864 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 02:19:47,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:47,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:47,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1182 [2022-12-13 02:19:47,864 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:19:47,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:47,864 INFO L85 PathProgramCache]: Analyzing trace with hash -392256904, now seen corresponding path program 1 times [2022-12-13 02:19:47,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:47,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38750890] [2022-12-13 02:19:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:47,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:47,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:19:47,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:47,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38750890] [2022-12-13 02:19:47,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38750890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:47,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:47,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778851969] [2022-12-13 02:19:47,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:47,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:47,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:47,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:47,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:47,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:47,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:47,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:47,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:47,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:48,009 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:48,009 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:48,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:48,010 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:48,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:48,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:48,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:48,011 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:48,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:48,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:48,014 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,014 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:48,014 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:48,014 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:48,014 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,015 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:48,015 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:48,015 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:48,022 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:48,022 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:48,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:48,022 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:48,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:48,122 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:48,122 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:19:48,122 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:48,122 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 02:19:48,122 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:48,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:48,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1183 [2022-12-13 02:19:48,123 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:19:48,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash -363627753, now seen corresponding path program 1 times [2022-12-13 02:19:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:48,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297329813] [2022-12-13 02:19:48,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:48,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:19:48,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:48,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297329813] [2022-12-13 02:19:48,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297329813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:48,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:48,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:48,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253813526] [2022-12-13 02:19:48,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:48,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:48,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:48,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:48,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:48,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:48,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:48,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:48,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:48,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:48,292 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:48,292 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:48,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:48,293 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:48,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:48,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:48,294 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:48,294 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:48,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:48,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:48,297 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:48,300 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:48,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:48,300 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,300 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:48,300 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:48,300 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:48,307 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:48,307 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:48,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:48,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:48,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:48,406 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:48,407 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:19:48,407 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:48,407 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 02:19:48,407 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:48,407 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:48,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1184 [2022-12-13 02:19:48,407 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:19:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:48,407 INFO L85 PathProgramCache]: Analyzing trace with hash -334998602, now seen corresponding path program 1 times [2022-12-13 02:19:48,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:48,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835724500] [2022-12-13 02:19:48,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:48,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:48,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:19:48,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:48,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835724500] [2022-12-13 02:19:48,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835724500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:48,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:48,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:48,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671071910] [2022-12-13 02:19:48,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:48,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:48,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:48,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:48,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:48,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:48,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:48,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:48,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:48,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:48,547 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:48,547 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:48,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:48,548 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:48,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:48,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:48,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:48,549 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:48,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:48,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:48,552 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:48,552 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:48,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:48,552 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,552 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:48,552 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:48,552 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:48,558 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:48,558 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:48,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:48,558 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:48,558 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:48,644 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:48,644 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:48,644 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:48,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:48,644 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:48,644 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:48,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1185 [2022-12-13 02:19:48,645 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:19:48,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash -306369451, now seen corresponding path program 1 times [2022-12-13 02:19:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:48,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155383576] [2022-12-13 02:19:48,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:48,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:48,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 02:19:48,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:48,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155383576] [2022-12-13 02:19:48,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155383576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:48,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:48,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:48,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269633871] [2022-12-13 02:19:48,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:48,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:48,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:48,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:48,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:48,695 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:48,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:48,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:48,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:48,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:48,768 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:48,769 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:48,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:48,770 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:48,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:48,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:48,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:48,770 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:48,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:48,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:48,773 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:48,773 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:48,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:48,773 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:48,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:48,773 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:48,779 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:48,779 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:48,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:48,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:48,779 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:48,869 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:48,869 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:19:48,869 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:48,869 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 02:19:48,869 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:48,869 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:48,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1186 [2022-12-13 02:19:48,870 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:19:48,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash -277740300, now seen corresponding path program 1 times [2022-12-13 02:19:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:48,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946729336] [2022-12-13 02:19:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:48,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:48,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:19:48,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:48,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946729336] [2022-12-13 02:19:48,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946729336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:48,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:48,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:48,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215002691] [2022-12-13 02:19:48,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:48,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:48,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:48,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:48,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:48,920 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:48,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:48,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:48,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:48,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:48,984 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:48,984 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:48,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:48,985 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:48,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:48,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:48,986 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:48,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:48,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:48,989 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,989 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:48,989 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:48,989 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:48,989 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,989 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:48,989 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:48,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:48,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:48,995 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:48,995 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:48,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:48,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:48,995 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:49,081 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:49,081 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:49,081 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:49,081 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 02:19:49,081 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:49,081 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:49,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1187 [2022-12-13 02:19:49,082 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:19:49,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash -249111149, now seen corresponding path program 1 times [2022-12-13 02:19:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:49,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956038386] [2022-12-13 02:19:49,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:49,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:19:49,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:49,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956038386] [2022-12-13 02:19:49,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956038386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:49,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:49,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:49,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689211875] [2022-12-13 02:19:49,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:49,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:49,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:49,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:49,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:49,137 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:49,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:49,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:49,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:49,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:49,203 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:49,203 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:49,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:49,204 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:49,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:49,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:49,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:49,205 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:49,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:49,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:49,208 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:49,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:49,208 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:49,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:49,208 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:49,208 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:49,208 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:49,208 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:49,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:49,214 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:49,214 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:19:49,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:49,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:49,214 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:49,299 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:49,300 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:49,300 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:49,300 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 02:19:49,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:49,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:49,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1188 [2022-12-13 02:19:49,300 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:19:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash -220481998, now seen corresponding path program 1 times [2022-12-13 02:19:49,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:49,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298444240] [2022-12-13 02:19:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:49,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:49,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:19:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:49,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298444240] [2022-12-13 02:19:49,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298444240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:49,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:49,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:49,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019167186] [2022-12-13 02:19:49,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:49,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:49,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:49,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:49,351 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:49,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:49,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:49,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:49,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:49,417 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:49,417 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:49,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:49,418 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:49,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:49,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:49,419 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:49,419 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:49,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:49,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:49,421 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:49,422 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:49,422 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:49,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:49,422 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:49,422 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:49,422 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:49,422 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:49,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:49,428 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:49,428 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:19:49,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:49,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:49,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:49,514 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:49,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:49,515 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:49,515 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 02:19:49,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:49,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:49,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1189 [2022-12-13 02:19:49,515 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:19:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash -191852847, now seen corresponding path program 1 times [2022-12-13 02:19:49,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:49,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107862634] [2022-12-13 02:19:49,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:49,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19: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:19:49,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:49,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107862634] [2022-12-13 02:19:49,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107862634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:49,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:49,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:49,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835430826] [2022-12-13 02:19:49,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:49,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:49,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:49,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:49,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:49,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:49,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:49,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:49,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:49,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:49,638 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:49,638 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:49,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:49,639 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:49,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:49,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:49,640 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:49,640 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:49,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:49,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:49,642 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:49,642 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:49,643 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:49,643 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:49,643 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:49,643 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:49,643 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:49,643 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:49,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:49,648 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:49,649 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:19:49,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:49,649 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:49,649 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:49,735 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:49,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:49,736 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:49,736 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 02:19:49,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:49,736 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:49,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1190 [2022-12-13 02:19:49,736 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:19:49,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:49,736 INFO L85 PathProgramCache]: Analyzing trace with hash -163223696, now seen corresponding path program 1 times [2022-12-13 02:19:49,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:49,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901519297] [2022-12-13 02:19:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:49,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:49,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:19:49,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:49,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901519297] [2022-12-13 02:19:49,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901519297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:49,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:49,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:49,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224610758] [2022-12-13 02:19:49,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:49,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:49,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:49,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:49,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:49,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:49,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:49,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:49,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:49,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:49,847 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:49,847 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:49,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:49,849 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:49,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:49,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:49,849 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:49,849 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:49,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:49,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:49,852 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:49,852 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:49,852 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:49,852 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:49,852 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:49,852 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:49,852 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:49,852 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:49,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:49,858 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:49,858 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:49,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:49,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:49,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:49,944 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:49,944 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:49,944 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:49,944 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 02:19:49,944 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:49,944 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:49,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1191 [2022-12-13 02:19:49,945 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:19:49,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash -134594545, now seen corresponding path program 1 times [2022-12-13 02:19:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:49,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426895141] [2022-12-13 02:19:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:50,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:19:50,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:50,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426895141] [2022-12-13 02:19:50,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426895141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:50,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:50,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:50,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629100309] [2022-12-13 02:19:50,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:50,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:50,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:50,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:50,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:50,018 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:50,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:50,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:50,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:50,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:50,102 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:50,102 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:50,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:50,103 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:50,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:50,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:50,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:50,104 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:50,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:50,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:50,106 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:50,106 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:50,106 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:50,107 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:50,107 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:50,107 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:50,107 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:50,107 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:50,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:50,112 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:50,112 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:50,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:50,113 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:50,113 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:50,199 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:50,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:50,200 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:50,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:50,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:50,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:50,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1192 [2022-12-13 02:19:50,200 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:19:50,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash -105965394, now seen corresponding path program 1 times [2022-12-13 02:19:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:50,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558682030] [2022-12-13 02:19:50,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:50,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:50,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:19:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:50,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558682030] [2022-12-13 02:19:50,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558682030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:50,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:50,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:50,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346016364] [2022-12-13 02:19:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:50,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:50,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:50,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:50,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:50,250 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:50,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:50,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:50,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:50,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:50,316 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:50,316 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:50,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:50,317 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:50,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:50,317 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:50,317 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:50,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:50,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:50,320 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:50,320 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:50,320 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:50,321 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:50,321 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:50,321 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:50,321 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:50,321 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:50,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:50,326 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:50,327 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:50,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:50,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:50,327 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:50,414 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:50,415 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:50,415 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:50,415 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 02:19:50,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:50,415 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:50,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1193 [2022-12-13 02:19:50,415 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:19:50,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:50,415 INFO L85 PathProgramCache]: Analyzing trace with hash -77336243, now seen corresponding path program 1 times [2022-12-13 02:19:50,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:50,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673019392] [2022-12-13 02:19:50,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:50,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:19:50,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:50,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673019392] [2022-12-13 02:19:50,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673019392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:50,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:50,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:50,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201135048] [2022-12-13 02:19:50,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:50,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:50,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:50,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:50,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:50,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:50,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:50,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:50,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:50,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:50,529 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:50,529 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:50,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:50,531 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:50,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:50,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:50,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:50,531 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:50,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:50,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:50,534 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:50,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:50,534 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:50,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:50,534 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:50,534 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:50,534 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:50,534 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:50,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:50,540 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:50,540 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:50,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:50,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:50,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:50,628 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:50,629 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:50,629 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:50,629 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 02:19:50,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:50,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:50,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1194 [2022-12-13 02:19:50,629 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:19:50,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:50,629 INFO L85 PathProgramCache]: Analyzing trace with hash -48707092, now seen corresponding path program 1 times [2022-12-13 02:19:50,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:50,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460001186] [2022-12-13 02:19:50,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:50,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:50,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:19:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:50,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460001186] [2022-12-13 02:19:50,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460001186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:50,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:50,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692784967] [2022-12-13 02:19:50,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:50,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:50,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:50,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:50,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:50,679 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:50,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:50,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:50,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:50,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:50,753 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:50,753 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:50,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:50,754 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:50,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:50,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:50,755 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:50,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:50,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:50,757 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:50,757 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:50,758 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:50,758 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:50,758 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:50,758 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:50,758 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:50,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:50,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:50,763 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:50,764 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:50,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:50,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:50,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:50,850 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:50,850 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:50,851 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:50,851 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 02:19:50,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:50,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:50,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1195 [2022-12-13 02:19:50,851 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:19:50,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:50,851 INFO L85 PathProgramCache]: Analyzing trace with hash -20077941, now seen corresponding path program 1 times [2022-12-13 02:19:50,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:50,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644445241] [2022-12-13 02:19:50,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:50,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:19:50,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:50,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644445241] [2022-12-13 02:19:50,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644445241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:50,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:50,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779411794] [2022-12-13 02:19:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:50,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:50,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:50,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:50,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:50,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:50,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:50,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:50,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:50,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:51,008 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:51,008 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:51,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:51,009 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:51,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:51,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:51,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:51,010 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:51,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:51,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:51,012 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:51,012 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:51,012 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:51,012 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:51,012 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:51,013 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:51,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:51,013 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:51,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:51,018 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:51,018 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:19:51,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:51,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:51,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:51,106 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:51,107 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:51,107 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:51,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:51,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:51,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:51,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1196 [2022-12-13 02:19:51,107 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:19:51,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash 8551210, now seen corresponding path program 1 times [2022-12-13 02:19:51,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:51,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135806256] [2022-12-13 02:19:51,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:51,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:51,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:19:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:51,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135806256] [2022-12-13 02:19:51,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135806256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:51,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:51,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739988551] [2022-12-13 02:19:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:51,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:51,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:51,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:51,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:51,164 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:51,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:51,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:51,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:51,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:51,230 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:51,230 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:51,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:51,232 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:51,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:51,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:51,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:51,232 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:51,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:51,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:51,235 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:51,235 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:51,235 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:51,235 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:51,235 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:51,235 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:51,235 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:51,235 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:51,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:51,241 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:51,241 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:19:51,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:51,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:51,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:51,329 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:51,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:51,329 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:51,329 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 02:19:51,329 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:51,329 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:51,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1197 [2022-12-13 02:19:51,330 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:19:51,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash 37180361, now seen corresponding path program 1 times [2022-12-13 02:19:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:51,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642516282] [2022-12-13 02:19:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:51,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:51,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:19:51,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:51,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642516282] [2022-12-13 02:19:51,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642516282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:51,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:51,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:51,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434266674] [2022-12-13 02:19:51,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:51,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:51,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:51,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:51,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:51,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:51,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:51,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:51,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:51,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:51,457 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:51,458 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:51,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:51,459 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:51,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:51,460 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:51,460 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:51,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:51,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:51,464 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:51,464 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:51,464 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:51,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:51,464 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:51,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:51,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:51,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:51,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:51,472 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:51,472 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:51,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:51,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:51,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:51,579 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:51,580 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:19:51,580 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:51,580 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 02:19:51,580 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:51,580 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:51,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1198 [2022-12-13 02:19:51,580 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:19:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:51,580 INFO L85 PathProgramCache]: Analyzing trace with hash 65809512, now seen corresponding path program 1 times [2022-12-13 02:19:51,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:51,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410436563] [2022-12-13 02:19:51,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:51,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:51,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 02:19:51,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:51,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410436563] [2022-12-13 02:19:51,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410436563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:51,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:51,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137485296] [2022-12-13 02:19:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:51,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:51,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:51,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:51,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:51,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:51,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:51,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:51,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:51,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:51,726 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:51,726 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:51,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:51,727 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:51,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:51,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:51,728 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:51,728 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:51,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:51,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:51,732 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:51,732 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:51,732 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:51,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:51,732 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:51,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:51,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:51,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:51,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:51,740 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:51,740 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:19:51,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:51,741 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:51,741 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:51,867 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:51,868 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:19:51,868 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:51,868 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 02:19:51,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:51,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:51,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1199 [2022-12-13 02:19:51,868 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:19:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:51,869 INFO L85 PathProgramCache]: Analyzing trace with hash 94438663, now seen corresponding path program 1 times [2022-12-13 02:19:51,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:51,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653915032] [2022-12-13 02:19:51,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:51,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:51,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:19:51,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:51,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653915032] [2022-12-13 02:19:51,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653915032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:51,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:51,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:51,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398493541] [2022-12-13 02:19:51,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:51,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:51,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:51,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:51,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:51,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:51,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:51,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:51,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:51,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:52,019 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:52,019 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:19:52,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:52,020 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:52,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:52,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:52,021 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:52,021 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:52,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:52,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:52,024 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:52,025 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:52,025 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:52,025 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:52,025 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:52,025 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:52,025 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:52,025 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:52,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:52,033 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:52,033 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:52,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:52,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:52,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:52,140 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:52,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:19:52,141 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:52,141 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 02:19:52,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:52,141 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:52,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1200 [2022-12-13 02:19:52,141 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:19:52,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:52,141 INFO L85 PathProgramCache]: Analyzing trace with hash 123067814, now seen corresponding path program 1 times [2022-12-13 02:19:52,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:52,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172635087] [2022-12-13 02:19:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:52,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 02:19:52,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:52,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172635087] [2022-12-13 02:19:52,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172635087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:52,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:52,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:52,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714318563] [2022-12-13 02:19:52,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:52,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:52,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:52,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:52,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:52,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:52,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:52,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:52,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:52,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:52,320 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:52,320 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:52,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:52,321 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:52,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:52,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:52,322 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:52,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:52,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:52,325 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:52,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:52,325 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:52,325 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:52,325 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:52,325 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:52,325 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:52,325 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:52,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:52,331 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:52,331 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:52,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:52,331 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:52,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:52,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:52,418 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:52,418 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:52,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:52,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:52,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:52,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1201 [2022-12-13 02:19:52,419 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:19:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:52,419 INFO L85 PathProgramCache]: Analyzing trace with hash 151696965, now seen corresponding path program 1 times [2022-12-13 02:19:52,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:52,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950754841] [2022-12-13 02:19:52,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:52,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:52,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:19:52,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:52,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950754841] [2022-12-13 02:19:52,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950754841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:52,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:52,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:52,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811807584] [2022-12-13 02:19:52,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:52,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:52,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:52,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:52,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:52,474 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:52,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:52,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:52,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:52,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:52,549 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:52,549 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:52,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:52,550 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:52,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:52,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:52,551 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:52,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:52,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:52,553 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:52,553 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:52,553 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:52,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:52,554 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:52,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:52,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:52,554 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:52,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:52,560 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:52,560 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:52,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:52,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:52,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:52,646 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:52,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:52,647 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:52,647 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 02:19:52,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:52,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:52,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1202 [2022-12-13 02:19:52,647 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:19:52,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:52,647 INFO L85 PathProgramCache]: Analyzing trace with hash 180326116, now seen corresponding path program 1 times [2022-12-13 02:19:52,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:52,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537100800] [2022-12-13 02:19:52,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:52,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:52,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:19:52,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:52,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537100800] [2022-12-13 02:19:52,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537100800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:52,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:52,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:52,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839619780] [2022-12-13 02:19:52,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:52,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:52,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:52,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:52,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:52,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:52,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:52,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:52,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:52,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:52,770 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:52,771 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:52,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:52,772 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:52,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:52,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:52,772 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:52,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:52,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:52,775 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:52,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:52,775 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:52,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:52,775 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:52,775 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:52,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:52,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:52,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:52,781 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:52,781 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:52,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:52,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:52,781 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:52,874 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:52,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:19:52,875 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:52,875 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 02:19:52,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:52,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:52,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1203 [2022-12-13 02:19:52,875 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:19:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash 208955267, now seen corresponding path program 1 times [2022-12-13 02:19:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:52,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082879751] [2022-12-13 02:19:52,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:52,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:52,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:19:52,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:52,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082879751] [2022-12-13 02:19:52,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082879751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:52,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:52,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:52,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642845189] [2022-12-13 02:19:52,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:52,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:52,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:52,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:52,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:52,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:52,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:52,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:52,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:52,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:52,996 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:52,997 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:52,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:52,998 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:52,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:52,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:52,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:52,998 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:52,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:53,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:53,001 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:53,001 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:53,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:53,001 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:53,002 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:53,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:53,007 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:53,007 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:19:53,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:53,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:53,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:53,094 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:53,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:53,094 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:53,094 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 02:19:53,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:53,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:53,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1204 [2022-12-13 02:19:53,094 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:19:53,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:53,095 INFO L85 PathProgramCache]: Analyzing trace with hash 237584418, now seen corresponding path program 1 times [2022-12-13 02:19:53,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:53,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489261668] [2022-12-13 02:19:53,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:53,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:53,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:19:53,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:53,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489261668] [2022-12-13 02:19:53,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489261668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:53,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:53,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322257121] [2022-12-13 02:19:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:53,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:53,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:53,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:53,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:53,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:53,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:53,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:53,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:53,235 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:53,235 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:53,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:53,236 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:53,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:53,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:53,237 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:53,237 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:53,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:53,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:53,239 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,240 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:53,240 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:53,240 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:53,240 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,240 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:53,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:53,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:53,246 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:53,246 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:53,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:53,246 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:53,246 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:53,332 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:53,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:53,332 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:53,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:53,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:53,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:53,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1205 [2022-12-13 02:19:53,332 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:19:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:53,333 INFO L85 PathProgramCache]: Analyzing trace with hash 266213569, now seen corresponding path program 1 times [2022-12-13 02:19:53,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:53,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696397515] [2022-12-13 02:19:53,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:53,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:53,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:19:53,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:53,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696397515] [2022-12-13 02:19:53,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696397515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:53,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:53,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:53,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87010846] [2022-12-13 02:19:53,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:53,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:53,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:53,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:53,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:53,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:53,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:53,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:53,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:53,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:53,457 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:53,457 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:53,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:53,458 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:53,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:53,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:53,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:53,458 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:53,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:53,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:53,461 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,461 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:53,461 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:53,461 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:53,461 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,461 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:53,461 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:53,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:53,467 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:53,467 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:53,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:53,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:53,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:53,555 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:53,555 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:53,555 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:53,555 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 02:19:53,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:53,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:53,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1206 [2022-12-13 02:19:53,555 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:19:53,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:53,555 INFO L85 PathProgramCache]: Analyzing trace with hash 294842720, now seen corresponding path program 1 times [2022-12-13 02:19:53,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:53,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838033020] [2022-12-13 02:19:53,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:53,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:53,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:19:53,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:53,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838033020] [2022-12-13 02:19:53,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838033020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:53,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:53,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:53,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724559285] [2022-12-13 02:19:53,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:53,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:53,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:53,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:53,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:53,604 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:53,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:53,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:53,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:53,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:53,680 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:53,680 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:53,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:53,681 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:53,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:53,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:53,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:53,681 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:53,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:53,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:53,684 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,684 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:53,684 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:53,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:53,684 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,684 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:53,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:53,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:53,696 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:53,697 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:53,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:53,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:53,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:53,784 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:53,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:19:53,784 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:53,784 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 02:19:53,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:53,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:53,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1207 [2022-12-13 02:19:53,785 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:19:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash 323471871, now seen corresponding path program 1 times [2022-12-13 02:19:53,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:53,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155493107] [2022-12-13 02:19:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:53,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:19:53,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155493107] [2022-12-13 02:19:53,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155493107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:53,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:53,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:53,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493599278] [2022-12-13 02:19:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:53,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:53,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:53,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:53,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:53,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:53,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:53,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:53,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:53,928 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:53,928 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:53,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:53,929 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:53,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:53,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:53,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:53,930 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:53,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:53,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:53,932 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,932 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:53,932 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:53,932 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:53,932 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:53,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:53,933 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:53,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:53,938 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:53,938 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:19:53,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:53,939 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:53,939 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:54,025 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:54,026 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:54,026 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:54,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:54,026 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:54,026 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:54,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1208 [2022-12-13 02:19:54,026 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:19:54,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:54,026 INFO L85 PathProgramCache]: Analyzing trace with hash 352101022, now seen corresponding path program 1 times [2022-12-13 02:19:54,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:54,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181711633] [2022-12-13 02:19:54,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:54,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:54,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:19:54,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:54,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181711633] [2022-12-13 02:19:54,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181711633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:54,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:54,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:54,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245789651] [2022-12-13 02:19:54,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:54,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:54,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:54,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:54,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:54,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:54,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:54,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:54,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:54,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:54,149 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:54,149 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:54,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:54,150 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:54,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:54,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:54,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:54,151 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:54,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:54,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:54,153 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:54,153 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:54,153 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:54,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:54,153 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:54,154 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:54,154 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:54,154 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:54,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:54,159 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:54,159 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:19:54,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:54,160 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:54,160 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:54,248 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:54,248 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:54,248 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:54,248 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 02:19:54,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:54,248 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:54,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1209 [2022-12-13 02:19:54,248 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:19:54,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:54,249 INFO L85 PathProgramCache]: Analyzing trace with hash 380730173, now seen corresponding path program 1 times [2022-12-13 02:19:54,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:54,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463588500] [2022-12-13 02:19:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:54,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:54,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:19:54,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:54,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463588500] [2022-12-13 02:19:54,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463588500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:54,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:54,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:54,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611528472] [2022-12-13 02:19:54,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:54,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:54,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:54,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:54,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:54,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:54,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:54,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:54,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:54,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:54,365 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:54,365 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:54,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:54,366 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:54,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:54,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:54,367 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:54,367 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:54,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:54,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:54,369 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:54,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:54,370 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:54,370 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:54,370 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:54,370 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:54,370 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:54,370 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:54,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:54,376 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:54,376 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:54,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:54,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:54,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:54,463 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:54,464 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:54,464 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:54,464 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 02:19:54,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:54,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:54,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1210 [2022-12-13 02:19:54,464 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:19:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash 409359324, now seen corresponding path program 1 times [2022-12-13 02:19:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:54,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691668638] [2022-12-13 02:19:54,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:54,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:54,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:19:54,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:54,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691668638] [2022-12-13 02:19:54,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691668638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:54,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:54,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:54,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877793668] [2022-12-13 02:19:54,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:54,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:54,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:54,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:54,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:54,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:54,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:54,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:54,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:54,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:54,612 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:54,612 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:54,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:54,613 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:54,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:54,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:54,614 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:54,614 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:54,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:54,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:54,616 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:54,616 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:54,617 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:54,617 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:54,617 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:54,617 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:54,617 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:54,617 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:54,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:54,623 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:54,623 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:54,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:54,623 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:54,623 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:54,708 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:54,709 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:54,709 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:54,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:54,709 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:54,709 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:54,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1211 [2022-12-13 02:19:54,709 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:19:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:54,709 INFO L85 PathProgramCache]: Analyzing trace with hash 437988475, now seen corresponding path program 1 times [2022-12-13 02:19:54,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:54,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316289628] [2022-12-13 02:19:54,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:54,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:54,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:19:54,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:54,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316289628] [2022-12-13 02:19:54,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316289628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:54,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:54,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:54,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155224165] [2022-12-13 02:19:54,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:54,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:54,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:54,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:54,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:54,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:54,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:54,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:54,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:54,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:54,851 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:54,851 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:54,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:54,852 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:54,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:54,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:54,852 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:54,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:54,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:54,855 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:54,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:54,855 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:54,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:54,855 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:54,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:54,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:54,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:54,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:54,861 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:54,861 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:54,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:54,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:54,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:54,948 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:54,948 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:54,948 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:54,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:54,948 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:54,948 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:54,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1212 [2022-12-13 02:19:54,948 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:19:54,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash 466617626, now seen corresponding path program 1 times [2022-12-13 02:19:54,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:54,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409530088] [2022-12-13 02:19:54,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:54,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19: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:19:54,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:54,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409530088] [2022-12-13 02:19:54,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409530088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:54,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:54,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:54,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506910269] [2022-12-13 02:19:54,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:54,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:54,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:54,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:54,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:54,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:54,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:54,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:54,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:54,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:55,065 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:55,065 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:55,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:55,066 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:55,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:55,066 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:55,066 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:55,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:55,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:55,069 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,069 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:55,069 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:55,069 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:55,069 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,069 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:55,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:55,069 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:55,075 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:55,075 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:55,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:55,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:55,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:55,163 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:55,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:55,164 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:55,164 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 02:19:55,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:55,164 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:55,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1213 [2022-12-13 02:19:55,164 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:19:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash 495246777, now seen corresponding path program 1 times [2022-12-13 02:19:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:55,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954705021] [2022-12-13 02:19:55,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:55,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:55,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:19:55,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:55,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954705021] [2022-12-13 02:19:55,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954705021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:55,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:55,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:55,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919310564] [2022-12-13 02:19:55,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:55,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:55,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:55,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:55,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:55,230 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:55,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:55,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:55,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:55,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:55,298 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:55,298 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:55,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:55,300 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:55,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:55,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:55,300 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:55,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:55,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:55,303 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,303 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:55,303 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:55,303 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:55,303 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,303 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:55,303 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:55,303 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:55,310 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:55,310 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:55,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:55,311 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:55,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:55,398 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:55,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:19:55,399 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:55,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:55,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:55,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:55,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1214 [2022-12-13 02:19:55,399 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:19:55,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:55,399 INFO L85 PathProgramCache]: Analyzing trace with hash 523875928, now seen corresponding path program 1 times [2022-12-13 02:19:55,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:55,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87704819] [2022-12-13 02:19:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:55,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:55,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:19:55,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:55,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87704819] [2022-12-13 02:19:55,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87704819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:55,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:55,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:55,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660881922] [2022-12-13 02:19:55,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:55,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:55,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:55,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:55,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:55,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:55,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:55,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:55,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:55,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:55,525 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:55,525 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:55,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:55,526 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:55,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:55,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:55,526 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:55,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:55,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:55,529 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:55,529 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:55,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:55,529 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:55,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:55,530 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:55,535 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:55,535 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:55,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:55,536 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:55,536 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:55,622 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:55,623 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:55,623 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:55,623 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 02:19:55,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:55,623 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:55,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1215 [2022-12-13 02:19:55,623 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:19:55,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:55,623 INFO L85 PathProgramCache]: Analyzing trace with hash 552505079, now seen corresponding path program 1 times [2022-12-13 02:19:55,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:55,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687867485] [2022-12-13 02:19:55,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:55,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:55,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 02:19:55,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:55,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687867485] [2022-12-13 02:19:55,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687867485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:55,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:55,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:55,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076944343] [2022-12-13 02:19:55,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:55,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:55,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:55,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:55,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:55,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:55,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:55,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:55,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:55,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:55,746 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:55,746 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:55,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:55,747 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:55,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:55,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:55,747 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:55,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:55,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:55,750 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:55,750 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:55,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:55,750 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:55,750 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:55,750 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:55,756 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:55,756 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:55,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:55,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:55,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:55,842 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:55,843 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:55,843 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:55,843 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 02:19:55,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:55,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:55,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1216 [2022-12-13 02:19:55,843 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:19:55,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:55,843 INFO L85 PathProgramCache]: Analyzing trace with hash 581134230, now seen corresponding path program 1 times [2022-12-13 02:19:55,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:55,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723251073] [2022-12-13 02:19:55,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:55,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:55,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:19:55,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:55,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723251073] [2022-12-13 02:19:55,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723251073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:55,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:55,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:55,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396596394] [2022-12-13 02:19:55,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:55,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:55,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:55,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:55,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:55,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:55,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:55,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:55,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:55,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:55,968 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:55,969 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:55,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:55,969 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:55,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:55,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:55,970 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:55,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:55,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:55,973 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,973 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:55,973 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:55,973 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:55,973 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,973 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:55,973 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:55,973 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:55,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:55,979 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:55,979 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:55,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:55,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:55,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:56,065 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:56,065 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:56,065 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:56,065 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 02:19:56,066 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:56,066 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:56,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1217 [2022-12-13 02:19:56,066 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:19:56,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:56,066 INFO L85 PathProgramCache]: Analyzing trace with hash 609763381, now seen corresponding path program 1 times [2022-12-13 02:19:56,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:56,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592396548] [2022-12-13 02:19:56,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:56,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:19:56,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:56,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592396548] [2022-12-13 02:19:56,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592396548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:56,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:56,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:56,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242284794] [2022-12-13 02:19:56,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:56,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:56,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:56,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:56,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:56,115 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:56,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:56,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:56,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:56,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:56,180 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:56,180 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:56,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:56,181 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:56,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:56,181 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:56,182 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:56,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:56,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:56,184 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:56,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:56,184 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:56,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:56,184 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:56,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:56,185 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:56,185 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:56,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:56,190 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:56,190 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:56,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:56,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:56,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:56,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:56,277 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:56,277 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:56,277 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 02:19:56,277 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:56,277 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:56,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1218 [2022-12-13 02:19:56,277 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:19:56,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:56,277 INFO L85 PathProgramCache]: Analyzing trace with hash 638392532, now seen corresponding path program 1 times [2022-12-13 02:19:56,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:56,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093584568] [2022-12-13 02:19:56,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:56,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:56,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:19:56,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:56,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093584568] [2022-12-13 02:19:56,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093584568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:56,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:56,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:56,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746128970] [2022-12-13 02:19:56,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:56,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:56,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:56,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:56,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:56,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:56,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:56,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:56,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:56,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:56,400 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:56,400 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:56,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:56,401 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:56,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:56,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:56,402 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:56,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:56,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:56,405 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:56,405 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:56,405 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:56,405 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:56,405 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:56,405 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:56,405 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:56,405 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:56,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:56,411 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:56,411 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:56,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:56,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:56,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:56,496 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:56,497 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:56,497 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:56,497 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 02:19:56,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:56,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:56,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1219 [2022-12-13 02:19:56,497 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:19:56,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:56,497 INFO L85 PathProgramCache]: Analyzing trace with hash 667021683, now seen corresponding path program 1 times [2022-12-13 02:19:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:56,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89418361] [2022-12-13 02:19:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:56,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:56,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:19:56,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:56,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89418361] [2022-12-13 02:19:56,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89418361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:56,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:56,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:56,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136625678] [2022-12-13 02:19:56,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:56,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:56,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:56,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:56,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:56,545 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:56,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:56,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:56,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:56,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:56,610 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:56,610 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:56,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:56,611 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:56,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:56,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:56,611 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:56,612 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:56,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:56,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:56,614 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:56,614 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:56,614 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:56,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:56,614 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:56,614 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:56,614 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:56,614 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:56,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:56,620 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:56,620 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:56,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:56,621 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:56,621 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:56,705 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:56,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:19:56,705 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:56,705 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 02:19:56,705 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:56,705 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:56,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1220 [2022-12-13 02:19:56,705 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:19:56,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:56,705 INFO L85 PathProgramCache]: Analyzing trace with hash 695650834, now seen corresponding path program 1 times [2022-12-13 02:19:56,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:56,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110849380] [2022-12-13 02:19:56,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:56,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19: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 02:19:56,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:56,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110849380] [2022-12-13 02:19:56,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110849380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:56,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:56,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:56,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330437425] [2022-12-13 02:19:56,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:56,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:56,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:56,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:56,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:56,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:56,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:56,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:56,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:56,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:56,830 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:56,830 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:56,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:56,831 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:56,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:56,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:56,832 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:56,832 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:56,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:56,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:56,834 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:56,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:56,834 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:56,835 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:56,835 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:56,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:56,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:56,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:56,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:56,841 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:56,841 INFO L131 PetriNetUnfolder]: For 435/444 co-relation queries the response was YES. [2022-12-13 02:19:56,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/444 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:56,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:56,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:56,927 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:56,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:56,927 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:56,927 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 02:19:56,927 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:56,927 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:56,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1221 [2022-12-13 02:19:56,928 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:19:56,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:56,928 INFO L85 PathProgramCache]: Analyzing trace with hash 724279985, now seen corresponding path program 1 times [2022-12-13 02:19:56,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:56,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003817829] [2022-12-13 02:19:56,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:56,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:56,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:19:56,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:56,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003817829] [2022-12-13 02:19:56,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003817829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:56,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:56,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:56,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695618384] [2022-12-13 02:19:56,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:56,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:56,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:56,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:56,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:56,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:56,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:56,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:56,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:56,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:57,042 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:57,042 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:57,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:57,043 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:57,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:57,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:57,044 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:57,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:57,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:57,046 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,047 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:57,047 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:57,047 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:57,047 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:57,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:57,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:57,053 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:57,053 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:57,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:57,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:57,053 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:57,140 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:57,140 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:57,140 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:57,140 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 02:19:57,140 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:57,140 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:57,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1222 [2022-12-13 02:19:57,140 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:19:57,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash 752909136, now seen corresponding path program 1 times [2022-12-13 02:19:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:57,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114877912] [2022-12-13 02:19:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:57,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:19:57,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:57,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114877912] [2022-12-13 02:19:57,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114877912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:57,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:57,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:57,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335896559] [2022-12-13 02:19:57,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:57,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:57,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:57,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:57,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:57,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:57,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:57,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:57,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:57,262 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:57,262 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:57,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:57,263 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:57,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:57,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:57,264 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:57,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:57,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:57,266 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,266 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:57,267 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:57,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:57,267 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,267 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:57,267 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:57,267 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:57,273 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:57,273 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:19:57,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:57,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:57,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:57,360 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:57,361 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:57,361 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:57,361 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 02:19:57,361 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:57,361 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:57,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1223 [2022-12-13 02:19:57,361 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:19:57,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:57,361 INFO L85 PathProgramCache]: Analyzing trace with hash 781538287, now seen corresponding path program 1 times [2022-12-13 02:19:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:57,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31505213] [2022-12-13 02:19:57,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:57,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19: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 02:19:57,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:57,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31505213] [2022-12-13 02:19:57,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31505213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:57,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:57,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:57,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921434865] [2022-12-13 02:19:57,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:57,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:57,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:57,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:57,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:57,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:57,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:57,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:57,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:57,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:57,487 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:57,487 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:57,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1127 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:57,488 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:57,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:57,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:57,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:57,488 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:57,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:57,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:57,491 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,491 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:57,491 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:57,491 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:57,491 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,491 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:57,491 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:57,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:57,497 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:57,497 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:57,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:57,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:57,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:57,585 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:57,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:57,586 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:57,586 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 02:19:57,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:57,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:57,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1224 [2022-12-13 02:19:57,586 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:19:57,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:57,586 INFO L85 PathProgramCache]: Analyzing trace with hash 810167438, now seen corresponding path program 1 times [2022-12-13 02:19:57,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:57,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828069929] [2022-12-13 02:19:57,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:57,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:57,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:19:57,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:57,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828069929] [2022-12-13 02:19:57,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828069929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:57,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:57,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:57,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584826406] [2022-12-13 02:19:57,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:57,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:57,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:57,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:57,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:57,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:57,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:57,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:57,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:57,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:57,709 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:57,710 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:57,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:57,711 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:57,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:57,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:57,711 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:57,711 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:57,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:57,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:57,714 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,714 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:57,714 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:57,714 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:57,714 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,714 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:57,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:57,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:57,720 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:57,720 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:57,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:57,720 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:57,721 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:57,807 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:57,807 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:57,807 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:57,807 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 02:19:57,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:57,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:57,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1225 [2022-12-13 02:19:57,808 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:19:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:57,808 INFO L85 PathProgramCache]: Analyzing trace with hash 838796589, now seen corresponding path program 1 times [2022-12-13 02:19:57,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:57,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616575] [2022-12-13 02:19:57,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:57,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:57,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:19:57,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:57,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616575] [2022-12-13 02:19:57,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:57,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:57,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:57,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658351104] [2022-12-13 02:19:57,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:57,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:57,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:57,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:57,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:57,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:57,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:57,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:57,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:57,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:57,923 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:57,923 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:57,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:57,924 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:57,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:57,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:57,925 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:57,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:57,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:57,928 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,928 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:57,928 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:57,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:57,928 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,928 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:57,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:57,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:57,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:57,934 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:57,934 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:57,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:57,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:57,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:58,020 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:58,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:58,021 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:58,021 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 02:19:58,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:58,021 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:58,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1226 [2022-12-13 02:19:58,021 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:19:58,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:58,021 INFO L85 PathProgramCache]: Analyzing trace with hash 867425740, now seen corresponding path program 1 times [2022-12-13 02:19:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:58,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565864800] [2022-12-13 02:19:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:58,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:19:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:58,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565864800] [2022-12-13 02:19:58,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565864800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:58,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:58,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:58,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222954190] [2022-12-13 02:19:58,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:58,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:58,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:58,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:58,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:58,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:58,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:58,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:58,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:58,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:58,154 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:58,154 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:58,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:58,155 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:58,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:58,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:58,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:58,156 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:58,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:58,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:58,158 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:58,158 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:58,158 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:58,158 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:58,158 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:58,159 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:58,159 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:58,159 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:58,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:58,164 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:58,164 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:58,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:58,165 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:58,165 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:58,250 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:58,250 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:19:58,250 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:58,250 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 02:19:58,250 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:58,250 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:58,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1227 [2022-12-13 02:19:58,250 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:19:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash 896054891, now seen corresponding path program 1 times [2022-12-13 02:19:58,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:58,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407650492] [2022-12-13 02:19:58,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:58,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:58,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:19:58,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:58,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407650492] [2022-12-13 02:19:58,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407650492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:58,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:58,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:58,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652649232] [2022-12-13 02:19:58,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:58,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:58,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:58,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:58,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:58,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:58,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:58,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:58,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:58,366 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:58,366 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:19:58,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:58,368 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:58,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:58,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:58,368 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:58,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:58,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:58,370 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:58,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:58,371 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:58,371 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:58,371 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:58,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:58,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:58,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:58,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:58,377 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:58,377 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:19:58,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:58,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:58,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:58,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:58,464 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:58,464 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:58,464 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 02:19:58,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:58,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:58,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1228 [2022-12-13 02:19:58,465 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:19:58,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:58,465 INFO L85 PathProgramCache]: Analyzing trace with hash 924684042, now seen corresponding path program 1 times [2022-12-13 02:19:58,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:58,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784980391] [2022-12-13 02:19:58,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:58,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:58,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 02:19:58,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:58,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784980391] [2022-12-13 02:19:58,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784980391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:58,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:58,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:58,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876553219] [2022-12-13 02:19:58,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:58,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:58,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:58,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:58,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:58,513 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:58,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:58,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:58,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:58,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:58,587 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:58,587 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:58,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:58,588 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:58,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:58,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:58,589 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:58,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:58,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:58,591 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:58,591 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:58,591 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:58,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:58,592 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:58,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:58,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:58,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:58,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:58,597 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:58,598 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:58,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:58,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:58,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:58,684 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:58,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:58,685 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:58,685 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 02:19:58,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:58,685 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:58,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1229 [2022-12-13 02:19:58,685 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:19:58,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash 953313193, now seen corresponding path program 1 times [2022-12-13 02:19:58,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:58,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757023773] [2022-12-13 02:19:58,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:58,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:58,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:19:58,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:58,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757023773] [2022-12-13 02:19:58,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757023773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:58,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:58,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:58,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058771342] [2022-12-13 02:19:58,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:58,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:58,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:58,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:58,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:58,735 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:58,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:58,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:58,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:58,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:58,809 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:58,810 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:58,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:58,811 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:58,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:58,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:58,811 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:58,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:58,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:58,814 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:58,814 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:58,814 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:58,814 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:58,814 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:58,814 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:58,814 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:58,815 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:58,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:58,820 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:58,820 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:19:58,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:58,821 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:58,821 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:58,907 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:58,907 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:58,907 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:58,907 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 02:19:58,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:58,907 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:58,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1230 [2022-12-13 02:19:58,907 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:19:58,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:58,908 INFO L85 PathProgramCache]: Analyzing trace with hash 981942344, now seen corresponding path program 1 times [2022-12-13 02:19:58,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:58,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5792376] [2022-12-13 02:19:58,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:58,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:58,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:19:58,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:58,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5792376] [2022-12-13 02:19:58,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5792376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:58,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:58,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:19:58,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162786344] [2022-12-13 02:19:58,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:58,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:19:58,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:58,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:19:58,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:19:58,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:58,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:58,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:58,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:58,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:59,055 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:59,055 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:59,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:59,056 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:59,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:59,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:59,057 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:59,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:59,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:59,059 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,059 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:59,059 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:59,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:59,059 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:59,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:59,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:59,065 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:59,065 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:59,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:59,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:59,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:59,152 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:59,152 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:59,153 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:59,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:19:59,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:59,153 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:59,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1231 [2022-12-13 02:19:59,153 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:19:59,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1010571495, now seen corresponding path program 1 times [2022-12-13 02:19:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:59,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081958739] [2022-12-13 02:19:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:59,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:59,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:19:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:59,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081958739] [2022-12-13 02:19:59,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081958739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:59,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:59,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:59,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771743192] [2022-12-13 02:19:59,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:59,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:59,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:59,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:59,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:59,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:59,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:59,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:59,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:59,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:59,267 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:59,267 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:59,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:59,268 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:59,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:59,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:59,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:59,268 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:59,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:59,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:59,271 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:59,271 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:59,271 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:59,271 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:59,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:59,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:59,277 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:59,277 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:59,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:59,278 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:59,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:59,365 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:59,366 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:19:59,366 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:59,366 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 02:19:59,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:59,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:59,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1232 [2022-12-13 02:19:59,366 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:19:59,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1039200646, now seen corresponding path program 1 times [2022-12-13 02:19:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:59,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392587795] [2022-12-13 02:19:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:59,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:59,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:19:59,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:59,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392587795] [2022-12-13 02:19:59,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392587795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:59,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:59,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:59,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176684357] [2022-12-13 02:19:59,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:59,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:59,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:59,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:59,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:59,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:59,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:59,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:59,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:59,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:59,483 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:59,483 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:19:59,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:59,484 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:59,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:59,485 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:59,485 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:59,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:59,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:59,487 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:59,488 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:59,488 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:59,488 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,488 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:59,488 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:59,488 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:59,494 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:59,494 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:59,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:59,494 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:59,494 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:59,581 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:59,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:19:59,582 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:59,582 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 02:19:59,582 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:59,582 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:59,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1233 [2022-12-13 02:19:59,582 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:19:59,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:59,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1067829797, now seen corresponding path program 1 times [2022-12-13 02:19:59,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:59,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409019423] [2022-12-13 02:19:59,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:59,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:59,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:19:59,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:59,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409019423] [2022-12-13 02:19:59,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409019423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:59,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:59,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:59,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605415244] [2022-12-13 02:19:59,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:59,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:59,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:59,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:59,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:59,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:59,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:59,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:59,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:59,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:59,706 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:59,706 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:19:59,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:59,707 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:59,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:59,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:59,707 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:59,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:59,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:59,710 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,710 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:59,710 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:59,710 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:59,710 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,710 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:59,711 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:59,711 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:59,716 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:59,716 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:19:59,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:59,717 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:59,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:19:59,803 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:19:59,803 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:19:59,803 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:19:59,803 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 02:19:59,803 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:19:59,803 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:19:59,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1234 [2022-12-13 02:19:59,803 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:19:59,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:19:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1096458948, now seen corresponding path program 1 times [2022-12-13 02:19:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:19:59,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178203339] [2022-12-13 02:19:59,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:19:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:19:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:19:59,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:19:59,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:19:59,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178203339] [2022-12-13 02:19:59,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178203339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:19:59,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:19:59,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:19:59,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972423510] [2022-12-13 02:19:59,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:19:59,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:19:59,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:19:59,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:19:59,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:19:59,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:19:59,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:19:59,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:19:59,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:19:59,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:19:59,929 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:19:59,929 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:19:59,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:19:59,930 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:19:59,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:59,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:19:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:19:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:19:59,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:19:59,930 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:19:59,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:19:59,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:19:59,933 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,933 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:19:59,933 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:19:59,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:19:59,933 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,933 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:19:59,934 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:19:59,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:19:59,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:59,939 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:19:59,939 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:19:59,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:19:59,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:19:59,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:00,027 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:00,027 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:00,027 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:00,028 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 02:20:00,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:00,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:00,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1235 [2022-12-13 02:20:00,028 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:20:00,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:00,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1125088099, now seen corresponding path program 1 times [2022-12-13 02:20:00,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:00,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883726715] [2022-12-13 02:20:00,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:00,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:00,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:20:00,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:00,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883726715] [2022-12-13 02:20:00,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883726715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:00,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:00,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:00,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409635175] [2022-12-13 02:20:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:00,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:00,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:00,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:00,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:00,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:00,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:00,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:00,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:00,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:00,155 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:00,155 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:00,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:00,156 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:00,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:00,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:00,157 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:00,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:00,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:00,159 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:00,160 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:00,160 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:00,160 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:00,160 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:00,160 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:00,160 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:00,160 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:00,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:00,166 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:00,166 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:00,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:00,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:00,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:00,252 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:00,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:00,252 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:00,252 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 02:20:00,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:00,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:00,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1236 [2022-12-13 02:20:00,253 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:20:00,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:00,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1153717250, now seen corresponding path program 1 times [2022-12-13 02:20:00,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:00,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753871119] [2022-12-13 02:20:00,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:00,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:00,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:20:00,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:00,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753871119] [2022-12-13 02:20:00,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753871119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:00,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:00,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:00,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466395880] [2022-12-13 02:20:00,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:00,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:00,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:00,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:00,303 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:00,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:00,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:00,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:00,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:00,369 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:00,369 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:00,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:00,370 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:00,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:00,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:00,371 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:00,371 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:00,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:00,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:00,373 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:00,373 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:00,374 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:00,374 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:00,374 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:00,374 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:00,374 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:00,374 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:00,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:00,379 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:00,380 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:20:00,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:00,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:00,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:00,466 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:00,467 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:00,467 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:00,467 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 02:20:00,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:00,467 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:00,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1237 [2022-12-13 02:20:00,467 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:20:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1182346401, now seen corresponding path program 1 times [2022-12-13 02:20:00,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:00,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642930214] [2022-12-13 02:20:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:00,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:00,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:20:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:00,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642930214] [2022-12-13 02:20:00,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642930214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:00,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:00,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:00,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447538268] [2022-12-13 02:20:00,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:00,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:00,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:00,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:00,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:00,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:00,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:00,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:00,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:00,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:00,583 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:00,584 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:00,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:00,585 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:00,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:00,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:00,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:00,585 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:00,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:00,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:00,588 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:00,588 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:00,588 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:00,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:00,588 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:00,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:00,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:00,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:00,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:00,594 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:00,594 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:00,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:00,595 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:00,595 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:00,682 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:00,683 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:00,683 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:00,683 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 02:20:00,683 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:00,683 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:00,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1238 [2022-12-13 02:20:00,683 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:20:00,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:00,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1210975552, now seen corresponding path program 1 times [2022-12-13 02:20:00,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:00,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753574843] [2022-12-13 02:20:00,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:00,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:00,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:20:00,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:00,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753574843] [2022-12-13 02:20:00,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753574843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:00,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:00,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:00,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725822299] [2022-12-13 02:20:00,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:00,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:00,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:00,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:00,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:00,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:00,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:00,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:00,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:00,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:00,824 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:00,824 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:00,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:00,825 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:00,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:00,826 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:00,826 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:00,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:00,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:00,828 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:00,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:00,828 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:00,829 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:00,829 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:00,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:00,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:00,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:00,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:00,834 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:00,834 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:00,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:00,835 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:00,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:00,924 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:00,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:00,924 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:00,924 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 02:20:00,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:00,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:00,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1239 [2022-12-13 02:20:00,925 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:20:00,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:00,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1239604703, now seen corresponding path program 1 times [2022-12-13 02:20:00,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:00,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622251317] [2022-12-13 02:20:00,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:00,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:00,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:20:00,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:00,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622251317] [2022-12-13 02:20:00,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622251317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:00,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:00,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:00,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143448458] [2022-12-13 02:20:00,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:00,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:00,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:00,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:00,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:00,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:00,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:00,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:00,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:00,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:01,068 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:01,068 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:01,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:01,069 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:01,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:01,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:01,069 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:01,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:01,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:01,072 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,072 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:01,072 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:01,072 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:01,072 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,072 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:01,073 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:01,073 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:01,078 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:01,078 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:01,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:01,079 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:01,079 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:01,165 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:01,165 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:01,165 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:01,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:01,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:01,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:01,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1240 [2022-12-13 02:20:01,165 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:20:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1268233854, now seen corresponding path program 1 times [2022-12-13 02:20:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:01,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64013216] [2022-12-13 02:20:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:01,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:20:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:01,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64013216] [2022-12-13 02:20:01,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64013216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:01,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:01,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:01,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208406085] [2022-12-13 02:20:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:01,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:01,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:01,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:01,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:01,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:01,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:01,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:01,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:01,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:01,281 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:01,282 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:01,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:01,283 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:01,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:01,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:01,283 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:01,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:01,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:01,286 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,286 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:01,286 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:01,286 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:01,286 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:01,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:01,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:01,292 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:01,292 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:01,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:01,293 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:01,293 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:01,386 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:01,386 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:20:01,386 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:01,386 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 02:20:01,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:01,386 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:01,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1241 [2022-12-13 02:20:01,386 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:20:01,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:01,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1296863005, now seen corresponding path program 1 times [2022-12-13 02:20:01,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:01,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87382304] [2022-12-13 02:20:01,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:01,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:01,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:20:01,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:01,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87382304] [2022-12-13 02:20:01,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87382304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:01,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:01,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:01,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101974309] [2022-12-13 02:20:01,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:01,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:01,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:01,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:01,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:01,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:01,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:01,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:01,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:01,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:01,511 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:01,511 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:01,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:01,512 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:01,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:01,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:01,513 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:01,513 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:01,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:01,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:01,515 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,516 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:01,516 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:01,516 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:01,516 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:01,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:01,516 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:01,522 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:01,522 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:01,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:01,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:01,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:01,609 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:01,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:01,610 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:01,610 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 02:20:01,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:01,610 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:01,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1242 [2022-12-13 02:20:01,610 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:20:01,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1325492156, now seen corresponding path program 1 times [2022-12-13 02:20:01,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:01,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619041693] [2022-12-13 02:20:01,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:01,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:01,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:20:01,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:01,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619041693] [2022-12-13 02:20:01,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619041693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:01,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:01,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:01,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261987262] [2022-12-13 02:20:01,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:01,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:01,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:01,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:01,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:01,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:01,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:01,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:01,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:01,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:01,746 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:01,746 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:01,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:01,747 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:01,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:01,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:01,748 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:01,748 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:01,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:01,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:01,750 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:01,751 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:01,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:01,751 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,751 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:01,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:01,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:01,756 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:01,757 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:01,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:01,757 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:01,757 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:01,844 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:01,845 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:01,845 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:01,845 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 02:20:01,845 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:01,845 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:01,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1243 [2022-12-13 02:20:01,845 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:20:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1354121307, now seen corresponding path program 1 times [2022-12-13 02:20:01,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:01,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132601440] [2022-12-13 02:20:01,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:01,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:20:01,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:01,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132601440] [2022-12-13 02:20:01,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132601440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:01,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:01,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:01,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251193136] [2022-12-13 02:20:01,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:01,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:01,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:01,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:01,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:01,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:01,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:01,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:01,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:01,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:01,966 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:01,967 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:01,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:01,967 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:01,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:01,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:01,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:01,968 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:01,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:01,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:01,971 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:01,971 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:01,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:01,971 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:01,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:01,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:01,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:01,977 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:01,977 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:01,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:01,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:01,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:02,064 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:02,065 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:02,065 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:02,065 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 02:20:02,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:02,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:02,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1244 [2022-12-13 02:20:02,065 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:20:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1382750458, now seen corresponding path program 1 times [2022-12-13 02:20:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:02,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260357248] [2022-12-13 02:20:02,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:02,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:02,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:20:02,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:02,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260357248] [2022-12-13 02:20:02,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260357248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:02,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:02,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:02,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79648295] [2022-12-13 02:20:02,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:02,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:02,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:02,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:02,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:02,113 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:02,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:02,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:02,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:02,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:02,186 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:02,187 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:02,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:02,188 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:02,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:02,188 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:02,188 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:02,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:02,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:02,191 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:02,191 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:02,191 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:02,191 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:02,191 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:02,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:02,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:02,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:02,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:02,197 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:02,197 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:02,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:02,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:02,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:02,284 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:02,284 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:02,284 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:02,284 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 02:20:02,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:02,284 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:02,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1245 [2022-12-13 02:20:02,285 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:20:02,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:02,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1411379609, now seen corresponding path program 1 times [2022-12-13 02:20:02,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:02,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141762384] [2022-12-13 02:20:02,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:02,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:02,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:20:02,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:02,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141762384] [2022-12-13 02:20:02,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141762384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:02,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:02,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:02,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902343478] [2022-12-13 02:20:02,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:02,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:02,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:02,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:02,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:02,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:02,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:02,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:02,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:02,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:02,426 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:02,426 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:02,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:02,427 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:02,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:02,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:02,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:02,428 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:02,428 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:02,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:02,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:02,431 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:02,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:02,431 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:02,431 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:02,431 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:02,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:02,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:02,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:02,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:02,437 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:02,437 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:02,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:02,438 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:02,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:02,524 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:02,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:02,524 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:02,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:02,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:02,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:02,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1246 [2022-12-13 02:20:02,524 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:20:02,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1440008760, now seen corresponding path program 1 times [2022-12-13 02:20:02,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:02,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606626545] [2022-12-13 02:20:02,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:02,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:02,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:20:02,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:02,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606626545] [2022-12-13 02:20:02,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606626545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:02,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:02,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:02,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727907797] [2022-12-13 02:20:02,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:02,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:02,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:02,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:02,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:02,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:02,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:02,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:02,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:02,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:02,645 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:02,645 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:02,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:02,646 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:02,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:02,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:02,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:02,647 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:02,647 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:02,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:02,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:02,649 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:02,650 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:02,650 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:02,650 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:02,650 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:02,650 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:02,650 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:02,650 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:02,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:02,656 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:02,656 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:02,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:02,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:02,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:02,742 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:02,742 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:02,742 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:02,742 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 02:20:02,742 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:02,742 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:02,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1247 [2022-12-13 02:20:02,742 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:20:02,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1468637911, now seen corresponding path program 1 times [2022-12-13 02:20:02,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:02,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609668904] [2022-12-13 02:20:02,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:02,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:02,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:20:02,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:02,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609668904] [2022-12-13 02:20:02,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609668904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:02,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:02,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151906353] [2022-12-13 02:20:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:02,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:02,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:02,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:02,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:02,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:02,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:02,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:02,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:02,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:02,854 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:02,854 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:02,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:02,855 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:02,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:02,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:02,856 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:02,856 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:02,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:02,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:02,858 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:02,858 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:02,858 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:02,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:02,858 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:02,858 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:02,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:02,859 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:02,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:02,864 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:02,864 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:02,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:02,865 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:02,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:02,951 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:02,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:02,952 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:02,952 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 02:20:02,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:02,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:02,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1248 [2022-12-13 02:20:02,952 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:20:02,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1497267062, now seen corresponding path program 1 times [2022-12-13 02:20:02,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:02,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905750093] [2022-12-13 02:20:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:02,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:02,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:20:02,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:02,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905750093] [2022-12-13 02:20:02,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905750093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:02,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:02,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:02,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659739406] [2022-12-13 02:20:02,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:02,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:02,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:02,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:02,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:02,998 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:02,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:02,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:02,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:02,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:03,063 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:03,064 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:03,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:03,065 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:03,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:03,065 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:03,065 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:03,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:03,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:03,068 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,068 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:03,068 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:03,068 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:03,068 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:03,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:03,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:03,074 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:03,074 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:03,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:03,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:03,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:03,161 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:03,162 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:03,162 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:03,162 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 02:20:03,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:03,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:03,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1249 [2022-12-13 02:20:03,162 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:20:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:03,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1525896213, now seen corresponding path program 1 times [2022-12-13 02:20:03,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:03,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011191268] [2022-12-13 02:20:03,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:03,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:03,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 02:20:03,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:03,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011191268] [2022-12-13 02:20:03,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011191268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:03,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:03,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:03,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778940958] [2022-12-13 02:20:03,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:03,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:03,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:03,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:03,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:03,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:03,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:03,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:03,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:03,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:03,278 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:03,278 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:03,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:03,279 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:03,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:03,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:03,279 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:03,279 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:03,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:03,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:03,282 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,282 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:03,282 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:03,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:03,282 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:03,283 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:03,283 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:03,288 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:03,288 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:03,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:03,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:03,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:03,375 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:03,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:03,375 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:03,375 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 02:20:03,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:03,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:03,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1250 [2022-12-13 02:20:03,375 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:20:03,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:03,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1554525364, now seen corresponding path program 1 times [2022-12-13 02:20:03,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:03,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171676588] [2022-12-13 02:20:03,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:03,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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:20:03,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:03,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171676588] [2022-12-13 02:20:03,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171676588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:03,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:03,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:03,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527701778] [2022-12-13 02:20:03,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:03,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:03,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:03,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:03,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:03,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:03,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:03,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:03,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:03,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:03,524 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:03,524 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:03,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:03,525 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:03,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:03,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:03,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:03,526 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:03,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:03,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:03,528 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:03,528 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:03,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:03,529 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:03,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:03,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:03,534 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:03,534 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:03,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:03,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:03,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:03,621 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:03,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:03,622 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:03,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:03,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:03,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:03,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1251 [2022-12-13 02:20:03,622 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:20:03,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1583154515, now seen corresponding path program 1 times [2022-12-13 02:20:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:03,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564665512] [2022-12-13 02:20:03,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:03,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:03,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:20:03,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:03,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564665512] [2022-12-13 02:20:03,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564665512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:03,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:03,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:03,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661562416] [2022-12-13 02:20:03,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:03,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:03,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:03,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:03,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:03,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:03,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:03,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:03,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:03,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:03,733 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:03,734 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:03,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:03,735 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:03,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:03,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:03,735 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:03,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:03,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:03,738 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,738 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:03,738 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:03,738 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:03,738 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:03,738 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:03,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:03,744 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:03,744 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:03,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:03,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:03,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:03,830 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:03,831 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:03,831 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:03,831 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 02:20:03,831 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:03,831 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:03,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1252 [2022-12-13 02:20:03,831 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:20:03,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1611783666, now seen corresponding path program 1 times [2022-12-13 02:20:03,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:03,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821577478] [2022-12-13 02:20:03,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:03,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 02:20:03,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:03,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821577478] [2022-12-13 02:20:03,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821577478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:03,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:03,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:03,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682816195] [2022-12-13 02:20:03,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:03,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:03,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:03,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:03,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:03,880 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:03,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:03,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:03,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:03,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:03,946 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:03,947 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:20:03,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:03,948 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:03,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:03,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:03,948 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:03,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:03,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:03,951 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,951 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:03,951 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:03,951 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:03,951 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:03,951 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:03,951 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:03,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:03,957 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:03,957 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:20:03,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:03,958 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:03,958 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:04,044 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:04,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:04,045 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:04,045 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 02:20:04,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:04,045 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:04,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1253 [2022-12-13 02:20:04,045 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:20:04,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:04,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1640412817, now seen corresponding path program 1 times [2022-12-13 02:20:04,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:04,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302094213] [2022-12-13 02:20:04,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:04,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:04,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:20:04,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:04,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302094213] [2022-12-13 02:20:04,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302094213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:04,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:04,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:04,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587548718] [2022-12-13 02:20:04,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:04,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:04,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:04,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:04,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:04,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:04,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:04,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:04,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:04,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:04,158 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:04,158 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:04,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:04,159 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:04,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:04,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:04,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:04,160 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:04,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:04,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:04,162 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:04,162 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:04,162 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:04,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:04,163 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:04,163 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:04,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:04,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:04,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:04,168 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:04,169 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:04,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:04,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:04,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:04,254 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:04,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:04,255 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:04,255 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 02:20:04,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:04,255 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:04,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1254 [2022-12-13 02:20:04,255 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:20:04,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:04,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1669041968, now seen corresponding path program 1 times [2022-12-13 02:20:04,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:04,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739779415] [2022-12-13 02:20:04,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:04,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:04,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:20:04,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:04,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739779415] [2022-12-13 02:20:04,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739779415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:04,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:04,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:04,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523742864] [2022-12-13 02:20:04,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:04,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:04,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:04,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:04,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:04,309 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:04,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:04,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:04,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:04,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:04,375 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:04,375 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:04,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:04,377 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:04,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:04,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:04,377 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:04,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:04,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:04,380 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:04,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:04,380 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:04,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:04,380 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:04,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:04,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:04,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:04,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:04,386 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:04,386 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:04,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:04,387 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:04,387 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:04,473 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:04,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:04,474 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:04,474 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 02:20:04,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:04,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:04,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1255 [2022-12-13 02:20:04,474 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:20:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:04,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1697671119, now seen corresponding path program 1 times [2022-12-13 02:20:04,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:04,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411475307] [2022-12-13 02:20:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:04,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:04,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411475307] [2022-12-13 02:20:04,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411475307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:04,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:04,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:04,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967255345] [2022-12-13 02:20:04,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:04,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:04,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:04,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:04,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:04,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:04,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:04,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:04,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:04,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:04,624 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:04,624 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:04,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:04,625 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:04,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:04,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:04,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:04,626 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:04,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:04,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:04,628 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:04,628 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:04,628 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:04,628 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:04,628 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:04,629 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:04,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:04,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:04,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:04,634 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:04,634 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:04,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:04,635 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:04,635 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:04,723 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:04,724 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:20:04,724 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:04,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:04,724 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:04,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:04,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1256 [2022-12-13 02:20:04,724 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:20:04,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:04,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1726300270, now seen corresponding path program 1 times [2022-12-13 02:20:04,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:04,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283541462] [2022-12-13 02:20:04,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:04,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:04,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:20:04,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:04,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283541462] [2022-12-13 02:20:04,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283541462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:04,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:04,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:04,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227236403] [2022-12-13 02:20:04,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:04,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:04,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:04,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:04,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:04,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:04,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:04,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:04,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:04,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:04,839 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:04,839 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:04,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:04,841 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:04,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:04,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:04,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:04,841 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:04,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:04,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:04,844 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:04,844 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:04,844 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:04,844 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:04,844 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:04,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:04,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:04,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:04,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:04,850 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:04,850 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:04,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:04,851 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:04,851 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:04,937 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:04,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:04,938 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:04,938 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 02:20:04,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:04,938 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:04,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1257 [2022-12-13 02:20:04,938 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:20:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:04,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1754929421, now seen corresponding path program 1 times [2022-12-13 02:20:04,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:04,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29427306] [2022-12-13 02:20:04,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:04,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:04,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:20:04,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:04,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29427306] [2022-12-13 02:20:04,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29427306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:04,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:04,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:04,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459354965] [2022-12-13 02:20:04,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:04,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:04,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:04,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:04,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:04,986 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:04,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:04,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:04,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:04,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:05,052 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:05,053 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:05,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:05,054 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:05,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:05,054 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:05,054 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:05,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:05,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:05,057 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,057 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:05,057 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:05,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:05,057 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:05,057 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:05,057 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:05,063 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:05,063 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:20:05,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:05,064 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:05,064 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:05,156 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:05,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:20:05,156 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:05,156 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 02:20:05,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:05,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:05,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1258 [2022-12-13 02:20:05,157 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:20:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:05,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1783558572, now seen corresponding path program 1 times [2022-12-13 02:20:05,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:05,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540120415] [2022-12-13 02:20:05,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:05,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:05,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 02:20:05,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:05,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540120415] [2022-12-13 02:20:05,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540120415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:05,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:05,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:05,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771363036] [2022-12-13 02:20:05,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:05,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:05,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:05,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:05,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:05,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:05,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:05,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:05,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:05,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:05,282 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:05,282 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:05,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1119 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:05,284 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:05,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:05,284 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:05,284 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:05,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:05,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:05,287 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,287 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:05,287 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:05,287 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:05,287 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:05,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:05,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:05,293 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:05,293 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:05,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:05,294 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:05,294 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:05,380 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:05,380 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:05,380 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:05,380 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 02:20:05,380 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:05,380 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:05,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1259 [2022-12-13 02:20:05,381 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:20:05,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:05,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1812187723, now seen corresponding path program 1 times [2022-12-13 02:20:05,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:05,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132265108] [2022-12-13 02:20:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:05,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:05,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:20:05,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:05,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132265108] [2022-12-13 02:20:05,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132265108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:05,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:05,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:05,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547636655] [2022-12-13 02:20:05,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:05,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:05,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:05,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:05,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:05,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:05,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:05,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:05,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:05,506 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:05,506 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:05,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:05,507 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:05,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:05,508 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:05,508 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:05,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:05,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:05,510 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,510 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:05,510 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:05,511 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:05,511 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,511 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:05,511 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:05,511 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:05,516 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:05,516 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:05,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:05,517 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:05,517 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:05,602 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:05,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:05,602 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:05,602 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 02:20:05,603 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:05,603 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:05,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1260 [2022-12-13 02:20:05,603 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:20:05,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1840816874, now seen corresponding path program 1 times [2022-12-13 02:20:05,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:05,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085653844] [2022-12-13 02:20:05,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:05,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:20:05,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:05,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085653844] [2022-12-13 02:20:05,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085653844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:05,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:05,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:05,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410394092] [2022-12-13 02:20:05,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:05,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:05,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:05,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:05,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:05,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:05,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:05,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:05,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:05,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:05,742 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:05,742 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:05,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:05,744 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:05,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:05,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:05,744 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:05,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:05,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:05,747 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,747 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:05,747 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:05,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:05,747 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,747 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:05,747 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:05,747 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:05,753 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:05,753 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:05,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:05,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:05,754 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:05,841 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:05,841 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:05,841 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:05,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:05,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:05,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:05,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1261 [2022-12-13 02:20:05,842 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:20:05,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1869446025, now seen corresponding path program 1 times [2022-12-13 02:20:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:05,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483953706] [2022-12-13 02:20:05,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:05,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:20:05,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:05,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483953706] [2022-12-13 02:20:05,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483953706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:05,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:05,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:05,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919408200] [2022-12-13 02:20:05,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:05,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:05,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:05,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:05,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:05,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:05,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:05,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:05,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:05,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:05,967 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:05,967 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:05,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:05,968 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:05,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:05,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:05,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:05,969 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:05,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:05,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:05,971 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:05,971 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:05,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:05,971 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,972 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:05,972 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:05,972 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:05,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:05,985 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:05,985 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:05,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:05,985 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:05,986 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:06,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:06,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:20:06,070 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:06,070 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 02:20:06,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:06,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:06,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1262 [2022-12-13 02:20:06,071 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:20:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:06,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1898075176, now seen corresponding path program 1 times [2022-12-13 02:20:06,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:06,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64711310] [2022-12-13 02:20:06,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:06,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:06,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 02:20:06,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:06,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64711310] [2022-12-13 02:20:06,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64711310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:06,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:06,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:06,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472458627] [2022-12-13 02:20:06,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:06,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:06,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:06,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:06,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:06,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:06,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:06,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:06,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:06,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:06,185 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:06,185 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:06,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:06,186 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:06,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:06,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:06,187 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:06,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:06,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:06,189 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:06,190 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:06,190 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:06,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:06,190 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:06,190 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:06,190 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:06,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:06,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:06,196 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:06,196 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:06,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:06,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:06,196 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:06,281 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:06,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:20:06,281 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:06,281 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 02:20:06,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:06,281 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:06,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1263 [2022-12-13 02:20:06,282 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:20:06,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:06,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1926704327, now seen corresponding path program 1 times [2022-12-13 02:20:06,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:06,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118351588] [2022-12-13 02:20:06,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:06,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:06,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:20:06,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:06,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118351588] [2022-12-13 02:20:06,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118351588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:06,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:06,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:06,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984181090] [2022-12-13 02:20:06,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:06,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:06,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:06,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:06,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:06,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:06,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:06,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:06,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:06,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:06,397 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:06,397 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:06,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:06,398 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:06,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:06,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:06,399 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:06,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:06,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:06,401 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:06,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:06,402 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:06,402 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:06,402 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:06,402 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:06,402 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:06,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:06,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:06,407 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:06,408 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:06,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:06,408 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:06,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:06,494 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:06,494 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:06,494 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:06,494 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 02:20:06,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:06,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:06,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1264 [2022-12-13 02:20:06,494 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:20:06,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:06,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1955333478, now seen corresponding path program 1 times [2022-12-13 02:20:06,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:06,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088588986] [2022-12-13 02:20:06,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:06,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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 02:20:06,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:06,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088588986] [2022-12-13 02:20:06,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088588986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:06,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:06,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:06,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876051520] [2022-12-13 02:20:06,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:06,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:06,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:06,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:06,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:06,548 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:06,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:06,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:06,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:06,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:06,623 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:06,623 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:06,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:06,624 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:06,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:06,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:06,625 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:06,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:06,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:06,628 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:06,628 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:06,628 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:06,628 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:06,628 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:06,628 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:06,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:06,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:06,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:06,634 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:06,634 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:06,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:06,635 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:06,635 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:06,739 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:06,739 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 02:20:06,739 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:06,739 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 02:20:06,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:06,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:06,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1265 [2022-12-13 02:20:06,740 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:20:06,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:06,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1983962629, now seen corresponding path program 1 times [2022-12-13 02:20:06,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:06,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404351384] [2022-12-13 02:20:06,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:06,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:06,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:20:06,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:06,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404351384] [2022-12-13 02:20:06,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404351384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:06,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:06,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:06,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752211485] [2022-12-13 02:20:06,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:06,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:06,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:06,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:06,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:06,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:06,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:06,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:06,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:06,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:06,863 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:06,863 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:06,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:06,865 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:06,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:06,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:06,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:06,865 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:06,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:06,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:06,868 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:06,868 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:06,868 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:06,868 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:06,868 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:06,868 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:06,868 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:06,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:06,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:06,882 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:06,882 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:06,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:06,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:06,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:06,968 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:06,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:20:06,968 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:06,968 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 02:20:06,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:06,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:06,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1266 [2022-12-13 02:20:06,969 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:20:06,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:06,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2012591780, now seen corresponding path program 1 times [2022-12-13 02:20:06,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:06,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202578062] [2022-12-13 02:20:06,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:06,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:07,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:20:07,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:07,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202578062] [2022-12-13 02:20:07,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202578062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:07,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:07,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:07,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001400064] [2022-12-13 02:20:07,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:07,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:07,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:07,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:07,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:07,018 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:07,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:07,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:07,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:07,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:07,093 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:07,093 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:07,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:07,094 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:07,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:07,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:07,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:07,095 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:07,095 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:07,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:07,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:07,097 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,097 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:07,097 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:07,097 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:07,098 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,098 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:07,098 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:07,098 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:07,103 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:07,103 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:07,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:07,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:07,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:07,189 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:07,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:07,190 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:07,190 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 02:20:07,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:07,190 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:07,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1267 [2022-12-13 02:20:07,190 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:20:07,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:07,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2041220931, now seen corresponding path program 1 times [2022-12-13 02:20:07,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:07,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606964802] [2022-12-13 02:20:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:07,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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:20:07,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:07,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606964802] [2022-12-13 02:20:07,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606964802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:07,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:07,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:07,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665843546] [2022-12-13 02:20:07,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:07,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:07,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:07,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:07,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:07,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:07,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:07,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:07,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:07,306 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:07,306 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:07,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:07,307 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:07,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:07,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:07,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:07,308 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:07,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:07,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:07,310 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,310 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:07,311 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:07,311 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:07,311 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:07,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:07,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:07,316 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:07,317 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:07,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:07,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:07,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:07,403 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:07,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:07,404 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:07,404 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 02:20:07,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:07,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:07,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1268 [2022-12-13 02:20:07,404 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:20:07,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:07,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2069850082, now seen corresponding path program 1 times [2022-12-13 02:20:07,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:07,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029738632] [2022-12-13 02:20:07,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:07,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:07,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:20:07,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:07,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029738632] [2022-12-13 02:20:07,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029738632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:07,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:07,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:07,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885074185] [2022-12-13 02:20:07,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:07,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:07,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:07,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:07,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:07,452 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:07,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:07,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:07,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:07,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:07,529 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:07,529 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:07,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:07,530 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:07,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:07,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:07,531 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:07,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:07,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:07,533 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,533 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:07,534 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:07,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:07,534 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,534 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:07,534 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:07,534 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:07,540 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:07,540 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:07,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:07,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:07,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:07,626 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:07,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:07,626 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:07,626 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 02:20:07,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:07,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:07,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1269 [2022-12-13 02:20:07,627 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:20:07,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:07,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2098479233, now seen corresponding path program 1 times [2022-12-13 02:20:07,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:07,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487634655] [2022-12-13 02:20:07,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:07,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:07,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:20:07,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:07,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487634655] [2022-12-13 02:20:07,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487634655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:07,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:07,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:07,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556828714] [2022-12-13 02:20:07,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:07,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:07,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:07,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:07,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:07,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:07,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:07,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:07,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:07,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:07,748 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:07,748 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:07,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:07,749 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:07,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:07,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:07,750 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:07,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:07,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:07,753 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:07,753 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:07,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:07,753 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:07,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:07,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:07,766 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:07,766 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:07,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:07,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:07,767 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:07,853 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:07,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:20:07,854 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:07,854 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 02:20:07,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:07,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:07,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1270 [2022-12-13 02:20:07,854 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:20:07,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:07,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2127108384, now seen corresponding path program 1 times [2022-12-13 02:20:07,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:07,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594907761] [2022-12-13 02:20:07,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:07,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:07,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:20:07,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:07,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594907761] [2022-12-13 02:20:07,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594907761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:07,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:07,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:07,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749166880] [2022-12-13 02:20:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:07,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:07,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:07,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:07,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:07,900 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:07,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:07,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:07,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:07,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:07,965 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:07,965 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:07,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:07,966 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:07,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:07,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:07,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:07,967 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:07,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:07,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:07,969 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,969 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:07,969 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:07,969 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:07,969 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,970 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:07,970 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:07,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:07,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:07,975 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:07,975 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:07,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:07,976 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:07,976 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:08,063 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:08,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:08,064 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:08,064 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 02:20:08,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:08,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:08,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1271 [2022-12-13 02:20:08,064 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:20:08,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2139229761, now seen corresponding path program 1 times [2022-12-13 02:20:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:08,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429058378] [2022-12-13 02:20:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:08,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:08,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:20:08,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:08,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429058378] [2022-12-13 02:20:08,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429058378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:08,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:08,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:08,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299157803] [2022-12-13 02:20:08,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:08,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:08,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:08,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:08,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:08,114 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:08,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:08,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:08,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:08,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:08,189 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:08,189 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:08,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:08,191 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:08,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:08,191 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:08,191 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:08,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:08,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:08,194 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:08,194 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:08,194 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:08,194 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:08,194 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:08,194 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:08,194 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:08,194 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:08,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:08,200 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:08,200 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:08,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:08,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:08,201 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:08,287 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:08,288 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:08,288 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:08,288 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 02:20:08,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:08,288 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:08,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1272 [2022-12-13 02:20:08,288 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:20:08,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:08,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2110600610, now seen corresponding path program 1 times [2022-12-13 02:20:08,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:08,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014954315] [2022-12-13 02:20:08,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:08,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:08,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:20:08,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:08,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014954315] [2022-12-13 02:20:08,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014954315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:08,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:08,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:08,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605742679] [2022-12-13 02:20:08,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:08,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:08,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:08,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:08,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:08,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:08,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:08,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:08,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:08,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:08,414 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:08,414 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:08,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:08,416 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:08,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:08,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:08,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:08,416 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:08,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:08,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:08,419 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:08,419 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:08,419 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:08,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:08,419 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:08,419 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:08,419 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:08,419 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:08,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:08,425 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:08,425 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:08,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:08,426 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:08,426 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:08,513 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:08,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:08,514 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:08,514 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 02:20:08,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:08,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:08,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1273 [2022-12-13 02:20:08,514 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:20:08,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2081971459, now seen corresponding path program 1 times [2022-12-13 02:20:08,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:08,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471704279] [2022-12-13 02:20:08,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:08,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:20:08,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:08,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471704279] [2022-12-13 02:20:08,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471704279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:08,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:08,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:08,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129141925] [2022-12-13 02:20:08,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:08,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:08,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:08,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:08,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:08,563 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:08,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:08,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:08,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:08,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:08,630 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:08,630 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:08,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:08,631 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:08,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:08,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:08,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:08,632 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:08,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:08,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:08,634 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:08,634 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:08,634 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:08,635 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:08,635 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:08,635 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:08,635 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:08,635 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:08,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:08,648 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:08,649 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:08,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:08,649 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:08,649 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:08,737 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:08,738 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:20:08,738 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:08,738 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 02:20:08,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:08,738 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:08,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1274 [2022-12-13 02:20:08,738 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:20:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:08,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2053342308, now seen corresponding path program 1 times [2022-12-13 02:20:08,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:08,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705602462] [2022-12-13 02:20:08,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:08,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:08,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:20:08,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:08,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705602462] [2022-12-13 02:20:08,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705602462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:08,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:08,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956804469] [2022-12-13 02:20:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:08,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:08,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:08,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:08,785 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:08,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:08,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:08,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:08,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:08,851 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:08,851 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:08,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:08,852 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:08,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:08,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:08,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:08,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:08,853 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:08,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:08,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:08,855 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:08,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:08,855 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:08,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:08,856 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:08,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:08,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:08,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:08,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:08,861 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:08,862 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:08,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:08,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:08,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:08,949 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:08,950 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:08,950 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:08,950 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 02:20:08,950 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:08,950 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:08,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1275 [2022-12-13 02:20:08,950 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:20:08,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:08,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2024713157, now seen corresponding path program 1 times [2022-12-13 02:20:08,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:08,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070801769] [2022-12-13 02:20:08,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:08,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:08,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:20:08,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:08,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070801769] [2022-12-13 02:20:08,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070801769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:08,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:08,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:08,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504569400] [2022-12-13 02:20:08,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:08,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:08,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:08,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:08,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:08,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:08,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:08,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:08,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:08,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:09,062 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:09,062 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:20:09,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1127 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:09,063 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:09,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:09,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:09,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:09,064 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:09,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:09,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:09,066 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:09,066 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:09,066 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:09,066 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,067 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:09,067 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:09,067 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:09,072 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:09,072 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:20:09,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:09,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:09,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:09,159 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:09,160 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:09,160 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:09,160 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 02:20:09,160 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:09,160 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:09,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1276 [2022-12-13 02:20:09,160 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:20:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1996084006, now seen corresponding path program 1 times [2022-12-13 02:20:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:09,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911089251] [2022-12-13 02:20:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:09,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:09,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:20:09,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:09,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911089251] [2022-12-13 02:20:09,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911089251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:09,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:09,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:09,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128000028] [2022-12-13 02:20:09,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:09,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:09,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:09,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:09,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:09,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:09,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:09,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:09,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:09,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:09,306 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:09,306 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:09,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:09,307 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:09,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:09,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:09,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:09,308 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:09,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:09,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:09,310 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,310 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:09,310 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:09,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:09,311 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:09,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:09,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:09,316 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:09,316 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:20:09,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:09,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:09,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:09,402 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:09,403 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:09,403 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:09,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:09,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:09,403 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:09,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1277 [2022-12-13 02:20:09,403 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:20:09,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:09,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1967454855, now seen corresponding path program 1 times [2022-12-13 02:20:09,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:09,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294756234] [2022-12-13 02:20:09,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:09,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:09,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:20:09,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:09,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294756234] [2022-12-13 02:20:09,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294756234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:09,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:09,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:09,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24657078] [2022-12-13 02:20:09,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:09,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:09,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:09,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:09,452 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:09,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:09,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:09,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:09,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:09,517 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:09,518 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:20:09,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:09,519 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:09,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:09,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:09,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:09,519 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:09,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:09,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:09,522 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,522 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:09,522 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:09,522 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:09,522 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,522 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:09,522 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:09,522 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:09,534 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:09,535 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:20:09,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:09,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:09,536 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:09,621 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:09,621 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:20:09,621 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:09,621 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 02:20:09,621 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:09,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:09,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1278 [2022-12-13 02:20:09,622 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:20:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:09,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1938825704, now seen corresponding path program 1 times [2022-12-13 02:20:09,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:09,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168762667] [2022-12-13 02:20:09,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:09,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:09,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 02:20:09,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:09,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168762667] [2022-12-13 02:20:09,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168762667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:09,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:09,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:09,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498382905] [2022-12-13 02:20:09,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:09,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:09,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:09,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:09,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:09,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:09,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:09,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:09,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:09,764 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:09,764 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:09,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:09,765 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:09,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:09,766 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:09,766 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:09,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:09,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:09,769 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,769 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:09,769 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:09,769 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:09,769 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:09,769 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:09,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:09,775 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:09,775 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:09,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:09,775 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:09,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:09,863 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:09,863 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:09,863 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:09,863 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 02:20:09,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:09,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:09,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1279 [2022-12-13 02:20:09,863 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:20:09,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:09,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1910196553, now seen corresponding path program 1 times [2022-12-13 02:20:09,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:09,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123094903] [2022-12-13 02:20:09,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:09,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:09,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:20:09,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:09,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123094903] [2022-12-13 02:20:09,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123094903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:09,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:09,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:09,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059828460] [2022-12-13 02:20:09,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:09,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:09,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:09,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:09,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:09,912 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:09,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:09,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:09,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:09,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:09,987 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:09,988 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:09,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:09,989 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:09,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:09,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:09,989 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:09,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:09,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:09,992 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,992 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:09,992 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:09,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:09,992 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:09,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:09,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:09,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:09,998 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:09,998 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:09,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:09,998 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:09,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:10,086 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:10,086 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:10,086 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:10,086 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 02:20:10,086 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:10,086 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:10,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1280 [2022-12-13 02:20:10,086 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:20:10,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1881567402, now seen corresponding path program 1 times [2022-12-13 02:20:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:10,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230009585] [2022-12-13 02:20:10,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:10,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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 02:20:10,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:10,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230009585] [2022-12-13 02:20:10,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230009585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:10,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:10,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:10,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991230502] [2022-12-13 02:20:10,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:10,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:10,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:10,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:10,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:10,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:10,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:10,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:10,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:10,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:10,212 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:10,213 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:10,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:10,214 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:10,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:10,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:10,214 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:10,214 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:10,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:10,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:10,217 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:10,217 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:10,217 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:10,217 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:10,217 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:10,217 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:10,217 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:10,218 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:10,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:10,223 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:10,223 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:10,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:10,224 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:10,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:10,309 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:10,310 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:10,310 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:10,310 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 02:20:10,310 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:10,310 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:10,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1281 [2022-12-13 02:20:10,310 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:20:10,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:10,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1852938251, now seen corresponding path program 1 times [2022-12-13 02:20:10,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:10,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215706090] [2022-12-13 02:20:10,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:10,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:10,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:20:10,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:10,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215706090] [2022-12-13 02:20:10,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215706090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:10,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:10,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:10,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874813937] [2022-12-13 02:20:10,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:10,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:10,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:10,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:10,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:10,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:10,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:10,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:10,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:10,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:10,425 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:10,425 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:10,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:10,426 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:10,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:10,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:10,427 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:10,427 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:10,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:10,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:10,439 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:10,439 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:10,439 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:10,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:10,440 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:10,440 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:10,440 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:10,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:10,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:10,446 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:10,446 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:10,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:10,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:10,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:10,554 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:10,555 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:20:10,555 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:10,555 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 02:20:10,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:10,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:10,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1282 [2022-12-13 02:20:10,555 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:20:10,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:10,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1824309100, now seen corresponding path program 1 times [2022-12-13 02:20:10,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:10,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888400339] [2022-12-13 02:20:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:10,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:10,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:10,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888400339] [2022-12-13 02:20:10,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888400339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:10,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:10,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:10,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871343386] [2022-12-13 02:20:10,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:10,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:10,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:10,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:10,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:10,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:10,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:10,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:10,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:10,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:10,699 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:10,700 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:10,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:10,701 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:10,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:10,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:10,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:10,702 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:10,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:10,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:10,705 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:10,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:10,705 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:10,706 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:10,706 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:10,706 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:10,706 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:10,706 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:10,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:10,714 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:10,714 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:10,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:10,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:10,715 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:10,818 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:10,818 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 02:20:10,818 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:10,818 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 02:20:10,818 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:10,818 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:10,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1283 [2022-12-13 02:20:10,819 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:20:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:10,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1795679949, now seen corresponding path program 1 times [2022-12-13 02:20:10,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:10,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204667759] [2022-12-13 02:20:10,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:10,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:10,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:20:10,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:10,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204667759] [2022-12-13 02:20:10,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204667759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:10,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:10,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:10,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894157844] [2022-12-13 02:20:10,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:10,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:10,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:10,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:10,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:10,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:10,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:10,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:10,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:10,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:10,994 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:10,995 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:10,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:10,996 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:10,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:10,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:10,997 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:10,997 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:10,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:11,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:11,001 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:11,001 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:11,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:11,001 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,001 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:11,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:11,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:11,009 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:11,009 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:11,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:11,010 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:11,010 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:11,113 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:11,114 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:20:11,114 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:11,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:11,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:11,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:11,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1284 [2022-12-13 02:20:11,114 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:20:11,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:11,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1767050798, now seen corresponding path program 1 times [2022-12-13 02:20:11,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:11,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749863961] [2022-12-13 02:20:11,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:11,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:11,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:20:11,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:11,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749863961] [2022-12-13 02:20:11,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749863961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:11,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:11,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:11,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949838485] [2022-12-13 02:20:11,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:11,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:11,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:11,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:11,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:11,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:11,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:11,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:11,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:11,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:11,254 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:11,254 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:11,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:11,256 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:11,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:11,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:11,257 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:11,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:11,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:11,261 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,261 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:11,261 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:11,261 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:11,261 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,261 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:11,261 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:11,262 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:11,269 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:11,269 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:11,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:11,270 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:11,270 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:11,373 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:11,374 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:20:11,374 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:11,374 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 02:20:11,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:11,374 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:11,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1285 [2022-12-13 02:20:11,374 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:20:11,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:11,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1738421647, now seen corresponding path program 1 times [2022-12-13 02:20:11,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:11,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947298433] [2022-12-13 02:20:11,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:11,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:11,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:20:11,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:11,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947298433] [2022-12-13 02:20:11,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947298433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:11,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:11,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:11,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201941319] [2022-12-13 02:20:11,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:11,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:11,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:11,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:11,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:11,424 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:11,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:11,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:11,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:11,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:11,509 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:11,509 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:11,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:11,510 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:11,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:11,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:11,511 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:11,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:11,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:11,513 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,513 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:11,513 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:11,513 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:11,513 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:11,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:11,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:11,519 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:11,519 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:20:11,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:11,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:11,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:11,608 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:11,608 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:11,608 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:11,608 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 02:20:11,608 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:11,608 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:11,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1286 [2022-12-13 02:20:11,608 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:20:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1709792496, now seen corresponding path program 1 times [2022-12-13 02:20:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:11,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920498810] [2022-12-13 02:20:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:11,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:11,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920498810] [2022-12-13 02:20:11,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920498810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:11,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:11,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:11,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334781158] [2022-12-13 02:20:11,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:11,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:11,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:11,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:11,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:11,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:11,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:11,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:11,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:11,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:11,734 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:11,734 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:11,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:11,735 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:11,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:11,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:11,736 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:11,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:11,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:11,739 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,739 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:11,739 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:11,739 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:11,739 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:11,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:11,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:11,745 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:11,745 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:11,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:11,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:11,746 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:11,832 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:11,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:11,833 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:11,833 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 02:20:11,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:11,833 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:11,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1287 [2022-12-13 02:20:11,833 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:20:11,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:11,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1681163345, now seen corresponding path program 1 times [2022-12-13 02:20:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:11,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621772309] [2022-12-13 02:20:11,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:11,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:11,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:20:11,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:11,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621772309] [2022-12-13 02:20:11,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621772309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:11,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:11,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:11,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460765618] [2022-12-13 02:20:11,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:11,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:11,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:11,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:11,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:11,883 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:11,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:11,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:11,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:11,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:11,950 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:11,950 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:11,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:11,952 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:11,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:11,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:11,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:11,952 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:11,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:11,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:11,955 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,955 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:11,955 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:11,955 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:11,955 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:11,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:11,955 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:11,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:11,961 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:11,961 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:20:11,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:11,962 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:11,962 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:12,050 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:12,050 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:12,050 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:12,050 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 02:20:12,050 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:12,050 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:12,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1288 [2022-12-13 02:20:12,051 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:20:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:12,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1652534194, now seen corresponding path program 1 times [2022-12-13 02:20:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:12,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784765172] [2022-12-13 02:20:12,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:12,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:12,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:20:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:12,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784765172] [2022-12-13 02:20:12,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784765172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:12,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:12,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:12,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79734228] [2022-12-13 02:20:12,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:12,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:12,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:12,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:12,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:12,102 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:12,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:12,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:12,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:12,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:12,177 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:12,177 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:12,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:12,178 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:12,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:12,179 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:12,179 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:12,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:12,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:12,181 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:12,181 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:12,181 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:12,181 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:12,182 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:12,182 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:12,182 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:12,182 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:12,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:12,187 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:12,187 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:12,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:12,188 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:12,188 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:12,274 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:12,275 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:12,275 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:12,275 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 02:20:12,275 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:12,275 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:12,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1289 [2022-12-13 02:20:12,275 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:20:12,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1623905043, now seen corresponding path program 1 times [2022-12-13 02:20:12,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:12,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696527638] [2022-12-13 02:20:12,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:12,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:20:12,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:12,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696527638] [2022-12-13 02:20:12,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696527638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:12,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:12,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:12,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288539675] [2022-12-13 02:20:12,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:12,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:12,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:12,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:12,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:12,324 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:12,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:12,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:12,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:12,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:12,396 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:12,397 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:12,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:12,398 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:12,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:12,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:12,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:12,398 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:12,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:12,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:12,401 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:12,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:12,401 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:12,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:12,401 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:12,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:12,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:12,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:12,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:12,407 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:12,407 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:12,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:12,408 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:12,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:12,493 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:12,494 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:12,494 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:12,494 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 02:20:12,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:12,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:12,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1290 [2022-12-13 02:20:12,494 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:20:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1595275892, now seen corresponding path program 1 times [2022-12-13 02:20:12,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:12,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740648782] [2022-12-13 02:20:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:12,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:20:12,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:12,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740648782] [2022-12-13 02:20:12,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740648782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:12,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:12,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956392288] [2022-12-13 02:20:12,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:12,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:12,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:12,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:12,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:12,544 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:12,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:12,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:12,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:12,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:12,620 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:12,620 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:12,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:12,621 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:12,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:12,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:12,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:12,622 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:12,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:12,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:12,624 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:12,624 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:12,624 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:12,624 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:12,624 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:12,625 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:12,625 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:12,625 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:12,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:12,630 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:12,630 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:12,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:12,631 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:12,631 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:12,721 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:12,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:20:12,721 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:12,721 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 02:20:12,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:12,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:12,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1291 [2022-12-13 02:20:12,721 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:20:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1566646741, now seen corresponding path program 1 times [2022-12-13 02:20:12,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:12,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194052686] [2022-12-13 02:20:12,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:12,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:12,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:20:12,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:12,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194052686] [2022-12-13 02:20:12,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194052686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:12,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:12,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:12,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988548727] [2022-12-13 02:20:12,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:12,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:12,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:12,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:12,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:12,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:12,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:12,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:12,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:12,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:12,836 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:12,836 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:12,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:12,838 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:12,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:12,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:12,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:12,838 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:12,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:12,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:12,841 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:12,841 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:12,841 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:12,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:12,841 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:12,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:12,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:12,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:12,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:12,847 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:12,847 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:12,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:12,848 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:12,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:12,933 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:12,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:12,933 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:12,933 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 02:20:12,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:12,934 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:12,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1292 [2022-12-13 02:20:12,934 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:20:12,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:12,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1538017590, now seen corresponding path program 1 times [2022-12-13 02:20:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:12,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911708078] [2022-12-13 02:20:12,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:12,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:20:12,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:12,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911708078] [2022-12-13 02:20:12,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911708078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:12,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:12,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:12,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335674388] [2022-12-13 02:20:12,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:12,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:12,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:12,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:12,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:12,983 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:12,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:12,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:12,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:12,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:13,049 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:13,049 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:13,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:13,050 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:13,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:13,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:13,051 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:13,051 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:13,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:13,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:13,053 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,053 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:13,054 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:13,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:13,054 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:13,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:13,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:13,060 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:13,060 INFO L131 PetriNetUnfolder]: For 435/453 co-relation queries the response was YES. [2022-12-13 02:20:13,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/453 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:13,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:13,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:13,147 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:13,147 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:13,147 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:13,147 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 02:20:13,148 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:13,148 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:13,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1293 [2022-12-13 02:20:13,148 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:20:13,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1509388439, now seen corresponding path program 1 times [2022-12-13 02:20:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:13,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251003406] [2022-12-13 02:20:13,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:13,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:13,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:13,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251003406] [2022-12-13 02:20:13,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251003406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:13,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:13,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100788003] [2022-12-13 02:20:13,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:13,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:13,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:13,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:13,196 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:13,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:13,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:13,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:13,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:13,281 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:13,281 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:13,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:13,282 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:13,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:13,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:13,283 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:13,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:13,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:13,285 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,285 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:13,285 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:13,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:13,285 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:13,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:13,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:13,291 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:13,291 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:13,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:13,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:13,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:13,378 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:13,379 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:13,379 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:13,379 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 02:20:13,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:13,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:13,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1294 [2022-12-13 02:20:13,379 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:20:13,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1480759288, now seen corresponding path program 1 times [2022-12-13 02:20:13,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:13,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42402781] [2022-12-13 02:20:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:13,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:13,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:20:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:13,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42402781] [2022-12-13 02:20:13,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42402781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:13,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:13,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80862420] [2022-12-13 02:20:13,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:13,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:13,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:13,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:13,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:13,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:13,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:13,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:13,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:13,494 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:13,495 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:13,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:13,496 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:13,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:13,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:13,496 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:13,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:13,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:13,499 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:13,499 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:13,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:13,499 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:13,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:13,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:13,505 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:13,505 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:13,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:13,506 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:13,506 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:13,593 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:13,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:13,594 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:13,594 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 02:20:13,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:13,594 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:13,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1295 [2022-12-13 02:20:13,594 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:20:13,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1452130137, now seen corresponding path program 1 times [2022-12-13 02:20:13,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:13,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550977188] [2022-12-13 02:20:13,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:13,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:20:13,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:13,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550977188] [2022-12-13 02:20:13,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550977188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:13,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:13,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:13,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244114925] [2022-12-13 02:20:13,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:13,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:13,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:13,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:13,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:13,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:13,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:13,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:13,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:13,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:13,707 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:13,707 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:13,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:13,708 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:13,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:13,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:13,709 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:13,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:13,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:13,711 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:13,712 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:13,712 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:13,712 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:13,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:13,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:13,717 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:13,718 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:13,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:13,718 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:13,718 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:13,803 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:13,803 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:20:13,803 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:13,803 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 02:20:13,803 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:13,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:13,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1296 [2022-12-13 02:20:13,804 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:20:13,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1423500986, now seen corresponding path program 1 times [2022-12-13 02:20:13,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:13,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706057907] [2022-12-13 02:20:13,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:13,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:13,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:20:13,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:13,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706057907] [2022-12-13 02:20:13,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706057907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:13,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:13,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:13,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871222122] [2022-12-13 02:20:13,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:13,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:13,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:13,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:13,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:13,864 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:13,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:13,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:13,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:13,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:13,929 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:13,929 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:13,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:13,930 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:13,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:13,931 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:13,931 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:13,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:13,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:13,933 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,933 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:13,933 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:13,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:13,933 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,934 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:13,934 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:13,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:13,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:13,939 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:13,939 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:13,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:13,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:13,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:14,025 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:14,025 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:14,025 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:14,025 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 02:20:14,025 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:14,025 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:14,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1297 [2022-12-13 02:20:14,026 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:20:14,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1394871835, now seen corresponding path program 1 times [2022-12-13 02:20:14,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:14,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231016519] [2022-12-13 02:20:14,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:14,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:14,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:20:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:14,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231016519] [2022-12-13 02:20:14,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231016519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:14,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:14,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:14,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665507667] [2022-12-13 02:20:14,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:14,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:14,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:14,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:14,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:14,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:14,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:14,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:14,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:14,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:14,148 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:14,149 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:14,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:14,149 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:14,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:14,150 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:14,150 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:14,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:14,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:14,152 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:14,153 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:14,153 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:14,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:14,153 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:14,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:14,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:14,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:14,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:14,158 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:14,159 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:14,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:14,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:14,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:14,245 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:14,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:14,246 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:14,246 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 02:20:14,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:14,246 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:14,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1298 [2022-12-13 02:20:14,246 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:20:14,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:14,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1366242684, now seen corresponding path program 1 times [2022-12-13 02:20:14,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:14,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084791595] [2022-12-13 02:20:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:14,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:14,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:20:14,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:14,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084791595] [2022-12-13 02:20:14,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084791595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:14,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:14,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677225659] [2022-12-13 02:20:14,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:14,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:14,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:14,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:14,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:14,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:14,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:14,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:14,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:14,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:14,369 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:14,369 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:14,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:14,370 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:14,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:14,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:14,371 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:14,371 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:14,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:14,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:14,373 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:14,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:14,374 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:14,374 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:14,374 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:14,374 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:14,374 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:14,374 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:14,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:14,380 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:14,380 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:14,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:14,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:14,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:14,466 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:14,467 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:14,467 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:14,467 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 02:20:14,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:14,467 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:14,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1299 [2022-12-13 02:20:14,467 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:20:14,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1337613533, now seen corresponding path program 1 times [2022-12-13 02:20:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:14,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574561027] [2022-12-13 02:20:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:14,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:14,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:20:14,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:14,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574561027] [2022-12-13 02:20:14,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574561027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:14,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:14,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:14,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774410897] [2022-12-13 02:20:14,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:14,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:14,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:14,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:14,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:14,515 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:14,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:14,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:14,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:14,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:14,581 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:14,582 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:14,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:14,583 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:14,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:14,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:14,583 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:14,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:14,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:14,586 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:14,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:14,586 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:14,586 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:14,586 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:14,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:14,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:14,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:14,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:14,592 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:14,592 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:14,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:14,592 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:14,593 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:14,678 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:14,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:14,679 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:14,679 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 02:20:14,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:14,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:14,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1300 [2022-12-13 02:20:14,679 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:20:14,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:14,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1308984382, now seen corresponding path program 1 times [2022-12-13 02:20:14,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:14,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989744763] [2022-12-13 02:20:14,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:14,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:14,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:20:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:14,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989744763] [2022-12-13 02:20:14,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989744763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:14,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:14,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:14,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768720076] [2022-12-13 02:20:14,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:14,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:14,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:14,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:14,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:14,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:14,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:14,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:14,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:14,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:14,803 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:14,804 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:14,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:14,805 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:14,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:14,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:14,805 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:14,805 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:14,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:14,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:14,808 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:14,808 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:14,808 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:14,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:14,808 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:14,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:14,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:14,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:14,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:14,814 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:14,814 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:14,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:14,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:14,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:14,900 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:14,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:14,900 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:14,900 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 02:20:14,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:14,901 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:14,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1301 [2022-12-13 02:20:14,901 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:20:14,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1280355231, now seen corresponding path program 1 times [2022-12-13 02:20:14,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:14,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533926326] [2022-12-13 02:20:14,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:14,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:14,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:20:14,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:14,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533926326] [2022-12-13 02:20:14,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533926326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:14,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:14,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:14,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561523980] [2022-12-13 02:20:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:14,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:14,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:14,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:14,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:14,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:14,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:14,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:14,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:15,035 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:15,036 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:15,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:15,037 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:15,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:15,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:15,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:15,037 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:15,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:15,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:15,039 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:15,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:15,040 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:15,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:15,040 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:15,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:15,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:15,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:15,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:15,045 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:15,046 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:15,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:15,046 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:15,046 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:15,132 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:15,133 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:15,133 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:15,133 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 02:20:15,133 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:15,133 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:15,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1302 [2022-12-13 02:20:15,133 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:20:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1251726080, now seen corresponding path program 1 times [2022-12-13 02:20:15,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:15,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770756607] [2022-12-13 02:20:15,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:15,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:20:15,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:15,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770756607] [2022-12-13 02:20:15,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770756607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:15,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:15,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:15,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643224569] [2022-12-13 02:20:15,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:15,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:15,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:15,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:15,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:15,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:15,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:15,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:15,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:15,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:15,260 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:15,260 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:15,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:15,261 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:15,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:15,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:15,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:15,262 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:15,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:15,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:15,264 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:15,265 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:15,265 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:15,265 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:15,265 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:15,265 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:15,265 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:15,265 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:15,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:15,271 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:15,271 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:15,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:15,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:15,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:15,357 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:15,357 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:15,357 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:15,357 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 02:20:15,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:15,357 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:15,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1303 [2022-12-13 02:20:15,358 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:20:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:15,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1223096929, now seen corresponding path program 1 times [2022-12-13 02:20:15,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:15,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638713272] [2022-12-13 02:20:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:15,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:15,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:20:15,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:15,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638713272] [2022-12-13 02:20:15,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638713272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:15,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:15,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:15,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413068935] [2022-12-13 02:20:15,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:15,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:15,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:15,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:15,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:15,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:15,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:15,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:15,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:15,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:15,482 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:15,482 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:15,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:15,483 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:15,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:15,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:15,484 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:15,484 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:15,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:15,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:15,487 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:15,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:15,487 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:15,487 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:15,487 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:15,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:15,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:15,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:15,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:15,493 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:15,493 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:15,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:15,493 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:15,493 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:15,605 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:15,605 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:20:15,605 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:15,606 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 02:20:15,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:15,606 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:15,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1304 [2022-12-13 02:20:15,606 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:20:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:15,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1194467778, now seen corresponding path program 1 times [2022-12-13 02:20:15,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:15,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333453432] [2022-12-13 02:20:15,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:15,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:15,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:20:15,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:15,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333453432] [2022-12-13 02:20:15,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333453432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:15,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:15,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:15,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003030516] [2022-12-13 02:20:15,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:15,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:15,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:15,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:15,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:15,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:15,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:15,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:15,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:15,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:15,754 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:15,755 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:15,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:15,756 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:15,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:15,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:15,757 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:15,757 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:15,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:15,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:15,760 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:15,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:15,761 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:15,761 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:15,761 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:15,761 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:15,761 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:15,761 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:15,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:15,769 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:15,769 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:15,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:15,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:15,770 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:15,884 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:15,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:20:15,885 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:15,885 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 02:20:15,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:15,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:15,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1305 [2022-12-13 02:20:15,885 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:20:15,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:15,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1165838627, now seen corresponding path program 1 times [2022-12-13 02:20:15,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:15,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891204356] [2022-12-13 02:20:15,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:15,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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:20:15,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:15,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891204356] [2022-12-13 02:20:15,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891204356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:15,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:15,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:15,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004476803] [2022-12-13 02:20:15,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:15,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:15,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:15,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:15,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:15,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:15,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:15,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:15,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:16,089 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:16,090 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:16,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:16,091 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:16,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:16,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:16,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:16,092 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:16,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:16,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:16,096 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,096 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:16,096 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:16,096 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:16,096 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,096 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:16,097 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:16,097 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:16,104 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:16,105 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:16,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:16,105 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:16,105 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:16,191 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:16,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:16,191 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:16,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:16,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:16,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:16,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1306 [2022-12-13 02:20:16,192 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:20:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1137209476, now seen corresponding path program 1 times [2022-12-13 02:20:16,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:16,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264139236] [2022-12-13 02:20:16,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:16,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:16,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:20:16,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:16,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264139236] [2022-12-13 02:20:16,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264139236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:16,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:16,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:16,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408875011] [2022-12-13 02:20:16,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:16,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:16,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:16,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:16,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:16,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:16,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:16,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:16,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:16,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:16,314 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:16,314 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:16,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:16,315 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:16,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:16,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:16,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:16,316 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:16,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:16,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:16,318 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,318 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:16,319 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:16,319 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:16,319 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,319 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:16,319 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:16,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:16,328 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:16,328 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:16,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:16,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:16,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:16,422 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:16,423 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:20:16,423 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:16,423 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 02:20:16,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:16,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:16,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1307 [2022-12-13 02:20:16,423 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:20:16,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1108580325, now seen corresponding path program 1 times [2022-12-13 02:20:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:16,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681372666] [2022-12-13 02:20:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:16,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:16,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:20:16,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:16,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681372666] [2022-12-13 02:20:16,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681372666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:16,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:16,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:16,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128507887] [2022-12-13 02:20:16,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:16,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:16,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:16,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:16,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:16,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:16,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:16,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:16,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:16,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:16,538 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:16,538 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:16,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:16,539 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:16,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:16,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:16,540 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:16,540 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:16,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:16,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:16,542 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:16,542 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:16,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:16,543 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:16,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:16,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:16,548 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:16,548 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:16,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:16,549 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:16,549 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:16,635 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:16,636 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:16,636 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:16,636 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 02:20:16,636 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:16,636 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:16,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1308 [2022-12-13 02:20:16,636 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:20:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1079951174, now seen corresponding path program 1 times [2022-12-13 02:20:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:16,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132429785] [2022-12-13 02:20:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:16,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:16,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 02:20:16,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:16,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132429785] [2022-12-13 02:20:16,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132429785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:16,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:16,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:16,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135156451] [2022-12-13 02:20:16,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:16,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:16,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:16,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:16,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:16,686 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:16,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:16,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:16,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:16,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:16,752 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:16,752 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:16,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:16,753 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:16,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:16,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:16,754 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:16,754 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:16,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:16,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:16,756 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,756 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:16,756 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:16,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:16,756 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,757 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:16,757 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:16,757 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:16,762 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:16,762 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:16,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:16,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:16,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:16,849 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:16,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:16,849 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:16,849 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 02:20:16,849 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:16,849 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:16,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1309 [2022-12-13 02:20:16,850 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:20:16,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:16,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1051322023, now seen corresponding path program 1 times [2022-12-13 02:20:16,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:16,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191254224] [2022-12-13 02:20:16,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:16,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:16,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:20:16,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:16,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191254224] [2022-12-13 02:20:16,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191254224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:16,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:16,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:16,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906948594] [2022-12-13 02:20:16,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:16,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:16,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:16,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:16,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:16,908 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:16,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:16,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:16,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:16,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:16,974 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:16,975 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:16,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:16,976 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:16,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:16,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:16,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:16,976 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:16,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:16,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:16,979 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,979 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:16,979 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:16,979 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:16,979 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,979 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:16,979 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:16,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:16,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:16,985 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:16,985 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:16,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:16,985 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:16,985 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:17,073 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:17,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:17,073 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:17,073 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 02:20:17,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:17,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:17,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1310 [2022-12-13 02:20:17,073 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:20:17,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1022692872, now seen corresponding path program 1 times [2022-12-13 02:20:17,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:17,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986987035] [2022-12-13 02:20:17,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:17,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 02:20:17,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:17,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986987035] [2022-12-13 02:20:17,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986987035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:17,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:17,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956486239] [2022-12-13 02:20:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:17,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:17,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:17,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:17,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:17,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:17,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:17,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:17,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:17,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:17,198 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:17,198 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:17,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:17,200 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:17,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:17,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:17,200 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:17,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:17,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:17,203 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:17,203 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:17,203 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:17,203 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:17,203 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:17,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:17,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:17,203 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:17,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:17,209 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:17,209 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:17,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:17,210 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:17,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:17,298 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:17,298 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:17,298 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:17,298 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 02:20:17,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:17,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:17,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1311 [2022-12-13 02:20:17,299 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:20:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:17,299 INFO L85 PathProgramCache]: Analyzing trace with hash -994063721, now seen corresponding path program 1 times [2022-12-13 02:20:17,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:17,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017382070] [2022-12-13 02:20:17,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:17,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:17,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:20:17,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:17,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017382070] [2022-12-13 02:20:17,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017382070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:17,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:17,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:17,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684156413] [2022-12-13 02:20:17,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:17,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:17,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:17,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:17,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:17,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:17,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:17,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:17,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:17,425 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:17,425 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:17,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:17,426 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:17,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:17,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:17,427 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:17,427 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:17,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:17,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:17,429 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:17,430 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:17,430 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:17,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:17,430 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:17,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:17,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:17,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:17,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:17,436 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:17,436 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:17,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:17,436 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:17,436 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:17,523 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:17,523 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:17,524 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:17,524 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 02:20:17,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:17,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:17,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1312 [2022-12-13 02:20:17,524 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:20:17,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:17,524 INFO L85 PathProgramCache]: Analyzing trace with hash -965434570, now seen corresponding path program 1 times [2022-12-13 02:20:17,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:17,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716382104] [2022-12-13 02:20:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:17,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:17,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:20:17,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:17,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716382104] [2022-12-13 02:20:17,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716382104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:17,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:17,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:17,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224673596] [2022-12-13 02:20:17,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:17,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:17,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:17,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:17,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:17,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:17,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:17,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:17,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:17,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:17,665 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:17,666 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:17,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:17,667 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:17,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:17,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:17,667 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:17,667 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:17,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:17,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:17,670 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:17,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:17,670 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:17,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:17,670 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:17,670 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:17,670 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:17,670 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:17,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:17,676 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:17,676 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:17,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:17,676 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:17,676 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:17,762 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:17,762 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:17,762 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:17,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:17,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:17,763 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:17,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1313 [2022-12-13 02:20:17,763 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:20:17,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:17,763 INFO L85 PathProgramCache]: Analyzing trace with hash -936805419, now seen corresponding path program 1 times [2022-12-13 02:20:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:17,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603841397] [2022-12-13 02:20:17,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:17,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:17,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:20:17,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:17,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603841397] [2022-12-13 02:20:17,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603841397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:17,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:17,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300127545] [2022-12-13 02:20:17,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:17,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:17,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:17,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:17,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:17,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:17,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:17,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:17,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:17,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:17,894 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:17,895 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:17,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:17,896 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:17,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:17,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:17,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:17,896 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:17,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:17,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:17,899 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:17,899 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:17,899 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:17,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:17,899 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:17,899 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:17,899 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:17,899 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:17,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:17,905 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:17,905 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:17,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:17,905 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:17,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:17,990 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:17,991 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:17,991 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:17,991 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 02:20:17,991 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:17,991 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:17,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1314 [2022-12-13 02:20:17,991 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:20:17,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:17,991 INFO L85 PathProgramCache]: Analyzing trace with hash -908176268, now seen corresponding path program 1 times [2022-12-13 02:20:17,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:17,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281157215] [2022-12-13 02:20:17,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:17,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:18,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:20:18,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:18,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281157215] [2022-12-13 02:20:18,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281157215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:18,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:18,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:18,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891137459] [2022-12-13 02:20:18,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:18,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:18,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:18,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:18,040 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:18,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:18,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:18,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:18,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:18,105 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:18,106 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:18,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:18,107 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:18,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:18,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:18,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:18,107 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:18,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:18,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:18,110 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,110 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:18,110 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:18,110 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:18,110 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:18,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:18,111 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:18,116 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:18,116 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:18,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:18,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:18,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:18,202 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:18,203 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:18,203 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:18,203 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 02:20:18,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:18,203 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:18,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1315 [2022-12-13 02:20:18,203 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:20:18,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash -879547117, now seen corresponding path program 1 times [2022-12-13 02:20:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:18,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950311288] [2022-12-13 02:20:18,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:18,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:18,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:20:18,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:18,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950311288] [2022-12-13 02:20:18,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950311288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:18,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:18,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:18,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204311000] [2022-12-13 02:20:18,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:18,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:18,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:18,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:18,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:18,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:18,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:18,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:18,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:18,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:18,315 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:18,315 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:18,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:18,316 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:18,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:18,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:18,317 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:18,317 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:18,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:18,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:18,319 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,319 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:18,320 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:18,320 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:18,320 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,320 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:18,320 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:18,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:18,325 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:18,326 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:18,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:18,326 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:18,326 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:18,412 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:18,413 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:18,413 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:18,413 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 02:20:18,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:18,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:18,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1316 [2022-12-13 02:20:18,413 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:20:18,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:18,413 INFO L85 PathProgramCache]: Analyzing trace with hash -850917966, now seen corresponding path program 1 times [2022-12-13 02:20:18,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:18,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665132977] [2022-12-13 02:20:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:18,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:18,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:18,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665132977] [2022-12-13 02:20:18,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665132977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:18,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:18,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:18,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304962646] [2022-12-13 02:20:18,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:18,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:18,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:18,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:18,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:18,460 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:18,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:18,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:18,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:18,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:18,534 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:18,534 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:18,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:18,535 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:18,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:18,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:18,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:18,536 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:18,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:18,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:18,538 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:18,538 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:18,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:18,538 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:18,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:18,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:18,544 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:18,544 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:18,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:18,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:18,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:18,633 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:18,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:18,633 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:18,633 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 02:20:18,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:18,633 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:18,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1317 [2022-12-13 02:20:18,634 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:20:18,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash -822288815, now seen corresponding path program 1 times [2022-12-13 02:20:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:18,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602297210] [2022-12-13 02:20:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:18,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:18,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:20:18,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:18,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602297210] [2022-12-13 02:20:18,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602297210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:18,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:18,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:18,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581375340] [2022-12-13 02:20:18,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:18,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:18,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:18,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:18,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:18,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:18,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:18,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:18,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:18,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:18,755 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:18,755 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:18,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:18,756 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:18,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:18,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:18,757 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:18,757 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:18,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:18,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:18,760 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:18,760 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:18,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:18,760 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:18,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:18,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:18,766 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:18,766 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:18,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:18,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:18,767 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:18,853 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:18,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:18,854 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:18,854 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 02:20:18,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:18,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:18,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1318 [2022-12-13 02:20:18,854 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:20:18,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:18,854 INFO L85 PathProgramCache]: Analyzing trace with hash -793659664, now seen corresponding path program 1 times [2022-12-13 02:20:18,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:18,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024722949] [2022-12-13 02:20:18,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:18,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:18,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:20:18,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:18,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024722949] [2022-12-13 02:20:18,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024722949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:18,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:18,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:18,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144211028] [2022-12-13 02:20:18,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:18,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:18,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:18,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:18,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:18,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:18,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:18,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:18,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:18,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:18,970 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:18,971 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:18,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:18,972 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:18,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:18,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:18,972 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:18,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:18,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:18,975 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,975 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:18,975 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:18,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:18,975 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:18,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:18,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:18,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:18,981 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:18,981 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:18,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:18,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:18,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:19,068 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:19,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:19,069 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:19,069 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 02:20:19,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:19,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:19,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1319 [2022-12-13 02:20:19,069 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:20:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:19,069 INFO L85 PathProgramCache]: Analyzing trace with hash -765030513, now seen corresponding path program 1 times [2022-12-13 02:20:19,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:19,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024450672] [2022-12-13 02:20:19,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:19,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:19,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:20:19,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:19,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024450672] [2022-12-13 02:20:19,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024450672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:19,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:19,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:19,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830240841] [2022-12-13 02:20:19,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:19,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:19,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:19,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:19,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:19,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:19,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:19,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:19,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:19,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:19,195 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:19,195 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:19,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:19,196 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:19,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:19,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:19,197 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:19,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:19,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:19,199 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:19,199 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:19,199 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:19,199 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:19,199 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:19,200 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:19,200 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:19,200 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:19,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:19,205 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:19,205 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:19,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:19,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:19,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:19,292 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:19,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:19,293 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:19,293 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 02:20:19,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:19,293 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:19,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1320 [2022-12-13 02:20:19,293 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:20:19,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:19,293 INFO L85 PathProgramCache]: Analyzing trace with hash -736401362, now seen corresponding path program 1 times [2022-12-13 02:20:19,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:19,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798341615] [2022-12-13 02:20:19,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:19,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:19,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:20:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:19,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798341615] [2022-12-13 02:20:19,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798341615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:19,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:19,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:19,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075572282] [2022-12-13 02:20:19,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:19,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:19,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:19,341 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:19,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:19,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:19,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:19,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:19,406 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:19,406 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:19,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:19,407 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:19,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:19,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:19,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:19,408 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:19,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:19,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:19,410 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:19,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:19,411 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:19,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:19,411 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:19,411 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:19,411 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:19,411 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:19,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:19,417 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:19,417 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:19,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:19,417 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:19,417 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:19,503 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:19,503 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:19,503 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:19,503 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 02:20:19,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:19,504 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:19,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1321 [2022-12-13 02:20:19,504 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:20:19,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:19,504 INFO L85 PathProgramCache]: Analyzing trace with hash -707772211, now seen corresponding path program 1 times [2022-12-13 02:20:19,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:19,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653620335] [2022-12-13 02:20:19,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:19,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:19,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:20:19,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:19,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653620335] [2022-12-13 02:20:19,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653620335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:19,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:19,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:19,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611319149] [2022-12-13 02:20:19,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:19,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:19,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:19,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:19,564 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:19,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:19,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:19,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:19,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:19,646 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:19,646 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:19,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:19,647 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:19,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:19,648 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:19,648 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:19,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:19,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:19,651 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:19,651 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:19,651 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:19,651 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:19,651 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:19,651 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:19,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:19,651 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:19,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:19,657 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:19,657 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:19,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 465 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:19,657 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:19,658 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:19,743 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:19,744 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:19,744 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:19,744 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 02:20:19,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:19,744 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:19,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1322 [2022-12-13 02:20:19,744 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:20:19,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash -679143060, now seen corresponding path program 1 times [2022-12-13 02:20:19,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:19,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230814942] [2022-12-13 02:20:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:19,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:19,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:20:19,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:19,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230814942] [2022-12-13 02:20:19,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230814942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:19,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:19,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039859003] [2022-12-13 02:20:19,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:19,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:19,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:19,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:19,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:19,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:19,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:19,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:19,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:19,862 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:19,863 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:19,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:19,864 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:19,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:19,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:19,864 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:19,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:19,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:19,867 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:19,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:19,867 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:19,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:19,867 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:19,868 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:19,868 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:19,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:19,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:19,873 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:19,873 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:19,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:19,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:19,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:19,961 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:19,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:19,961 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:19,961 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 02:20:19,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:19,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:19,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1323 [2022-12-13 02:20:19,961 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:20:19,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:19,962 INFO L85 PathProgramCache]: Analyzing trace with hash -650513909, now seen corresponding path program 1 times [2022-12-13 02:20:19,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:19,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10775065] [2022-12-13 02:20:19,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:20,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:20:20,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:20,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10775065] [2022-12-13 02:20:20,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10775065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:20,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:20,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:20,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410244380] [2022-12-13 02:20:20,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:20,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:20,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:20,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:20,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:20,013 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:20,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:20,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:20,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:20,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:20,088 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:20,088 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:20,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:20,089 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:20,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:20,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:20,090 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:20,090 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:20,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:20,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:20,093 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:20,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:20,093 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:20,093 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:20,093 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:20,093 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:20,093 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:20,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:20,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:20,099 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:20,099 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:20,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:20,099 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:20,099 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:20,185 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:20,186 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:20,186 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:20,186 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 02:20:20,186 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:20,186 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:20,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1324 [2022-12-13 02:20:20,186 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:20:20,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:20,186 INFO L85 PathProgramCache]: Analyzing trace with hash -621884758, now seen corresponding path program 1 times [2022-12-13 02:20:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:20,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092536613] [2022-12-13 02:20:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:20,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:20,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:20:20,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:20,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092536613] [2022-12-13 02:20:20,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092536613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:20,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:20,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:20,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556097114] [2022-12-13 02:20:20,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:20,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:20,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:20,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:20,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:20,237 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:20,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:20,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:20,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:20,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:20,313 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:20,313 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:20,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:20,314 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:20,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:20,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:20,314 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:20,314 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:20,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:20,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:20,317 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:20,317 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:20,317 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:20,317 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:20,317 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:20,317 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:20,317 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:20,318 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:20,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:20,323 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:20,323 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:20,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:20,324 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:20,324 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:20,411 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:20,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:20,411 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:20,411 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 02:20:20,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:20,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:20,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1325 [2022-12-13 02:20:20,412 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:20:20,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:20,412 INFO L85 PathProgramCache]: Analyzing trace with hash -593255607, now seen corresponding path program 1 times [2022-12-13 02:20:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:20,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16436728] [2022-12-13 02:20:20,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:20,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:20:20,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:20,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16436728] [2022-12-13 02:20:20,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16436728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:20,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:20,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:20,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179567367] [2022-12-13 02:20:20,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:20,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:20,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:20,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:20,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:20,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:20,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:20,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:20,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:20,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:20,559 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:20,559 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:20,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:20,560 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:20,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:20,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:20,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:20,561 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:20,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:20,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:20,563 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:20,563 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:20,564 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:20,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:20,564 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:20,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:20,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:20,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:20,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:20,571 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:20,571 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:20,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:20,572 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:20,572 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:20,664 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:20,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:20:20,664 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:20,664 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 02:20:20,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:20,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:20,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1326 [2022-12-13 02:20:20,664 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:20:20,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash -564626456, now seen corresponding path program 1 times [2022-12-13 02:20:20,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:20,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754474204] [2022-12-13 02:20:20,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:20,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:20:20,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:20,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754474204] [2022-12-13 02:20:20,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754474204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:20,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:20,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:20,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842807121] [2022-12-13 02:20:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:20,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:20,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:20,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:20,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:20,719 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:20,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:20,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:20,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:20,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:20,796 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:20,797 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:20,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:20,798 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:20,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:20,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:20,798 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:20,798 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:20,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:20,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:20,801 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:20,801 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:20,801 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:20,801 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:20,801 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:20,802 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:20,802 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:20,802 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:20,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:20,807 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:20,807 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:20,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 443 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:20,808 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:20,808 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:20,895 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:20,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:20,896 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:20,896 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 02:20:20,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:20,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:20,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1327 [2022-12-13 02:20:20,896 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:20:20,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:20,896 INFO L85 PathProgramCache]: Analyzing trace with hash -535997305, now seen corresponding path program 1 times [2022-12-13 02:20:20,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:20,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329860348] [2022-12-13 02:20:20,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:20,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:20,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:20:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:20,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329860348] [2022-12-13 02:20:20,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329860348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:20,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:20,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613111715] [2022-12-13 02:20:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:20,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:20,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:20,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:20,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:20,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:20,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:20,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:20,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:21,025 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:21,025 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:21,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:21,026 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:21,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:21,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:21,027 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:21,027 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:21,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:21,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:21,030 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,030 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:21,030 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:21,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:21,030 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:21,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:21,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:21,036 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:21,036 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:21,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:21,037 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:21,037 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:21,135 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:21,136 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:20:21,136 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:21,136 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 02:20:21,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:21,136 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:21,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1328 [2022-12-13 02:20:21,136 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:20:21,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:21,136 INFO L85 PathProgramCache]: Analyzing trace with hash -507368154, now seen corresponding path program 1 times [2022-12-13 02:20:21,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:21,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137651231] [2022-12-13 02:20:21,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:21,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:21,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:20:21,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:21,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137651231] [2022-12-13 02:20:21,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137651231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:21,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:21,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:21,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719798632] [2022-12-13 02:20:21,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:21,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:21,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:21,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:21,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:21,185 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:21,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:21,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:21,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:21,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:21,270 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:21,270 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:21,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:21,271 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:21,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:21,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:21,272 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:21,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:21,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:21,275 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,275 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:21,275 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:21,275 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:21,276 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:21,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:21,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:21,283 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:21,283 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:21,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:21,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:21,284 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:21,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:21,371 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:20:21,371 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:21,371 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 02:20:21,371 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:21,371 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:21,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1329 [2022-12-13 02:20:21,372 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:20:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:21,372 INFO L85 PathProgramCache]: Analyzing trace with hash -478739003, now seen corresponding path program 1 times [2022-12-13 02:20:21,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:21,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517208174] [2022-12-13 02:20:21,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:21,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:21,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517208174] [2022-12-13 02:20:21,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517208174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:21,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:21,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:21,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586649439] [2022-12-13 02:20:21,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:21,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:21,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:21,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:21,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:21,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:21,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:21,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:21,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:21,523 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:21,523 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:21,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:21,524 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:21,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:21,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:21,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:21,525 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:21,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:21,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:21,527 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,527 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:21,528 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:21,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:21,528 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,528 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:21,528 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:21,528 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:21,541 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:21,541 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:21,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:21,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:21,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:21,628 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:21,628 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:20:21,628 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:21,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:21,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:21,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:21,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1330 [2022-12-13 02:20:21,628 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:20:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash -450109852, now seen corresponding path program 1 times [2022-12-13 02:20:21,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:21,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221450592] [2022-12-13 02:20:21,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:21,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:21,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:20:21,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:21,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221450592] [2022-12-13 02:20:21,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221450592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:21,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:21,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104662461] [2022-12-13 02:20:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:21,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:21,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:21,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:21,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:21,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:21,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:21,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:21,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:21,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:21,744 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:21,744 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:21,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:21,745 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:21,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:21,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:21,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:21,746 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:21,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:21,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:21,749 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,749 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:21,749 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:21,749 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:21,749 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,749 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:21,749 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:21,749 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:21,755 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:21,755 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:21,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:21,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:21,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:21,842 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:21,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:21,842 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:21,842 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 02:20:21,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:21,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:21,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1331 [2022-12-13 02:20:21,843 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:20:21,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:21,843 INFO L85 PathProgramCache]: Analyzing trace with hash -421480701, now seen corresponding path program 1 times [2022-12-13 02:20:21,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:21,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649795309] [2022-12-13 02:20:21,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:21,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:21,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:20:21,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:21,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649795309] [2022-12-13 02:20:21,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649795309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:21,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:21,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:21,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593346729] [2022-12-13 02:20:21,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:21,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:21,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:21,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:21,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:21,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:21,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:21,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:21,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:21,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:21,968 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:21,968 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:21,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:21,969 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:21,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:21,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:21,970 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:21,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:21,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:21,973 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,973 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:21,973 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:21,973 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:21,973 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,973 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:21,973 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:21,973 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:21,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:21,979 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:21,979 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:21,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:21,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:21,980 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:22,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:22,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:20:22,071 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:22,071 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 02:20:22,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:22,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:22,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1332 [2022-12-13 02:20:22,071 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:20:22,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:22,071 INFO L85 PathProgramCache]: Analyzing trace with hash -392851550, now seen corresponding path program 1 times [2022-12-13 02:20:22,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:22,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217812226] [2022-12-13 02:20:22,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:22,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:22,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:20:22,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:22,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217812226] [2022-12-13 02:20:22,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217812226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:22,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:22,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139141701] [2022-12-13 02:20:22,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:22,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:22,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:22,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:22,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:22,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:22,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:22,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:22,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:22,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:22,207 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:22,207 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:22,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:22,208 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:22,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:22,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:22,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:22,209 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:22,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:22,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:22,211 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:22,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:22,211 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:22,211 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:22,211 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:22,212 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:22,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:22,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:22,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:22,217 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:22,217 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:22,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:22,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:22,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:22,302 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:22,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:22,303 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:22,303 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 02:20:22,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:22,303 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:22,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1333 [2022-12-13 02:20:22,303 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:20:22,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash -364222399, now seen corresponding path program 1 times [2022-12-13 02:20:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:22,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722880553] [2022-12-13 02:20:22,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:22,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:22,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 02:20:22,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:22,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722880553] [2022-12-13 02:20:22,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722880553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:22,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:22,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444638642] [2022-12-13 02:20:22,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:22,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:22,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:22,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:22,368 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:22,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:22,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:22,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:22,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:22,443 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:22,443 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:22,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:22,444 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:22,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:22,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:22,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:22,445 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:22,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:22,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:22,447 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:22,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:22,447 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:22,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:22,447 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:22,448 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:22,448 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:22,448 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:22,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:22,453 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:22,453 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:20:22,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:22,454 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:22,454 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:22,540 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:22,540 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:22,540 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:22,540 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 02:20:22,541 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:22,541 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:22,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1334 [2022-12-13 02:20:22,541 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:20:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:22,541 INFO L85 PathProgramCache]: Analyzing trace with hash -335593248, now seen corresponding path program 1 times [2022-12-13 02:20:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:22,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425649307] [2022-12-13 02:20:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:22,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:22,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:20:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:22,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425649307] [2022-12-13 02:20:22,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425649307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:22,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:22,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:22,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828055067] [2022-12-13 02:20:22,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:22,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:22,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:22,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:22,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:22,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:22,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:22,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:22,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:22,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:22,696 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:22,696 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:22,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:22,697 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:22,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:22,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:22,698 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:22,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:22,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:22,700 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:22,701 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:22,701 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:22,701 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:22,701 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:22,701 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:22,701 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:22,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:22,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:22,707 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:22,707 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:22,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:22,707 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:22,707 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:22,793 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:22,793 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:22,793 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:22,793 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 02:20:22,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:22,793 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:22,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1335 [2022-12-13 02:20:22,794 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:20:22,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:22,794 INFO L85 PathProgramCache]: Analyzing trace with hash -306964097, now seen corresponding path program 1 times [2022-12-13 02:20:22,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:22,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217009213] [2022-12-13 02:20:22,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:22,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:22,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:20:22,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:22,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217009213] [2022-12-13 02:20:22,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217009213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:22,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:22,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:22,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579444328] [2022-12-13 02:20:22,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:22,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:22,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:22,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:22,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:22,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:22,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:22,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:22,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:22,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:22,918 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:22,919 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:22,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:22,920 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:22,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:22,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:22,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:22,920 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:22,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:22,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:22,923 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:22,923 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:22,923 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:22,923 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:22,923 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:22,924 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:22,924 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:22,924 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:22,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:22,929 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:22,929 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:22,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 443 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:22,930 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:22,930 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:23,016 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:23,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:23,017 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:23,017 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 02:20:23,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:23,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:23,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1336 [2022-12-13 02:20:23,017 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:20:23,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:23,017 INFO L85 PathProgramCache]: Analyzing trace with hash -278334946, now seen corresponding path program 1 times [2022-12-13 02:20:23,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:23,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839407367] [2022-12-13 02:20:23,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:23,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:23,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:20:23,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:23,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839407367] [2022-12-13 02:20:23,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839407367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:23,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:23,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:23,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34498046] [2022-12-13 02:20:23,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:23,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:23,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:23,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:23,066 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:23,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:23,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:23,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:23,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:23,140 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:23,140 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:23,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:23,141 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:23,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:23,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:23,142 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:23,142 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:23,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:23,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:23,145 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:23,145 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:23,145 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:23,145 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:23,145 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:23,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:23,145 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:23,145 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:23,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:23,151 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:23,151 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:23,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:23,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:23,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:23,239 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:23,239 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:23,239 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:23,239 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 02:20:23,239 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:23,239 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:23,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1337 [2022-12-13 02:20:23,239 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:20:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash -249705795, now seen corresponding path program 1 times [2022-12-13 02:20:23,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:23,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165665134] [2022-12-13 02:20:23,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:23,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:23,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:23,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165665134] [2022-12-13 02:20:23,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165665134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:23,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:23,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:23,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552058364] [2022-12-13 02:20:23,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:23,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:23,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:23,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:23,290 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:23,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:23,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:23,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:23,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:23,356 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:23,356 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:23,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:23,358 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:23,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:23,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:23,358 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:23,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:23,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:23,361 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:23,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:23,361 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:23,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:23,361 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:23,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:23,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:23,361 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:23,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:23,367 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:23,367 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:23,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:23,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:23,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:23,454 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:23,455 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:23,455 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:23,455 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 02:20:23,455 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:23,455 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:23,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1338 [2022-12-13 02:20:23,455 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:20:23,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:23,455 INFO L85 PathProgramCache]: Analyzing trace with hash -221076644, now seen corresponding path program 1 times [2022-12-13 02:20:23,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:23,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974681714] [2022-12-13 02:20:23,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:23,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:23,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:20:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:23,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974681714] [2022-12-13 02:20:23,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974681714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:23,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:23,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:23,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168154443] [2022-12-13 02:20:23,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:23,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:23,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:23,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:23,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:23,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:23,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:23,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:23,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:23,583 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:23,583 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:23,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:23,584 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:23,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:23,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:23,585 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:23,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:23,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:23,587 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:23,587 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:23,587 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:23,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:23,587 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:23,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:23,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:23,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:23,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:23,593 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:23,593 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:23,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:23,594 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:23,594 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:23,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:23,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:23,682 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:23,682 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 02:20:23,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:23,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:23,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1339 [2022-12-13 02:20:23,682 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:20:23,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:23,682 INFO L85 PathProgramCache]: Analyzing trace with hash -192447493, now seen corresponding path program 1 times [2022-12-13 02:20:23,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:23,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871189827] [2022-12-13 02:20:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:23,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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:20:23,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:23,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871189827] [2022-12-13 02:20:23,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871189827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:23,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:23,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:23,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713424511] [2022-12-13 02:20:23,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:23,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:23,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:23,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:23,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:23,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:23,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:23,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:23,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:23,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:23,845 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:23,846 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:23,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:23,847 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:23,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:23,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:23,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:23,847 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:23,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:23,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:23,850 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:23,850 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:23,850 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:23,850 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:23,850 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:23,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:23,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:23,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:23,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:23,856 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:23,856 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:23,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:23,857 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:23,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:23,943 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:23,944 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:23,944 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:23,944 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 02:20:23,944 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:23,944 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:23,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1340 [2022-12-13 02:20:23,944 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:20:23,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:23,944 INFO L85 PathProgramCache]: Analyzing trace with hash -163818342, now seen corresponding path program 1 times [2022-12-13 02:20:23,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:23,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029622890] [2022-12-13 02:20:23,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:23,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:24,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:20:24,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:24,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029622890] [2022-12-13 02:20:24,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029622890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:24,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:24,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:24,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909080777] [2022-12-13 02:20:24,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:24,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:24,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:24,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:24,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:24,013 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:24,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:24,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:24,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:24,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:24,097 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:24,097 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:24,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:24,098 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:24,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:24,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:24,099 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:24,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:24,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:24,101 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:24,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:24,102 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:24,102 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:24,102 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:24,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:24,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:24,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:24,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:24,107 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:24,108 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:24,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:24,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:24,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:24,195 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:24,195 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:24,195 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:24,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:24,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:24,195 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:24,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1341 [2022-12-13 02:20:24,195 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:20:24,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:24,196 INFO L85 PathProgramCache]: Analyzing trace with hash -135189191, now seen corresponding path program 1 times [2022-12-13 02:20:24,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:24,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937422628] [2022-12-13 02:20:24,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:24,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:24,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:20:24,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:24,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937422628] [2022-12-13 02:20:24,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937422628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:24,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:24,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219965366] [2022-12-13 02:20:24,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:24,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:24,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:24,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:24,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:24,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:24,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:24,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:24,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:24,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:24,321 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:24,321 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:24,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:24,323 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:24,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:24,323 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:24,323 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:24,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:24,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:24,326 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:24,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:24,326 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:24,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:24,326 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:24,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:24,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:24,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:24,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:24,332 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:24,332 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:24,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:24,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:24,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:24,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:24,418 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:24,418 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:24,418 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 02:20:24,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:24,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:24,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1342 [2022-12-13 02:20:24,419 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:20:24,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:24,419 INFO L85 PathProgramCache]: Analyzing trace with hash -106560040, now seen corresponding path program 1 times [2022-12-13 02:20:24,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:24,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617135985] [2022-12-13 02:20:24,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:24,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:24,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 02:20:24,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:24,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617135985] [2022-12-13 02:20:24,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617135985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:24,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:24,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382351093] [2022-12-13 02:20:24,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:24,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:24,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:24,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:24,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:24,468 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:24,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:24,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:24,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:24,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:24,533 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:24,533 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:24,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:24,535 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:24,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:24,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:24,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:24,535 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:24,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:24,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:24,537 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:24,537 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:24,538 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:24,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:24,538 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:24,538 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:24,538 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:24,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:24,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:24,544 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:24,544 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:20:24,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:24,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:24,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:24,632 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:24,632 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:24,632 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:24,632 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 02:20:24,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:24,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:24,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1343 [2022-12-13 02:20:24,632 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:20:24,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash -77930889, now seen corresponding path program 1 times [2022-12-13 02:20:24,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:24,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956341222] [2022-12-13 02:20:24,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:24,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:24,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:20:24,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:24,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956341222] [2022-12-13 02:20:24,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956341222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:24,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:24,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:24,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504285126] [2022-12-13 02:20:24,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:24,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:24,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:24,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:24,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:24,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:24,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:24,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:24,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:24,750 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:24,751 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:24,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:24,752 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:24,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:24,752 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:24,752 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:24,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:24,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:24,755 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:24,755 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:24,755 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:24,755 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:24,755 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:24,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:24,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:24,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:24,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:24,761 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:24,761 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:24,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:24,762 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:24,762 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:24,858 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:24,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:20:24,858 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:24,858 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 02:20:24,858 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:24,858 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:24,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1344 [2022-12-13 02:20:24,858 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:20:24,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:24,858 INFO L85 PathProgramCache]: Analyzing trace with hash -49301738, now seen corresponding path program 1 times [2022-12-13 02:20:24,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:24,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983431942] [2022-12-13 02:20:24,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:24,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:24,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 02:20:24,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:24,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983431942] [2022-12-13 02:20:24,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983431942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:24,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:24,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087935502] [2022-12-13 02:20:24,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:24,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:24,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:24,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:24,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:24,923 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:24,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:24,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:24,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:24,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:24,997 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:24,997 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:24,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:24,998 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:24,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:24,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:24,999 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:24,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:25,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:25,001 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:25,001 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:25,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:25,001 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:25,002 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:25,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:25,007 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:25,008 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:20:25,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:25,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:25,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:25,093 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:25,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:25,094 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:25,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:25,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:25,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:25,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1345 [2022-12-13 02:20:25,094 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:20:25,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:25,094 INFO L85 PathProgramCache]: Analyzing trace with hash -20672587, now seen corresponding path program 1 times [2022-12-13 02:20:25,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:25,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90168288] [2022-12-13 02:20:25,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:25,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:25,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:20:25,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:25,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90168288] [2022-12-13 02:20:25,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90168288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:25,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:25,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:25,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019712411] [2022-12-13 02:20:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:25,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:25,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:25,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:25,141 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:25,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:25,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:25,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:25,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:25,205 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:25,205 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:25,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:25,206 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:25,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:25,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:25,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:25,207 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:25,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:25,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:25,209 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,209 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:25,210 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:25,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:25,210 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:25,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:25,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:25,215 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:25,215 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:25,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:25,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:25,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:25,303 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:25,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:25,303 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:25,303 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 02:20:25,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:25,303 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:25,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1346 [2022-12-13 02:20:25,303 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:20:25,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:25,304 INFO L85 PathProgramCache]: Analyzing trace with hash 7956564, now seen corresponding path program 1 times [2022-12-13 02:20:25,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:25,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480768775] [2022-12-13 02:20:25,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:25,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:25,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:20:25,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:25,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480768775] [2022-12-13 02:20:25,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480768775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:25,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:25,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:25,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111594606] [2022-12-13 02:20:25,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:25,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:25,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:25,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:25,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:25,354 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:25,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:25,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:25,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:25,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:25,432 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:25,432 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:25,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:25,433 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:25,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:25,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:25,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:25,433 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:25,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:25,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:25,436 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,436 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:25,436 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:25,436 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:25,436 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,437 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:25,437 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:25,437 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:25,442 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:25,442 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:20:25,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:25,443 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:25,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:25,530 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:25,531 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:25,531 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:25,531 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 02:20:25,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:25,531 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:25,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1347 [2022-12-13 02:20:25,531 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:20:25,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:25,531 INFO L85 PathProgramCache]: Analyzing trace with hash 36585715, now seen corresponding path program 1 times [2022-12-13 02:20:25,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:25,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641404921] [2022-12-13 02:20:25,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:25,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:25,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:20:25,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:25,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641404921] [2022-12-13 02:20:25,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641404921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:25,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:25,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:25,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647456669] [2022-12-13 02:20:25,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:25,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:25,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:25,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:25,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:25,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:25,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:25,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:25,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:25,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:25,680 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:25,681 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:20:25,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1127 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:25,682 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:25,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:25,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:25,682 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:25,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:25,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:25,685 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,685 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:25,685 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:25,685 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:25,685 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,685 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:25,685 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:25,685 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:25,691 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:25,691 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:20:25,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:25,692 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:25,692 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:25,779 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:25,779 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:25,779 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:25,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:25,779 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:25,779 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:25,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1348 [2022-12-13 02:20:25,779 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:20:25,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:25,780 INFO L85 PathProgramCache]: Analyzing trace with hash 65214866, now seen corresponding path program 1 times [2022-12-13 02:20:25,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:25,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981228786] [2022-12-13 02:20:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:25,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:20:25,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:25,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981228786] [2022-12-13 02:20:25,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981228786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:25,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:25,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:25,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059439985] [2022-12-13 02:20:25,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:25,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:25,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:25,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:25,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:25,830 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:25,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:25,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:25,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:25,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:25,904 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:25,904 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:25,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:25,905 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:25,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:25,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:25,906 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:25,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:25,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:25,908 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,908 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:25,909 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:25,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:25,909 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:25,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:25,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:25,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:25,915 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:25,915 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:25,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:25,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:25,915 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:26,002 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:26,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:26,003 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:26,003 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 02:20:26,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:26,003 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:26,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1349 [2022-12-13 02:20:26,003 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:20:26,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:26,003 INFO L85 PathProgramCache]: Analyzing trace with hash 93844017, now seen corresponding path program 1 times [2022-12-13 02:20:26,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:26,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973654104] [2022-12-13 02:20:26,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:26,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:26,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:20:26,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:26,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973654104] [2022-12-13 02:20:26,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973654104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:26,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:26,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:26,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312501142] [2022-12-13 02:20:26,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:26,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:26,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:26,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:26,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:26,054 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:26,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:26,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:26,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:26,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:26,120 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:26,120 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:26,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:26,121 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:26,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:26,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:26,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:26,121 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:26,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:26,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:26,124 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:26,124 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:26,124 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:26,124 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:26,124 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:26,124 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:26,124 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:26,124 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:26,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:26,130 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:26,130 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:26,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:26,130 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:26,130 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:26,217 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:26,218 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:26,218 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:26,218 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 02:20:26,218 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:26,218 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:26,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1350 [2022-12-13 02:20:26,218 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:20:26,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:26,218 INFO L85 PathProgramCache]: Analyzing trace with hash 122473168, now seen corresponding path program 1 times [2022-12-13 02:20:26,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:26,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425821654] [2022-12-13 02:20:26,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:26,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:26,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:20:26,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:26,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425821654] [2022-12-13 02:20:26,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425821654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:26,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:26,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:26,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486730697] [2022-12-13 02:20:26,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:26,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:26,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:26,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:26,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:26,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:26,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:26,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:26,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:26,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:26,345 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:26,345 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:26,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:26,346 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:26,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:26,347 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:26,347 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:26,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:26,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:26,349 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:26,349 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:26,349 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:26,349 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:26,349 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:26,350 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:26,350 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:26,350 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:26,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:26,355 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:26,355 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:26,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:26,356 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:26,356 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:26,443 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:26,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:26,444 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:26,444 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 02:20:26,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:26,444 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:26,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1351 [2022-12-13 02:20:26,444 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:20:26,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash 151102319, now seen corresponding path program 1 times [2022-12-13 02:20:26,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:26,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846831423] [2022-12-13 02:20:26,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:26,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:20:26,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:26,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846831423] [2022-12-13 02:20:26,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846831423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:26,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:26,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366183847] [2022-12-13 02:20:26,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:26,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:26,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:26,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:26,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:26,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:26,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:26,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:26,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:26,567 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:26,567 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:26,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:26,568 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:26,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:26,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:26,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:26,569 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:26,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:26,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:26,571 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:26,571 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:26,571 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:26,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:26,572 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:26,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:26,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:26,572 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:26,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:26,577 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:26,577 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:26,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:26,578 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:26,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:26,665 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:26,665 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:26,665 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:26,665 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 02:20:26,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:26,665 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:26,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1352 [2022-12-13 02:20:26,665 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:20:26,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:26,666 INFO L85 PathProgramCache]: Analyzing trace with hash 179731470, now seen corresponding path program 1 times [2022-12-13 02:20:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:26,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389203484] [2022-12-13 02:20:26,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:26,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:26,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:20:26,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:26,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389203484] [2022-12-13 02:20:26,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389203484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:26,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:26,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:26,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337322805] [2022-12-13 02:20:26,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:26,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:26,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:26,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:26,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:26,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:26,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:26,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:26,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:26,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:26,782 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:26,783 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:26,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:26,784 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:26,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:26,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:26,784 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:26,784 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:26,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:26,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:26,787 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:26,787 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:26,787 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:26,787 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:26,787 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:26,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:26,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:26,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:26,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:26,793 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:26,793 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:26,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:26,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:26,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:26,881 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:26,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:26,882 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:26,882 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 02:20:26,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:26,882 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:26,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1353 [2022-12-13 02:20:26,882 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:20:26,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:26,882 INFO L85 PathProgramCache]: Analyzing trace with hash 208360621, now seen corresponding path program 1 times [2022-12-13 02:20:26,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:26,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483148190] [2022-12-13 02:20:26,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:26,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:26,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:26,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483148190] [2022-12-13 02:20:26,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483148190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:26,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:26,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:26,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305478464] [2022-12-13 02:20:26,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:26,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:26,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:26,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:26,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:26,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:26,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:26,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:26,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:26,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:27,033 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:27,033 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:27,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:27,035 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:27,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:27,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:27,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:27,035 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:27,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:27,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:27,038 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,038 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:27,038 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:27,038 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:27,038 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,038 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:27,038 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:27,038 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:27,044 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:27,044 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:27,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:27,044 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:27,044 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:27,132 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:27,133 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:27,133 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:27,133 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 02:20:27,133 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:27,133 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:27,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1354 [2022-12-13 02:20:27,133 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:20:27,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:27,133 INFO L85 PathProgramCache]: Analyzing trace with hash 236989772, now seen corresponding path program 1 times [2022-12-13 02:20:27,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:27,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295336104] [2022-12-13 02:20:27,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:27,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:27,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:20:27,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:27,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295336104] [2022-12-13 02:20:27,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295336104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:27,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:27,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:27,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590022135] [2022-12-13 02:20:27,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:27,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:27,184 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:27,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:27,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:27,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:27,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:27,251 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:27,252 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:27,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:27,253 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:27,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:27,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:27,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:27,253 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:27,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:27,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:27,256 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,256 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:27,256 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:27,256 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:27,256 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,256 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:27,256 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:27,256 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:27,262 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:27,262 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:20:27,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:27,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:27,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:27,350 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:27,351 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:27,351 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:27,351 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 02:20:27,351 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:27,351 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:27,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1355 [2022-12-13 02:20:27,351 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:20:27,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash 265618923, now seen corresponding path program 1 times [2022-12-13 02:20:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:27,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950213703] [2022-12-13 02:20:27,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:27,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:27,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:20:27,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:27,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950213703] [2022-12-13 02:20:27,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950213703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:27,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:27,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:27,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245078543] [2022-12-13 02:20:27,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:27,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:27,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:27,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:27,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:27,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:27,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:27,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:27,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:27,477 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:27,477 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:27,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:27,478 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:27,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:27,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:27,478 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:27,478 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:27,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:27,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:27,481 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,481 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:27,481 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:27,481 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:27,481 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,481 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:27,481 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:27,481 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:27,487 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:27,487 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:27,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:27,487 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:27,487 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:27,572 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:27,572 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:20:27,572 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:27,572 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 02:20:27,572 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:27,572 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:27,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1356 [2022-12-13 02:20:27,573 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:20:27,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:27,573 INFO L85 PathProgramCache]: Analyzing trace with hash 294248074, now seen corresponding path program 1 times [2022-12-13 02:20:27,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:27,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124214246] [2022-12-13 02:20:27,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:27,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:20:27,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:27,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124214246] [2022-12-13 02:20:27,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124214246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:27,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:27,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:27,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077235107] [2022-12-13 02:20:27,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:27,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:27,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:27,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:27,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:27,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:27,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:27,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:27,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:27,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:27,695 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:27,695 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:20:27,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:27,696 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:27,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:27,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:27,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:27,697 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:27,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:27,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:27,699 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,699 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:27,699 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:27,699 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:27,699 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,699 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:27,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:27,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:27,705 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:27,705 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:27,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:27,706 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:27,706 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:27,790 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:27,790 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:20:27,790 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:27,790 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 02:20:27,790 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:27,790 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:27,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1357 [2022-12-13 02:20:27,790 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:20:27,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:27,790 INFO L85 PathProgramCache]: Analyzing trace with hash 322877225, now seen corresponding path program 1 times [2022-12-13 02:20:27,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:27,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803900101] [2022-12-13 02:20:27,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:27,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:27,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:20:27,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:27,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803900101] [2022-12-13 02:20:27,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803900101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:27,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:27,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:27,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475733481] [2022-12-13 02:20:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:27,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:27,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:27,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:27,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:27,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:27,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:27,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:27,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:27,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:27,905 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:27,906 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:27,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:27,907 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:27,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:27,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:27,907 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:27,907 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:27,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:27,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:27,910 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,910 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:27,910 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:27,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:27,910 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,910 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:27,910 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:27,910 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:27,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:27,916 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:27,916 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:27,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:27,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:27,917 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:28,003 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:28,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:28,003 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:28,003 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 02:20:28,004 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:28,004 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:28,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1358 [2022-12-13 02:20:28,004 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:20:28,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash 351506376, now seen corresponding path program 1 times [2022-12-13 02:20:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:28,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923721683] [2022-12-13 02:20:28,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:28,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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 02:20:28,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:28,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923721683] [2022-12-13 02:20:28,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923721683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:28,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:28,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092803989] [2022-12-13 02:20:28,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:28,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:28,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:28,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:28,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:28,061 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:28,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:28,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:28,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:28,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:28,127 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:28,127 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:28,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:28,128 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:28,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:28,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:28,128 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:28,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:28,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:28,131 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:28,131 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:28,131 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:28,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:28,131 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:28,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:28,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:28,131 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:28,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:28,137 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:28,137 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:28,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:28,137 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:28,138 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:28,224 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:28,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:28,225 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:28,225 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 02:20:28,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:28,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:28,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1359 [2022-12-13 02:20:28,225 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:20:28,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:28,225 INFO L85 PathProgramCache]: Analyzing trace with hash 380135527, now seen corresponding path program 1 times [2022-12-13 02:20:28,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:28,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321556726] [2022-12-13 02:20:28,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:28,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:28,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:20:28,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:28,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321556726] [2022-12-13 02:20:28,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321556726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:28,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:28,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:28,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639132100] [2022-12-13 02:20:28,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:28,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:28,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:28,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:28,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:28,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:28,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:28,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:28,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:28,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:28,338 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:28,338 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:28,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:28,339 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:28,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:28,340 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:28,340 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:28,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:28,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:28,342 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:28,342 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:28,343 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:28,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:28,343 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:28,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:28,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:28,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:28,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:28,349 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:28,349 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:28,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:28,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:28,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:28,435 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:28,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:28,436 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:28,436 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 02:20:28,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:28,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:28,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1360 [2022-12-13 02:20:28,436 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:20:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash 408764678, now seen corresponding path program 1 times [2022-12-13 02:20:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:28,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364516356] [2022-12-13 02:20:28,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:28,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:28,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:20:28,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:28,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364516356] [2022-12-13 02:20:28,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364516356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:28,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:28,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:28,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130163281] [2022-12-13 02:20:28,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:28,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:28,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:28,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:28,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:28,515 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:28,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:28,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:28,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:28,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:28,599 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:28,599 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:28,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:28,600 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:28,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:28,600 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:28,600 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:28,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:28,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:28,603 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:28,603 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:28,603 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:28,603 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:28,603 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:28,604 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:28,604 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:28,604 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:28,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:28,609 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:28,609 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:28,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:28,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:28,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:28,696 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:28,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:28,696 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:28,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:28,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:28,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:28,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1361 [2022-12-13 02:20:28,697 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:20:28,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:28,697 INFO L85 PathProgramCache]: Analyzing trace with hash 437393829, now seen corresponding path program 1 times [2022-12-13 02:20:28,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:28,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672686934] [2022-12-13 02:20:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:28,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:20:28,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:28,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672686934] [2022-12-13 02:20:28,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672686934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:28,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:28,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248064402] [2022-12-13 02:20:28,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:28,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:28,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:28,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:28,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:28,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:28,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:28,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:28,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:28,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:28,821 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:28,821 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:28,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:28,822 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:28,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:28,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:28,823 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:28,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:28,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:28,825 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:28,825 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:28,825 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:28,825 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:28,825 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:28,826 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:28,826 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:28,826 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:28,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:28,831 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:28,832 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:28,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:28,832 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:28,832 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:28,917 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:28,918 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:28,918 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:28,918 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 02:20:28,918 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:28,918 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:28,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1362 [2022-12-13 02:20:28,918 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:20:28,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:28,918 INFO L85 PathProgramCache]: Analyzing trace with hash 466022980, now seen corresponding path program 1 times [2022-12-13 02:20:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:28,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996780164] [2022-12-13 02:20:28,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:28,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:20:28,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:28,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996780164] [2022-12-13 02:20:28,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996780164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:28,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:28,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205950869] [2022-12-13 02:20:28,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:28,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:28,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:28,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:28,985 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:28,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:28,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:28,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:28,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:29,079 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:29,080 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:29,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:29,081 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:29,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:29,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:29,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:29,081 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:29,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:29,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:29,084 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,084 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:29,084 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:29,084 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:29,084 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,084 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:29,084 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:29,084 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:29,090 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:29,090 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:29,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:29,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:29,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:29,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:29,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:29,177 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:29,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:29,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:29,178 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:29,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1363 [2022-12-13 02:20:29,178 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:20:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash 494652131, now seen corresponding path program 1 times [2022-12-13 02:20:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:29,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885953721] [2022-12-13 02:20:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:29,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:29,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:20:29,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:29,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885953721] [2022-12-13 02:20:29,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885953721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:29,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:29,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530664930] [2022-12-13 02:20:29,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:29,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:29,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:29,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:29,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:29,229 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:29,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:29,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:29,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:29,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:29,295 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:29,295 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:29,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:29,296 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:29,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:29,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:29,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:29,296 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:29,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:29,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:29,299 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,299 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:29,299 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:29,299 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:29,299 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,299 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:29,299 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:29,299 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:29,305 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:29,305 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:29,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:29,306 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:29,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:29,393 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:29,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:29,393 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:29,393 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 02:20:29,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:29,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:29,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1364 [2022-12-13 02:20:29,393 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:20:29,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash 523281282, now seen corresponding path program 1 times [2022-12-13 02:20:29,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:29,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406883149] [2022-12-13 02:20:29,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:29,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:29,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:20:29,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:29,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406883149] [2022-12-13 02:20:29,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406883149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:29,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:29,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:29,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415539251] [2022-12-13 02:20:29,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:29,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:29,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:29,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:29,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:29,443 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:29,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:29,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:29,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:29,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:29,507 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:29,508 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:29,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:29,509 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:29,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:29,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:29,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:29,509 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:29,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:29,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:29,512 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:29,512 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:29,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:29,512 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:29,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:29,512 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:29,518 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:29,518 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:29,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:29,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:29,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:29,604 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:29,605 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:29,605 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:29,605 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 02:20:29,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:29,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:29,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1365 [2022-12-13 02:20:29,605 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:20:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash 551910433, now seen corresponding path program 1 times [2022-12-13 02:20:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:29,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899987649] [2022-12-13 02:20:29,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:29,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:29,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:20:29,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:29,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899987649] [2022-12-13 02:20:29,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899987649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:29,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:29,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602661559] [2022-12-13 02:20:29,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:29,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:29,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:29,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:29,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:29,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:29,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:29,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:29,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:29,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:29,738 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:29,738 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:29,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1089 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:29,739 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:29,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:29,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:29,739 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:29,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:29,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:29,742 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:29,742 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:29,742 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:29,742 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:29,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:29,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:29,748 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:29,748 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:29,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:29,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:29,749 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:29,836 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:29,837 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:29,837 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:29,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:29,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:29,837 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:29,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1366 [2022-12-13 02:20:29,837 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:20:29,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:29,838 INFO L85 PathProgramCache]: Analyzing trace with hash 580539584, now seen corresponding path program 1 times [2022-12-13 02:20:29,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:29,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553076565] [2022-12-13 02:20:29,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:29,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:29,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:20:29,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:29,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553076565] [2022-12-13 02:20:29,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553076565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:29,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:29,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:29,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252129213] [2022-12-13 02:20:29,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:29,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:29,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:29,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:29,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:29,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:29,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:29,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:29,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:29,962 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:29,963 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:29,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:29,964 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:29,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:29,964 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:29,964 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:29,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:29,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:29,967 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,967 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:29,967 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:29,967 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:29,967 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,968 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:29,968 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:29,968 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:29,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:29,973 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:29,973 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:29,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:29,974 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:29,974 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:30,061 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:30,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:30,061 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:30,062 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 02:20:30,062 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:30,062 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:30,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1367 [2022-12-13 02:20:30,062 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:20:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash 609168735, now seen corresponding path program 1 times [2022-12-13 02:20:30,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:30,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617309359] [2022-12-13 02:20:30,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:30,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:30,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:20:30,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:30,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617309359] [2022-12-13 02:20:30,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617309359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:30,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:30,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:30,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271781674] [2022-12-13 02:20:30,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:30,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:30,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:30,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:30,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:30,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:30,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:30,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:30,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:30,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:30,198 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:30,198 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:30,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:30,199 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:30,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:30,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:30,200 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:30,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:30,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:30,202 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:30,202 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:30,202 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:30,203 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:30,203 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:30,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:30,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:30,203 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:30,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:30,208 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:30,208 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:30,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:30,209 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:30,209 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:30,296 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:30,297 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:30,297 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:30,297 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 02:20:30,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:30,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:30,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1368 [2022-12-13 02:20:30,297 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:20:30,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:30,297 INFO L85 PathProgramCache]: Analyzing trace with hash 637797886, now seen corresponding path program 1 times [2022-12-13 02:20:30,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:30,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736871167] [2022-12-13 02:20:30,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:30,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:30,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:20:30,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:30,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736871167] [2022-12-13 02:20:30,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736871167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:30,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:30,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:30,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045199714] [2022-12-13 02:20:30,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:30,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:30,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:30,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:30,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:30,346 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:30,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:30,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:30,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:30,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:30,422 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:30,423 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:30,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:30,424 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:30,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:30,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:30,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:30,424 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:30,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:30,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:30,427 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:30,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:30,427 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:30,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:30,427 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:30,427 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:30,427 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:30,427 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:30,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:30,433 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:30,433 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:30,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:30,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:30,434 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:30,521 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:30,521 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:30,521 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:30,521 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 02:20:30,521 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:30,521 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:30,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1369 [2022-12-13 02:20:30,521 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:20:30,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash 666427037, now seen corresponding path program 1 times [2022-12-13 02:20:30,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:30,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827072782] [2022-12-13 02:20:30,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:30,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:20:30,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:30,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827072782] [2022-12-13 02:20:30,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827072782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:30,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:30,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:30,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793570172] [2022-12-13 02:20:30,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:30,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:30,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:30,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:30,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:30,588 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:30,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:30,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:30,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:30,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:30,656 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:30,656 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:30,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:30,657 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:30,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:30,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:30,658 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:30,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:30,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:30,660 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:30,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:30,661 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:30,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:30,661 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:30,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:30,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:30,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:30,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:30,666 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:30,667 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:30,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:30,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:30,667 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:30,754 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:30,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:30,754 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:30,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:30,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:30,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:30,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1370 [2022-12-13 02:20:30,755 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:20:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash 695056188, now seen corresponding path program 1 times [2022-12-13 02:20:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:30,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408828147] [2022-12-13 02:20:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:30,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:30,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:20:30,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:30,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408828147] [2022-12-13 02:20:30,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408828147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:30,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:30,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:30,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87113749] [2022-12-13 02:20:30,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:30,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:30,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:30,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:30,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:30,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:30,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:30,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:30,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:30,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:30,871 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:30,871 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:30,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:30,872 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:30,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:30,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:30,873 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:30,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:30,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:30,876 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:30,876 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:30,876 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:30,876 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:30,876 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:30,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:30,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:30,876 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:30,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:30,882 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:30,882 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:30,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:30,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:30,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:30,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:30,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:30,970 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:30,970 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 02:20:30,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:30,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:30,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1371 [2022-12-13 02:20:30,970 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:20:30,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash 723685339, now seen corresponding path program 1 times [2022-12-13 02:20:30,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:30,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323483702] [2022-12-13 02:20:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:30,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:31,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:20:31,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:31,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323483702] [2022-12-13 02:20:31,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323483702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:31,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:31,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:31,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683471096] [2022-12-13 02:20:31,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:31,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:31,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:31,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:31,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:31,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:31,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:31,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:31,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:31,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:31,085 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:31,085 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:31,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:31,086 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:31,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:31,087 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:31,087 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:31,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:31,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:31,089 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:31,089 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:31,089 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:31,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:31,090 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:31,090 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:31,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:31,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:31,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:31,096 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:31,096 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:20:31,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:31,096 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:31,096 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:31,194 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:31,195 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:20:31,195 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:31,195 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 02:20:31,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:31,195 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:31,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1372 [2022-12-13 02:20:31,195 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:20:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:31,195 INFO L85 PathProgramCache]: Analyzing trace with hash 752314490, now seen corresponding path program 1 times [2022-12-13 02:20:31,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:31,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805873439] [2022-12-13 02:20:31,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:31,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:31,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:20:31,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:31,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805873439] [2022-12-13 02:20:31,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805873439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:31,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:31,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:31,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914547450] [2022-12-13 02:20:31,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:31,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:31,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:31,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:31,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:31,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:31,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:31,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:31,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:31,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:31,324 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:31,324 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:31,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:31,325 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:31,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:31,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:31,326 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:31,326 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:31,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:31,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:31,328 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:31,328 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:31,328 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:31,328 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:31,328 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:31,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:31,329 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:31,329 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:31,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:31,334 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:31,334 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:31,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:31,335 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:31,335 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:31,423 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:31,423 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:31,423 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:31,423 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 02:20:31,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:31,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:31,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1373 [2022-12-13 02:20:31,423 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:20:31,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash 780943641, now seen corresponding path program 1 times [2022-12-13 02:20:31,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:31,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316923855] [2022-12-13 02:20:31,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:31,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:31,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:20:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:31,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316923855] [2022-12-13 02:20:31,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316923855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:31,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:31,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:31,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048979196] [2022-12-13 02:20:31,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:31,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:31,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:31,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:31,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:31,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:31,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:31,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:31,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:31,540 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:31,540 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:31,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:31,541 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:31,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:31,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:31,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:31,542 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:31,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:31,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:31,544 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:31,545 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:31,545 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:31,545 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:31,545 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:31,545 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:31,545 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:31,545 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:31,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:31,551 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:31,551 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:31,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:31,551 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:31,551 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:31,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:31,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:31,638 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:31,638 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 02:20:31,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:31,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:31,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1374 [2022-12-13 02:20:31,638 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:20:31,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:31,639 INFO L85 PathProgramCache]: Analyzing trace with hash 809572792, now seen corresponding path program 1 times [2022-12-13 02:20:31,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:31,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241527152] [2022-12-13 02:20:31,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:31,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:31,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:20:31,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:31,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241527152] [2022-12-13 02:20:31,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241527152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:31,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:31,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:31,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430123855] [2022-12-13 02:20:31,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:31,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:31,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:31,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:31,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:31,702 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:31,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:31,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:31,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:31,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:31,778 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:31,779 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:31,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:31,779 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:31,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:31,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:31,780 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:31,780 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:31,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:31,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:31,782 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:31,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:31,783 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:31,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:31,783 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:31,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:31,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:31,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:31,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:31,788 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:31,789 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:20:31,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:31,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:31,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:31,877 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:31,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:31,877 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:31,877 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 02:20:31,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:31,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:31,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1375 [2022-12-13 02:20:31,877 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:20:31,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:31,878 INFO L85 PathProgramCache]: Analyzing trace with hash 838201943, now seen corresponding path program 1 times [2022-12-13 02:20:31,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:31,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313772594] [2022-12-13 02:20:31,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:31,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:31,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 02:20:31,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:31,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313772594] [2022-12-13 02:20:31,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313772594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:31,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:31,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:31,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198898977] [2022-12-13 02:20:31,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:31,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:31,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:31,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:31,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:31,926 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:31,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:31,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:31,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:31,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:32,003 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:32,003 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:32,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:32,004 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:32,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:32,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:32,005 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:32,005 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:32,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:32,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:32,007 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,007 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:32,007 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:32,007 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:32,008 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,008 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:32,008 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:32,008 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:32,013 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:32,013 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:32,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:32,014 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:32,014 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:32,102 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:32,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:20:32,103 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:32,103 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 02:20:32,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:32,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:32,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1376 [2022-12-13 02:20:32,103 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:20:32,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:32,103 INFO L85 PathProgramCache]: Analyzing trace with hash 866831094, now seen corresponding path program 1 times [2022-12-13 02:20:32,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:32,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660293253] [2022-12-13 02:20:32,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:32,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:32,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660293253] [2022-12-13 02:20:32,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660293253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:32,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:32,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:32,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62706729] [2022-12-13 02:20:32,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:32,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:32,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:32,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:32,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:32,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:32,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:32,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:32,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:32,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:32,225 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:32,225 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:32,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:32,226 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:32,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:32,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:32,226 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:32,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:32,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:32,229 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:32,229 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:32,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:32,229 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:32,229 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:32,229 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:32,235 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:32,235 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:32,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:32,236 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:32,236 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:32,323 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:32,323 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:32,323 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:32,323 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 02:20:32,323 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:32,323 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:32,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1377 [2022-12-13 02:20:32,323 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:20:32,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:32,324 INFO L85 PathProgramCache]: Analyzing trace with hash 895460245, now seen corresponding path program 1 times [2022-12-13 02:20:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:32,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562895942] [2022-12-13 02:20:32,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:32,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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:20:32,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:32,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562895942] [2022-12-13 02:20:32,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562895942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:32,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:32,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:32,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127287787] [2022-12-13 02:20:32,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:32,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:32,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:32,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:32,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:32,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:32,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:32,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:32,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:32,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:32,451 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:32,451 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:32,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:32,452 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:32,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:32,453 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:32,453 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:32,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:32,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:32,455 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,455 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:32,455 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:32,455 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:32,455 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,456 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:32,456 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:32,456 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:32,461 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:32,461 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:32,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:32,462 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:32,462 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:32,548 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:32,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:32,549 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:32,549 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 02:20:32,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:32,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:32,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1378 [2022-12-13 02:20:32,549 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:20:32,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash 924089396, now seen corresponding path program 1 times [2022-12-13 02:20:32,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:32,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308371450] [2022-12-13 02:20:32,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:32,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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:20:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:32,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308371450] [2022-12-13 02:20:32,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308371450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:32,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:32,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289431630] [2022-12-13 02:20:32,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:32,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:32,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:32,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:32,601 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:32,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:32,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:32,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:32,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:32,666 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:32,666 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:20:32,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:32,667 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:32,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:32,667 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:32,668 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:32,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:32,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:32,670 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:32,670 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:32,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:32,670 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,671 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:32,671 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:32,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:32,676 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:32,676 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:20:32,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:32,677 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:32,677 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:32,764 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:32,764 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:32,764 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:32,764 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 02:20:32,764 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:32,764 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:32,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1379 [2022-12-13 02:20:32,765 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:20:32,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:32,765 INFO L85 PathProgramCache]: Analyzing trace with hash 952718547, now seen corresponding path program 1 times [2022-12-13 02:20:32,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:32,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566199351] [2022-12-13 02:20:32,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:32,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:32,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:32,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566199351] [2022-12-13 02:20:32,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566199351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:32,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:32,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475758855] [2022-12-13 02:20:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:32,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:32,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:32,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:32,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:32,813 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:32,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:32,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:32,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:32,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:32,889 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:32,890 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:32,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:32,891 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:32,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:32,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:32,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:32,891 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:32,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:32,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:32,894 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,894 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:32,894 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:32,894 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:32,894 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,894 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:32,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:32,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:32,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:32,900 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:32,900 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:32,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:32,901 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:32,901 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:32,988 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:32,988 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:32,988 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:32,988 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 02:20:32,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:32,989 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:32,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1380 [2022-12-13 02:20:32,989 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:20:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:32,989 INFO L85 PathProgramCache]: Analyzing trace with hash 981347698, now seen corresponding path program 1 times [2022-12-13 02:20:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:32,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227961095] [2022-12-13 02:20:32,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:32,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:33,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:20:33,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:33,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227961095] [2022-12-13 02:20:33,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227961095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:33,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:33,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:33,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731319695] [2022-12-13 02:20:33,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:33,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:33,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:33,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:33,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:33,041 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:33,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:33,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:33,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:33,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:33,117 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:33,117 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:33,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:33,118 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:33,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:33,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:33,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:33,119 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:33,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:33,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:33,121 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:33,121 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:33,122 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:33,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:33,122 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:33,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:33,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:33,122 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:33,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:33,128 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:33,128 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:33,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:33,128 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:33,128 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:33,215 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:33,216 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:33,216 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:33,216 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 02:20:33,216 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:33,216 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:33,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1381 [2022-12-13 02:20:33,216 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:20:33,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:33,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1009976849, now seen corresponding path program 1 times [2022-12-13 02:20:33,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:33,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409153544] [2022-12-13 02:20:33,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:33,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:33,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:20:33,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:33,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409153544] [2022-12-13 02:20:33,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409153544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:33,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:33,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330712807] [2022-12-13 02:20:33,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:33,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:33,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:33,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:33,293 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:33,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:33,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:33,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:33,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:33,361 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:33,361 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:33,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:33,363 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:33,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:33,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:33,363 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:33,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:33,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:33,366 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:33,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:33,366 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:33,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:33,366 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:33,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:33,366 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:33,366 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:33,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:33,372 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:33,372 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:33,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:33,372 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:33,373 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:33,461 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:33,461 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:33,461 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:33,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:33,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:33,461 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:33,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1382 [2022-12-13 02:20:33,462 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:20:33,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:33,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1038606000, now seen corresponding path program 1 times [2022-12-13 02:20:33,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:33,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483973291] [2022-12-13 02:20:33,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:33,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:33,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:20:33,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:33,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483973291] [2022-12-13 02:20:33,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483973291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:33,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:33,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:33,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933744168] [2022-12-13 02:20:33,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:33,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:33,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:33,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:33,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:33,530 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:33,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:33,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:33,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:33,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:33,606 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:33,606 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:33,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:33,607 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:33,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:33,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:33,608 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:33,608 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:33,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:33,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:33,610 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:33,610 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:33,610 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:33,610 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:33,611 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:33,611 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:33,611 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:33,611 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:33,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:33,616 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:33,616 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:33,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:33,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:33,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:33,706 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:33,706 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:20:33,706 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:33,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:33,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:33,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:33,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1383 [2022-12-13 02:20:33,706 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:20:33,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:33,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1067235151, now seen corresponding path program 1 times [2022-12-13 02:20:33,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:33,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080876170] [2022-12-13 02:20:33,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:33,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:33,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:20:33,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:33,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080876170] [2022-12-13 02:20:33,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080876170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:33,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:33,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:33,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262062239] [2022-12-13 02:20:33,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:33,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:33,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:33,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:33,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:33,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:33,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:33,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:33,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:33,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:33,831 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:33,831 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:33,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:33,832 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:33,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:33,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:33,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:33,833 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:33,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:33,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:33,836 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:33,836 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:33,836 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:33,836 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:33,836 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:33,836 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:33,836 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:33,836 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:33,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:33,842 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:33,842 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:33,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:33,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:33,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:33,937 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:33,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:20:33,938 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:33,938 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 02:20:33,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:33,938 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:33,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1384 [2022-12-13 02:20:33,938 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:20:33,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1095864302, now seen corresponding path program 1 times [2022-12-13 02:20:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:33,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089917136] [2022-12-13 02:20:33,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:33,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:33,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:20:33,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:33,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089917136] [2022-12-13 02:20:33,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089917136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:33,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:33,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:33,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488395686] [2022-12-13 02:20:33,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:33,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:33,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:33,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:33,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:33,989 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:33,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:33,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:33,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:33,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:34,055 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:34,056 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:34,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:34,057 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:34,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:34,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:34,057 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:34,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:34,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:34,060 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:34,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:34,060 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:34,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:34,060 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:34,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:34,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:34,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:34,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:34,066 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:34,066 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:34,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:34,067 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:34,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:34,155 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:34,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:34,155 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:34,155 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 02:20:34,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:34,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:34,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1385 [2022-12-13 02:20:34,155 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:20:34,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:34,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1124493453, now seen corresponding path program 1 times [2022-12-13 02:20:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:34,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122319018] [2022-12-13 02:20:34,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:34,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:34,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:20:34,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:34,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122319018] [2022-12-13 02:20:34,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122319018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:34,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:34,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:34,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503043391] [2022-12-13 02:20:34,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:34,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:34,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:34,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:34,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:34,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:34,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:34,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:34,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:34,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:34,283 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:34,283 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:34,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:34,284 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:34,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:34,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:34,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:34,285 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:34,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:34,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:34,287 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:34,287 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:34,288 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:34,288 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:34,288 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:34,288 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:34,288 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:34,288 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:34,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:34,293 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:34,294 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:34,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:34,294 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:34,294 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:34,394 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:34,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:20:34,395 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:34,395 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 02:20:34,395 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:34,395 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:34,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1386 [2022-12-13 02:20:34,395 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:20:34,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1153122604, now seen corresponding path program 1 times [2022-12-13 02:20:34,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:34,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202075368] [2022-12-13 02:20:34,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:34,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:34,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:20:34,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:34,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202075368] [2022-12-13 02:20:34,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202075368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:34,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:34,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:34,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601136771] [2022-12-13 02:20:34,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:34,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:34,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:34,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:34,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:34,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:34,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:34,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:34,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:34,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:34,564 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:34,564 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:34,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:34,565 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:34,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:34,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:34,565 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:34,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:34,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:34,568 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:34,568 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:34,568 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:34,568 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:34,568 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:34,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:34,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:34,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:34,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:34,574 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:34,574 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:20:34,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:34,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:34,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:34,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:34,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:34,661 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:34,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:34,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:34,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:34,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1387 [2022-12-13 02:20:34,661 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:20:34,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:34,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1181751755, now seen corresponding path program 1 times [2022-12-13 02:20:34,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:34,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399944312] [2022-12-13 02:20:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:34,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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:20:34,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:34,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399944312] [2022-12-13 02:20:34,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399944312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:34,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:34,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:34,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177874323] [2022-12-13 02:20:34,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:34,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:34,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:34,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:34,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:34,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:34,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:34,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:34,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:34,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:34,787 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:34,787 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:20:34,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:34,788 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:34,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:34,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:34,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:34,789 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:34,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:34,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:34,791 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:34,791 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:34,791 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:34,791 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:34,792 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:34,792 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:34,792 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:34,792 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:34,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:34,797 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:34,797 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:20:34,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:34,798 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:34,798 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:34,882 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:34,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:34,883 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:34,883 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 02:20:34,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:34,883 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:34,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1388 [2022-12-13 02:20:34,883 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:20:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:34,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1210380906, now seen corresponding path program 1 times [2022-12-13 02:20:34,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:34,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727896662] [2022-12-13 02:20:34,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:34,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:20:34,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:34,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727896662] [2022-12-13 02:20:34,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727896662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:34,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:34,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570331861] [2022-12-13 02:20:34,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:34,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:34,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:34,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:34,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:34,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:34,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:34,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:34,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:34,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:35,026 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:35,026 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:35,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:35,027 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:35,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:35,028 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:35,028 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:35,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:35,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:35,030 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,030 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:35,030 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:35,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:35,030 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,031 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:35,031 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:35,031 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:35,036 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:35,036 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:35,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:35,037 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:35,037 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:35,123 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:35,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:35,123 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:35,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:35,124 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:35,124 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:35,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1389 [2022-12-13 02:20:35,124 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:20:35,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:35,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1239010057, now seen corresponding path program 1 times [2022-12-13 02:20:35,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:35,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675317249] [2022-12-13 02:20:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:35,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:20:35,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:35,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675317249] [2022-12-13 02:20:35,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675317249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:35,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:35,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:35,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795283439] [2022-12-13 02:20:35,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:35,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:35,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:35,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:35,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:35,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:35,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:35,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:35,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:35,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:35,246 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:35,247 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:20:35,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:35,248 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:35,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:35,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:35,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:35,248 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:35,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:35,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:35,251 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,251 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:35,251 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:35,251 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:35,251 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,251 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:35,251 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:35,251 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:35,257 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:35,257 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:20:35,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:35,257 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:35,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:35,345 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:35,345 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:35,346 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:35,346 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 02:20:35,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:35,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:35,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1390 [2022-12-13 02:20:35,346 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:20:35,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:35,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1267639208, now seen corresponding path program 1 times [2022-12-13 02:20:35,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:35,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478897355] [2022-12-13 02:20:35,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:35,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:35,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:20:35,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:35,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478897355] [2022-12-13 02:20:35,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478897355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:35,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:35,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:35,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828923775] [2022-12-13 02:20:35,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:35,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:35,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:35,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:35,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:35,422 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:35,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:35,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:35,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:35,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:35,499 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:35,499 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:35,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:35,500 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:35,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:35,501 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:35,501 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:35,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:35,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:35,503 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,503 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:35,504 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:35,504 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:35,504 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,504 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:35,504 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:35,504 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:35,510 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:35,510 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:35,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:35,510 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:35,510 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:35,597 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:35,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:35,597 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:35,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:35,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:35,598 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:35,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1391 [2022-12-13 02:20:35,598 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:20:35,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:35,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1296268359, now seen corresponding path program 1 times [2022-12-13 02:20:35,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:35,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167931768] [2022-12-13 02:20:35,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:35,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:35,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:20:35,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:35,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167931768] [2022-12-13 02:20:35,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167931768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:35,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:35,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951083850] [2022-12-13 02:20:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:35,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:35,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:35,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:35,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:35,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:35,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:35,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:35,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:35,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:35,738 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:35,738 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:35,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:35,739 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:35,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:35,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:35,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:35,740 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:35,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:35,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:35,742 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:35,742 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:35,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:35,743 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:35,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:35,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:35,748 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:35,748 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:35,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:35,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:35,749 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:35,835 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:35,835 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:35,835 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:35,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:35,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:35,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:35,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1392 [2022-12-13 02:20:35,835 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:20:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:35,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1324897510, now seen corresponding path program 1 times [2022-12-13 02:20:35,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:35,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102678192] [2022-12-13 02:20:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:35,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:35,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:20:35,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:35,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102678192] [2022-12-13 02:20:35,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102678192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:35,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:35,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:35,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100488228] [2022-12-13 02:20:35,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:35,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:35,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:35,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:35,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:35,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:35,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:35,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:35,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:35,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:35,965 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:35,965 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:35,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:35,966 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:35,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:35,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:35,967 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:35,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:35,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:35,969 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,970 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:35,970 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:35,970 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:35,970 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,970 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:35,970 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:35,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:35,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:35,976 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:35,976 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:35,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:35,976 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:35,976 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:36,064 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:36,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:36,064 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:36,064 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 02:20:36,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:36,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:36,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1393 [2022-12-13 02:20:36,065 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:20:36,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1353526661, now seen corresponding path program 1 times [2022-12-13 02:20:36,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:36,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808312888] [2022-12-13 02:20:36,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:36,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:36,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:36,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808312888] [2022-12-13 02:20:36,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808312888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:36,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:36,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:36,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166749983] [2022-12-13 02:20:36,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:36,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:36,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:36,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:36,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:36,115 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:36,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:36,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:36,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:36,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:36,181 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:36,181 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:36,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:36,182 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:36,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:36,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:36,183 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:36,183 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:36,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:36,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:36,185 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:36,186 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:36,186 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:36,186 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:36,186 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:36,186 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:36,186 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:36,186 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:36,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:36,192 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:36,192 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:36,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:36,192 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:36,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:36,303 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:36,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:20:36,303 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:36,303 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 02:20:36,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:36,303 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:36,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1394 [2022-12-13 02:20:36,304 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:20:36,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:36,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1382155812, now seen corresponding path program 1 times [2022-12-13 02:20:36,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:36,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487451407] [2022-12-13 02:20:36,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:36,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:36,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:20:36,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:36,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487451407] [2022-12-13 02:20:36,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487451407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:36,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:36,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206570803] [2022-12-13 02:20:36,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:36,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:36,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:36,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:36,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:36,363 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:36,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:36,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:36,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:36,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:36,427 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:36,427 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:36,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:36,428 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:36,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:36,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:36,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:36,429 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:36,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:36,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:36,431 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:36,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:36,432 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:36,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:36,432 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:36,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:36,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:36,432 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:36,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:36,438 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:36,438 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:36,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:36,438 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:36,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:36,525 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:36,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:36,526 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:36,526 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 02:20:36,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:36,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:36,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1395 [2022-12-13 02:20:36,526 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:20:36,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:36,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1410784963, now seen corresponding path program 1 times [2022-12-13 02:20:36,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:36,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505354647] [2022-12-13 02:20:36,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:36,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:36,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:20:36,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:36,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505354647] [2022-12-13 02:20:36,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505354647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:36,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:36,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:36,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688769699] [2022-12-13 02:20:36,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:36,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:36,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:36,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:36,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:36,583 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:36,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:36,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:36,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:36,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:36,658 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:36,658 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:36,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:36,659 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:36,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:36,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:36,660 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:36,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:36,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:36,662 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:36,662 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:36,662 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:36,662 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:36,662 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:36,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:36,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:36,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:36,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:36,668 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:36,669 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:36,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:36,669 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:36,669 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:36,756 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:36,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:36,756 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:36,756 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 02:20:36,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:36,756 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:36,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1396 [2022-12-13 02:20:36,756 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:20:36,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:36,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1439414114, now seen corresponding path program 1 times [2022-12-13 02:20:36,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:36,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095341784] [2022-12-13 02:20:36,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:36,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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:20:36,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:36,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095341784] [2022-12-13 02:20:36,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095341784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:36,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:36,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:36,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638888616] [2022-12-13 02:20:36,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:36,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:36,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:36,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:36,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:36,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:36,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:36,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:36,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:36,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:36,881 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:36,882 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:36,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:36,883 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:36,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:36,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:36,883 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:36,883 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:36,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:36,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:36,886 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:36,886 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:36,886 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:36,886 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:36,886 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:36,886 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:36,886 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:36,886 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:36,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:36,892 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:36,892 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:36,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:36,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:36,893 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:36,979 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:36,980 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:36,980 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:36,980 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 02:20:36,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:36,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:36,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1397 [2022-12-13 02:20:36,980 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:20:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:36,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1468043265, now seen corresponding path program 1 times [2022-12-13 02:20:36,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:36,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610969586] [2022-12-13 02:20:36,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:36,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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:20:37,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:37,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610969586] [2022-12-13 02:20:37,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610969586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:37,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:37,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209870424] [2022-12-13 02:20:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:37,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:37,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:37,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:37,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:37,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:37,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:37,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:37,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:37,111 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:37,111 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:37,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:37,112 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:37,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:37,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:37,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:37,113 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:37,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:37,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:37,116 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:37,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:37,117 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:37,117 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:37,117 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:37,117 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:37,117 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:37,117 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:37,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:37,123 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:37,123 INFO L131 PetriNetUnfolder]: For 435/444 co-relation queries the response was YES. [2022-12-13 02:20:37,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/444 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:37,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:37,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:37,210 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:37,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:37,210 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:37,210 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 02:20:37,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:37,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:37,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1398 [2022-12-13 02:20:37,211 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:20:37,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:37,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1496672416, now seen corresponding path program 1 times [2022-12-13 02:20:37,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:37,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14059864] [2022-12-13 02:20:37,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:37,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:37,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:20:37,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:37,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14059864] [2022-12-13 02:20:37,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14059864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:37,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:37,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:37,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735911249] [2022-12-13 02:20:37,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:37,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:37,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:37,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:37,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:37,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:37,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:37,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:37,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:37,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:37,328 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:37,329 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:37,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:37,330 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:37,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:37,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:37,330 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:37,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:37,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:37,333 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:37,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:37,333 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:37,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:37,333 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:37,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:37,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:37,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:37,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:37,339 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:37,339 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:37,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:37,340 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:37,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:37,428 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:37,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:20:37,429 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:37,429 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 02:20:37,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:37,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:37,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1399 [2022-12-13 02:20:37,429 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:20:37,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:37,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1525301567, now seen corresponding path program 1 times [2022-12-13 02:20:37,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:37,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468772450] [2022-12-13 02:20:37,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:37,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:37,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:20:37,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:37,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468772450] [2022-12-13 02:20:37,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468772450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:37,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:37,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:37,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341757778] [2022-12-13 02:20:37,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:37,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:37,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:37,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:37,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:37,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:37,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:37,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:37,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:37,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:37,546 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:37,546 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:37,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:37,547 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:37,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:37,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:37,548 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:37,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:37,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:37,550 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:37,550 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:37,551 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:37,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:37,558 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:37,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:37,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:37,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:37,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:37,564 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:37,564 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:20:37,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:37,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:37,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:37,653 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:37,654 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:20:37,654 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:37,654 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 02:20:37,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:37,654 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:37,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1400 [2022-12-13 02:20:37,654 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:20:37,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1553930718, now seen corresponding path program 1 times [2022-12-13 02:20:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:37,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232166993] [2022-12-13 02:20:37,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:37,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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:20:37,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:37,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232166993] [2022-12-13 02:20:37,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232166993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:37,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:37,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:37,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278334365] [2022-12-13 02:20:37,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:37,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:37,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:37,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:37,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:37,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:37,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:37,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:37,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:37,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:37,779 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:37,780 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:37,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:37,781 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:37,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:37,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:37,781 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:37,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:37,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:37,784 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:37,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:37,784 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:37,784 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:37,784 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:37,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:37,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:37,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:37,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:37,790 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:37,790 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:37,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:37,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:37,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:37,878 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:37,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:37,879 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:37,879 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 02:20:37,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:37,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:37,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1401 [2022-12-13 02:20:37,879 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:20:37,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:37,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1582559869, now seen corresponding path program 1 times [2022-12-13 02:20:37,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:37,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490991341] [2022-12-13 02:20:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:37,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:20:37,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:37,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490991341] [2022-12-13 02:20:37,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490991341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:37,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:37,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:37,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008490753] [2022-12-13 02:20:37,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:37,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:37,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:37,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:37,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:37,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:37,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:37,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:37,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:37,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:37,996 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:37,996 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:37,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:37,997 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:37,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:37,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:37,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:37,998 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:37,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:38,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:38,000 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:38,001 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:38,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:38,001 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,001 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:38,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:38,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:38,007 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:38,007 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:38,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:38,007 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:38,007 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:38,096 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:38,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:38,096 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:38,096 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 02:20:38,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:38,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:38,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1402 [2022-12-13 02:20:38,096 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:20:38,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:38,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1611189020, now seen corresponding path program 1 times [2022-12-13 02:20:38,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:38,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21631807] [2022-12-13 02:20:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:38,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:38,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:38,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21631807] [2022-12-13 02:20:38,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21631807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:38,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:38,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:38,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266217203] [2022-12-13 02:20:38,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:38,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:38,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:38,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:38,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:38,145 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:38,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:38,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:38,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:38,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:38,221 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:38,222 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:38,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:38,223 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:38,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:38,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:38,223 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:38,223 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:38,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:38,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:38,226 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,226 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:38,226 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:38,226 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:38,226 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,226 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:38,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:38,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:38,232 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:38,232 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:38,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:38,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:38,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:38,320 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:38,321 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:38,321 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:38,321 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 02:20:38,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:38,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:38,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1403 [2022-12-13 02:20:38,321 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:20:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1639818171, now seen corresponding path program 1 times [2022-12-13 02:20:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:38,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289719975] [2022-12-13 02:20:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:38,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:38,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:20:38,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:38,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289719975] [2022-12-13 02:20:38,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289719975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:38,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:38,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:38,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264517051] [2022-12-13 02:20:38,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:38,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:38,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:38,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:38,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:38,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:38,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:38,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:38,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:38,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:38,435 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:38,436 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:38,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:38,437 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:38,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:38,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:38,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:38,437 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:38,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:38,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:38,440 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,440 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:38,440 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:38,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:38,440 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,440 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:38,440 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:38,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:38,446 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:38,446 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:38,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:38,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:38,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:38,533 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:38,534 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:38,534 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:38,534 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 02:20:38,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:38,534 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:38,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1404 [2022-12-13 02:20:38,534 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:20:38,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:38,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1668447322, now seen corresponding path program 1 times [2022-12-13 02:20:38,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:38,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231934890] [2022-12-13 02:20:38,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:38,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:38,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:20:38,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:38,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231934890] [2022-12-13 02:20:38,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231934890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:38,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:38,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:38,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780872977] [2022-12-13 02:20:38,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:38,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:38,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:38,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:38,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:38,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:38,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:38,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:38,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:38,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:38,678 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:38,678 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:38,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:38,679 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:38,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:38,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:38,679 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:38,680 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:38,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:38,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:38,682 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,682 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:38,682 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:38,683 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:38,683 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,683 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:38,683 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:38,683 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:38,688 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:38,688 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:20:38,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:38,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:38,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:38,777 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:38,777 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:38,777 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:38,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:38,777 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:38,777 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:38,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1405 [2022-12-13 02:20:38,777 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:20:38,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:38,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1697076473, now seen corresponding path program 1 times [2022-12-13 02:20:38,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:38,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733730911] [2022-12-13 02:20:38,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:38,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:38,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 02:20:38,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:38,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733730911] [2022-12-13 02:20:38,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733730911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:38,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:38,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:38,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423241375] [2022-12-13 02:20:38,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:38,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:38,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:38,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:38,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:38,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:38,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:38,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:38,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:38,895 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:38,895 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:38,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:38,896 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:38,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:38,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:38,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:38,897 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:38,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:38,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:38,899 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,899 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:38,900 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:38,900 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:38,900 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:38,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:38,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:38,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:38,905 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:38,905 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:20:38,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:38,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:38,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:38,996 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:38,996 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:20:38,996 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:38,996 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 02:20:38,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:38,996 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:38,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1406 [2022-12-13 02:20:38,996 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:20:38,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:38,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1725705624, now seen corresponding path program 1 times [2022-12-13 02:20:38,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:38,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727946900] [2022-12-13 02:20:38,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:38,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:39,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:20:39,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:39,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727946900] [2022-12-13 02:20:39,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727946900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:39,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:39,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:39,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228384325] [2022-12-13 02:20:39,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:39,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:39,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:39,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:39,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:39,045 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:39,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:39,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:39,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:39,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:39,123 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:39,123 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:39,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:39,124 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:39,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:39,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:39,125 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:39,125 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:39,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:39,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:39,128 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:39,128 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:39,128 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:39,128 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:39,128 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:39,128 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:39,128 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:39,128 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:39,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:39,134 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:39,134 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:39,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:39,135 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:39,135 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:39,221 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:39,221 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:39,222 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:39,222 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 02:20:39,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:39,222 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:39,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1407 [2022-12-13 02:20:39,222 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:20:39,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:39,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1754334775, now seen corresponding path program 1 times [2022-12-13 02:20:39,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:39,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734559158] [2022-12-13 02:20:39,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:39,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:39,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:20:39,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:39,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734559158] [2022-12-13 02:20:39,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734559158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:39,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:39,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:39,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516598914] [2022-12-13 02:20:39,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:39,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:39,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:39,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:39,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:39,272 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:39,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:39,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:39,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:39,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:39,348 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:39,348 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:39,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:39,349 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:39,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:39,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:39,350 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:39,350 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:39,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:39,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:39,353 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:39,353 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:39,353 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:39,353 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:39,353 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:39,353 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:39,353 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:39,353 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:39,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:39,359 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:39,359 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:39,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:39,359 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:39,359 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:39,447 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:39,448 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:39,448 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:39,448 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 02:20:39,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:39,448 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:39,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1408 [2022-12-13 02:20:39,448 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:20:39,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:39,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1782963926, now seen corresponding path program 1 times [2022-12-13 02:20:39,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:39,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452622302] [2022-12-13 02:20:39,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:39,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:39,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:20:39,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:39,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452622302] [2022-12-13 02:20:39,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452622302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:39,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:39,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:39,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233026521] [2022-12-13 02:20:39,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:39,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:39,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:39,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:39,498 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:39,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:39,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:39,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:39,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:39,564 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:39,564 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:39,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:39,565 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:39,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:39,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:39,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:39,566 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:39,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:39,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:39,569 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:39,569 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:39,569 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:39,569 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:39,569 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:39,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:39,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:39,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:39,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:39,575 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:39,575 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:39,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:39,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:39,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:39,663 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:39,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:39,664 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:39,664 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 02:20:39,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:39,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:39,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1409 [2022-12-13 02:20:39,664 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:20:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:39,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1811593077, now seen corresponding path program 1 times [2022-12-13 02:20:39,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:39,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934381355] [2022-12-13 02:20:39,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:39,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:39,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:20:39,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:39,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934381355] [2022-12-13 02:20:39,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934381355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:39,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:39,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:39,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699932990] [2022-12-13 02:20:39,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:39,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:39,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:39,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:39,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:39,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:39,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:39,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:39,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:39,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:39,800 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:39,800 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:39,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:39,802 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:39,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:39,802 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:39,802 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:39,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:39,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:39,805 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:39,805 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:39,805 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:39,805 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:39,805 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:39,805 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:39,805 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:39,805 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:39,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:39,811 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:39,811 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:39,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:39,811 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:39,811 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:39,898 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:39,899 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:39,899 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:39,899 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 02:20:39,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:39,899 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:39,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1410 [2022-12-13 02:20:39,899 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:20:39,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:39,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1840222228, now seen corresponding path program 1 times [2022-12-13 02:20:39,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:39,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882414242] [2022-12-13 02:20:39,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:39,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:39,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:20:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:39,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882414242] [2022-12-13 02:20:39,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882414242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:39,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:39,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:39,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075440028] [2022-12-13 02:20:39,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:39,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:39,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:39,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:39,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:39,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:39,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:39,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:39,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:39,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:40,013 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:40,013 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:40,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:40,014 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:40,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:40,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:40,015 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:40,015 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:40,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:40,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:40,017 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,017 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:40,017 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:40,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:40,017 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,018 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:40,018 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:40,018 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:40,023 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:40,023 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:40,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:40,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:40,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:40,111 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:40,111 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:40,112 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:40,112 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 02:20:40,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:40,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:40,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1411 [2022-12-13 02:20:40,112 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:20:40,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:40,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1868851379, now seen corresponding path program 1 times [2022-12-13 02:20:40,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:40,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289095012] [2022-12-13 02:20:40,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:40,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:40,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:20:40,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:40,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289095012] [2022-12-13 02:20:40,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289095012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:40,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:40,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537084911] [2022-12-13 02:20:40,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:40,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:40,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:40,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:40,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:40,162 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:40,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:40,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:40,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:40,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:40,228 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:40,228 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:40,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:40,229 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:40,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:40,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:40,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:40,229 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:40,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:40,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:40,232 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,232 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:40,232 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:40,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:40,232 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:40,233 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:40,233 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:40,238 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:40,238 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:40,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:40,239 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:40,239 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:40,324 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:40,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:40,325 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:40,325 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 02:20:40,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:40,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:40,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1412 [2022-12-13 02:20:40,325 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:20:40,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:40,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1897480530, now seen corresponding path program 1 times [2022-12-13 02:20:40,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:40,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350611824] [2022-12-13 02:20:40,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:40,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:40,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:20:40,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:40,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350611824] [2022-12-13 02:20:40,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350611824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:40,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:40,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:40,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575653374] [2022-12-13 02:20:40,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:40,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:40,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:40,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:40,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:40,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:40,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:40,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:40,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:40,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:40,441 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:40,441 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:40,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:40,442 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:40,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:40,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:40,443 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:40,443 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:40,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:40,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:40,445 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,445 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:40,445 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:40,445 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:40,445 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,446 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:40,446 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:40,446 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:40,451 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:40,451 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:20:40,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:40,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:40,452 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:40,538 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:40,538 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:40,538 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:40,538 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 02:20:40,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:40,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:40,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1413 [2022-12-13 02:20:40,538 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:20:40,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:40,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1926109681, now seen corresponding path program 1 times [2022-12-13 02:20:40,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:40,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114759736] [2022-12-13 02:20:40,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:40,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:40,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:20:40,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:40,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114759736] [2022-12-13 02:20:40,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114759736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:40,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:40,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:40,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971195348] [2022-12-13 02:20:40,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:40,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:40,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:40,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:40,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:40,590 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:40,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:40,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:40,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:40,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:40,665 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:40,665 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:40,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:40,666 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:40,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:40,667 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:40,667 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:40,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:40,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:40,669 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,669 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:40,669 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:40,669 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:40,670 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,670 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:40,670 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:40,670 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:40,684 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:40,684 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:20:40,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:40,685 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:40,685 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:40,771 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:40,772 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:20:40,772 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:40,772 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 02:20:40,772 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:40,772 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:40,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1414 [2022-12-13 02:20:40,772 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:20:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1954738832, now seen corresponding path program 1 times [2022-12-13 02:20:40,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:40,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106629115] [2022-12-13 02:20:40,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:40,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:40,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 02:20:40,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:40,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106629115] [2022-12-13 02:20:40,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106629115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:40,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:40,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:40,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796455148] [2022-12-13 02:20:40,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:40,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:40,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:40,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:40,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:40,823 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:40,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:40,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:40,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:40,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:40,899 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:40,899 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:40,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:40,900 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:40,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:40,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:40,901 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:40,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:40,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:40,903 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,904 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:40,904 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:40,904 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:40,904 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,904 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:40,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:40,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:40,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:40,910 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:40,910 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:40,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:40,910 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:40,910 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:41,000 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:41,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:20:41,001 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:41,001 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 02:20:41,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:41,001 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:41,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1415 [2022-12-13 02:20:41,001 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:20:41,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:41,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1983367983, now seen corresponding path program 1 times [2022-12-13 02:20:41,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:41,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685488109] [2022-12-13 02:20:41,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:41,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:41,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:20:41,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:41,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685488109] [2022-12-13 02:20:41,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685488109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:41,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:41,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:41,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427280022] [2022-12-13 02:20:41,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:41,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:41,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:41,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:41,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:41,053 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:41,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:41,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:41,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:41,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:41,120 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:41,120 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:41,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:41,121 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:41,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:41,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:41,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:41,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:41,122 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:41,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:41,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:41,125 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:41,125 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:41,125 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:41,125 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:41,125 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:41,125 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:41,125 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:41,125 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:41,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:41,131 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:41,131 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:20:41,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:41,131 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:41,131 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:41,220 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:41,220 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:41,220 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:41,220 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 02:20:41,220 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:41,220 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:41,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1416 [2022-12-13 02:20:41,221 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:20:41,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2011997134, now seen corresponding path program 1 times [2022-12-13 02:20:41,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:41,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773883847] [2022-12-13 02:20:41,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:41,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:41,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:20:41,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:41,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773883847] [2022-12-13 02:20:41,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773883847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:41,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:41,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:41,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932890007] [2022-12-13 02:20:41,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:41,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:41,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:41,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:41,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:41,270 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:41,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:41,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:41,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:41,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:41,338 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:41,338 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:20:41,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:41,339 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:41,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:41,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:41,339 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:41,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:41,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:41,342 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:41,342 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:41,342 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:41,342 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:41,342 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:41,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:41,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:41,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:41,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:41,348 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:41,348 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:20:41,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:41,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:41,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:41,443 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:41,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:20:41,444 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:41,444 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 02:20:41,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:41,444 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:41,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1417 [2022-12-13 02:20:41,444 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:20:41,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:41,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2040626285, now seen corresponding path program 1 times [2022-12-13 02:20:41,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:41,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872058965] [2022-12-13 02:20:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:41,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:41,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:20:41,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:41,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872058965] [2022-12-13 02:20:41,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872058965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:41,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:41,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:41,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724506194] [2022-12-13 02:20:41,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:41,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:41,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:41,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:41,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:41,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:41,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:41,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:41,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:41,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:41,575 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:41,575 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:41,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:41,576 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:41,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:41,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:41,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:41,577 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:41,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:41,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:41,579 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:41,579 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:41,579 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:41,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:41,580 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:41,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:41,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:41,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:41,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:41,585 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:41,585 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:41,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:41,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:41,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:41,673 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:41,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:41,673 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:41,673 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 02:20:41,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:41,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:41,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1418 [2022-12-13 02:20:41,674 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:20:41,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2069255436, now seen corresponding path program 1 times [2022-12-13 02:20:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:41,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609531074] [2022-12-13 02:20:41,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:41,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:41,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:20:41,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:41,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609531074] [2022-12-13 02:20:41,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609531074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:41,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:41,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:41,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591782613] [2022-12-13 02:20:41,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:41,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:41,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:41,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:41,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:41,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:41,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:41,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:41,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:41,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:41,809 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:41,810 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:41,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:41,811 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:41,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:41,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:41,811 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:41,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:41,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:41,814 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:41,814 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:41,814 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:41,814 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:41,814 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:41,814 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:41,814 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:41,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:41,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:41,820 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:41,820 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:41,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:41,820 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:41,821 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:41,911 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:41,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:20:41,912 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:41,912 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 02:20:41,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:41,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:41,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1419 [2022-12-13 02:20:41,912 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:20:41,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:41,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2097884587, now seen corresponding path program 1 times [2022-12-13 02:20:41,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:41,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350239927] [2022-12-13 02:20:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:41,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:20:41,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:41,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350239927] [2022-12-13 02:20:41,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350239927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:41,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:41,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168211033] [2022-12-13 02:20:41,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:41,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:41,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:41,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:41,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:41,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:41,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:41,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:42,067 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:42,067 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:42,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:42,069 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:42,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:42,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:42,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:42,069 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:42,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:42,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:42,073 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,073 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:42,073 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:42,073 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:42,074 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,074 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:42,074 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:42,074 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:42,082 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:42,082 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:42,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:42,083 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:42,083 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:42,186 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:42,187 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 02:20:42,187 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:42,187 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 02:20:42,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:42,187 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:42,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1420 [2022-12-13 02:20:42,187 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:20:42,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:42,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2126513738, now seen corresponding path program 1 times [2022-12-13 02:20:42,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:42,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797811148] [2022-12-13 02:20:42,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:42,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:42,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:20:42,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:42,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797811148] [2022-12-13 02:20:42,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797811148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:42,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:42,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:42,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082731872] [2022-12-13 02:20:42,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:42,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:42,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:42,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:42,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:42,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:42,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:42,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:42,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:42,305 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:42,305 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:42,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:42,306 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:42,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:42,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:42,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:42,307 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:42,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:42,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:42,309 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,309 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:42,309 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:42,309 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:42,309 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,309 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:42,309 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:42,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:42,315 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:42,315 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:42,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:42,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:42,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:42,402 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:42,402 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:42,402 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:42,402 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 02:20:42,402 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:42,402 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:42,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1421 [2022-12-13 02:20:42,402 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:20:42,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:42,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2139824407, now seen corresponding path program 1 times [2022-12-13 02:20:42,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:42,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896424355] [2022-12-13 02:20:42,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:42,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:42,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:20:42,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:42,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896424355] [2022-12-13 02:20:42,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896424355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:42,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:42,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:42,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53209648] [2022-12-13 02:20:42,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:42,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:42,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:42,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:42,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:42,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:42,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:42,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:42,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:42,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:42,524 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:42,524 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:42,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:42,525 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:42,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:42,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:42,526 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:42,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:42,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:42,528 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:42,528 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:42,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:42,528 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:42,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:42,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:42,534 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:42,534 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:42,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:42,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:42,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:42,621 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:42,621 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:42,621 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:42,621 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 02:20:42,621 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:42,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:42,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1422 [2022-12-13 02:20:42,622 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:20:42,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:42,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2111195256, now seen corresponding path program 1 times [2022-12-13 02:20:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:42,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777928798] [2022-12-13 02:20:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:42,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:42,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:20:42,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:42,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777928798] [2022-12-13 02:20:42,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777928798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:42,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:42,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:42,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917372677] [2022-12-13 02:20:42,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:42,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:42,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:42,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:42,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:42,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:42,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:42,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:42,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:42,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:42,742 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:42,742 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:42,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:42,743 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:42,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:42,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:42,744 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:42,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:42,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:42,746 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,747 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:42,747 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:42,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:42,747 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,747 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:42,747 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:42,747 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:42,753 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:42,753 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:42,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:42,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:42,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:42,839 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:42,839 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:42,839 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:42,839 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 02:20:42,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:42,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:42,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1423 [2022-12-13 02:20:42,840 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:20:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:42,840 INFO L85 PathProgramCache]: Analyzing trace with hash -2082566105, now seen corresponding path program 1 times [2022-12-13 02:20:42,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:42,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54643129] [2022-12-13 02:20:42,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:42,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:42,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:20:42,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:42,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54643129] [2022-12-13 02:20:42,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54643129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:42,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:42,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:42,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666634561] [2022-12-13 02:20:42,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:42,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:42,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:42,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:42,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:42,900 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:42,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:42,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:42,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:42,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:42,965 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:42,965 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:42,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:42,966 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:42,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:42,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:42,967 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:42,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:42,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:42,970 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,970 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:42,970 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:42,970 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:42,970 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,970 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:42,970 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:42,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:42,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:42,976 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:42,976 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:42,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:42,976 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:42,976 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:43,063 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:43,063 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:43,064 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:43,064 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 02:20:43,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:43,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:43,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1424 [2022-12-13 02:20:43,064 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:20:43,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:43,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2053936954, now seen corresponding path program 1 times [2022-12-13 02:20:43,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:43,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452775953] [2022-12-13 02:20:43,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:43,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:43,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:20:43,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:43,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452775953] [2022-12-13 02:20:43,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452775953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:43,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:43,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:43,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919613438] [2022-12-13 02:20:43,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:43,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:43,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:43,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:43,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:43,113 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:43,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:43,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:43,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:43,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:43,191 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:43,191 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:43,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:43,192 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:43,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:43,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:43,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:43,193 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:43,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:43,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:43,195 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:43,195 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:43,195 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:43,195 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:43,195 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:43,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:43,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:43,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:43,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:43,201 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:43,201 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:20:43,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:43,202 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:43,202 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:43,290 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:43,290 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:43,290 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:43,290 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 02:20:43,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:43,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:43,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1425 [2022-12-13 02:20:43,291 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:20:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2025307803, now seen corresponding path program 1 times [2022-12-13 02:20:43,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:43,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349711292] [2022-12-13 02:20:43,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:43,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:20:43,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:43,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349711292] [2022-12-13 02:20:43,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349711292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:43,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:43,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:43,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228126769] [2022-12-13 02:20:43,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:43,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:43,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:43,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:43,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:43,343 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:43,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:43,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:43,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:43,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:43,419 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:43,419 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:43,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:43,421 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:43,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:43,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:43,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:43,421 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:43,421 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:43,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:43,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:43,424 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:43,424 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:43,424 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:43,424 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:43,424 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:43,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:43,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:43,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:43,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:43,430 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:43,430 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:43,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:43,430 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:43,431 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:43,517 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:43,517 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:43,517 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:43,517 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 02:20:43,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:43,517 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:43,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1426 [2022-12-13 02:20:43,517 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:20:43,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1996678652, now seen corresponding path program 1 times [2022-12-13 02:20:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:43,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262884466] [2022-12-13 02:20:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:43,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:43,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:20:43,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:43,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262884466] [2022-12-13 02:20:43,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262884466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:43,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:43,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:43,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129822880] [2022-12-13 02:20:43,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:43,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:43,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:43,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:43,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:43,568 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:43,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:43,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:43,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:43,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:43,644 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:43,645 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:43,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:43,646 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:43,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:43,646 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:43,646 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:43,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:43,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:43,649 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:43,649 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:43,649 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:43,649 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:43,649 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:43,649 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:43,649 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:43,649 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:43,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:43,655 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:43,655 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:20:43,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:43,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:43,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:43,742 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:43,743 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:43,743 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:43,743 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 02:20:43,743 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:43,743 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:43,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1427 [2022-12-13 02:20:43,743 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:20:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1968049501, now seen corresponding path program 1 times [2022-12-13 02:20:43,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:43,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355256648] [2022-12-13 02:20:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:43,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:43,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:43,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355256648] [2022-12-13 02:20:43,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355256648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:43,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:43,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:43,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244218949] [2022-12-13 02:20:43,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:43,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:43,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:43,809 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:43,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:43,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:43,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:43,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:43,879 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:43,879 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:43,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:43,880 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:43,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:43,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:43,881 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:43,881 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:43,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:43,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:43,884 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:43,884 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:43,884 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:43,884 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:43,884 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:43,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:43,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:43,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:43,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:43,890 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:43,890 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:43,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:43,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:43,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:43,985 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:43,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:20:43,986 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:43,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:43,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:43,986 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:43,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1428 [2022-12-13 02:20:43,986 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:20:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:43,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1939420350, now seen corresponding path program 1 times [2022-12-13 02:20:43,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:43,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124100814] [2022-12-13 02:20:43,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:43,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:44,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:20:44,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:44,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124100814] [2022-12-13 02:20:44,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124100814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:44,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:44,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:44,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701753960] [2022-12-13 02:20:44,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:44,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:44,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:44,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:44,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:44,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:44,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:44,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:44,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:44,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:44,126 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:44,127 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:44,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:44,128 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:44,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:44,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:44,128 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:44,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:44,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:44,131 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:44,131 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:44,131 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:44,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:44,131 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:44,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:44,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:44,132 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:44,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:44,137 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:44,137 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:44,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:44,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:44,138 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:44,225 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:44,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:44,225 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:44,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:44,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:44,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:44,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1429 [2022-12-13 02:20:44,225 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:20:44,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:44,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1910791199, now seen corresponding path program 1 times [2022-12-13 02:20:44,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:44,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367025299] [2022-12-13 02:20:44,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:44,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:44,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:20:44,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:44,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367025299] [2022-12-13 02:20:44,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367025299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:44,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:44,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:44,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885877857] [2022-12-13 02:20:44,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:44,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:44,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:44,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:44,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:44,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:44,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:44,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:44,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:44,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:44,369 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:44,369 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:44,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:44,371 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:44,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:44,371 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:44,371 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:44,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:44,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:44,374 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:44,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:44,374 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:44,374 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:44,374 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:44,374 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:44,374 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:44,374 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:44,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:44,380 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:44,380 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:44,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:44,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:44,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:44,468 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:44,468 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:44,468 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:44,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:44,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:44,468 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:44,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1430 [2022-12-13 02:20:44,468 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:20:44,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:44,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1882162048, now seen corresponding path program 1 times [2022-12-13 02:20:44,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:44,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317240543] [2022-12-13 02:20:44,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:44,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:44,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:20:44,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:44,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317240543] [2022-12-13 02:20:44,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317240543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:44,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:44,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386343348] [2022-12-13 02:20:44,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:44,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:44,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:44,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:44,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:44,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:44,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:44,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:44,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:44,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:44,619 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:44,619 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:44,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:44,620 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:44,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:44,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:44,620 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:44,620 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:44,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:44,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:44,623 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:44,623 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:44,623 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:44,623 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:44,623 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:44,624 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:44,624 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:44,624 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:44,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:44,629 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:44,629 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:44,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:44,630 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:44,630 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:44,718 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:44,718 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:44,718 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:44,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:44,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:44,718 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:44,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1431 [2022-12-13 02:20:44,718 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:20:44,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:44,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1853532897, now seen corresponding path program 1 times [2022-12-13 02:20:44,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:44,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537208544] [2022-12-13 02:20:44,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:44,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:44,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:20:44,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:44,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537208544] [2022-12-13 02:20:44,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537208544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:44,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:44,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:44,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71447993] [2022-12-13 02:20:44,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:44,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:44,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:44,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:44,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:44,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:44,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:44,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:44,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:44,836 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:44,836 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:44,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:44,837 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:44,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:44,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:44,838 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:44,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:44,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:44,840 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:44,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:44,841 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:44,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:44,841 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:44,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:44,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:44,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:44,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:44,847 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:44,847 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:44,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:44,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:44,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:44,935 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:44,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:44,936 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:44,936 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 02:20:44,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:44,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:44,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1432 [2022-12-13 02:20:44,936 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:20:44,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1824903746, now seen corresponding path program 1 times [2022-12-13 02:20:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:44,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907926158] [2022-12-13 02:20:44,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:44,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:44,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:20:44,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:44,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907926158] [2022-12-13 02:20:44,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907926158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:44,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:44,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217545454] [2022-12-13 02:20:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:44,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:44,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:44,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:44,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:44,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:44,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:44,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:44,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:45,064 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:45,065 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:45,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:45,066 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:45,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:45,066 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:45,066 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:45,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:45,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:45,069 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,069 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:45,069 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:45,069 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:45,069 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,069 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:45,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:45,069 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:45,075 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:45,075 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:45,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:45,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:45,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:45,164 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:45,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:45,165 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:45,165 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 02:20:45,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:45,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:45,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1433 [2022-12-13 02:20:45,165 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:20:45,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1796274595, now seen corresponding path program 1 times [2022-12-13 02:20:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:45,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340695676] [2022-12-13 02:20:45,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:45,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:20:45,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:45,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340695676] [2022-12-13 02:20:45,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340695676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:45,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:45,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:45,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189779218] [2022-12-13 02:20:45,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:45,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:45,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:45,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:45,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:45,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:45,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:45,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:45,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:45,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:45,299 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:45,300 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:45,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:45,301 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:45,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:45,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:45,301 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:45,301 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:45,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:45,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:45,304 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,304 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:45,304 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:45,304 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:45,304 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,304 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:45,304 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:45,304 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:45,310 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:45,310 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:45,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:45,311 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:45,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:45,398 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:45,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:45,398 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:45,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:45,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:45,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:45,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1434 [2022-12-13 02:20:45,399 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:20:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:45,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1767645444, now seen corresponding path program 1 times [2022-12-13 02:20:45,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:45,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104510045] [2022-12-13 02:20:45,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:45,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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:20:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:45,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104510045] [2022-12-13 02:20:45,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104510045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:45,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:45,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:45,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157053863] [2022-12-13 02:20:45,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:45,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:45,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:45,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:45,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:45,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:45,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:45,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:45,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:45,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:45,525 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:45,525 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:45,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:45,526 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:45,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:45,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:45,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:45,526 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:45,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:45,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:45,529 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:45,529 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:45,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:45,529 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,530 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:45,530 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:45,530 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:45,535 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:45,535 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:45,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:45,536 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:45,536 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:45,623 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:45,623 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:45,623 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:45,623 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 02:20:45,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:45,624 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:45,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1435 [2022-12-13 02:20:45,624 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:20:45,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:45,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1739016293, now seen corresponding path program 1 times [2022-12-13 02:20:45,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:45,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895074118] [2022-12-13 02:20:45,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:45,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:45,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:20:45,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:45,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895074118] [2022-12-13 02:20:45,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895074118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:45,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:45,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:45,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788531267] [2022-12-13 02:20:45,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:45,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:45,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:45,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:45,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:45,674 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:45,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:45,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:45,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:45,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:45,750 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:45,750 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:45,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:45,751 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:45,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:45,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:45,752 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:45,752 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:45,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:45,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:45,754 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,754 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:45,755 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:45,755 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:45,755 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:45,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:45,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:45,761 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:45,761 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:20:45,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:45,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:45,761 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:45,847 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:45,848 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:45,848 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:45,848 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 02:20:45,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:45,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:45,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1436 [2022-12-13 02:20:45,848 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:20:45,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1710387142, now seen corresponding path program 1 times [2022-12-13 02:20:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:45,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612659056] [2022-12-13 02:20:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:45,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:45,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:20:45,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:45,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612659056] [2022-12-13 02:20:45,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612659056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:45,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:45,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218506972] [2022-12-13 02:20:45,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:45,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:45,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:45,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:45,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:45,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:45,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:45,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:45,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:45,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:45,965 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:45,965 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:20:45,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:45,967 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:45,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:45,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:45,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:45,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:45,967 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:45,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:45,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:45,970 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,970 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:45,970 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:45,970 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:45,970 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,970 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:45,970 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:45,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:45,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:45,976 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:45,976 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:20:45,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:45,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:45,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:46,073 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:46,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:20:46,073 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:46,073 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 02:20:46,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:46,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:46,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1437 [2022-12-13 02:20:46,074 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:20:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1681757991, now seen corresponding path program 1 times [2022-12-13 02:20:46,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:46,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173065075] [2022-12-13 02:20:46,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:46,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:46,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:20:46,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:46,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173065075] [2022-12-13 02:20:46,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173065075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:46,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:46,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539980073] [2022-12-13 02:20:46,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:46,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:46,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:46,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:46,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:46,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:46,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:46,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:46,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:46,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:46,192 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:46,192 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:46,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:46,193 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:46,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:46,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:46,194 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:46,194 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:46,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:46,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:46,197 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:46,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:46,197 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:46,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:46,197 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:46,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:46,197 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:46,197 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:46,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:46,203 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:46,203 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:46,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:46,203 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:46,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:46,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:46,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:46,291 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:46,291 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 02:20:46,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:46,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:46,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1438 [2022-12-13 02:20:46,292 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:20:46,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:46,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1653128840, now seen corresponding path program 1 times [2022-12-13 02:20:46,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:46,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202200443] [2022-12-13 02:20:46,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:46,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:46,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:20:46,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:46,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202200443] [2022-12-13 02:20:46,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202200443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:46,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:46,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:46,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621501024] [2022-12-13 02:20:46,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:46,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:46,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:46,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:46,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:46,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:46,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:46,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:46,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:46,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:46,405 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:46,405 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:46,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:46,406 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:46,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:46,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:46,406 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:46,407 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:46,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:46,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:46,409 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:46,409 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:46,409 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:46,410 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:46,410 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:46,410 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:46,410 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:46,410 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:46,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:46,415 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:46,415 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:46,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:46,416 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:46,416 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:46,503 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:46,503 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:46,503 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:46,503 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 02:20:46,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:46,503 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:46,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1439 [2022-12-13 02:20:46,503 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:20:46,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:46,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1624499689, now seen corresponding path program 1 times [2022-12-13 02:20:46,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:46,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952037793] [2022-12-13 02:20:46,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:46,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:46,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:20:46,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:46,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952037793] [2022-12-13 02:20:46,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952037793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:46,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:46,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:46,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386599039] [2022-12-13 02:20:46,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:46,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:46,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:46,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:46,554 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:46,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:46,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:46,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:46,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:46,619 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:46,619 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:46,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:46,620 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:46,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:46,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:46,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:46,620 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:46,620 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:46,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:46,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:46,623 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:46,623 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:46,623 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:46,623 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:46,623 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:46,623 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:46,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:46,624 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:46,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:46,629 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:46,629 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:46,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:46,630 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:46,630 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:46,716 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:46,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:46,717 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:46,717 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 02:20:46,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:46,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:46,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1440 [2022-12-13 02:20:46,717 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:20:46,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:46,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1595870538, now seen corresponding path program 1 times [2022-12-13 02:20:46,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:46,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995991324] [2022-12-13 02:20:46,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:46,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:46,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 02:20:46,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:46,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995991324] [2022-12-13 02:20:46,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995991324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:46,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:46,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:46,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802804796] [2022-12-13 02:20:46,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:46,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:46,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:46,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:46,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:46,767 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:46,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:46,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:46,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:46,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:46,832 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:46,832 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:46,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:46,833 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:46,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:46,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:46,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:46,834 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:46,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:46,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:46,836 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:46,837 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:46,837 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:46,837 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:46,837 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:46,837 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:46,837 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:46,837 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:46,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:46,843 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:46,843 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:46,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:46,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:46,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:46,929 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:46,930 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:46,930 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:46,930 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 02:20:46,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:46,930 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:46,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1441 [2022-12-13 02:20:46,930 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:20:46,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1567241387, now seen corresponding path program 1 times [2022-12-13 02:20:46,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:46,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106024777] [2022-12-13 02:20:46,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:46,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:20:46,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:46,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106024777] [2022-12-13 02:20:46,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106024777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:46,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:46,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:46,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814090785] [2022-12-13 02:20:46,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:46,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:46,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:46,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:46,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:46,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:46,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:46,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:46,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:46,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:47,078 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:47,079 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:47,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:47,080 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:47,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:47,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:47,080 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:47,080 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:47,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:47,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:47,082 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,083 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:47,083 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:47,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:47,083 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,083 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:47,083 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:47,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:47,089 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:47,089 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:47,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:47,089 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:47,089 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:47,175 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:47,175 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:47,175 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:47,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:47,175 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:47,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:47,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1442 [2022-12-13 02:20:47,176 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:20:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1538612236, now seen corresponding path program 1 times [2022-12-13 02:20:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:47,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406551904] [2022-12-13 02:20:47,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:47,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:47,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:20:47,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:47,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406551904] [2022-12-13 02:20:47,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406551904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:47,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:47,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:47,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691856762] [2022-12-13 02:20:47,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:47,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:47,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:47,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:47,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:47,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:47,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:47,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:47,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:47,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:47,325 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:47,325 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:47,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:47,326 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:47,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:47,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:47,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:47,327 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:47,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:47,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:47,329 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,329 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:47,329 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:47,330 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:47,330 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:47,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:47,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:47,335 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:47,335 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:47,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:47,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:47,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:47,421 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:47,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:47,422 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:47,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:47,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:47,422 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:47,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1443 [2022-12-13 02:20:47,422 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:20:47,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1509983085, now seen corresponding path program 1 times [2022-12-13 02:20:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:47,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275779335] [2022-12-13 02:20:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:47,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:47,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:20:47,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:47,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275779335] [2022-12-13 02:20:47,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275779335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:47,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:47,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:47,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264665822] [2022-12-13 02:20:47,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:47,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:47,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:47,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:47,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:47,470 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:47,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:47,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:47,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:47,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:47,545 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:47,546 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:47,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:47,547 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:47,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:47,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:47,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:47,547 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:47,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:47,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:47,550 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,550 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:47,550 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:47,550 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:47,550 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,550 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:47,550 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:47,550 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:47,556 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:47,556 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:47,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:47,557 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:47,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:47,642 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:47,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:47,643 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:47,643 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 02:20:47,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:47,643 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:47,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1444 [2022-12-13 02:20:47,643 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:20:47,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:47,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1481353934, now seen corresponding path program 1 times [2022-12-13 02:20:47,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:47,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256377863] [2022-12-13 02:20:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:47,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:47,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:20:47,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:47,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256377863] [2022-12-13 02:20:47,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256377863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:47,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:47,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:47,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72887584] [2022-12-13 02:20:47,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:47,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:47,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:47,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:47,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:47,692 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:47,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:47,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:47,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:47,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:47,767 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:47,767 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:47,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:47,768 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:47,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:47,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:47,769 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:47,769 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:47,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:47,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:47,771 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,771 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:47,771 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:47,771 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:47,771 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,772 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:47,772 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:47,772 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:47,777 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:47,777 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:20:47,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:47,778 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:47,778 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:47,865 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:47,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:47,865 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:47,865 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 02:20:47,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:47,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:47,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1445 [2022-12-13 02:20:47,866 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:20:47,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1452724783, now seen corresponding path program 1 times [2022-12-13 02:20:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:47,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604303681] [2022-12-13 02:20:47,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:47,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:47,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:20:47,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:47,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604303681] [2022-12-13 02:20:47,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604303681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:47,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:47,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:47,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505173591] [2022-12-13 02:20:47,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:47,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:47,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:47,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:47,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:47,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:47,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:47,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:47,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:47,981 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:47,981 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:47,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:47,982 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:47,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:47,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:47,983 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:47,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:47,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:47,985 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,986 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:47,986 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:47,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:47,986 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:47,986 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:47,986 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:47,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:47,991 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:47,992 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:47,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:47,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:47,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:48,078 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:48,079 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:48,079 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:48,079 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 02:20:48,079 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:48,079 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:48,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1446 [2022-12-13 02:20:48,079 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:20:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1424095632, now seen corresponding path program 1 times [2022-12-13 02:20:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:48,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033024826] [2022-12-13 02:20:48,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:48,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:48,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:20:48,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:48,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033024826] [2022-12-13 02:20:48,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033024826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:48,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:48,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:48,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250971457] [2022-12-13 02:20:48,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:48,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:48,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:48,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:48,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:48,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:48,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:48,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:48,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:48,204 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:48,204 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:48,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:48,205 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:48,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:48,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:48,205 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:48,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:48,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:48,208 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:48,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:48,208 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:48,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:48,208 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:48,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:48,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:48,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:48,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:48,214 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:48,214 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:48,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:48,215 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:48,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:48,301 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:48,302 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:48,302 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:48,302 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 02:20:48,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:48,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:48,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1447 [2022-12-13 02:20:48,302 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:20:48,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:48,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1395466481, now seen corresponding path program 1 times [2022-12-13 02:20:48,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:48,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069532768] [2022-12-13 02:20:48,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:48,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:48,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 02:20:48,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:48,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069532768] [2022-12-13 02:20:48,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069532768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:48,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:48,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:48,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095947126] [2022-12-13 02:20:48,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:48,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:48,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:48,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:48,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:48,368 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:48,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:48,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:48,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:48,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:48,442 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:48,442 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:20:48,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:48,443 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:48,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:48,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:48,444 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:48,444 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:48,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:48,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:48,446 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:48,446 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:48,446 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:48,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:48,446 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:48,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:48,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:48,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:48,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:48,452 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:48,452 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:20:48,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:48,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:48,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:48,539 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:48,539 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:48,539 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:48,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:48,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:48,539 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:48,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1448 [2022-12-13 02:20:48,539 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:20:48,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1366837330, now seen corresponding path program 1 times [2022-12-13 02:20:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:48,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806507056] [2022-12-13 02:20:48,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:48,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:48,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:20:48,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:48,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806507056] [2022-12-13 02:20:48,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806507056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:48,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:48,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:48,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996542365] [2022-12-13 02:20:48,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:48,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:48,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:48,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:48,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:48,590 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:48,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:48,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:48,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:48,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:48,656 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:48,656 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:48,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:48,657 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:48,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:48,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:48,657 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:48,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:48,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:48,660 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:48,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:48,660 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:48,660 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:48,660 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:48,660 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:48,660 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:48,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:48,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:48,666 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:48,666 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:48,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:48,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:48,667 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:48,755 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:48,755 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:48,755 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:48,755 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 02:20:48,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:48,756 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:48,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1449 [2022-12-13 02:20:48,756 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:20:48,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:48,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1338208179, now seen corresponding path program 1 times [2022-12-13 02:20:48,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:48,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422455279] [2022-12-13 02:20:48,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:48,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:48,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:20:48,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:48,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422455279] [2022-12-13 02:20:48,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422455279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:48,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:48,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:48,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680003920] [2022-12-13 02:20:48,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:48,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:48,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:48,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:48,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:48,822 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:48,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:48,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:48,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:48,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:48,911 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:48,911 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:48,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1125 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:48,913 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:48,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:48,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:48,913 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:48,913 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:48,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:48,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:48,916 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:48,916 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:48,916 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:48,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:48,916 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:48,916 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:48,916 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:48,916 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:48,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:48,922 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:48,922 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:48,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:48,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:48,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:49,009 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:49,010 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:49,010 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:49,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:49,010 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:49,010 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:49,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1450 [2022-12-13 02:20:49,010 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:20:49,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:49,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1309579028, now seen corresponding path program 1 times [2022-12-13 02:20:49,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:49,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534662738] [2022-12-13 02:20:49,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:49,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:49,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:20:49,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:49,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534662738] [2022-12-13 02:20:49,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534662738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:49,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:49,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:49,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37452777] [2022-12-13 02:20:49,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:49,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:49,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:49,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:49,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:49,061 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:49,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:49,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:49,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:49,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:49,146 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:49,146 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:49,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:49,147 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:49,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:49,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:49,148 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:49,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:49,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:49,150 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:49,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:49,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:49,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:49,150 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:49,151 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:49,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:49,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:49,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:49,156 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:49,156 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:49,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:49,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:49,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:49,244 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:49,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:49,245 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:49,245 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 02:20:49,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:49,245 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:49,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1451 [2022-12-13 02:20:49,245 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:20:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:49,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1280949877, now seen corresponding path program 1 times [2022-12-13 02:20:49,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:49,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483662287] [2022-12-13 02:20:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:49,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:49,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:20:49,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:49,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483662287] [2022-12-13 02:20:49,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483662287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:49,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:49,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:49,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628148105] [2022-12-13 02:20:49,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:49,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:49,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:49,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:49,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:49,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:49,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:49,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:49,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:49,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:49,363 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:49,363 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:49,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:49,364 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:49,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:49,364 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:49,364 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:49,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:49,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:49,367 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:49,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:49,367 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:49,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:49,367 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:49,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:49,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:49,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:49,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:49,373 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:49,373 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:49,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:49,374 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:49,374 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:49,460 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:49,461 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:49,461 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:49,461 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 02:20:49,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:49,461 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:49,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1452 [2022-12-13 02:20:49,461 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:20:49,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:49,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1252320726, now seen corresponding path program 1 times [2022-12-13 02:20:49,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:49,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066629220] [2022-12-13 02:20:49,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:49,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:49,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:20:49,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:49,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066629220] [2022-12-13 02:20:49,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066629220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:49,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:49,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:49,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520331312] [2022-12-13 02:20:49,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:49,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:49,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:49,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:49,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:49,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:49,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:49,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:49,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:49,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:49,595 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:49,595 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:49,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:49,596 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:49,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:49,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:49,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:49,597 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:49,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:49,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:49,599 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:49,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:49,599 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:49,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:49,600 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:49,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:49,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:49,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:49,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:49,605 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:49,606 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:49,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:49,606 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:49,606 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:49,692 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:49,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:49,692 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:49,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:49,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:49,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:49,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1453 [2022-12-13 02:20:49,693 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:20:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:49,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1223691575, now seen corresponding path program 1 times [2022-12-13 02:20:49,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:49,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180209549] [2022-12-13 02:20:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:49,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:49,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:20:49,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:49,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180209549] [2022-12-13 02:20:49,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180209549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:49,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:49,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:49,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907520176] [2022-12-13 02:20:49,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:49,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:49,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:49,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:49,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:49,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:49,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:49,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:49,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:49,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:49,817 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:49,817 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:49,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:49,818 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:49,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:49,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:49,819 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:49,819 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:49,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:49,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:49,821 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:49,822 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:49,822 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:49,822 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:49,822 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:49,822 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:49,822 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:49,822 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:49,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:49,828 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:49,828 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:49,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:49,828 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:49,828 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:49,914 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:49,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:49,914 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:49,914 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 02:20:49,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:49,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:49,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1454 [2022-12-13 02:20:49,915 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:20:49,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1195062424, now seen corresponding path program 1 times [2022-12-13 02:20:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:49,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131207318] [2022-12-13 02:20:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:49,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:20:49,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:49,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131207318] [2022-12-13 02:20:49,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131207318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:49,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:49,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:49,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18749286] [2022-12-13 02:20:49,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:49,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:49,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:49,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:49,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:49,963 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:49,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:49,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:49,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:49,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:50,029 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:50,030 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:50,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:50,031 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:50,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:50,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:50,031 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:50,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:50,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:50,034 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,034 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:50,034 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:50,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:50,034 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:50,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:50,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:50,040 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:50,040 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:50,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:50,041 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:50,041 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:50,128 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:50,129 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:50,129 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:50,129 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 02:20:50,129 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:50,129 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:50,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1455 [2022-12-13 02:20:50,129 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:20:50,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1166433273, now seen corresponding path program 1 times [2022-12-13 02:20:50,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:50,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944831314] [2022-12-13 02:20:50,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:50,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:50,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 02:20:50,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:50,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944831314] [2022-12-13 02:20:50,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944831314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:50,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:50,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:50,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65428725] [2022-12-13 02:20:50,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:50,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:50,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:50,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:50,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:50,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:50,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:50,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:50,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:50,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:50,280 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:50,280 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:50,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:50,281 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:50,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:50,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:50,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:50,281 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:50,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:50,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:50,284 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,284 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:50,284 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:50,284 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:50,284 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:50,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:50,285 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:50,290 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:50,290 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:50,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:50,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:50,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:50,376 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:50,377 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:50,377 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:50,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:50,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:50,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:50,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1456 [2022-12-13 02:20:50,377 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:20:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1137804122, now seen corresponding path program 1 times [2022-12-13 02:20:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:50,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208705881] [2022-12-13 02:20:50,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:50,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:50,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:20:50,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:50,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208705881] [2022-12-13 02:20:50,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208705881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:50,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:50,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:50,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316684687] [2022-12-13 02:20:50,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:50,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:50,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:50,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:50,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:50,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:50,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:50,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:50,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:50,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:50,493 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:50,493 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:50,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:50,494 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:50,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:50,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:50,495 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:50,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:50,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:50,497 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,497 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:50,497 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:50,497 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:50,497 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,497 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:50,498 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:50,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:50,503 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:50,503 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:50,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:50,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:50,504 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:50,590 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:50,590 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:50,590 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:50,590 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 02:20:50,590 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:50,590 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:50,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1457 [2022-12-13 02:20:50,590 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:20:50,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1109174971, now seen corresponding path program 1 times [2022-12-13 02:20:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:50,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623644109] [2022-12-13 02:20:50,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:50,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:50,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 02:20:50,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:50,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623644109] [2022-12-13 02:20:50,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623644109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:50,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:50,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:50,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103548886] [2022-12-13 02:20:50,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:50,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:50,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:50,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:50,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:50,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:50,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:50,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:50,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:50,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:50,704 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:50,704 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:50,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:50,705 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:50,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:50,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:50,706 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:50,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:50,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:50,708 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,709 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:50,709 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:50,709 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:50,709 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:50,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:50,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:50,714 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:50,715 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:50,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:50,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:50,715 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:50,801 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:50,802 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:50,802 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:50,802 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 02:20:50,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:50,802 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:50,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1458 [2022-12-13 02:20:50,802 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:20:50,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1080545820, now seen corresponding path program 1 times [2022-12-13 02:20:50,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:50,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299206560] [2022-12-13 02:20:50,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:50,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:50,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:20:50,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:50,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299206560] [2022-12-13 02:20:50,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299206560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:50,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:50,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:50,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93125601] [2022-12-13 02:20:50,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:50,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:50,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:50,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:50,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:50,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:50,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:50,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:50,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:50,916 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:50,916 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:50,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1127 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:50,917 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:50,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:50,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:50,917 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:50,917 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:50,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:50,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:50,920 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,920 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:50,920 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:50,920 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:50,920 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,920 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:50,920 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:50,921 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:50,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:50,926 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:50,926 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:50,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:50,927 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:50,927 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:51,013 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:51,013 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:51,013 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:51,014 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 02:20:51,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:51,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:51,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1459 [2022-12-13 02:20:51,014 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:20:51,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:51,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1051916669, now seen corresponding path program 1 times [2022-12-13 02:20:51,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:51,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962321248] [2022-12-13 02:20:51,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:51,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:51,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:51,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962321248] [2022-12-13 02:20:51,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962321248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:51,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:51,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:51,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710040662] [2022-12-13 02:20:51,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:51,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:51,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:51,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:51,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:51,064 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:51,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:51,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:51,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:51,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:51,150 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:51,150 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:51,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:51,151 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:51,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:51,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:51,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:51,152 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:51,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:51,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:51,155 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:51,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:51,155 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:51,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:51,155 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:51,155 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:51,155 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:51,155 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:51,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:51,161 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:51,161 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:51,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:51,162 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:51,162 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:51,265 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:51,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 02:20:51,266 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:51,266 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 02:20:51,266 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:51,266 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:51,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1460 [2022-12-13 02:20:51,266 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:20:51,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:51,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1023287518, now seen corresponding path program 1 times [2022-12-13 02:20:51,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:51,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51037269] [2022-12-13 02:20:51,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:51,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:51,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:20:51,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:51,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51037269] [2022-12-13 02:20:51,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51037269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:51,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:51,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:51,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576583499] [2022-12-13 02:20:51,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:51,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:51,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:51,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:51,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:51,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:51,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:51,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:51,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:51,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:51,409 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:51,410 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:51,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:51,411 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:51,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:51,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:51,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:51,411 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:51,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:51,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:51,414 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:51,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:51,414 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:51,414 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:51,414 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:51,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:51,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:51,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:51,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:51,420 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:51,420 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:51,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:51,421 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:51,421 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:51,508 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:51,508 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:51,508 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:51,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:51,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:51,508 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:51,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1461 [2022-12-13 02:20:51,509 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:20:51,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash -994658367, now seen corresponding path program 1 times [2022-12-13 02:20:51,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:51,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481378901] [2022-12-13 02:20:51,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:51,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:51,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:20:51,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:51,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481378901] [2022-12-13 02:20:51,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481378901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:51,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:51,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:51,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113196736] [2022-12-13 02:20:51,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:51,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:51,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:51,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:51,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:51,558 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:51,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:51,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:51,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:51,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:51,622 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:51,623 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:51,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:51,624 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:51,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:51,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:51,624 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:51,624 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:51,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:51,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:51,627 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:51,627 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:51,627 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:51,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:51,627 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:51,627 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:51,627 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:51,627 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:51,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:51,633 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:51,633 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:51,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:51,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:51,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:51,721 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:51,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:51,721 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:51,721 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 02:20:51,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:51,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:51,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1462 [2022-12-13 02:20:51,721 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:20:51,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:51,722 INFO L85 PathProgramCache]: Analyzing trace with hash -966029216, now seen corresponding path program 1 times [2022-12-13 02:20:51,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:51,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504827625] [2022-12-13 02:20:51,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:51,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:51,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:20:51,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:51,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504827625] [2022-12-13 02:20:51,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504827625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:51,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:51,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:51,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794440319] [2022-12-13 02:20:51,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:51,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:51,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:51,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:51,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:51,787 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:51,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:51,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:51,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:51,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:51,866 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:51,866 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:51,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:51,867 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:51,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:51,868 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:51,868 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:51,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:51,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:51,871 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:51,871 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:51,872 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:51,872 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:51,872 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:51,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:51,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:51,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:51,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:51,878 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:51,878 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:51,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:51,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:51,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:51,967 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:51,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:51,967 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:51,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:51,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:51,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:51,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1463 [2022-12-13 02:20:51,967 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:20:51,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:51,968 INFO L85 PathProgramCache]: Analyzing trace with hash -937400065, now seen corresponding path program 1 times [2022-12-13 02:20:51,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:51,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815214366] [2022-12-13 02:20:51,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:51,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:52,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:20:52,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:52,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815214366] [2022-12-13 02:20:52,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815214366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:52,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:52,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:52,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213837766] [2022-12-13 02:20:52,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:52,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:52,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:52,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:52,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:52,018 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:52,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:52,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:52,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:52,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:52,095 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:52,095 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:52,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:52,096 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:52,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:52,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:52,097 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:52,097 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:52,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:52,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:52,099 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:52,100 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:52,100 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:52,100 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:52,100 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:52,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:52,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:52,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:52,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:52,106 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:52,106 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:52,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:52,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:52,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:52,204 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:52,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:20:52,205 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:52,205 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 02:20:52,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:52,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:52,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1464 [2022-12-13 02:20:52,205 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:20:52,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:52,205 INFO L85 PathProgramCache]: Analyzing trace with hash -908770914, now seen corresponding path program 1 times [2022-12-13 02:20:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:52,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88739362] [2022-12-13 02:20:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:52,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:20:52,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:52,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88739362] [2022-12-13 02:20:52,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88739362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:52,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:52,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:52,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806912468] [2022-12-13 02:20:52,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:52,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:52,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:52,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:52,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:52,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:52,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:52,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:52,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:52,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:52,340 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:52,340 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:52,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:52,341 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:52,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:52,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:52,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:52,341 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:52,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:52,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:52,344 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:52,344 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:52,344 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:52,344 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:52,344 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:52,345 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:52,345 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:52,345 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:52,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:52,350 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:52,350 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:52,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:52,351 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:52,351 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:52,438 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:52,439 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:52,439 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:52,439 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 02:20:52,439 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:52,439 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:52,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1465 [2022-12-13 02:20:52,439 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:20:52,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash -880141763, now seen corresponding path program 1 times [2022-12-13 02:20:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:52,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113202739] [2022-12-13 02:20:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:52,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:52,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:20:52,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:52,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113202739] [2022-12-13 02:20:52,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113202739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:52,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:52,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:52,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142186945] [2022-12-13 02:20:52,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:52,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:52,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:52,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:52,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:52,488 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:52,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:52,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:52,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:52,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:52,554 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:52,555 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:52,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:52,556 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:52,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:52,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:52,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:52,556 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:52,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:52,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:52,559 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:52,559 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:52,559 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:52,559 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:52,559 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:52,559 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:52,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:52,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:52,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:52,565 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:52,565 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:52,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:52,566 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:52,566 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:52,653 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:52,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:52,653 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:52,653 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 02:20:52,653 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:52,653 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:52,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1466 [2022-12-13 02:20:52,653 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:20:52,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:52,654 INFO L85 PathProgramCache]: Analyzing trace with hash -851512612, now seen corresponding path program 1 times [2022-12-13 02:20:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:52,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160419850] [2022-12-13 02:20:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:52,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:52,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:20:52,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:52,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160419850] [2022-12-13 02:20:52,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160419850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:52,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:52,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:52,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184411144] [2022-12-13 02:20:52,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:52,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:52,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:52,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:52,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:52,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:52,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:52,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:52,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:52,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:52,780 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:52,780 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:52,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:52,781 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:52,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:52,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:52,782 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:52,782 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:52,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:52,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:52,784 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:52,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:52,784 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:52,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:52,785 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:52,785 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:52,785 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:52,785 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:52,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:52,790 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:52,790 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:20:52,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:52,791 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:52,791 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:52,877 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:52,878 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:52,878 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:52,878 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 02:20:52,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:52,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:52,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1467 [2022-12-13 02:20:52,878 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:20:52,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash -822883461, now seen corresponding path program 1 times [2022-12-13 02:20:52,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:52,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217293073] [2022-12-13 02:20:52,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:52,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:52,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:20:52,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:52,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217293073] [2022-12-13 02:20:52,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217293073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:52,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:52,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:52,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767171421] [2022-12-13 02:20:52,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:52,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:52,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:52,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:52,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:52,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:52,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:52,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:52,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:52,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:52,996 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:52,996 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:52,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:52,997 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:52,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:52,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:52,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:52,998 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:52,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:53,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:53,000 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:53,000 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:53,000 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:53,000 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,001 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:53,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:53,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:53,006 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:53,006 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:53,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:53,007 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:53,007 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:53,095 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:53,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:20:53,096 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:53,096 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 02:20:53,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:53,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:53,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1468 [2022-12-13 02:20:53,096 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:20:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:53,096 INFO L85 PathProgramCache]: Analyzing trace with hash -794254310, now seen corresponding path program 1 times [2022-12-13 02:20:53,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:53,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462614522] [2022-12-13 02:20:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:53,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:53,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:20:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:53,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462614522] [2022-12-13 02:20:53,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462614522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:53,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:53,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:53,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825375447] [2022-12-13 02:20:53,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:53,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:53,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:53,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:53,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:53,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:53,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:53,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:53,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:53,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:53,209 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:53,209 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:53,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:53,210 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:53,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:53,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:53,211 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:53,211 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:53,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:53,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:53,214 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,214 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:53,214 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:53,214 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:53,214 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,214 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:53,214 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:53,214 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:53,220 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:53,220 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:53,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:53,221 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:53,221 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:53,308 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:53,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:53,309 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:53,309 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 02:20:53,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:53,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:53,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1469 [2022-12-13 02:20:53,309 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:20:53,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash -765625159, now seen corresponding path program 1 times [2022-12-13 02:20:53,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:53,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463258179] [2022-12-13 02:20:53,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:53,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:53,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:20:53,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:53,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463258179] [2022-12-13 02:20:53,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463258179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:53,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:53,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:53,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515376251] [2022-12-13 02:20:53,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:53,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:53,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:53,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:53,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:53,369 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:53,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:53,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:53,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:53,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:53,434 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:53,434 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:53,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:53,435 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:53,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:53,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:53,436 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:53,436 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:53,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:53,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:53,438 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,439 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:53,439 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:53,439 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:53,439 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,439 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:53,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:53,439 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:53,445 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:53,445 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:53,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:53,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:53,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:53,532 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:53,532 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:53,533 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:53,533 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 02:20:53,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:53,533 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:53,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1470 [2022-12-13 02:20:53,533 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:20:53,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:53,533 INFO L85 PathProgramCache]: Analyzing trace with hash -736996008, now seen corresponding path program 1 times [2022-12-13 02:20:53,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:53,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669453815] [2022-12-13 02:20:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:53,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:53,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:20:53,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:53,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669453815] [2022-12-13 02:20:53,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669453815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:53,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:53,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:53,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614545554] [2022-12-13 02:20:53,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:53,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:53,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:53,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:53,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:53,583 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:53,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:53,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:53,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:53,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:53,659 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:53,659 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:53,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:53,660 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:53,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:53,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:53,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:53,661 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:53,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:53,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:53,663 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,663 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:53,663 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:53,663 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:53,663 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,664 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:53,664 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:53,664 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:53,669 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:53,669 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:53,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:53,670 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:53,670 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:53,757 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:53,758 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:53,758 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:53,758 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 02:20:53,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:53,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:53,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1471 [2022-12-13 02:20:53,758 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:20:53,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:53,758 INFO L85 PathProgramCache]: Analyzing trace with hash -708366857, now seen corresponding path program 1 times [2022-12-13 02:20:53,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:53,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810095561] [2022-12-13 02:20:53,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:53,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:53,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:20:53,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:53,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810095561] [2022-12-13 02:20:53,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810095561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:53,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:53,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:53,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959151395] [2022-12-13 02:20:53,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:53,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:53,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:53,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:53,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:53,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:53,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:53,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:53,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:53,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:53,876 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:53,876 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:53,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:53,877 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:53,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:53,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:53,878 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:53,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:53,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:53,881 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,881 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:53,881 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:53,881 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:53,881 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,881 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:53,881 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:53,881 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:53,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:53,887 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:53,887 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:53,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:53,888 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:53,888 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:53,974 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:53,975 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:53,975 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:53,975 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 02:20:53,975 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:53,975 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:53,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1472 [2022-12-13 02:20:53,975 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:20:53,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash -679737706, now seen corresponding path program 1 times [2022-12-13 02:20:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:53,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530395959] [2022-12-13 02:20:53,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:53,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:54,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:20:54,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:54,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530395959] [2022-12-13 02:20:54,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530395959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:54,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:54,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:54,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603948178] [2022-12-13 02:20:54,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:54,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:54,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:54,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:54,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:54,042 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:54,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:54,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:54,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:54,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:54,109 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:54,109 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:54,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1095 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:54,110 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:54,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:54,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:54,111 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:54,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:54,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:54,113 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,113 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:54,114 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:54,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:54,114 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,114 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:54,114 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:54,114 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:54,119 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:54,120 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:54,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:54,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:54,120 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:54,205 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:54,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:20:54,205 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:54,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:54,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:54,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:54,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1473 [2022-12-13 02:20:54,206 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:20:54,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:54,206 INFO L85 PathProgramCache]: Analyzing trace with hash -651108555, now seen corresponding path program 1 times [2022-12-13 02:20:54,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:54,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760457504] [2022-12-13 02:20:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:54,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:20:54,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:54,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760457504] [2022-12-13 02:20:54,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760457504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:54,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:54,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:54,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781310126] [2022-12-13 02:20:54,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:54,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:54,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:54,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:54,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:54,256 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:54,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:54,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:54,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:54,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:54,320 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:54,320 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:54,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:54,321 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:54,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:54,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:54,322 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:54,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:54,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:54,325 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:54,325 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:54,325 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:54,325 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:54,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:54,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:54,339 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:54,339 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:54,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:54,340 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:54,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:54,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:54,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:20:54,427 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:54,427 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 02:20:54,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:54,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:54,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1474 [2022-12-13 02:20:54,427 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:20:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash -622479404, now seen corresponding path program 1 times [2022-12-13 02:20:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:54,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725589677] [2022-12-13 02:20:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:54,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:54,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:20:54,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:54,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725589677] [2022-12-13 02:20:54,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725589677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:54,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:54,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:54,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91080984] [2022-12-13 02:20:54,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:54,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:54,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:54,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:54,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:54,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:54,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:54,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:54,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:54,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:54,548 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:54,549 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:54,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:54,550 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:54,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:54,550 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:54,550 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:54,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:54,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:54,553 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,553 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:54,553 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:54,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:54,553 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,553 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:54,553 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:54,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:54,559 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:54,559 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:54,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:54,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:54,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:54,646 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:54,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:54,647 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:54,647 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 02:20:54,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:54,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:54,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1475 [2022-12-13 02:20:54,647 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:20:54,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:54,647 INFO L85 PathProgramCache]: Analyzing trace with hash -593850253, now seen corresponding path program 1 times [2022-12-13 02:20:54,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:54,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541019864] [2022-12-13 02:20:54,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:54,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:54,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:20:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:54,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541019864] [2022-12-13 02:20:54,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541019864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:54,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:54,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544011697] [2022-12-13 02:20:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:54,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:54,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:54,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:54,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:54,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:54,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:54,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:54,771 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:54,771 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:54,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:54,772 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:54,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:54,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:54,772 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:54,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:54,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:54,775 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:54,775 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:54,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:54,776 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,776 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:54,776 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:54,776 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:54,781 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:54,781 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:20:54,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:54,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:54,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:54,869 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:54,870 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:54,870 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:54,870 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 02:20:54,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:54,870 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:54,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1476 [2022-12-13 02:20:54,870 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:20:54,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:54,870 INFO L85 PathProgramCache]: Analyzing trace with hash -565221102, now seen corresponding path program 1 times [2022-12-13 02:20:54,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:54,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401240545] [2022-12-13 02:20:54,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:54,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20: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 02:20:54,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:54,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401240545] [2022-12-13 02:20:54,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401240545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:54,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:54,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:54,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516894093] [2022-12-13 02:20:54,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:54,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:54,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:54,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:54,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:54,917 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:54,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:54,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:54,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:54,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:54,982 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:54,983 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:54,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:54,984 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:54,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:54,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:54,984 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:54,984 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:54,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:54,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:54,987 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,987 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:54,987 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:54,987 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:54,987 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,987 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:54,987 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:54,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:54,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:54,993 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:54,993 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:54,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:54,994 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:54,994 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:55,079 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:55,080 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:55,080 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:55,080 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 02:20:55,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:55,080 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:55,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1477 [2022-12-13 02:20:55,080 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:20:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash -536591951, now seen corresponding path program 1 times [2022-12-13 02:20:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:55,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557942881] [2022-12-13 02:20:55,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:55,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:20:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:55,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557942881] [2022-12-13 02:20:55,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557942881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:55,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:55,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741778431] [2022-12-13 02:20:55,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:55,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:55,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:55,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:55,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:55,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:55,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:55,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:55,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:55,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:55,199 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:55,199 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:55,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:55,201 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:55,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:55,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:55,201 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:55,201 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:55,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:55,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:55,204 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:55,204 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:55,204 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:55,204 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:55,204 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:55,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:55,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:55,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:55,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:55,210 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:55,210 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:55,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:55,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:55,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:55,297 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:55,297 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:55,297 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:55,297 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 02:20:55,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:55,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:55,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1478 [2022-12-13 02:20:55,298 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:20:55,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash -507962800, now seen corresponding path program 1 times [2022-12-13 02:20:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:55,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13642045] [2022-12-13 02:20:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:55,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:20:55,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:55,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13642045] [2022-12-13 02:20:55,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13642045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:55,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:55,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:55,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607996753] [2022-12-13 02:20:55,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:55,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:55,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:55,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:55,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:55,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:55,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:55,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:55,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:55,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:55,459 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:55,459 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:55,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:55,460 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:55,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:55,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:55,461 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:55,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:55,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:55,463 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:55,463 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:55,464 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:55,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:55,464 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:55,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:55,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:55,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:55,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:55,469 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:55,470 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:55,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:55,470 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:55,470 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:55,557 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:55,558 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:55,558 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:55,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:55,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:55,558 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:55,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1479 [2022-12-13 02:20:55,558 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:20:55,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:55,558 INFO L85 PathProgramCache]: Analyzing trace with hash -479333649, now seen corresponding path program 1 times [2022-12-13 02:20:55,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:55,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787696922] [2022-12-13 02:20:55,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:55,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:55,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 02:20:55,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:55,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787696922] [2022-12-13 02:20:55,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787696922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:55,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:55,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083948867] [2022-12-13 02:20:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:55,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:55,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:55,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:55,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:55,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:55,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:55,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:55,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:55,685 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:55,685 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:55,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:55,687 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:55,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:55,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:55,687 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:55,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:55,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:55,690 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:55,690 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:55,690 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:55,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:55,690 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:55,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:55,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:55,690 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:55,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:55,696 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:55,696 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:55,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:55,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:55,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:55,785 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:55,785 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:55,785 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:55,785 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 02:20:55,785 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:55,785 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:55,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1480 [2022-12-13 02:20:55,786 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:20:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:55,786 INFO L85 PathProgramCache]: Analyzing trace with hash -450704498, now seen corresponding path program 1 times [2022-12-13 02:20:55,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:55,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911188083] [2022-12-13 02:20:55,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:55,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:55,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:20:55,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:55,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911188083] [2022-12-13 02:20:55,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911188083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:55,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:55,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812740822] [2022-12-13 02:20:55,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:55,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:55,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:55,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:55,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:55,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:55,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:55,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:55,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:55,900 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:55,900 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:55,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:55,901 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:55,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:55,902 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:55,902 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:55,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:55,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:55,904 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:55,904 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:55,905 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:55,905 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:55,905 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:55,905 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:55,905 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:55,905 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:55,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:55,910 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:55,911 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:55,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:55,911 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:55,911 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:55,999 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:55,999 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:56,000 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:56,000 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 02:20:56,000 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:56,000 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:56,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1481 [2022-12-13 02:20:56,000 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:20:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash -422075347, now seen corresponding path program 1 times [2022-12-13 02:20:56,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:56,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965695761] [2022-12-13 02:20:56,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:56,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:56,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:20:56,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:56,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965695761] [2022-12-13 02:20:56,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965695761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:56,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:56,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:56,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162392764] [2022-12-13 02:20:56,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:56,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:56,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:56,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:56,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:56,047 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:56,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:56,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:56,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:56,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:56,113 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:56,113 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:56,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:56,114 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:56,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:56,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:56,115 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:56,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:56,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:56,117 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,117 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:56,118 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:56,118 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:56,118 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,118 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:56,118 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:56,118 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:56,124 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:56,124 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:20:56,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:56,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:56,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:56,211 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:56,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:56,212 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:56,212 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 02:20:56,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:56,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:56,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1482 [2022-12-13 02:20:56,212 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:20:56,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:56,212 INFO L85 PathProgramCache]: Analyzing trace with hash -393446196, now seen corresponding path program 1 times [2022-12-13 02:20:56,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:56,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853812471] [2022-12-13 02:20:56,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:56,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:56,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:20:56,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:56,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853812471] [2022-12-13 02:20:56,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853812471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:56,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:56,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:56,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900066341] [2022-12-13 02:20:56,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:56,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:56,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:56,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:56,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:56,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:56,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:56,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:56,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:56,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:56,326 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:56,326 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:56,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:56,328 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:56,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:56,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:56,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:56,328 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:56,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:56,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:56,331 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:56,331 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:56,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:56,331 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,331 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:56,331 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:56,331 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:56,337 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:56,337 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:20:56,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:56,337 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:56,337 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:56,423 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:56,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:56,424 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:56,424 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 02:20:56,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:56,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:56,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1483 [2022-12-13 02:20:56,424 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:20:56,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:56,424 INFO L85 PathProgramCache]: Analyzing trace with hash -364817045, now seen corresponding path program 1 times [2022-12-13 02:20:56,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:56,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850953661] [2022-12-13 02:20:56,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:56,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:56,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:20:56,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:56,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850953661] [2022-12-13 02:20:56,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850953661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:56,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:56,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431293290] [2022-12-13 02:20:56,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:56,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:56,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:56,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:56,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:56,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:56,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:56,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:56,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:56,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:56,550 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:56,550 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:56,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:56,551 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:56,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:56,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:56,551 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:56,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:56,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:56,554 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,554 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:56,554 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:56,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:56,554 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,555 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:56,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:56,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:56,561 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:56,561 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:56,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:56,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:56,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:56,648 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:56,648 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:56,648 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:56,648 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 02:20:56,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:56,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:56,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1484 [2022-12-13 02:20:56,649 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:20:56,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:56,649 INFO L85 PathProgramCache]: Analyzing trace with hash -336187894, now seen corresponding path program 1 times [2022-12-13 02:20:56,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:56,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852606861] [2022-12-13 02:20:56,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:56,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:56,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:20:56,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:56,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852606861] [2022-12-13 02:20:56,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852606861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:56,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:56,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:56,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656801115] [2022-12-13 02:20:56,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:56,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:56,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:56,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:56,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:56,701 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:56,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:56,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:56,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:56,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:56,777 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:56,777 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:56,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:56,778 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:56,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:56,779 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:56,779 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:56,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:56,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:56,781 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,781 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:56,781 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:56,781 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:56,781 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,782 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:56,782 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:56,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:56,787 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:56,787 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:20:56,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:56,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:56,788 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:56,875 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:56,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:56,875 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:56,875 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 02:20:56,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:56,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:56,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1485 [2022-12-13 02:20:56,875 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:20:56,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:56,876 INFO L85 PathProgramCache]: Analyzing trace with hash -307558743, now seen corresponding path program 1 times [2022-12-13 02:20:56,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:56,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186272155] [2022-12-13 02:20:56,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:56,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:56,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 02:20:56,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:56,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186272155] [2022-12-13 02:20:56,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186272155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:56,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:56,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:56,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738451593] [2022-12-13 02:20:56,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:56,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:56,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:56,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:56,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:56,926 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:56,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:56,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:56,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:56,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:56,992 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:56,992 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:56,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:56,993 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:56,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:56,993 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:56,993 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:56,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:56,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:56,996 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,996 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:56,996 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:56,996 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:56,996 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,996 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:56,996 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:56,996 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:56,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:57,002 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:57,002 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:57,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:57,003 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:57,003 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:57,090 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:57,090 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:57,090 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:57,090 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 02:20:57,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:57,090 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:57,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1486 [2022-12-13 02:20:57,090 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:20:57,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash -278929592, now seen corresponding path program 1 times [2022-12-13 02:20:57,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:57,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227906036] [2022-12-13 02:20:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:57,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:20:57,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:57,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227906036] [2022-12-13 02:20:57,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227906036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:57,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:57,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:57,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609821417] [2022-12-13 02:20:57,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:57,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:57,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:57,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:57,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:57,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:57,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:57,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:57,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:57,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:57,224 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:57,224 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:57,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:57,225 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:57,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:57,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:57,226 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:57,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:57,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:57,228 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:57,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:57,229 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:57,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:57,229 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:57,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:57,229 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:57,229 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:57,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:57,235 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:57,235 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:57,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:57,235 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:57,235 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:57,322 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:57,322 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:57,322 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:57,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:57,323 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:57,323 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:57,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1487 [2022-12-13 02:20:57,323 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:20:57,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:57,323 INFO L85 PathProgramCache]: Analyzing trace with hash -250300441, now seen corresponding path program 1 times [2022-12-13 02:20:57,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:57,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455481600] [2022-12-13 02:20:57,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:57,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:57,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:20:57,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:57,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455481600] [2022-12-13 02:20:57,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455481600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:57,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:57,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:57,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877979404] [2022-12-13 02:20:57,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:57,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:57,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:57,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:57,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:57,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:57,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:57,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:57,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:57,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:57,450 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:57,450 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:57,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:57,451 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:57,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:57,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:57,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:57,451 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:57,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:57,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:57,454 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:57,454 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:57,454 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:57,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:57,454 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:57,454 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:57,454 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:57,454 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:57,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:57,460 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:57,460 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:57,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:57,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:57,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:57,548 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:57,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:57,548 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:57,548 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 02:20:57,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:57,548 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:57,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1488 [2022-12-13 02:20:57,549 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:20:57,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash -221671290, now seen corresponding path program 1 times [2022-12-13 02:20:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:57,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045360308] [2022-12-13 02:20:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:57,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:20:57,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:57,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045360308] [2022-12-13 02:20:57,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045360308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:57,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:57,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:57,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885071301] [2022-12-13 02:20:57,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:57,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:57,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:57,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:57,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:57,615 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:57,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:57,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:57,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:57,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:57,683 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:57,683 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:57,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:57,684 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:57,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:57,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:57,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:57,684 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:57,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:57,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:57,687 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:57,687 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:57,687 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:57,687 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:57,687 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:57,687 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:57,687 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:57,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:57,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:57,693 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:57,693 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:20:57,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:57,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:57,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:57,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:57,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:57,781 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:57,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:57,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:57,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:57,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1489 [2022-12-13 02:20:57,781 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:20:57,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:57,781 INFO L85 PathProgramCache]: Analyzing trace with hash -193042139, now seen corresponding path program 1 times [2022-12-13 02:20:57,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:57,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845216061] [2022-12-13 02:20:57,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:57,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:57,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:20:57,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:57,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845216061] [2022-12-13 02:20:57,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845216061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:57,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:57,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:57,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673004097] [2022-12-13 02:20:57,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:57,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:57,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:57,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:57,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:57,830 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:57,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:57,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:57,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:57,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:57,894 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:57,894 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:20:57,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:57,895 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:57,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:57,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:57,896 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:57,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:57,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:57,898 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:57,898 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:57,899 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:57,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:57,899 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:57,899 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:57,899 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:57,899 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:57,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:57,904 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:57,904 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:20:57,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:57,905 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:57,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:57,989 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:57,990 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:20:57,990 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:57,990 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 02:20:57,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:57,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:57,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1490 [2022-12-13 02:20:57,990 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:20:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash -164412988, now seen corresponding path program 1 times [2022-12-13 02:20:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:57,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81226965] [2022-12-13 02:20:57,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:57,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:58,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:20:58,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:58,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81226965] [2022-12-13 02:20:58,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81226965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:58,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:58,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:58,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776254355] [2022-12-13 02:20:58,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:58,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:58,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:58,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:58,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:58,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:58,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:58,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:58,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:58,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:58,105 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:58,106 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:58,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:58,106 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:58,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:58,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:58,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:58,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:58,107 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:58,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:58,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:58,110 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,110 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:58,110 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:58,110 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:58,110 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:58,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:58,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:58,116 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:58,116 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:20:58,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:58,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:58,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:58,203 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:58,203 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:58,204 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:58,204 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 02:20:58,204 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:58,204 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:58,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1491 [2022-12-13 02:20:58,204 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:20:58,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash -135783837, now seen corresponding path program 1 times [2022-12-13 02:20:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:58,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135103032] [2022-12-13 02:20:58,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:58,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:58,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:20:58,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:58,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135103032] [2022-12-13 02:20:58,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135103032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:58,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:58,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:58,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478898677] [2022-12-13 02:20:58,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:58,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:58,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:58,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:58,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:58,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:58,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:58,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:58,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:58,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:58,328 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:58,329 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:58,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:58,330 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:58,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:58,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:58,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:58,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:58,330 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:58,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:58,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:58,333 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:58,333 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:58,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:58,333 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:58,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:58,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:58,339 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:58,339 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:58,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:58,340 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:58,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:58,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:58,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:58,427 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:58,427 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 02:20:58,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:58,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:58,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1492 [2022-12-13 02:20:58,427 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:20:58,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:58,427 INFO L85 PathProgramCache]: Analyzing trace with hash -107154686, now seen corresponding path program 1 times [2022-12-13 02:20:58,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:58,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115675235] [2022-12-13 02:20:58,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:58,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:58,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:20:58,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:58,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115675235] [2022-12-13 02:20:58,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115675235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:58,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:58,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:58,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130165311] [2022-12-13 02:20:58,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:58,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:58,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:58,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:58,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:58,487 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:58,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:58,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:58,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:58,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:58,553 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:58,553 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:58,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:58,554 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:58,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:58,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:58,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:58,555 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:58,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:58,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:58,557 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,557 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:58,557 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:58,557 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:58,558 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:58,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:58,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:58,563 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:58,563 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:58,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:58,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:58,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:58,650 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:58,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:58,651 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:58,651 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 02:20:58,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:58,651 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:58,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1493 [2022-12-13 02:20:58,651 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:20:58,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:58,651 INFO L85 PathProgramCache]: Analyzing trace with hash -78525535, now seen corresponding path program 1 times [2022-12-13 02:20:58,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:58,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431069046] [2022-12-13 02:20:58,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:58,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 02:20:58,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:58,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431069046] [2022-12-13 02:20:58,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431069046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:58,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:58,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:58,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259614665] [2022-12-13 02:20:58,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:58,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:58,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:58,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:58,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:58,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:58,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:58,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:58,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:58,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:58,770 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:58,770 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:58,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:58,771 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:58,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:58,771 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:58,772 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:58,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:58,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:58,774 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,774 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:58,774 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:58,774 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:58,774 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,775 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:58,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:58,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:58,780 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:58,781 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:20:58,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:58,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:58,781 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:58,868 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:58,869 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:20:58,869 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:58,869 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 02:20:58,869 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:58,869 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:58,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1494 [2022-12-13 02:20:58,869 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:20:58,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:58,869 INFO L85 PathProgramCache]: Analyzing trace with hash -49896384, now seen corresponding path program 1 times [2022-12-13 02:20:58,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:58,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840274503] [2022-12-13 02:20:58,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:58,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:58,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:20:58,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:58,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840274503] [2022-12-13 02:20:58,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840274503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:58,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:58,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:58,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738761043] [2022-12-13 02:20:58,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:58,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:58,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:58,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:58,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:58,921 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:58,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:58,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:58,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:58,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:58,987 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:58,987 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:58,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:58,988 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:58,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:58,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:58,989 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:58,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:58,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:58,991 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,992 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:58,992 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:58,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:58,992 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:58,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:58,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:58,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:58,998 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:58,998 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:58,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:58,998 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:58,998 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:59,085 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:59,085 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:20:59,086 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:59,086 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 02:20:59,086 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:59,086 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:59,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1495 [2022-12-13 02:20:59,086 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:20:59,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:59,086 INFO L85 PathProgramCache]: Analyzing trace with hash -21267233, now seen corresponding path program 1 times [2022-12-13 02:20:59,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:59,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781677700] [2022-12-13 02:20:59,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:59,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:59,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:20:59,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:59,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781677700] [2022-12-13 02:20:59,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781677700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:59,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:59,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:59,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875498249] [2022-12-13 02:20:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:59,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:59,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:59,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:59,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:59,135 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:59,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:59,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:59,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:59,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:59,210 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:59,210 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:20:59,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:59,211 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:59,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:59,212 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:59,212 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:59,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:59,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:59,214 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:59,214 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:59,214 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:59,214 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:59,214 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:59,215 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:59,215 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:59,215 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:59,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:59,220 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:59,220 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:59,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:59,221 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:59,221 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:59,307 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:59,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:20:59,308 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:59,308 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 02:20:59,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:59,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:59,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1496 [2022-12-13 02:20:59,308 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:20:59,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash 7361918, now seen corresponding path program 1 times [2022-12-13 02:20:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:59,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952701561] [2022-12-13 02:20:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:59,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:20:59,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:59,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952701561] [2022-12-13 02:20:59,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952701561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:59,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:59,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:59,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670475242] [2022-12-13 02:20:59,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:59,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:59,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:59,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:59,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:59,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:59,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:59,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:59,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:59,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:59,435 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:59,436 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:20:59,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:59,437 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:59,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:59,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:59,437 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:59,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:59,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:59,440 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:59,440 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:59,440 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:59,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:59,440 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:59,440 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:59,440 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:59,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:59,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:59,446 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:59,446 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:20:59,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:59,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:59,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:59,543 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:59,543 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:20:59,543 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:59,543 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 02:20:59,543 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:59,543 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:59,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1497 [2022-12-13 02:20:59,544 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:20:59,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:59,544 INFO L85 PathProgramCache]: Analyzing trace with hash 35991069, now seen corresponding path program 1 times [2022-12-13 02:20:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:59,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686046495] [2022-12-13 02:20:59,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:59,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:59,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 02:20:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:59,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686046495] [2022-12-13 02:20:59,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686046495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:59,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:59,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:20:59,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390171961] [2022-12-13 02:20:59,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:59,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:20:59,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:59,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:20:59,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:20:59,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:59,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:59,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:59,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:59,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:59,688 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:59,688 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:20:59,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:59,689 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:59,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:59,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:59,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:59,690 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:59,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:59,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:59,693 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:59,693 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:59,693 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:59,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:59,693 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:59,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:59,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:59,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:59,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:59,699 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:59,699 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:20:59,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:59,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:59,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:20:59,785 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:20:59,785 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:20:59,786 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:20:59,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:20:59,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:20:59,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:20:59,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1498 [2022-12-13 02:20:59,786 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:20:59,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:20:59,786 INFO L85 PathProgramCache]: Analyzing trace with hash 64620220, now seen corresponding path program 1 times [2022-12-13 02:20:59,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:20:59,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116050312] [2022-12-13 02:20:59,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:20:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:20:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:20:59,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:20:59,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:20:59,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116050312] [2022-12-13 02:20:59,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116050312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:20:59,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:20:59,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:20:59,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287812048] [2022-12-13 02:20:59,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:20:59,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:20:59,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:20:59,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:20:59,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:20:59,836 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:20:59,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:20:59,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:20:59,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:20:59,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:20:59,911 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:20:59,911 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:20:59,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:20:59,912 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:20:59,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:20:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:20:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:20:59,913 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:20:59,913 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:20:59,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:20:59,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:20:59,915 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:59,915 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:20:59,916 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:20:59,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:20:59,916 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:59,916 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:20:59,916 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:20:59,916 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:20:59,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:59,921 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:20:59,922 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:20:59,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:20:59,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:20:59,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:00,008 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:00,009 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:00,009 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:00,009 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 02:21:00,009 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:00,009 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:00,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1499 [2022-12-13 02:21:00,009 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:21:00,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:00,009 INFO L85 PathProgramCache]: Analyzing trace with hash 93249371, now seen corresponding path program 1 times [2022-12-13 02:21:00,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:00,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870908487] [2022-12-13 02:21:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:00,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:21:00,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:00,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870908487] [2022-12-13 02:21:00,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870908487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:00,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:00,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156197823] [2022-12-13 02:21:00,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:00,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:00,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:00,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:00,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:00,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:00,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:00,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:00,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:00,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:00,126 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:00,126 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:00,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:00,127 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:00,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:00,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:00,127 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:00,127 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:00,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:00,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:00,130 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:00,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:00,130 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:00,130 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:00,130 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:00,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:00,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:00,131 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:00,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:00,136 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:00,136 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:00,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:00,137 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:00,137 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:00,225 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:00,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:00,225 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:00,225 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 02:21:00,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:00,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:00,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1500 [2022-12-13 02:21:00,225 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:21:00,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:00,226 INFO L85 PathProgramCache]: Analyzing trace with hash 121878522, now seen corresponding path program 1 times [2022-12-13 02:21:00,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:00,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641848342] [2022-12-13 02:21:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:00,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:00,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:21:00,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:00,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641848342] [2022-12-13 02:21:00,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641848342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:00,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:00,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:00,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384002846] [2022-12-13 02:21:00,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:00,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:00,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:00,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:00,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:00,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:00,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:00,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:00,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:00,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:00,338 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:00,338 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:00,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:00,339 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:00,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:00,340 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:00,340 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:00,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:00,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:00,342 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:00,342 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:00,342 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:00,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:00,343 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:00,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:00,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:00,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:00,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:00,349 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:00,349 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:00,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:00,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:00,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:00,436 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:00,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:00,436 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:00,436 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 02:21:00,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:00,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:00,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1501 [2022-12-13 02:21:00,436 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:21:00,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash 150507673, now seen corresponding path program 1 times [2022-12-13 02:21:00,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:00,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174488696] [2022-12-13 02:21:00,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:00,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:00,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:21:00,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:00,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174488696] [2022-12-13 02:21:00,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174488696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:00,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:00,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300395682] [2022-12-13 02:21:00,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:00,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:00,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:00,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:00,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:00,488 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:00,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:00,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:00,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:00,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:00,573 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:00,573 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:00,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:00,574 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:00,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:00,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:00,575 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:00,575 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:00,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:00,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:00,577 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:00,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:00,577 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:00,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:00,577 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:00,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:00,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:00,578 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:00,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:00,583 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:00,583 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:00,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:00,584 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:00,584 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:00,671 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:00,672 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:00,672 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:00,672 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 02:21:00,672 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:00,672 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:00,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1502 [2022-12-13 02:21:00,672 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:21:00,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash 179136824, now seen corresponding path program 1 times [2022-12-13 02:21:00,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:00,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100302474] [2022-12-13 02:21:00,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:00,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:00,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:21:00,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:00,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100302474] [2022-12-13 02:21:00,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100302474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:00,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:00,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:00,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693530417] [2022-12-13 02:21:00,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:00,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:00,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:00,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:00,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:00,737 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:00,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:00,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:00,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:00,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:00,806 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:00,806 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:00,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:00,807 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:00,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:00,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:00,808 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:00,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:00,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:00,810 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:00,810 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:00,811 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:00,811 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:00,811 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:00,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:00,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:00,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:00,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:00,816 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:00,817 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:00,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:00,817 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:00,817 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:00,904 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:00,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:00,905 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:00,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:00,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:00,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:00,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1503 [2022-12-13 02:21:00,905 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:21:00,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash 207765975, now seen corresponding path program 1 times [2022-12-13 02:21:00,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:00,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252438131] [2022-12-13 02:21:00,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:00,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:00,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:21:00,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:00,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252438131] [2022-12-13 02:21:00,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252438131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:00,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:00,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:00,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457892778] [2022-12-13 02:21:00,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:00,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:00,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:00,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:00,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:00,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:00,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:00,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:00,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:01,017 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:01,017 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:01,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:01,018 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:01,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:01,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:01,019 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:01,019 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:01,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:01,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:01,021 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,021 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:01,021 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:01,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:01,022 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:01,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:01,022 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:01,027 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:01,027 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:01,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:01,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:01,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:01,113 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:01,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:21:01,113 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:01,113 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 02:21:01,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:01,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:01,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1504 [2022-12-13 02:21:01,113 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:21:01,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:01,113 INFO L85 PathProgramCache]: Analyzing trace with hash 236395126, now seen corresponding path program 1 times [2022-12-13 02:21:01,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:01,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616274599] [2022-12-13 02:21:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:01,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:21:01,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:01,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616274599] [2022-12-13 02:21:01,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616274599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:01,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:01,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:01,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788405935] [2022-12-13 02:21:01,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:01,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:01,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:01,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:01,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:01,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:01,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:01,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:01,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:01,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:01,247 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:01,247 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:01,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:01,248 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:01,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:01,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:01,249 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:01,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:01,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:01,251 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,251 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:01,251 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:01,251 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:01,251 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,252 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:01,252 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:01,252 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:01,257 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:01,257 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:21:01,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:01,258 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:01,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:01,343 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:01,343 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:21:01,343 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:01,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:01,344 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:01,344 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:01,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1505 [2022-12-13 02:21:01,344 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:21:01,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash 265024277, now seen corresponding path program 1 times [2022-12-13 02:21:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:01,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926407862] [2022-12-13 02:21:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:01,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:21:01,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:01,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926407862] [2022-12-13 02:21:01,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926407862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:01,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:01,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:01,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980605254] [2022-12-13 02:21:01,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:01,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:01,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:01,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:01,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:01,394 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:01,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:01,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:01,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:01,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:01,475 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:01,475 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:01,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:01,476 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:01,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:01,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:01,477 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:01,477 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:01,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:01,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:01,479 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,479 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:01,479 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:01,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:01,480 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,480 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:01,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:01,480 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:01,486 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:01,486 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:21:01,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:01,486 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:01,486 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:01,573 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:01,573 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:01,573 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:01,573 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 02:21:01,573 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:01,573 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:01,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1506 [2022-12-13 02:21:01,573 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:21:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:01,574 INFO L85 PathProgramCache]: Analyzing trace with hash 293653428, now seen corresponding path program 1 times [2022-12-13 02:21:01,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:01,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341503416] [2022-12-13 02:21:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:01,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:01,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:21:01,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:01,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341503416] [2022-12-13 02:21:01,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341503416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:01,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:01,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:01,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855761450] [2022-12-13 02:21:01,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:01,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:01,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:01,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:01,633 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:01,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:01,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:01,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:01,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:01,709 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:01,709 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:01,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:01,710 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:01,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:01,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:01,710 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:01,710 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:01,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:01,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:01,713 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,713 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:01,713 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:01,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:01,713 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:01,713 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:01,713 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:01,719 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:01,719 INFO L131 PetriNetUnfolder]: For 435/453 co-relation queries the response was YES. [2022-12-13 02:21:01,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/453 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:01,720 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:01,720 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:01,808 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:01,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:01,809 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:01,809 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 02:21:01,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:01,809 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:01,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1507 [2022-12-13 02:21:01,809 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:21:01,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:01,809 INFO L85 PathProgramCache]: Analyzing trace with hash 322282579, now seen corresponding path program 1 times [2022-12-13 02:21:01,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:01,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181645857] [2022-12-13 02:21:01,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:01,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:01,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:21:01,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:01,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181645857] [2022-12-13 02:21:01,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181645857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:01,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:01,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:01,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27622359] [2022-12-13 02:21:01,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:01,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:01,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:01,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:01,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:01,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:01,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:01,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:01,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:01,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:01,924 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:01,924 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:01,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:01,925 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:01,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:01,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:01,925 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:01,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:01,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:01,928 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,928 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:01,928 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:01,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:01,928 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,929 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:01,929 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:01,929 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:01,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:01,934 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:01,934 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:01,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:01,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:01,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:02,022 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:02,022 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:02,022 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:02,022 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 02:21:02,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:02,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:02,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1508 [2022-12-13 02:21:02,022 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:21:02,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:02,023 INFO L85 PathProgramCache]: Analyzing trace with hash 350911730, now seen corresponding path program 1 times [2022-12-13 02:21:02,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:02,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963861304] [2022-12-13 02:21:02,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:02,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:02,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:21:02,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:02,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963861304] [2022-12-13 02:21:02,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963861304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:02,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:02,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:02,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834298901] [2022-12-13 02:21:02,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:02,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:02,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:02,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:02,074 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:02,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:02,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:02,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:02,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:02,140 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:02,140 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:02,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1095 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:02,141 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:02,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:02,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:02,141 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:02,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:02,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:02,144 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:02,144 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:02,144 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:02,144 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:02,144 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:02,144 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:02,145 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:02,145 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:02,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:02,150 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:02,150 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:02,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:02,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:02,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:02,237 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:02,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:02,237 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:02,237 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 02:21:02,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:02,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:02,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1509 [2022-12-13 02:21:02,238 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:21:02,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:02,238 INFO L85 PathProgramCache]: Analyzing trace with hash 379540881, now seen corresponding path program 1 times [2022-12-13 02:21:02,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:02,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379942427] [2022-12-13 02:21:02,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:02,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:21:02,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:02,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379942427] [2022-12-13 02:21:02,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379942427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:02,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:02,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:02,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929152084] [2022-12-13 02:21:02,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:02,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:02,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:02,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:02,290 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:02,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:02,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:02,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:02,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:02,366 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:02,366 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:02,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:02,367 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:02,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:02,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:02,368 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:02,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:02,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:02,370 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:02,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:02,371 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:02,371 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:02,371 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:02,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:02,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:02,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:02,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:02,376 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:02,377 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:02,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:02,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:02,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:02,463 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:02,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:21:02,463 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:02,463 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 02:21:02,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:02,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:02,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1510 [2022-12-13 02:21:02,464 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:21:02,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:02,464 INFO L85 PathProgramCache]: Analyzing trace with hash 408170032, now seen corresponding path program 1 times [2022-12-13 02:21:02,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:02,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640504166] [2022-12-13 02:21:02,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:02,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:02,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:21:02,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:02,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640504166] [2022-12-13 02:21:02,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640504166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:02,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:02,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456875197] [2022-12-13 02:21:02,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:02,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:02,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:02,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:02,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:02,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:02,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:02,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:02,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:02,615 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:02,615 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:02,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:02,616 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:02,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:02,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:02,617 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:02,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:02,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:02,619 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:02,619 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:02,620 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:02,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:02,620 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:02,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:02,620 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:02,620 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:02,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:02,626 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:02,626 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:02,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:02,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:02,626 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:02,713 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:02,713 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:02,713 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:02,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:02,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:02,713 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:02,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1511 [2022-12-13 02:21:02,713 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:21:02,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:02,714 INFO L85 PathProgramCache]: Analyzing trace with hash 436799183, now seen corresponding path program 1 times [2022-12-13 02:21:02,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:02,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766293634] [2022-12-13 02:21:02,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:02,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:02,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:21:02,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:02,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766293634] [2022-12-13 02:21:02,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766293634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:02,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:02,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:02,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959212114] [2022-12-13 02:21:02,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:02,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:02,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:02,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:02,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:02,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:02,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:02,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:02,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:02,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:02,830 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:02,830 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:02,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:02,831 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:02,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:02,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:02,832 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:02,832 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:02,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:02,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:02,834 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:02,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:02,835 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:02,835 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:02,835 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:02,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:02,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:02,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:02,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:02,841 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:02,841 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:02,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:02,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:02,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:02,928 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:02,928 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:02,928 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:02,928 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 02:21:02,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:02,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:02,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1512 [2022-12-13 02:21:02,928 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:21:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash 465428334, now seen corresponding path program 1 times [2022-12-13 02:21:02,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:02,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395569265] [2022-12-13 02:21:02,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:02,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:02,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:21:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:02,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395569265] [2022-12-13 02:21:02,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395569265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:02,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:02,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637538006] [2022-12-13 02:21:02,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:02,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:02,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:02,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:02,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:02,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:02,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:02,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:02,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:02,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:03,050 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:03,051 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:03,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:03,052 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:03,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:03,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:03,052 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:03,052 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:03,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:03,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:03,055 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,055 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:03,055 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:03,055 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:03,055 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:03,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:03,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:03,061 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:03,061 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:03,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:03,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:03,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:03,149 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:03,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:03,149 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:03,149 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 02:21:03,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:03,149 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:03,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1513 [2022-12-13 02:21:03,150 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:21:03,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:03,150 INFO L85 PathProgramCache]: Analyzing trace with hash 494057485, now seen corresponding path program 1 times [2022-12-13 02:21:03,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:03,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464290729] [2022-12-13 02:21:03,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:03,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:03,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:21:03,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:03,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464290729] [2022-12-13 02:21:03,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464290729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:03,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:03,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:03,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128138583] [2022-12-13 02:21:03,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:03,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:03,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:03,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:03,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:03,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:03,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:03,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:03,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:03,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:03,267 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:03,267 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:03,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:03,268 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:03,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:03,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:03,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:03,269 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:03,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:03,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:03,271 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:03,271 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:03,271 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:03,272 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:03,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:03,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:03,277 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:03,277 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:03,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:03,278 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:03,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:03,364 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:03,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:03,365 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:03,365 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 02:21:03,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:03,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:03,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1514 [2022-12-13 02:21:03,365 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:21:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash 522686636, now seen corresponding path program 1 times [2022-12-13 02:21:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:03,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112951780] [2022-12-13 02:21:03,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:03,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:03,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:21:03,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:03,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112951780] [2022-12-13 02:21:03,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112951780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:03,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:03,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:03,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309961768] [2022-12-13 02:21:03,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:03,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:03,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:03,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:03,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:03,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:03,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:03,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:03,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:03,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:03,482 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:03,482 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:03,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:03,483 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:03,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:03,484 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:03,484 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:03,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:03,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:03,486 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,486 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:03,486 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:03,486 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:03,487 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:03,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:03,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:03,492 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:03,492 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:03,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:03,493 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:03,493 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:03,581 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:03,581 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:03,581 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:03,581 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 02:21:03,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:03,581 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:03,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1515 [2022-12-13 02:21:03,581 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:21:03,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:03,582 INFO L85 PathProgramCache]: Analyzing trace with hash 551315787, now seen corresponding path program 1 times [2022-12-13 02:21:03,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:03,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728405047] [2022-12-13 02:21:03,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:03,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:03,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:21:03,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:03,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728405047] [2022-12-13 02:21:03,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728405047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:03,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:03,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:03,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119655230] [2022-12-13 02:21:03,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:03,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:03,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:03,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:03,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:03,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:03,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:03,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:03,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:03,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:03,714 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:03,714 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:03,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:03,715 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:03,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:03,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:03,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:03,716 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:03,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:03,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:03,718 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,718 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:03,718 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:03,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:03,719 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:03,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:03,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:03,724 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:03,724 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:03,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:03,725 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:03,725 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:03,812 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:03,812 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:03,812 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:03,812 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 02:21:03,812 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:03,812 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:03,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1516 [2022-12-13 02:21:03,812 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:21:03,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:03,813 INFO L85 PathProgramCache]: Analyzing trace with hash 579944938, now seen corresponding path program 1 times [2022-12-13 02:21:03,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:03,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748577357] [2022-12-13 02:21:03,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:03,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:03,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:21:03,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:03,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748577357] [2022-12-13 02:21:03,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748577357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:03,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:03,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:03,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099531518] [2022-12-13 02:21:03,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:03,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:03,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:03,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:03,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:03,864 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:03,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:03,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:03,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:03,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:03,941 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:03,942 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:03,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:03,943 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:03,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:03,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:03,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:03,943 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:03,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:03,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:03,946 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:03,946 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:03,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:03,946 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,946 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:03,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:03,946 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:03,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:03,952 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:03,952 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:03,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:03,952 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:03,952 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:04,039 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:04,039 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:04,039 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:04,040 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 02:21:04,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:04,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:04,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1517 [2022-12-13 02:21:04,040 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:21:04,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash 608574089, now seen corresponding path program 1 times [2022-12-13 02:21:04,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:04,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766750538] [2022-12-13 02:21:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:04,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:04,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:21:04,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:04,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766750538] [2022-12-13 02:21:04,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766750538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:04,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:04,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:04,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665521957] [2022-12-13 02:21:04,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:04,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:04,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:04,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:04,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:04,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:04,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:04,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:04,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:04,173 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:04,174 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:04,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:04,175 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:04,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:04,175 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:04,175 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:04,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:04,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:04,178 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:04,178 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:04,178 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:04,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:04,178 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:04,178 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:04,178 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:04,178 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:04,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:04,184 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:04,184 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:04,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:04,185 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:04,185 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:04,271 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:04,272 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:04,272 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:04,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:04,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:04,272 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:04,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1518 [2022-12-13 02:21:04,272 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:21:04,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash 637203240, now seen corresponding path program 1 times [2022-12-13 02:21:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:04,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397299027] [2022-12-13 02:21:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:04,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:21:04,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:04,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397299027] [2022-12-13 02:21:04,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397299027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:04,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:04,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:04,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032634621] [2022-12-13 02:21:04,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:04,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:04,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:04,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:04,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:04,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:04,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:04,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:04,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:04,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:04,423 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:04,423 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:04,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:04,424 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:04,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:04,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:04,425 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:04,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:04,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:04,427 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:04,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:04,428 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:04,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:04,428 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:04,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:04,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:04,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:04,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:04,433 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:04,434 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:04,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:04,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:04,434 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:04,522 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:04,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:04,522 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:04,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:04,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:04,522 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:04,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1519 [2022-12-13 02:21:04,523 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:21:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash 665832391, now seen corresponding path program 1 times [2022-12-13 02:21:04,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:04,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494196819] [2022-12-13 02:21:04,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:04,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:04,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:21:04,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:04,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494196819] [2022-12-13 02:21:04,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494196819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:04,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:04,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:04,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722685321] [2022-12-13 02:21:04,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:04,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:04,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:04,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:04,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:04,573 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:04,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:04,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:04,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:04,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:04,648 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:04,648 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:04,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:04,649 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:04,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:04,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:04,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:04,650 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:04,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:04,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:04,652 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:04,652 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:04,652 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:04,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:04,652 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:04,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:04,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:04,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:04,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:04,667 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:04,667 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:04,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:04,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:04,667 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:04,753 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:04,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:21:04,754 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:04,754 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 02:21:04,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:04,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:04,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1520 [2022-12-13 02:21:04,754 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:21:04,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:04,754 INFO L85 PathProgramCache]: Analyzing trace with hash 694461542, now seen corresponding path program 1 times [2022-12-13 02:21:04,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:04,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369918304] [2022-12-13 02:21:04,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:04,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:04,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:21:04,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:04,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369918304] [2022-12-13 02:21:04,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369918304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:04,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:04,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:04,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845155318] [2022-12-13 02:21:04,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:04,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:04,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:04,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:04,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:04,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:04,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:04,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:04,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:04,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:04,870 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:04,870 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:04,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:04,871 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:04,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:04,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:04,872 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:04,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:04,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:04,874 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:04,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:04,874 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:04,875 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:04,875 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:04,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:04,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:04,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:04,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:04,880 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:04,881 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:04,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:04,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:04,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:04,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:04,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:04,970 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:04,970 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 02:21:04,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:04,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:04,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1521 [2022-12-13 02:21:04,970 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:21:04,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:04,970 INFO L85 PathProgramCache]: Analyzing trace with hash 723090693, now seen corresponding path program 1 times [2022-12-13 02:21:04,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:04,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225638365] [2022-12-13 02:21:04,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:04,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:05,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:21:05,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:05,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225638365] [2022-12-13 02:21:05,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225638365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:05,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:05,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:05,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637182505] [2022-12-13 02:21:05,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:05,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:05,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:05,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:05,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:05,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:05,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:05,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:05,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:05,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:05,085 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:05,085 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:05,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:05,086 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:05,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:05,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:05,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:05,087 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:05,087 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:05,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:05,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:05,089 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,089 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:05,089 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:05,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:05,089 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,090 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:05,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:05,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:05,095 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:05,095 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:05,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:05,096 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:05,096 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:05,183 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:05,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:05,184 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:05,184 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 02:21:05,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:05,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:05,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1522 [2022-12-13 02:21:05,184 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:21:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash 751719844, now seen corresponding path program 1 times [2022-12-13 02:21:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:05,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373415645] [2022-12-13 02:21:05,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:05,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:05,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:21:05,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:05,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373415645] [2022-12-13 02:21:05,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373415645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:05,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:05,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:05,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210103253] [2022-12-13 02:21:05,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:05,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:05,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:05,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:05,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:05,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:05,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:05,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:05,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:05,309 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:05,309 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:05,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:05,310 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:05,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:05,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:05,310 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:05,310 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:05,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:05,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:05,313 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,313 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:05,313 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:05,313 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:05,313 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,314 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:05,314 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:05,314 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:05,319 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:05,319 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:05,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:05,320 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:05,320 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:05,406 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:05,406 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:05,407 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:05,407 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 02:21:05,407 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:05,407 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:05,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1523 [2022-12-13 02:21:05,407 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:21:05,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:05,407 INFO L85 PathProgramCache]: Analyzing trace with hash 780348995, now seen corresponding path program 1 times [2022-12-13 02:21:05,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:05,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498527075] [2022-12-13 02:21:05,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:05,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:05,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 02:21:05,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:05,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498527075] [2022-12-13 02:21:05,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498527075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:05,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:05,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:05,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129782059] [2022-12-13 02:21:05,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:05,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:05,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:05,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:05,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:05,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:05,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:05,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:05,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:05,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:05,522 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:05,523 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:05,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:05,524 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:05,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:05,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:05,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:05,524 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:05,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:05,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:05,527 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,527 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:05,527 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:05,527 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:05,527 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,527 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:05,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:05,527 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:05,533 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:05,533 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:05,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:05,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:05,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:05,620 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:05,621 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:05,621 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:05,621 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 02:21:05,621 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:05,621 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:05,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1524 [2022-12-13 02:21:05,621 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:21:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:05,621 INFO L85 PathProgramCache]: Analyzing trace with hash 808978146, now seen corresponding path program 1 times [2022-12-13 02:21:05,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:05,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54002773] [2022-12-13 02:21:05,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:05,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:05,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:21:05,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:05,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54002773] [2022-12-13 02:21:05,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54002773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:05,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:05,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:05,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121827177] [2022-12-13 02:21:05,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:05,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:05,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:05,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:05,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:05,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:05,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:05,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:05,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:05,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:05,749 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:05,750 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:05,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:05,751 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:05,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:05,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:05,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:05,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:05,751 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:05,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:05,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:05,754 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,754 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:05,754 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:05,754 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:05,754 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,754 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:05,754 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:05,754 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:05,760 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:05,760 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:21:05,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:05,760 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:05,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:05,848 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:05,848 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:05,848 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:05,848 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 02:21:05,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:05,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:05,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1525 [2022-12-13 02:21:05,848 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:21:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:05,849 INFO L85 PathProgramCache]: Analyzing trace with hash 837607297, now seen corresponding path program 1 times [2022-12-13 02:21:05,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:05,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825364042] [2022-12-13 02:21:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:05,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:05,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:21:05,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:05,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825364042] [2022-12-13 02:21:05,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825364042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:05,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:05,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:05,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343434249] [2022-12-13 02:21:05,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:05,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:05,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:05,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:05,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:05,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:05,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:05,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:05,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:05,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:05,964 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:05,964 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:05,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:05,965 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:05,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:05,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:05,965 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:05,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:05,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:05,968 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,968 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:05,968 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:05,968 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:05,968 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,968 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:05,968 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:05,968 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:05,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:05,974 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:05,974 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:05,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:05,974 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:05,974 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:06,068 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:06,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:21:06,069 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:06,069 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 02:21:06,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:06,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:06,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1526 [2022-12-13 02:21:06,069 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:21:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:06,069 INFO L85 PathProgramCache]: Analyzing trace with hash 866236448, now seen corresponding path program 1 times [2022-12-13 02:21:06,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:06,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246789514] [2022-12-13 02:21:06,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:06,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:06,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:21:06,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:06,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246789514] [2022-12-13 02:21:06,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246789514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:06,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:06,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445607495] [2022-12-13 02:21:06,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:06,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:06,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:06,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:06,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:06,125 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:06,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:06,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:06,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:06,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:06,191 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:06,191 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:06,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:06,192 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:06,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:06,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:06,192 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:06,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:06,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:06,195 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:06,195 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:06,195 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:06,195 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:06,195 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:06,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:06,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:06,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:06,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:06,201 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:06,201 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:06,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:06,202 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:06,202 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:06,287 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:06,288 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:06,288 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:06,288 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 02:21:06,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:06,288 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:06,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1527 [2022-12-13 02:21:06,288 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:21:06,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:06,288 INFO L85 PathProgramCache]: Analyzing trace with hash 894865599, now seen corresponding path program 1 times [2022-12-13 02:21:06,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:06,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509436315] [2022-12-13 02:21:06,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:06,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21: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:21:06,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:06,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509436315] [2022-12-13 02:21:06,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509436315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:06,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:06,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:06,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141994633] [2022-12-13 02:21:06,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:06,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:06,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:06,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:06,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:06,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:06,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:06,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:06,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:06,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:06,416 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:06,416 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:06,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:06,417 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:06,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:06,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:06,418 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:06,418 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:06,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:06,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:06,420 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:06,420 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:06,421 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:06,421 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:06,421 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:06,421 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:06,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:06,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:06,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:06,426 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:06,427 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:06,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:06,427 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:06,427 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:06,515 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:06,516 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:06,516 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:06,516 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 02:21:06,516 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:06,516 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:06,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1528 [2022-12-13 02:21:06,516 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:21:06,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash 923494750, now seen corresponding path program 1 times [2022-12-13 02:21:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:06,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405392286] [2022-12-13 02:21:06,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:06,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:06,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:21:06,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:06,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405392286] [2022-12-13 02:21:06,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405392286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:06,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:06,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:06,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143246402] [2022-12-13 02:21:06,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:06,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:06,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:06,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:06,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:06,568 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:06,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:06,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:06,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:06,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:06,635 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:06,635 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:06,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:06,636 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:06,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:06,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:06,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:06,637 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:06,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:06,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:06,639 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:06,639 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:06,639 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:06,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:06,639 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:06,640 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:06,640 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:06,640 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:06,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:06,645 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:06,645 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:06,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:06,646 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:06,646 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:06,734 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:06,734 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:06,735 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:06,735 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 02:21:06,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:06,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:06,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1529 [2022-12-13 02:21:06,735 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:21:06,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:06,735 INFO L85 PathProgramCache]: Analyzing trace with hash 952123901, now seen corresponding path program 1 times [2022-12-13 02:21:06,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:06,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201397460] [2022-12-13 02:21:06,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:06,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:06,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:21:06,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:06,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201397460] [2022-12-13 02:21:06,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201397460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:06,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:06,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:06,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369839880] [2022-12-13 02:21:06,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:06,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:06,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:06,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:06,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:06,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:06,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:06,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:06,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:06,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:06,864 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:06,864 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:06,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:06,866 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:06,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:06,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:06,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:06,866 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:06,866 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:06,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:06,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:06,869 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:06,869 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:06,869 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:06,869 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:06,869 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:06,869 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:06,869 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:06,869 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:06,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:06,876 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:06,876 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:06,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:06,876 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:06,876 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:06,965 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:06,965 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:06,965 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:06,965 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 02:21:06,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:06,965 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:06,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1530 [2022-12-13 02:21:06,966 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:21:06,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:06,966 INFO L85 PathProgramCache]: Analyzing trace with hash 980753052, now seen corresponding path program 1 times [2022-12-13 02:21:06,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:06,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114907843] [2022-12-13 02:21:06,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:06,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:07,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:21:07,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:07,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114907843] [2022-12-13 02:21:07,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114907843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:07,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:07,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:07,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306077752] [2022-12-13 02:21:07,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:07,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:07,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:07,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:07,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:07,018 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:07,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:07,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:07,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:07,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:07,084 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:07,084 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:07,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1134 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:07,085 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:07,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:07,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:07,085 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:07,086 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:07,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:07,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:07,088 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:07,088 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:07,088 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:07,088 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:07,088 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:07,089 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:07,089 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:07,089 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:07,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:07,094 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:07,094 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:21:07,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:07,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:07,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:07,181 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:07,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:07,181 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:07,181 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 02:21:07,181 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:07,181 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:07,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1531 [2022-12-13 02:21:07,182 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:21:07,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:07,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1009382203, now seen corresponding path program 1 times [2022-12-13 02:21:07,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:07,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011450285] [2022-12-13 02:21:07,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:07,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:07,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:21:07,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:07,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011450285] [2022-12-13 02:21:07,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011450285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:07,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:07,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:07,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967489179] [2022-12-13 02:21:07,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:07,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:07,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:07,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:07,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:07,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:07,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:07,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:07,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:07,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:07,310 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:07,310 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:07,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:07,311 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:07,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:07,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:07,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:07,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:07,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:07,312 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:07,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:07,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:07,314 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:07,314 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:07,314 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:07,314 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:07,314 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:07,315 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:07,315 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:07,315 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:07,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:07,320 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:07,320 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:07,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:07,321 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:07,321 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:07,409 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:07,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:07,409 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:07,409 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 02:21:07,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:07,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:07,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1532 [2022-12-13 02:21:07,410 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:21:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:07,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1038011354, now seen corresponding path program 1 times [2022-12-13 02:21:07,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:07,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981420667] [2022-12-13 02:21:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:07,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:07,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:21:07,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:07,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981420667] [2022-12-13 02:21:07,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981420667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:07,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:07,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:07,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678431400] [2022-12-13 02:21:07,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:07,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:07,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:07,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:07,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:07,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:07,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:07,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:07,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:07,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:07,537 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:07,538 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:07,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:07,539 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:07,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:07,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:07,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:07,539 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:07,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:07,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:07,542 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:07,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:07,542 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:07,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:07,542 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:07,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:07,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:07,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:07,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:07,548 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:07,548 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:07,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:07,549 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:07,549 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:07,637 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:07,637 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:07,637 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:07,637 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 02:21:07,637 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:07,637 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:07,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1533 [2022-12-13 02:21:07,637 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:21:07,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:07,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1066640505, now seen corresponding path program 1 times [2022-12-13 02:21:07,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:07,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731829942] [2022-12-13 02:21:07,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:07,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:07,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:21:07,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:07,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731829942] [2022-12-13 02:21:07,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731829942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:07,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:07,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140454349] [2022-12-13 02:21:07,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:07,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:07,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:07,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:07,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:07,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:07,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:07,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:07,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:07,754 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:07,754 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:07,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:07,755 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:07,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:07,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:07,756 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:07,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:07,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:07,758 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:07,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:07,759 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:07,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:07,759 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:07,759 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:07,759 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:07,759 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:07,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:07,765 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:07,765 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:07,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:07,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:07,766 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:07,861 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:07,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:21:07,862 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:07,862 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 02:21:07,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:07,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:07,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1534 [2022-12-13 02:21:07,862 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:21:07,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:07,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1095269656, now seen corresponding path program 1 times [2022-12-13 02:21:07,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:07,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739829868] [2022-12-13 02:21:07,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:07,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:07,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:21:07,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:07,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739829868] [2022-12-13 02:21:07,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739829868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:07,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:07,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:07,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353659475] [2022-12-13 02:21:07,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:07,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:07,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:07,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:07,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:07,912 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:07,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:07,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:07,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:07,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:07,997 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:07,997 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:07,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:07,998 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:07,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:07,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:07,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:07,999 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:07,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:08,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:08,001 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:08,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:08,001 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:08,002 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:08,002 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:08,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:08,002 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:08,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:08,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:08,007 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:08,007 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:08,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:08,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:08,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:08,095 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:08,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:08,096 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:08,096 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 02:21:08,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:08,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:08,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1535 [2022-12-13 02:21:08,096 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:21:08,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1123898807, now seen corresponding path program 1 times [2022-12-13 02:21:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:08,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433366748] [2022-12-13 02:21:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21: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:21:08,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:08,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433366748] [2022-12-13 02:21:08,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433366748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:08,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:08,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:08,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289343645] [2022-12-13 02:21:08,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:08,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:08,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:08,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:08,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:08,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:08,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:08,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:08,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:08,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:08,253 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:08,253 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:08,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:08,254 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:08,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:08,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:08,255 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:08,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:08,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:08,259 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:08,259 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:08,259 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:08,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:08,259 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:08,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:08,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:08,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:08,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:08,268 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:08,268 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:08,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:08,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:08,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:08,374 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:08,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:21:08,375 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:08,375 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 02:21:08,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:08,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:08,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1536 [2022-12-13 02:21:08,375 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:21:08,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1152527958, now seen corresponding path program 1 times [2022-12-13 02:21:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:08,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93666923] [2022-12-13 02:21:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:08,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:21:08,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:08,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93666923] [2022-12-13 02:21:08,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93666923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:08,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:08,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:08,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290690937] [2022-12-13 02:21:08,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:08,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:08,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:08,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:08,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:08,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:08,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:08,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:08,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:08,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:08,528 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:08,528 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:08,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:08,529 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:08,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:08,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:08,530 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:08,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:08,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:08,534 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:08,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:08,534 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:08,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:08,534 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:08,534 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:08,534 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:08,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:08,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:08,542 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:08,543 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:08,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:08,543 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:08,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:08,652 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:08,652 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:21:08,652 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:08,652 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 02:21:08,652 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:08,652 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:08,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1537 [2022-12-13 02:21:08,653 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:21:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1181157109, now seen corresponding path program 1 times [2022-12-13 02:21:08,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:08,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495975022] [2022-12-13 02:21:08,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:08,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:08,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:21:08,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:08,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495975022] [2022-12-13 02:21:08,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495975022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:08,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:08,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:08,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67208688] [2022-12-13 02:21:08,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:08,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:08,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:08,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:08,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:08,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:08,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:08,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:08,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:08,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:08,780 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:08,780 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:08,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:08,781 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:08,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:08,782 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:08,782 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:08,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:08,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:08,785 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:08,785 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:08,785 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:08,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:08,785 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:08,785 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:08,785 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:08,785 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:08,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:08,791 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:08,791 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:08,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:08,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:08,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:08,879 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:08,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:08,880 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:08,880 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 02:21:08,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:08,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:08,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1538 [2022-12-13 02:21:08,880 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:21:08,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:08,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1209786260, now seen corresponding path program 1 times [2022-12-13 02:21:08,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:08,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467824278] [2022-12-13 02:21:08,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:08,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:08,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:21:08,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:08,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467824278] [2022-12-13 02:21:08,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467824278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:08,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:08,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:08,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638670407] [2022-12-13 02:21:08,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:08,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:08,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:08,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:08,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:08,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:08,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:08,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:08,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:09,013 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:09,013 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:09,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:09,014 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:09,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:09,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:09,015 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:09,015 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:09,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:09,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:09,017 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,017 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:09,017 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:09,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:09,018 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,018 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:09,018 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:09,018 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:09,023 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:09,023 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:09,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:09,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:09,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:09,110 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:09,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:09,110 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:09,110 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 02:21:09,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:09,110 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:09,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1539 [2022-12-13 02:21:09,111 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:21:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:09,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1238415411, now seen corresponding path program 1 times [2022-12-13 02:21:09,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:09,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898687672] [2022-12-13 02:21:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:09,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:21:09,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:09,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898687672] [2022-12-13 02:21:09,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898687672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:09,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:09,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:09,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490629493] [2022-12-13 02:21:09,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:09,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:09,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:09,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:09,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:09,162 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:09,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:09,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:09,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:09,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:09,228 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:09,228 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:09,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:09,229 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:09,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:09,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:09,230 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:09,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:09,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:09,232 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,232 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:09,232 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:09,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:09,232 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:09,233 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:09,233 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:09,238 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:09,238 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:09,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:09,239 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:09,239 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:09,325 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:09,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:09,326 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:09,326 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 02:21:09,326 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:09,326 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:09,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1540 [2022-12-13 02:21:09,326 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:21:09,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:09,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1267044562, now seen corresponding path program 1 times [2022-12-13 02:21:09,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:09,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661502421] [2022-12-13 02:21:09,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:09,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:09,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:21:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:09,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661502421] [2022-12-13 02:21:09,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661502421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:09,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:09,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:09,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466633650] [2022-12-13 02:21:09,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:09,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:09,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:09,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:09,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:09,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:09,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:09,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:09,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:09,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:09,449 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:09,449 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:09,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:09,450 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:09,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:09,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:09,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:09,450 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:09,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:09,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:09,453 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,453 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:09,453 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:09,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:09,453 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:09,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:09,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:09,459 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:09,459 INFO L131 PetriNetUnfolder]: For 435/453 co-relation queries the response was YES. [2022-12-13 02:21:09,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/453 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:09,459 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:09,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:09,545 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:09,545 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:21:09,545 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:09,545 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 02:21:09,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:09,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:09,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1541 [2022-12-13 02:21:09,546 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:21:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:09,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1295673713, now seen corresponding path program 1 times [2022-12-13 02:21:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:09,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97488129] [2022-12-13 02:21:09,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:09,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:09,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:21:09,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:09,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97488129] [2022-12-13 02:21:09,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97488129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:09,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:09,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:09,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391112613] [2022-12-13 02:21:09,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:09,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:09,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:09,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:09,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:09,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:09,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:09,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:09,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:09,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:09,667 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:09,668 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:09,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1127 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:09,669 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:09,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:09,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:09,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:09,669 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:09,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:09,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:09,671 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,671 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:09,672 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:09,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:09,672 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,672 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:09,672 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:09,672 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:09,677 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:09,677 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:21:09,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:09,678 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:09,678 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:09,763 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:09,763 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:21:09,763 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:09,763 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 02:21:09,764 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:09,764 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:09,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1542 [2022-12-13 02:21:09,764 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:21:09,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1324302864, now seen corresponding path program 1 times [2022-12-13 02:21:09,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:09,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397761918] [2022-12-13 02:21:09,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:09,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:09,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:21:09,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:09,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397761918] [2022-12-13 02:21:09,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397761918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:09,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:09,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:09,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836573960] [2022-12-13 02:21:09,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:09,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:09,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:09,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:09,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:09,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:09,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:09,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:09,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:09,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:09,885 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:09,885 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:09,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:09,886 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:09,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:09,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:09,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:09,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:09,887 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:09,887 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:09,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:09,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:09,889 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:09,889 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:09,889 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:09,889 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,890 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:09,890 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:09,890 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:09,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:09,895 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:09,895 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:09,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:09,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:09,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:09,980 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:09,981 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:21:09,981 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:09,981 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 02:21:09,981 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:09,981 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:09,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1543 [2022-12-13 02:21:09,981 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:21:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1352932015, now seen corresponding path program 1 times [2022-12-13 02:21:09,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:09,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461909115] [2022-12-13 02:21:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:09,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21: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 02:21:10,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:10,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461909115] [2022-12-13 02:21:10,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461909115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:10,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:10,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:10,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965169580] [2022-12-13 02:21:10,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:10,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:10,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:10,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:10,042 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:10,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:10,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:10,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:10,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:10,122 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:10,122 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:10,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:10,123 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:10,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:10,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:10,124 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:10,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:10,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:10,126 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,126 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:10,126 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:10,127 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:10,127 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,127 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:10,127 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:10,127 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:10,132 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:10,132 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:10,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:10,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:10,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:10,219 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:10,219 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:21:10,219 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:10,219 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 02:21:10,219 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:10,219 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:10,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1544 [2022-12-13 02:21:10,219 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:21:10,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1381561166, now seen corresponding path program 1 times [2022-12-13 02:21:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:10,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741795398] [2022-12-13 02:21:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:10,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:21:10,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:10,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741795398] [2022-12-13 02:21:10,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741795398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:10,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:10,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:10,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271132793] [2022-12-13 02:21:10,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:10,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:10,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:10,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:10,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:10,270 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:10,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:10,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:10,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:10,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:10,336 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:10,336 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:10,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:10,337 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:10,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:10,337 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:10,338 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:10,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:10,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:10,340 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:10,340 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:10,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:10,340 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:10,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:10,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:10,346 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:10,346 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:10,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:10,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:10,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:10,433 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:10,434 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:10,434 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:10,434 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 02:21:10,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:10,434 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:10,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1545 [2022-12-13 02:21:10,434 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:21:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:10,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1410190317, now seen corresponding path program 1 times [2022-12-13 02:21:10,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:10,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256584357] [2022-12-13 02:21:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:10,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:10,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:21:10,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:10,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256584357] [2022-12-13 02:21:10,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256584357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:10,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:10,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:10,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833423693] [2022-12-13 02:21:10,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:10,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:10,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:10,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:10,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:10,486 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:10,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:10,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:10,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:10,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:10,553 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:10,553 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:10,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:10,554 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:10,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:10,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:10,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:10,554 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:10,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:10,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:10,557 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,557 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:10,557 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:10,557 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:10,557 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:10,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:10,557 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:10,563 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:10,563 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:10,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:10,563 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:10,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:10,650 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:10,650 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:10,650 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:10,650 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 02:21:10,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:10,651 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:10,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1546 [2022-12-13 02:21:10,651 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:21:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:10,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1438819468, now seen corresponding path program 1 times [2022-12-13 02:21:10,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:10,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973813814] [2022-12-13 02:21:10,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:10,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:10,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:21:10,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:10,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973813814] [2022-12-13 02:21:10,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973813814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:10,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:10,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:10,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460662535] [2022-12-13 02:21:10,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:10,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:10,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:10,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:10,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:10,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:10,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:10,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:10,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:10,765 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:10,765 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:10,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:10,766 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:10,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:10,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:10,767 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:10,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:10,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:10,769 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,769 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:10,769 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:10,770 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:10,770 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,770 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:10,770 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:10,770 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:10,775 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:10,775 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:10,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:10,776 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:10,776 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:10,863 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:10,863 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:10,863 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:10,863 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 02:21:10,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:10,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:10,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1547 [2022-12-13 02:21:10,863 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:21:10,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:10,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1467448619, now seen corresponding path program 1 times [2022-12-13 02:21:10,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:10,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039086825] [2022-12-13 02:21:10,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:10,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:10,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:21:10,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:10,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039086825] [2022-12-13 02:21:10,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039086825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:10,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:10,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105080487] [2022-12-13 02:21:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:10,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:10,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:10,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:10,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:10,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:10,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:10,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:10,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:10,978 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:10,978 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:10,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:10,979 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:10,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:10,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:10,980 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:10,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:10,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:10,982 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,982 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:10,982 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:10,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:10,982 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,983 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:10,983 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:10,983 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:10,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:10,988 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:10,988 INFO L131 PetriNetUnfolder]: For 435/444 co-relation queries the response was YES. [2022-12-13 02:21:10,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/444 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:10,989 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:10,989 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:11,077 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:11,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:11,078 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:11,078 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 02:21:11,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:11,085 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:11,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1548 [2022-12-13 02:21:11,086 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:21:11,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:11,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1496077770, now seen corresponding path program 1 times [2022-12-13 02:21:11,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:11,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857252959] [2022-12-13 02:21:11,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:11,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:11,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:21:11,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:11,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857252959] [2022-12-13 02:21:11,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857252959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:11,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:11,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:11,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168254960] [2022-12-13 02:21:11,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:11,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:11,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:11,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:11,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:11,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:11,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:11,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:11,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:11,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:11,231 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:11,231 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:11,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:11,232 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:11,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:11,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:11,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:11,233 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:11,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:11,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:11,235 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:11,236 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:11,236 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:11,236 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:11,236 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:11,236 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:11,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:11,236 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:11,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:11,242 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:11,242 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:11,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:11,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:11,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:11,330 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:11,330 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:11,330 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:11,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:11,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:11,330 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:11,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1549 [2022-12-13 02:21:11,330 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:21:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1524706921, now seen corresponding path program 1 times [2022-12-13 02:21:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:11,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509615162] [2022-12-13 02:21:11,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:11,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:11,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:21:11,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:11,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509615162] [2022-12-13 02:21:11,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509615162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:11,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:11,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:11,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824007753] [2022-12-13 02:21:11,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:11,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:11,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:11,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:11,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:11,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:11,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:11,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:11,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:11,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:11,444 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:11,444 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:11,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:11,445 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:11,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:11,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:11,445 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:11,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:11,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:11,448 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:11,448 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:11,448 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:11,448 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:11,448 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:11,448 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:11,448 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:11,448 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:11,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:11,454 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:11,454 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:11,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:11,454 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:11,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:11,542 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:11,542 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:11,542 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:11,542 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 02:21:11,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:11,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:11,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1550 [2022-12-13 02:21:11,543 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:21:11,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:11,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1553336072, now seen corresponding path program 1 times [2022-12-13 02:21:11,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:11,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895866681] [2022-12-13 02:21:11,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:11,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:11,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:21:11,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:11,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895866681] [2022-12-13 02:21:11,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895866681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:11,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:11,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:11,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516794603] [2022-12-13 02:21:11,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:11,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:11,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:11,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:11,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:11,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:11,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:11,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:11,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:11,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:11,658 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:11,658 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:11,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:11,659 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:11,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:11,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:11,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:11,660 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:11,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:11,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:11,662 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:11,662 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:11,662 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:11,662 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:11,662 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:11,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:11,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:11,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:11,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:11,668 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:11,668 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:11,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:11,669 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:11,669 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:11,756 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:11,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:11,756 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:11,756 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 02:21:11,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:11,756 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:11,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1551 [2022-12-13 02:21:11,756 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:21:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1581965223, now seen corresponding path program 1 times [2022-12-13 02:21:11,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:11,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202882363] [2022-12-13 02:21:11,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:11,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:11,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:21:11,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:11,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202882363] [2022-12-13 02:21:11,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202882363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:11,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:11,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:11,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560052439] [2022-12-13 02:21:11,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:11,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:11,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:11,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:11,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:11,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:11,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:11,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:11,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:11,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:11,871 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:11,872 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:11,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:11,873 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:11,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:11,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:11,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:11,873 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:11,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:11,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:11,876 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:11,876 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:11,876 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:11,876 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:11,876 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:11,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:11,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:11,876 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:11,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:11,882 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:11,882 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:11,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:11,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:11,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:11,970 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:11,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:11,971 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:11,971 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 02:21:11,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:11,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:11,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1552 [2022-12-13 02:21:11,971 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:21:11,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:11,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1610594374, now seen corresponding path program 1 times [2022-12-13 02:21:11,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:11,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318241142] [2022-12-13 02:21:11,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:12,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:21:12,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:12,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318241142] [2022-12-13 02:21:12,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318241142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:12,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:12,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:12,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940936017] [2022-12-13 02:21:12,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:12,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:12,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:12,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:12,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:12,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:12,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:12,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:12,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:12,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:12,110 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:12,110 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:12,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:12,111 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:12,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:12,112 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:12,112 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:12,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:12,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:12,114 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:12,114 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:12,114 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:12,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:12,114 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:12,115 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:12,115 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:12,115 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:12,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:12,120 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:12,120 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:12,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:12,121 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:12,121 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:12,208 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:12,208 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:12,208 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:12,208 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 02:21:12,208 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:12,208 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:12,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1553 [2022-12-13 02:21:12,209 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:21:12,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:12,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1639223525, now seen corresponding path program 1 times [2022-12-13 02:21:12,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:12,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072080130] [2022-12-13 02:21:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:12,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:12,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:21:12,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:12,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072080130] [2022-12-13 02:21:12,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072080130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:12,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:12,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:12,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036024607] [2022-12-13 02:21:12,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:12,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:12,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:12,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:12,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:12,275 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:12,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:12,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:12,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:12,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:12,343 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:12,343 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:12,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:12,344 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:12,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:12,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:12,345 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:12,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:12,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:12,347 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:12,348 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:12,348 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:12,348 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:12,348 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:12,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:12,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:12,348 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:12,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:12,353 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:12,354 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:12,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:12,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:12,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:12,442 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:12,442 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:12,442 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:12,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:12,442 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:12,442 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:12,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1554 [2022-12-13 02:21:12,442 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:21:12,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:12,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1667852676, now seen corresponding path program 1 times [2022-12-13 02:21:12,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:12,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097239074] [2022-12-13 02:21:12,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:12,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21: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:21:12,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:12,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097239074] [2022-12-13 02:21:12,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097239074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:12,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:12,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:12,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111811446] [2022-12-13 02:21:12,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:12,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:12,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:12,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:12,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:12,490 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:12,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:12,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:12,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:12,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:12,566 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:12,567 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:12,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:12,568 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:12,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:12,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:12,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:12,568 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:12,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:12,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:12,571 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:12,571 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:12,571 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:12,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:12,571 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:12,571 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:12,571 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:12,571 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:12,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:12,577 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:12,577 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:12,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:12,578 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:12,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:12,665 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:12,666 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:12,666 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:12,666 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 02:21:12,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:12,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:12,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1555 [2022-12-13 02:21:12,666 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:21:12,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:12,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1696481827, now seen corresponding path program 1 times [2022-12-13 02:21:12,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:12,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007483390] [2022-12-13 02:21:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:12,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:12,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:21:12,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:12,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007483390] [2022-12-13 02:21:12,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007483390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:12,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:12,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:12,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808636018] [2022-12-13 02:21:12,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:12,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:12,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:12,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:12,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:12,715 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:12,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:12,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:12,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:12,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:12,789 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:12,789 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:12,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:12,790 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:12,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:12,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:12,791 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:12,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:12,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:12,793 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:12,793 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:12,793 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:12,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:12,794 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:12,794 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:12,794 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:12,794 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:12,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:12,799 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:12,799 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:12,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:12,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:12,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:12,886 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:12,887 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:12,887 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:12,887 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 02:21:12,887 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:12,887 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:12,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1556 [2022-12-13 02:21:12,887 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:21:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1725110978, now seen corresponding path program 1 times [2022-12-13 02:21:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:12,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333668419] [2022-12-13 02:21:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:12,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21: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:21:12,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:12,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333668419] [2022-12-13 02:21:12,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333668419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:12,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:12,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:12,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145097264] [2022-12-13 02:21:12,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:12,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:12,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:12,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:12,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:12,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:12,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:12,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:12,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:13,012 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:13,012 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:13,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:13,013 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:13,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:13,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:13,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:13,014 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:13,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:13,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:13,016 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,016 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:13,017 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:13,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:13,017 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:13,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:13,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:13,022 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:13,023 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:13,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:13,023 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:13,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:13,110 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:13,111 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:13,111 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:13,111 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 02:21:13,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:13,111 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:13,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1557 [2022-12-13 02:21:13,111 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:21:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1753740129, now seen corresponding path program 1 times [2022-12-13 02:21:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:13,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984612275] [2022-12-13 02:21:13,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:13,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:21:13,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:13,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984612275] [2022-12-13 02:21:13,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984612275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:13,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:13,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:13,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170174883] [2022-12-13 02:21:13,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:13,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:13,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:13,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:13,171 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:13,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:13,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:13,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:13,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:13,237 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:13,237 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:13,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:13,238 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:13,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:13,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:13,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:13,239 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:13,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:13,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:13,241 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,241 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:13,241 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:13,241 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:13,241 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,242 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:13,242 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:13,242 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:13,247 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:13,247 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:21:13,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:13,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:13,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:13,334 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:13,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:13,335 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:13,335 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 02:21:13,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:13,335 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:13,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1558 [2022-12-13 02:21:13,335 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:21:13,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1782369280, now seen corresponding path program 1 times [2022-12-13 02:21:13,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:13,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157155440] [2022-12-13 02:21:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:13,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:13,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:21:13,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:13,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157155440] [2022-12-13 02:21:13,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157155440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:13,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:13,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:13,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186045972] [2022-12-13 02:21:13,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:13,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:13,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:13,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:13,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:13,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:13,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:13,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:13,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:13,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:13,449 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:13,449 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:13,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:13,450 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:13,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:13,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:13,451 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:13,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:13,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:13,453 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,453 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:13,454 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:13,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:13,454 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,454 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:13,454 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:13,454 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:13,459 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:13,460 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:13,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:13,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:13,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:13,547 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:13,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:13,547 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:13,547 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 02:21:13,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:13,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:13,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1559 [2022-12-13 02:21:13,547 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:21:13,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1810998431, now seen corresponding path program 1 times [2022-12-13 02:21:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:13,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468394639] [2022-12-13 02:21:13,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:13,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:13,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:21:13,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:13,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468394639] [2022-12-13 02:21:13,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468394639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:13,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:13,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:13,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624584553] [2022-12-13 02:21:13,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:13,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:13,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:13,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:13,615 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:13,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:13,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:13,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:13,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:13,690 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:13,690 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:13,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:13,692 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:13,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:13,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:13,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:13,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:13,692 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:13,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:13,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:13,694 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,695 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:13,695 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:13,695 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:13,695 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:13,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:13,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:13,701 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:13,701 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:13,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:13,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:13,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:13,788 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:13,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:13,788 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:13,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:13,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:13,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:13,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1560 [2022-12-13 02:21:13,788 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:21:13,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1839627582, now seen corresponding path program 1 times [2022-12-13 02:21:13,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:13,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96385407] [2022-12-13 02:21:13,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:13,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:13,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:21:13,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:13,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96385407] [2022-12-13 02:21:13,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96385407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:13,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:13,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:13,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868174000] [2022-12-13 02:21:13,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:13,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:13,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:13,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:13,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:13,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:13,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:13,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:13,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:13,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:13,900 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:13,900 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:13,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:13,902 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:13,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:13,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:13,902 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:13,902 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:13,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:13,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:13,905 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,905 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:13,905 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:13,905 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:13,905 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,905 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:13,905 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:13,905 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:13,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:13,911 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:13,911 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:13,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:13,912 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:13,912 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:13,999 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:14,000 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:14,000 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:14,000 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 02:21:14,000 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:14,000 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:14,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1561 [2022-12-13 02:21:14,000 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:21:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1868256733, now seen corresponding path program 1 times [2022-12-13 02:21:14,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:14,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736169220] [2022-12-13 02:21:14,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:14,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:14,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:21:14,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:14,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736169220] [2022-12-13 02:21:14,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736169220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:14,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:14,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:14,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415090755] [2022-12-13 02:21:14,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:14,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:14,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:14,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:14,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:14,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:14,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:14,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:14,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:14,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:14,117 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:14,117 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:14,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:14,118 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:14,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:14,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:14,119 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:14,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:14,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:14,131 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:14,131 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:14,131 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:14,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:14,131 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:14,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:14,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:14,131 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:14,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:14,137 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:14,137 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:21:14,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:14,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:14,138 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:14,223 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:14,224 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:14,224 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:14,224 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 02:21:14,224 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:14,224 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:14,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1562 [2022-12-13 02:21:14,224 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:21:14,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:14,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1896885884, now seen corresponding path program 1 times [2022-12-13 02:21:14,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:14,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239034025] [2022-12-13 02:21:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:14,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:14,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:21:14,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:14,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239034025] [2022-12-13 02:21:14,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239034025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:14,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:14,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:14,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457613566] [2022-12-13 02:21:14,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:14,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:14,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:14,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:14,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:14,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:14,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:14,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:14,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:14,374 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:14,374 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:14,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1129 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:14,375 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:14,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:14,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:14,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:14,376 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:14,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:14,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:14,378 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:14,378 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:14,378 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:14,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:14,378 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:14,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:14,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:14,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:14,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:14,384 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:14,384 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:14,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:14,385 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:14,385 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:14,471 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:14,471 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:14,471 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:14,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:14,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:14,471 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:14,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1563 [2022-12-13 02:21:14,472 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:21:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1925515035, now seen corresponding path program 1 times [2022-12-13 02:21:14,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:14,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249288024] [2022-12-13 02:21:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:14,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:14,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:21:14,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:14,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249288024] [2022-12-13 02:21:14,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249288024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:14,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:14,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:14,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301030838] [2022-12-13 02:21:14,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:14,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:14,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:14,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:14,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:14,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:14,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:14,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:14,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:14,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:14,594 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:14,594 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:14,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:14,595 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:14,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:14,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:14,596 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:14,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:14,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:14,598 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:14,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:14,598 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:14,598 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:14,599 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:14,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:14,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:14,599 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:14,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:14,604 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:14,604 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:14,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:14,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:14,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:14,691 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:14,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:14,691 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:14,691 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 02:21:14,691 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:14,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:14,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1564 [2022-12-13 02:21:14,692 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:21:14,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:14,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1954144186, now seen corresponding path program 1 times [2022-12-13 02:21:14,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:14,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744183157] [2022-12-13 02:21:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:14,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:14,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:21:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:14,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744183157] [2022-12-13 02:21:14,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744183157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:14,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:14,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:14,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241292817] [2022-12-13 02:21:14,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:14,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:14,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:14,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:14,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:14,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:14,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:14,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:14,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:14,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:14,814 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:14,814 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:14,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:14,815 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:14,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:14,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:14,816 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:14,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:14,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:14,818 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:14,818 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:14,818 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:14,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:14,818 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:14,819 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:14,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:14,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:14,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:14,824 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:14,824 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:14,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:14,825 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:14,825 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:14,913 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:14,913 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:14,913 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:14,913 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 02:21:14,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:14,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:14,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1565 [2022-12-13 02:21:14,913 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:21:14,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1982773337, now seen corresponding path program 1 times [2022-12-13 02:21:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:14,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736701851] [2022-12-13 02:21:14,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:14,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:14,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:21:14,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:14,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736701851] [2022-12-13 02:21:14,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736701851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:14,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:14,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:14,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517506645] [2022-12-13 02:21:14,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:14,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:14,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:14,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:14,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:14,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:14,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:14,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:14,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:14,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:15,036 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:15,036 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:15,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:15,037 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:15,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:15,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:15,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:15,037 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:15,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:15,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:15,040 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,040 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:15,040 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:15,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:15,040 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:15,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:15,041 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:15,046 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:15,046 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:15,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:15,047 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:15,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:15,133 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:15,133 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:15,133 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:15,133 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 02:21:15,133 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:15,133 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:15,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1566 [2022-12-13 02:21:15,134 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:21:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2011402488, now seen corresponding path program 1 times [2022-12-13 02:21:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:15,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741739046] [2022-12-13 02:21:15,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:15,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:21:15,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:15,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741739046] [2022-12-13 02:21:15,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741739046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:15,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:15,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:15,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322046200] [2022-12-13 02:21:15,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:15,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:15,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:15,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:15,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:15,196 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:15,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:15,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:15,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:15,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:15,270 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:15,270 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:15,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:15,271 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:15,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:15,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:15,272 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:15,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:15,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:15,274 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,274 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:15,275 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:15,275 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:15,275 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,275 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:15,275 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:15,275 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:15,280 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:15,281 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:15,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:15,281 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:15,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:15,368 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:15,369 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:15,369 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:15,369 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 02:21:15,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:15,369 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:15,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1567 [2022-12-13 02:21:15,369 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:21:15,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2040031639, now seen corresponding path program 1 times [2022-12-13 02:21:15,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:15,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059425664] [2022-12-13 02:21:15,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:15,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:15,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:21:15,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:15,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059425664] [2022-12-13 02:21:15,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059425664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:15,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:15,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:15,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100931313] [2022-12-13 02:21:15,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:15,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:15,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:15,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:15,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:15,435 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:15,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:15,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:15,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:15,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:15,512 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:15,512 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:15,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:15,513 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:15,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:15,513 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:15,513 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:15,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:15,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:15,516 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,516 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:15,516 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:15,516 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:15,516 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:15,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:15,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:15,522 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:15,522 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:15,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:15,523 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:15,523 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:15,610 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:15,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:15,610 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:15,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:15,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:15,610 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:15,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1568 [2022-12-13 02:21:15,611 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:21:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:15,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2068660790, now seen corresponding path program 1 times [2022-12-13 02:21:15,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:15,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853232377] [2022-12-13 02:21:15,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:15,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:15,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 02:21:15,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:15,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853232377] [2022-12-13 02:21:15,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853232377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:15,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:15,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:15,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574020957] [2022-12-13 02:21:15,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:15,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:15,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:15,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:15,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:15,658 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:15,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:15,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:15,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:15,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:15,734 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:15,734 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:15,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:15,735 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:15,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:15,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:15,736 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:15,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:15,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:15,738 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,738 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:15,738 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:15,738 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:15,738 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:15,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:15,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:15,744 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:15,744 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:15,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:15,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:15,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:15,832 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:15,832 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:15,832 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:15,832 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 02:21:15,832 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:15,833 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:15,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1569 [2022-12-13 02:21:15,833 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:21:15,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:15,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2097289941, now seen corresponding path program 1 times [2022-12-13 02:21:15,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:15,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469419926] [2022-12-13 02:21:15,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:15,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:15,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:21:15,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:15,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469419926] [2022-12-13 02:21:15,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469419926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:15,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:15,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:15,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259927219] [2022-12-13 02:21:15,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:15,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:15,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:15,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:15,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:15,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:15,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:15,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:15,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:15,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:15,947 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:15,947 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:15,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:15,948 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:15,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:15,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:15,949 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:15,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:15,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:15,951 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,951 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:15,951 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:15,952 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:15,952 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,952 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:15,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:15,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:15,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:15,958 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:15,958 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:15,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:15,958 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:15,958 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:16,046 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:16,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:16,046 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:16,046 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 02:21:16,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:16,047 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:16,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1570 [2022-12-13 02:21:16,047 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:21:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2125919092, now seen corresponding path program 1 times [2022-12-13 02:21:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:16,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835608607] [2022-12-13 02:21:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:16,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:16,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:21:16,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:16,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835608607] [2022-12-13 02:21:16,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835608607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:16,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:16,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534196546] [2022-12-13 02:21:16,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:16,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:16,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:16,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:16,095 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:16,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:16,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:16,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:16,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:16,170 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:16,171 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:16,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:16,172 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:16,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:16,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:16,172 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:16,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:16,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:16,175 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:16,175 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:16,175 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:16,175 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:16,175 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:16,175 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:16,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:16,176 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:16,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:16,190 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:16,190 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:16,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:16,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:16,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:16,278 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:16,279 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:21:16,279 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:16,279 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 02:21:16,279 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:16,279 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:16,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1571 [2022-12-13 02:21:16,279 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:21:16,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:16,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2140419053, now seen corresponding path program 1 times [2022-12-13 02:21:16,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:16,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281820929] [2022-12-13 02:21:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:16,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:16,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:21:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:16,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281820929] [2022-12-13 02:21:16,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281820929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:16,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:16,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:16,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34088434] [2022-12-13 02:21:16,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:16,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:16,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:16,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:16,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:16,329 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:16,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:16,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:16,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:16,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:16,395 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:16,395 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:16,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:16,396 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:16,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:16,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:16,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:16,397 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:16,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:16,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:16,399 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:16,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:16,400 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:16,400 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:16,400 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:16,400 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:16,400 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:16,400 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:16,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:16,406 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:16,406 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:16,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:16,406 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:16,406 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:16,493 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:16,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:16,493 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:16,493 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 02:21:16,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:16,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:16,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1572 [2022-12-13 02:21:16,494 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:21:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2111789902, now seen corresponding path program 1 times [2022-12-13 02:21:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:16,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508554208] [2022-12-13 02:21:16,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:16,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:16,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:21:16,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:16,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508554208] [2022-12-13 02:21:16,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508554208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:16,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:16,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:16,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899162373] [2022-12-13 02:21:16,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:16,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:16,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:16,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:16,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:16,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:16,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:16,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:16,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:16,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:16,618 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:16,618 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:16,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:16,619 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:16,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:16,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:16,620 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:16,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:16,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:16,622 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:16,622 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:16,622 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:16,622 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:16,622 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:16,622 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:16,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:16,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:16,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:16,628 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:16,628 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:16,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:16,629 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:16,629 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:16,716 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:16,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:16,717 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:16,717 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 02:21:16,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:16,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:16,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1573 [2022-12-13 02:21:16,717 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:21:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:16,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2083160751, now seen corresponding path program 1 times [2022-12-13 02:21:16,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:16,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793002489] [2022-12-13 02:21:16,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:16,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:16,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:21:16,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:16,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793002489] [2022-12-13 02:21:16,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793002489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:16,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:16,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:16,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179458719] [2022-12-13 02:21:16,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:16,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:16,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:16,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:16,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:16,785 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:16,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:16,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:16,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:16,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:16,860 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:16,860 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:16,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:16,861 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:16,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:16,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:16,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:16,862 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:16,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:16,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:16,864 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:16,865 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:16,865 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:16,865 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:16,865 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:16,865 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:16,865 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:16,865 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:16,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:16,871 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:16,871 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:16,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:16,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:16,871 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:16,959 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:16,959 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:16,959 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:16,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:16,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:16,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:16,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1574 [2022-12-13 02:21:16,960 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:21:16,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2054531600, now seen corresponding path program 1 times [2022-12-13 02:21:16,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:16,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481217325] [2022-12-13 02:21:16,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:16,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:17,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:21:17,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:17,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481217325] [2022-12-13 02:21:17,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481217325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:17,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:17,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:17,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107044555] [2022-12-13 02:21:17,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:17,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:17,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:17,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:17,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:17,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:17,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:17,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:17,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:17,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:17,110 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:17,110 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:17,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:17,112 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:17,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:17,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:17,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:17,113 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:17,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:17,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:17,115 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:17,115 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:17,115 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:17,116 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:17,116 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:17,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:17,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:17,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:17,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:17,121 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:17,121 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:17,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:17,122 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:17,122 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:17,211 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:17,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:17,212 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:17,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:17,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:17,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:17,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1575 [2022-12-13 02:21:17,212 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:21:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2025902449, now seen corresponding path program 1 times [2022-12-13 02:21:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:17,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116987742] [2022-12-13 02:21:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:17,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:21:17,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:17,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116987742] [2022-12-13 02:21:17,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116987742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:17,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:17,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:17,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568741799] [2022-12-13 02:21:17,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:17,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:17,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:17,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:17,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:17,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:17,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:17,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:17,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:17,340 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:17,340 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:17,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:17,341 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:17,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:17,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:17,342 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:17,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:17,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:17,344 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:17,344 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:17,344 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:17,344 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:17,344 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:17,345 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:17,345 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:17,345 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:17,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:17,350 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:17,350 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:17,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:17,351 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:17,351 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:17,438 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:17,439 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:17,439 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:17,439 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 02:21:17,439 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:17,439 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:17,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1576 [2022-12-13 02:21:17,439 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:21:17,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1997273298, now seen corresponding path program 1 times [2022-12-13 02:21:17,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:17,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29481927] [2022-12-13 02:21:17,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:17,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:17,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:21:17,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:17,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29481927] [2022-12-13 02:21:17,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29481927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:17,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:17,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:17,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767111357] [2022-12-13 02:21:17,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:17,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:17,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:17,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:17,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:17,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:17,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:17,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:17,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:17,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:17,563 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:17,563 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:17,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:17,564 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:17,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:17,564 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:17,564 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:17,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:17,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:17,567 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:17,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:17,567 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:17,567 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:17,567 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:17,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:17,568 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:17,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:17,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:17,573 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:17,573 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:17,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:17,574 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:17,574 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:17,661 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:17,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:17,661 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:17,662 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 02:21:17,662 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:17,662 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:17,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1577 [2022-12-13 02:21:17,662 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:21:17,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:17,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1968644147, now seen corresponding path program 1 times [2022-12-13 02:21:17,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:17,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543108200] [2022-12-13 02:21:17,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:17,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:17,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:21:17,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:17,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543108200] [2022-12-13 02:21:17,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543108200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:17,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:17,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399952075] [2022-12-13 02:21:17,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:17,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:17,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:17,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:17,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:17,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:17,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:17,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:17,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:17,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:17,784 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:17,784 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:17,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:17,785 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:17,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:17,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:17,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:17,786 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:17,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:17,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:17,789 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:17,789 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:17,789 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:17,789 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:17,789 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:17,789 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:17,789 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:17,789 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:17,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:17,795 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:17,795 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:17,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:17,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:17,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:17,883 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:17,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:17,883 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:17,883 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 02:21:17,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:17,883 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:17,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1578 [2022-12-13 02:21:17,883 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:21:17,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:17,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1940014996, now seen corresponding path program 1 times [2022-12-13 02:21:17,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:17,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82019287] [2022-12-13 02:21:17,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:17,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:21:17,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:17,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82019287] [2022-12-13 02:21:17,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82019287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:17,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:17,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:17,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699417406] [2022-12-13 02:21:17,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:17,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:17,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:17,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:17,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:17,934 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:17,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:17,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:17,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:17,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:17,999 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:17,999 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:18,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:18,000 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:18,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:18,001 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:18,001 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:18,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:18,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:18,004 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,004 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:18,004 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:18,004 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:18,004 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,004 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:18,004 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:18,004 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:18,010 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:18,010 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:21:18,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:18,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:18,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:18,098 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:18,098 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:18,098 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:18,098 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 02:21:18,098 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:18,098 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:18,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1579 [2022-12-13 02:21:18,098 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:21:18,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:18,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1911385845, now seen corresponding path program 1 times [2022-12-13 02:21:18,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:18,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152005403] [2022-12-13 02:21:18,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:18,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:18,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:21:18,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:18,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152005403] [2022-12-13 02:21:18,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152005403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:18,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:18,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:18,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279729302] [2022-12-13 02:21:18,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:18,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:18,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:18,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:18,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:18,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:18,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:18,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:18,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:18,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:18,215 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:18,215 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:18,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:18,216 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:18,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:18,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:18,217 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:18,217 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:18,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:18,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:18,219 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,219 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:18,219 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:18,219 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:18,220 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:18,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:18,220 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:18,225 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:18,225 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:18,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:18,226 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:18,226 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:18,324 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:18,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:21:18,325 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:18,325 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 02:21:18,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:18,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:18,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1580 [2022-12-13 02:21:18,325 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:21:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1882756694, now seen corresponding path program 1 times [2022-12-13 02:21:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:18,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691234756] [2022-12-13 02:21:18,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:18,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:21:18,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:18,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691234756] [2022-12-13 02:21:18,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691234756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:18,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:18,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:18,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088956790] [2022-12-13 02:21:18,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:18,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:18,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:18,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:18,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:18,408 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:18,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:18,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:18,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:18,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:18,487 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:18,487 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:18,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:18,488 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:18,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:18,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:18,489 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:18,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:18,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:18,491 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,491 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:18,491 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:18,491 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:18,491 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,492 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:18,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:18,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:18,497 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:18,497 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:18,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:18,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:18,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:18,585 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:18,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:18,586 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:18,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:18,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:18,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:18,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1581 [2022-12-13 02:21:18,586 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:21:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:18,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1854127543, now seen corresponding path program 1 times [2022-12-13 02:21:18,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:18,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365693587] [2022-12-13 02:21:18,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:18,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:18,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:21:18,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:18,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365693587] [2022-12-13 02:21:18,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365693587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:18,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:18,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:18,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491057771] [2022-12-13 02:21:18,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:18,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:18,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:18,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:18,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:18,637 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:18,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:18,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:18,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:18,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:18,704 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:18,704 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:18,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:18,705 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:18,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:18,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:18,705 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:18,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:18,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:18,708 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,708 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:18,708 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:18,708 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:18,708 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,708 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:18,708 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:18,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:18,714 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:18,714 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:18,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:18,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:18,715 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:18,803 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:18,803 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:18,803 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:18,803 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 02:21:18,803 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:18,803 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:18,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1582 [2022-12-13 02:21:18,803 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:21:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1825498392, now seen corresponding path program 1 times [2022-12-13 02:21:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:18,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531266521] [2022-12-13 02:21:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:18,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:21:18,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:18,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531266521] [2022-12-13 02:21:18,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531266521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:18,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:18,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:18,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269940468] [2022-12-13 02:21:18,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:18,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:18,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:18,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:18,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:18,871 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:18,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:18,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:18,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:18,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:18,946 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:18,946 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:18,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:18,947 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:18,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:18,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:18,948 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:18,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:18,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:18,950 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,950 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:18,950 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:18,950 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:18,950 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:18,951 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:18,951 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:18,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:18,956 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:18,956 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:18,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:18,957 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:18,957 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:19,045 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:19,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:19,045 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:19,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:19,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:19,045 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:19,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1583 [2022-12-13 02:21:19,045 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:21:19,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:19,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1796869241, now seen corresponding path program 1 times [2022-12-13 02:21:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:19,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671948501] [2022-12-13 02:21:19,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:19,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:19,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:21:19,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:19,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671948501] [2022-12-13 02:21:19,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671948501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:19,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:19,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:19,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096824727] [2022-12-13 02:21:19,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:19,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:19,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:19,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:19,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:19,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:19,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:19,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:19,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:19,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:19,167 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:19,167 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:19,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:19,168 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:19,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:19,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:19,169 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:19,169 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:19,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:19,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:19,171 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:19,171 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:19,171 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:19,171 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:19,171 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:19,172 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:19,172 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:19,172 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:19,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:19,177 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:19,177 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:19,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:19,178 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:19,178 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:19,283 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:19,284 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:21:19,284 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:19,284 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 02:21:19,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:19,284 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:19,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1584 [2022-12-13 02:21:19,284 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:21:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:19,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1768240090, now seen corresponding path program 1 times [2022-12-13 02:21:19,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:19,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467679014] [2022-12-13 02:21:19,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:19,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:19,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 02:21:19,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:19,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467679014] [2022-12-13 02:21:19,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467679014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:19,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:19,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:19,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326786895] [2022-12-13 02:21:19,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:19,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:19,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:19,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:19,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:19,345 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:19,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:19,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:19,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:19,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:19,421 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:19,421 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:19,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:19,422 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:19,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:19,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:19,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:19,422 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:19,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:19,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:19,425 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:19,425 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:19,425 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:19,425 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:19,425 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:19,425 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:19,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:19,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:19,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:19,431 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:19,431 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:19,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:19,431 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:19,431 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:19,518 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:19,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:19,518 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:19,518 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 02:21:19,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:19,519 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:19,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1585 [2022-12-13 02:21:19,519 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:21:19,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:19,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1739610939, now seen corresponding path program 1 times [2022-12-13 02:21:19,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:19,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136910044] [2022-12-13 02:21:19,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:19,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:19,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 02:21:19,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:19,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136910044] [2022-12-13 02:21:19,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136910044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:19,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:19,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:19,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296383954] [2022-12-13 02:21:19,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:19,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:19,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:19,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:19,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:19,569 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:19,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:19,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:19,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:19,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:19,634 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:19,634 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:19,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:19,635 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:19,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:19,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:19,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:19,635 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:19,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:19,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:19,638 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:19,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:19,638 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:19,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:19,638 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:19,638 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:19,638 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:19,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:19,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:19,644 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:19,644 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:19,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:19,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:19,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:19,731 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:19,732 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:19,732 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:19,732 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 02:21:19,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:19,732 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:19,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1586 [2022-12-13 02:21:19,732 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:21:19,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:19,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1710981788, now seen corresponding path program 1 times [2022-12-13 02:21:19,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:19,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152821325] [2022-12-13 02:21:19,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:19,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:19,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:21:19,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:19,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152821325] [2022-12-13 02:21:19,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152821325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:19,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:19,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:19,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542107615] [2022-12-13 02:21:19,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:19,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:19,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:19,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:19,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:19,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:19,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:19,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:19,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:19,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:19,848 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:19,848 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:19,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:19,850 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:19,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:19,850 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:19,850 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:19,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:19,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:19,853 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:19,853 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:19,853 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:19,853 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:19,853 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:19,853 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:19,853 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:19,853 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:19,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:19,859 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:19,859 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:19,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:19,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:19,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:19,945 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:19,945 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:21:19,945 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:19,945 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 02:21:19,945 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:19,945 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:19,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1587 [2022-12-13 02:21:19,945 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:21:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1682352637, now seen corresponding path program 1 times [2022-12-13 02:21:19,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:19,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584237182] [2022-12-13 02:21:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:19,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:19,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:21:19,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:19,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584237182] [2022-12-13 02:21:19,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584237182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:19,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:19,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:19,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632225154] [2022-12-13 02:21:19,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:19,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:19,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:19,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:19,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:19,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:19,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:19,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:19,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:19,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:20,062 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:20,062 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:20,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:20,063 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:20,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:20,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:20,064 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:20,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:20,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:20,066 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:20,066 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:20,066 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:20,066 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,067 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:20,067 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:20,067 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:20,072 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:20,072 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:21:20,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:20,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:20,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:20,160 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:20,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:20,161 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:20,161 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 02:21:20,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:20,161 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:20,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1588 [2022-12-13 02:21:20,161 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:21:20,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:20,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1653723486, now seen corresponding path program 1 times [2022-12-13 02:21:20,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:20,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098277529] [2022-12-13 02:21:20,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:20,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:20,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 02:21:20,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:20,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098277529] [2022-12-13 02:21:20,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098277529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:20,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:20,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:20,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702783357] [2022-12-13 02:21:20,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:20,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:20,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:20,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:20,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:20,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:20,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:20,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:20,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:20,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:20,277 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:20,277 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:20,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:20,278 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:20,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:20,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:20,278 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:20,279 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:20,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:20,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:20,281 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:20,281 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:20,281 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:20,281 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:20,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:20,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:20,287 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:20,287 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:20,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:20,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:20,288 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:20,375 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:20,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:20,375 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:20,375 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 02:21:20,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:20,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:20,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1589 [2022-12-13 02:21:20,375 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:21:20,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1625094335, now seen corresponding path program 1 times [2022-12-13 02:21:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:20,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153662003] [2022-12-13 02:21:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:21:20,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:20,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153662003] [2022-12-13 02:21:20,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153662003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:20,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:20,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:20,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35137685] [2022-12-13 02:21:20,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:20,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:20,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:20,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:20,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:20,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:20,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:20,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:20,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:20,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:20,510 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:20,510 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:20,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:20,511 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:20,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:20,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:20,512 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:20,512 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:20,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:20,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:20,514 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,514 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:20,515 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:20,515 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:20,515 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:20,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:20,515 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:20,520 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:20,520 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:20,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:20,521 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:20,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:20,607 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:20,608 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:20,608 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:20,608 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 02:21:20,608 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:20,608 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:20,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1590 [2022-12-13 02:21:20,608 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:21:20,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:20,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1596465184, now seen corresponding path program 1 times [2022-12-13 02:21:20,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:20,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422080887] [2022-12-13 02:21:20,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:20,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:21:20,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:20,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422080887] [2022-12-13 02:21:20,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422080887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:20,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:20,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:20,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318008855] [2022-12-13 02:21:20,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:20,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:20,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:20,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:20,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:20,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:20,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:20,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:20,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:20,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:20,733 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:20,733 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:20,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:20,734 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:20,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:20,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:20,735 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:20,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:20,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:20,738 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,738 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:20,738 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:20,738 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:20,738 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:20,738 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:20,738 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:20,744 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:20,744 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:20,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:20,744 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:20,744 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:20,832 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:20,832 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:20,833 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:20,833 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 02:21:20,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:20,833 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:20,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1591 [2022-12-13 02:21:20,833 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:21:20,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:20,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1567836033, now seen corresponding path program 1 times [2022-12-13 02:21:20,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:20,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739997812] [2022-12-13 02:21:20,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:20,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:21:20,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:20,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739997812] [2022-12-13 02:21:20,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739997812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:20,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:20,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178868988] [2022-12-13 02:21:20,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:20,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:20,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:20,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:20,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:20,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:20,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:20,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:20,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:20,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:20,948 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:20,949 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:20,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:20,950 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:20,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:20,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:20,950 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:20,950 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:20,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:20,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:20,953 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,953 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:20,953 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:20,953 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:20,953 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,953 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:20,953 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:20,953 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:20,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:20,959 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:20,959 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:20,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:20,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:20,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:21,047 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:21,047 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:21,047 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:21,047 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 02:21:21,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:21,047 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:21,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1592 [2022-12-13 02:21:21,048 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:21:21,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:21,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1539206882, now seen corresponding path program 1 times [2022-12-13 02:21:21,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:21,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651053261] [2022-12-13 02:21:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:21,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:21:21,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:21,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651053261] [2022-12-13 02:21:21,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651053261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:21,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:21,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:21,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047451582] [2022-12-13 02:21:21,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:21,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:21,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:21,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:21,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:21,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:21,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:21,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:21,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:21,172 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:21,172 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:21,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:21,173 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:21,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:21,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:21,174 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:21,174 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:21,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:21,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:21,176 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:21,176 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:21,176 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:21,177 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:21,177 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:21,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:21,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:21,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:21,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:21,182 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:21,183 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:21,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:21,183 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:21,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:21,270 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:21,271 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:21,271 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:21,271 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 02:21:21,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:21,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:21,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1593 [2022-12-13 02:21:21,271 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:21:21,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:21,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1510577731, now seen corresponding path program 1 times [2022-12-13 02:21:21,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:21,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397080119] [2022-12-13 02:21:21,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:21,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:21:21,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:21,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397080119] [2022-12-13 02:21:21,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397080119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:21,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:21,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:21,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782604638] [2022-12-13 02:21:21,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:21,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:21,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:21,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:21,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:21,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:21,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:21,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:21,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:21,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:21,416 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:21,416 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:21,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:21,427 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:21,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:21,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:21,428 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:21,428 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:21,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:21,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:21,431 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:21,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:21,431 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:21,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:21,432 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:21,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:21,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:21,432 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:21,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:21,440 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:21,440 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:21,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:21,441 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:21,441 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:21,547 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:21,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:21:21,547 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:21,547 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 02:21:21,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:21,548 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:21,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1594 [2022-12-13 02:21:21,548 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:21:21,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:21,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1481948580, now seen corresponding path program 1 times [2022-12-13 02:21:21,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:21,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241758985] [2022-12-13 02:21:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:21,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:21,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:21:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:21,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241758985] [2022-12-13 02:21:21,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241758985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:21,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:21,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199888875] [2022-12-13 02:21:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:21,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:21,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:21,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:21,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:21,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:21,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:21,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:21,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:21,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:21,684 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:21,685 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:21,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:21,686 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:21,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:21,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:21,686 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:21,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:21,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:21,689 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:21,689 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:21,689 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:21,689 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:21,689 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:21,689 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:21,689 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:21,689 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:21,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:21,695 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:21,695 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:21:21,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:21,696 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:21,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:21,782 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:21,783 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:21,783 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:21,783 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 02:21:21,783 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:21,783 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:21,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1595 [2022-12-13 02:21:21,783 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:21:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1453319429, now seen corresponding path program 1 times [2022-12-13 02:21:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:21,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405182702] [2022-12-13 02:21:21,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:21,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:21,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 02:21:21,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:21,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405182702] [2022-12-13 02:21:21,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405182702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:21,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:21,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:21,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016246192] [2022-12-13 02:21:21,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:21,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:21,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:21,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:21,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:21,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:21,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:21,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:21,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:21,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:21,942 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:21,943 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:21,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:21,944 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:21,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:21,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:21,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:21,945 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:21,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:21,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:21,948 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:21,948 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:21,948 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:21,949 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:21,949 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:21,949 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:21,949 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:21,949 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:21,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:21,957 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:21,957 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:21,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:21,958 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:21,958 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:22,066 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:22,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:21:22,067 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:22,067 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 02:21:22,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:22,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:22,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1596 [2022-12-13 02:21:22,067 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:21:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:22,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1424690278, now seen corresponding path program 1 times [2022-12-13 02:21:22,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:22,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238737788] [2022-12-13 02:21:22,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:22,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:22,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 02:21:22,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:22,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238737788] [2022-12-13 02:21:22,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238737788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:22,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:22,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706959153] [2022-12-13 02:21:22,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:22,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:22,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:22,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:22,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:22,131 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:22,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:22,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:22,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:22,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:22,217 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:22,217 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:22,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:22,218 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:22,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:22,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:22,219 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:22,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:22,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:22,221 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:22,221 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:22,222 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:22,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:22,222 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:22,222 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:22,222 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:22,222 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:22,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:22,228 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:22,228 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:22,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:22,228 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:22,228 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:22,317 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:22,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:22,317 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:22,317 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 02:21:22,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:22,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:22,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1597 [2022-12-13 02:21:22,318 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:21:22,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:22,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1396061127, now seen corresponding path program 1 times [2022-12-13 02:21:22,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:22,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598227494] [2022-12-13 02:21:22,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:22,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21: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 02:21:22,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:22,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598227494] [2022-12-13 02:21:22,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598227494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:22,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:22,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711446044] [2022-12-13 02:21:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:22,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:22,369 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:22,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:22,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:22,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:22,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:22,445 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:22,445 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:22,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:22,447 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:22,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:22,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:22,447 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:22,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:22,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:22,450 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:22,450 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:22,450 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:22,450 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:22,450 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:22,450 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:22,450 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:22,450 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:22,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:22,456 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:22,456 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:22,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:22,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:22,457 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:22,545 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:22,546 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:22,546 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:22,546 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 02:21:22,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:22,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:22,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1598 [2022-12-13 02:21:22,546 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:21:22,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:22,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1367431976, now seen corresponding path program 1 times [2022-12-13 02:21:22,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:22,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330305208] [2022-12-13 02:21:22,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:22,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:22,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:21:22,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:22,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330305208] [2022-12-13 02:21:22,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330305208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:22,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:22,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:22,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144687406] [2022-12-13 02:21:22,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:22,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:22,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:22,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:22,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:22,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:22,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:22,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:22,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:22,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:22,686 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:22,686 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:22,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:22,687 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:22,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:22,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:22,688 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:22,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:22,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:22,690 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:22,690 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:22,690 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:22,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:22,690 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:22,691 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:22,691 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:22,691 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:22,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:22,696 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:22,696 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:22,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:22,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:22,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:22,784 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:22,785 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:22,785 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:22,785 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 02:21:22,785 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:22,785 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:22,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1599 [2022-12-13 02:21:22,785 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:21:22,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:22,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1338802825, now seen corresponding path program 1 times [2022-12-13 02:21:22,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:22,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974594171] [2022-12-13 02:21:22,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:22,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:21:22,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:22,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974594171] [2022-12-13 02:21:22,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974594171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:22,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:22,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:22,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100639957] [2022-12-13 02:21:22,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:22,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:22,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:22,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:22,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:22,836 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:22,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:22,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:22,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:22,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:22,912 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:22,913 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:22,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:22,914 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:22,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:22,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:22,914 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:22,914 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:22,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:22,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:22,917 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:22,917 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:22,917 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:22,917 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:22,917 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:22,917 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:22,917 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:22,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:22,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:22,923 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:22,923 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:22,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:22,924 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:22,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:23,010 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:23,010 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:23,010 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:23,010 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 02:21:23,011 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:23,011 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:23,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1600 [2022-12-13 02:21:23,011 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:21:23,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1310173674, now seen corresponding path program 1 times [2022-12-13 02:21:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:23,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807896890] [2022-12-13 02:21:23,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:23,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:23,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:21:23,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:23,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807896890] [2022-12-13 02:21:23,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807896890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:23,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:23,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:23,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507748393] [2022-12-13 02:21:23,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:23,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:23,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:23,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:23,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:23,061 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:23,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:23,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:23,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:23,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:23,127 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:23,127 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:23,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:23,129 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:23,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:23,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:23,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:23,129 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:23,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:23,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:23,132 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:23,132 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:23,132 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:23,132 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:23,132 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:23,132 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:23,132 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:23,132 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:23,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:23,138 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:23,138 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:23,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:23,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:23,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:23,226 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:23,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:23,226 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:23,226 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 02:21:23,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:23,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:23,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1601 [2022-12-13 02:21:23,227 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:21:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1281544523, now seen corresponding path program 1 times [2022-12-13 02:21:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:23,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331840867] [2022-12-13 02:21:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21: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:21:23,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:23,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331840867] [2022-12-13 02:21:23,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331840867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:23,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:23,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:23,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47821294] [2022-12-13 02:21:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:23,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:23,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:23,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:23,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:23,276 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:23,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:23,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:23,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:23,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:23,350 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:23,351 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:23,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:23,352 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:23,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:23,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:23,352 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:23,352 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:23,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:23,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:23,355 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:23,355 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:23,355 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:23,355 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:23,355 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:23,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:23,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:23,356 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:23,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:23,361 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:23,361 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:23,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:23,362 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:23,362 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:23,449 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:23,449 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:23,449 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:23,449 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 02:21:23,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:23,449 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:23,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1602 [2022-12-13 02:21:23,450 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:21:23,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:23,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1252915372, now seen corresponding path program 1 times [2022-12-13 02:21:23,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:23,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976151364] [2022-12-13 02:21:23,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:23,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:23,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:21:23,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:23,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976151364] [2022-12-13 02:21:23,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976151364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:23,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:23,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:23,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680150921] [2022-12-13 02:21:23,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:23,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:23,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:23,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:23,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:23,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:23,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:23,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:23,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:23,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:23,590 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:23,591 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:23,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:23,592 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:23,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:23,592 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:23,592 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:23,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:23,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:23,595 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:23,595 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:23,595 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:23,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:23,595 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:23,595 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:23,595 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:23,595 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:23,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:23,601 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:23,601 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:23,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:23,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:23,602 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:23,697 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:23,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:21:23,697 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:23,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:23,698 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:23,698 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:23,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1603 [2022-12-13 02:21:23,698 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:21:23,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1224286221, now seen corresponding path program 1 times [2022-12-13 02:21:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:23,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969212509] [2022-12-13 02:21:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:23,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 02:21:23,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:23,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969212509] [2022-12-13 02:21:23,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969212509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:23,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:23,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:23,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743126213] [2022-12-13 02:21:23,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:23,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:23,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:23,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:23,748 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:23,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:23,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:23,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:23,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:23,813 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:23,813 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:23,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:23,814 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:23,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:23,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:23,814 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:23,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:23,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:23,817 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:23,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:23,817 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:23,817 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:23,817 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:23,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:23,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:23,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:23,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:23,823 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:23,823 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:23,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:23,824 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:23,824 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:23,910 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:23,911 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:23,911 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:23,911 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 02:21:23,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:23,911 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:23,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1604 [2022-12-13 02:21:23,911 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:21:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:23,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1195657070, now seen corresponding path program 1 times [2022-12-13 02:21:23,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:23,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616757512] [2022-12-13 02:21:23,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:21:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:23,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616757512] [2022-12-13 02:21:23,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616757512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:23,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:23,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110460099] [2022-12-13 02:21:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:23,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:23,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:23,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:23,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:23,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:23,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:23,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:24,032 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:24,032 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:24,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:24,033 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:24,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:24,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:24,033 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:24,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:24,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:24,036 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,036 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:24,036 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:24,036 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:24,036 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,036 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:24,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:24,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:24,042 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:24,042 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:24,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:24,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:24,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:24,128 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:24,129 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:24,129 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:24,129 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 02:21:24,129 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:24,129 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:24,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1605 [2022-12-13 02:21:24,129 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:21:24,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1167027919, now seen corresponding path program 1 times [2022-12-13 02:21:24,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:24,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722156169] [2022-12-13 02:21:24,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:24,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:24,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:21:24,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:24,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722156169] [2022-12-13 02:21:24,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722156169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:24,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:24,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:24,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875542503] [2022-12-13 02:21:24,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:24,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:24,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:24,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:24,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:24,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:24,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:24,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:24,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:24,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:24,253 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:24,254 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:24,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:24,255 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:24,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:24,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:24,255 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:24,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:24,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:24,258 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:24,258 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:24,258 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:24,258 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:24,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:24,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:24,264 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:24,264 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:24,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:24,265 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:24,265 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:24,352 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:24,352 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:24,353 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:24,353 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 02:21:24,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:24,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:24,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1606 [2022-12-13 02:21:24,353 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:21:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:24,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1138398768, now seen corresponding path program 1 times [2022-12-13 02:21:24,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:24,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905022732] [2022-12-13 02:21:24,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:24,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:24,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:21:24,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:24,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905022732] [2022-12-13 02:21:24,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905022732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:24,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:24,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:24,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566791022] [2022-12-13 02:21:24,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:24,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:24,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:24,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:24,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:24,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:24,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:24,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:24,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:24,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:24,469 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:24,470 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:24,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:24,471 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:24,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:24,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:24,471 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:24,471 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:24,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:24,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:24,474 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,474 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:24,474 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:24,474 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:24,474 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,474 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:24,474 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:24,474 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:24,480 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:24,480 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:24,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:24,480 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:24,480 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:24,567 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:24,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:24,567 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:24,567 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 02:21:24,567 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:24,567 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:24,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1607 [2022-12-13 02:21:24,567 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:21:24,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:24,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1109769617, now seen corresponding path program 1 times [2022-12-13 02:21:24,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:24,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50089084] [2022-12-13 02:21:24,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:24,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:24,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:21:24,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:24,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50089084] [2022-12-13 02:21:24,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50089084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:24,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:24,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:24,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501031286] [2022-12-13 02:21:24,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:24,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:24,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:24,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:24,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:24,616 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:24,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:24,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:24,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:24,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:24,699 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:24,700 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:24,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:24,701 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:24,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:24,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:24,701 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:24,701 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:24,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:24,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:24,704 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,704 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:24,704 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:24,704 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:24,704 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,704 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:24,705 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:24,705 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:24,710 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:24,710 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:21:24,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:24,711 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:24,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:24,797 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:24,798 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:24,798 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:24,798 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 02:21:24,798 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:24,798 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:24,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1608 [2022-12-13 02:21:24,798 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:21:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:24,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1081140466, now seen corresponding path program 1 times [2022-12-13 02:21:24,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:24,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510378409] [2022-12-13 02:21:24,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:24,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:24,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:21:24,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:24,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510378409] [2022-12-13 02:21:24,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510378409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:24,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:24,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:24,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040019147] [2022-12-13 02:21:24,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:24,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:24,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:24,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:24,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:24,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:24,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:24,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:24,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:24,914 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:24,915 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:24,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:24,916 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:24,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:24,916 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:24,916 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:24,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:24,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:24,919 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:24,919 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:24,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:24,919 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:24,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:24,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:24,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:24,925 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:24,925 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:24,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:24,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:24,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:25,012 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:25,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:25,012 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:25,012 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 02:21:25,013 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:25,013 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:25,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1609 [2022-12-13 02:21:25,013 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:21:25,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:25,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1052511315, now seen corresponding path program 1 times [2022-12-13 02:21:25,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:25,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014854594] [2022-12-13 02:21:25,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:25,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:25,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:21:25,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:25,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014854594] [2022-12-13 02:21:25,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014854594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:25,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:25,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:25,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632140392] [2022-12-13 02:21:25,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:25,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:25,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:25,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:25,069 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:25,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:25,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:25,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:25,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:25,134 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:25,134 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:25,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:25,136 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:25,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:25,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:25,136 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:25,136 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:25,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:25,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:25,139 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:25,139 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:25,139 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:25,139 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:25,139 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:25,139 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:25,139 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:25,139 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:25,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:25,145 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:25,145 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:21:25,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:25,146 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:25,146 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:25,232 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:25,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:25,233 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:25,233 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 02:21:25,233 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:25,233 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:25,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1610 [2022-12-13 02:21:25,233 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:21:25,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:25,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1023882164, now seen corresponding path program 1 times [2022-12-13 02:21:25,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:25,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979973832] [2022-12-13 02:21:25,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:25,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:21:25,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:25,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979973832] [2022-12-13 02:21:25,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979973832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:25,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:25,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:25,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117762416] [2022-12-13 02:21:25,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:25,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:25,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:25,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:25,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:25,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:25,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:25,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:25,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:25,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:25,359 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:25,359 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:25,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:25,360 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:25,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:25,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:25,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:25,361 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:25,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:25,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:25,363 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:25,364 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:25,364 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:25,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:25,364 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:25,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:25,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:25,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:25,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:25,370 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:25,370 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:25,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:25,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:25,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:25,457 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:25,457 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:25,457 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:25,457 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 02:21:25,457 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:25,457 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:25,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1611 [2022-12-13 02:21:25,458 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:21:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash -995253013, now seen corresponding path program 1 times [2022-12-13 02:21:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:25,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275429773] [2022-12-13 02:21:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:25,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:25,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:21:25,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:25,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275429773] [2022-12-13 02:21:25,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275429773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:25,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:25,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:25,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144126158] [2022-12-13 02:21:25,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:25,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:25,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:25,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:25,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:25,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:25,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:25,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:25,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:25,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:25,574 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:25,574 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:25,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:25,575 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:25,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:25,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:25,576 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:25,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:25,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:25,578 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:25,578 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:25,578 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:25,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:25,579 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:25,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:25,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:25,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:25,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:25,584 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:25,585 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:25,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:25,585 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:25,585 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:25,673 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:25,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:25,673 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:25,674 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 02:21:25,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:25,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:25,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1612 [2022-12-13 02:21:25,674 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:21:25,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:25,674 INFO L85 PathProgramCache]: Analyzing trace with hash -966623862, now seen corresponding path program 1 times [2022-12-13 02:21:25,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:25,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056214704] [2022-12-13 02:21:25,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:25,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:25,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:21:25,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:25,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056214704] [2022-12-13 02:21:25,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056214704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:25,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:25,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:25,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931209773] [2022-12-13 02:21:25,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:25,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:25,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:25,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:25,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:25,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:25,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:25,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:25,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:25,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:25,813 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:25,813 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:25,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:25,814 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:25,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:25,815 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:25,815 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:25,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:25,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:25,817 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:25,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:25,817 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:25,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:25,818 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:25,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:25,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:25,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:25,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:25,823 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:25,824 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:25,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:25,824 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:25,824 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:25,910 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:25,911 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:25,911 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:25,911 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 02:21:25,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:25,911 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:25,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1613 [2022-12-13 02:21:25,911 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:21:25,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:25,911 INFO L85 PathProgramCache]: Analyzing trace with hash -937994711, now seen corresponding path program 1 times [2022-12-13 02:21:25,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:25,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274404728] [2022-12-13 02:21:25,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:25,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:25,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:21:25,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:25,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274404728] [2022-12-13 02:21:25,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274404728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:25,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:25,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:25,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711819350] [2022-12-13 02:21:25,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:25,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:25,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:25,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:25,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:25,960 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:25,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:25,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:25,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:25,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:26,025 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:26,025 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:26,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:26,026 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:26,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:26,027 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:26,027 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:26,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:26,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:26,029 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,030 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:26,030 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:26,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:26,030 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:26,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:26,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:26,036 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:26,036 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:26,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:26,036 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:26,036 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:26,123 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:26,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:26,123 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:26,123 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 02:21:26,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:26,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:26,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1614 [2022-12-13 02:21:26,123 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:21:26,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:26,124 INFO L85 PathProgramCache]: Analyzing trace with hash -909365560, now seen corresponding path program 1 times [2022-12-13 02:21:26,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:26,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075415725] [2022-12-13 02:21:26,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:26,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:26,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:21:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:26,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075415725] [2022-12-13 02:21:26,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075415725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:26,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:26,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:26,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442461756] [2022-12-13 02:21:26,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:26,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:26,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:26,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:26,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:26,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:26,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:26,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:26,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:26,241 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:26,241 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:26,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:26,242 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:26,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:26,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:26,242 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:26,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:26,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:26,245 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:26,245 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:26,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:26,245 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,246 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:26,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:26,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:26,251 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:26,251 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:26,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:26,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:26,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:26,338 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:26,339 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:26,339 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:26,339 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 02:21:26,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:26,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:26,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1615 [2022-12-13 02:21:26,339 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:21:26,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:26,339 INFO L85 PathProgramCache]: Analyzing trace with hash -880736409, now seen corresponding path program 1 times [2022-12-13 02:21:26,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:26,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534861775] [2022-12-13 02:21:26,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:26,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:26,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:21:26,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:26,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534861775] [2022-12-13 02:21:26,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534861775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:26,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:26,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119546805] [2022-12-13 02:21:26,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:26,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:26,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:26,387 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:26,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:26,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:26,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:26,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:26,462 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:26,462 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:26,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:26,463 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:26,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:26,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:26,463 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:26,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:26,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:26,466 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,466 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:26,466 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:26,466 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:26,466 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,466 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:26,467 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:26,467 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:26,472 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:26,472 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:26,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:26,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:26,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:26,560 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:26,561 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:26,561 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:26,561 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 02:21:26,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:26,561 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:26,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1616 [2022-12-13 02:21:26,561 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:21:26,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:26,561 INFO L85 PathProgramCache]: Analyzing trace with hash -852107258, now seen corresponding path program 1 times [2022-12-13 02:21:26,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:26,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540339273] [2022-12-13 02:21:26,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:26,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:26,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 02:21:26,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:26,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540339273] [2022-12-13 02:21:26,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540339273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:26,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:26,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:26,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196936057] [2022-12-13 02:21:26,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:26,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:26,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:26,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:26,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:26,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:26,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:26,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:26,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:26,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:26,685 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:26,685 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:26,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:26,686 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:26,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:26,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:26,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:26,687 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:26,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:26,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:26,690 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,690 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:26,690 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:26,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:26,690 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:26,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:26,690 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:26,704 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:26,704 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:26,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:26,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:26,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:26,791 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:26,792 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:21:26,792 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:26,792 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 02:21:26,792 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:26,792 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:26,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1617 [2022-12-13 02:21:26,792 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:21:26,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:26,792 INFO L85 PathProgramCache]: Analyzing trace with hash -823478107, now seen corresponding path program 1 times [2022-12-13 02:21:26,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:26,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811466988] [2022-12-13 02:21:26,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:26,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:26,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:21:26,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:26,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811466988] [2022-12-13 02:21:26,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811466988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:26,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:26,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:26,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091556434] [2022-12-13 02:21:26,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:26,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:26,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:26,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:26,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:26,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:26,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:26,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:26,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:26,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:26,935 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:26,935 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:26,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:26,936 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:26,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:26,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:26,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:26,937 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:26,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:26,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:26,940 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,940 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:26,940 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:26,940 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:26,940 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:26,940 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:26,940 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:26,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:26,945 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:26,946 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:26,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:26,946 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:26,946 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:27,033 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:27,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:27,033 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:27,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:27,033 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:27,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:27,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1618 [2022-12-13 02:21:27,034 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:21:27,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:27,034 INFO L85 PathProgramCache]: Analyzing trace with hash -794848956, now seen corresponding path program 1 times [2022-12-13 02:21:27,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:27,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500090152] [2022-12-13 02:21:27,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:27,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:27,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:21:27,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:27,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500090152] [2022-12-13 02:21:27,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500090152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:27,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:27,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:27,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924269673] [2022-12-13 02:21:27,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:27,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:27,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:27,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:27,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:27,083 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:27,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:27,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:27,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:27,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:27,148 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:27,148 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:27,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:27,149 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:27,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:27,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:27,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:27,150 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:27,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:27,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:27,152 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:27,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:27,152 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:27,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:27,152 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:27,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:27,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:27,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:27,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:27,158 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:27,158 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:21:27,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:27,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:27,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:27,246 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:27,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:27,247 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:27,247 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 02:21:27,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:27,247 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:27,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1619 [2022-12-13 02:21:27,247 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:21:27,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:27,247 INFO L85 PathProgramCache]: Analyzing trace with hash -766219805, now seen corresponding path program 1 times [2022-12-13 02:21:27,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:27,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806250471] [2022-12-13 02:21:27,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:27,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:27,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:21:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:27,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806250471] [2022-12-13 02:21:27,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806250471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:27,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:27,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:27,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587384185] [2022-12-13 02:21:27,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:27,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:27,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:27,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:27,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:27,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:27,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:27,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:27,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:27,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:27,370 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:27,370 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:27,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:27,371 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:27,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:27,372 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:27,372 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:27,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:27,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:27,374 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:27,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:27,374 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:27,374 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:27,375 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:27,375 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:27,375 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:27,375 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:27,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:27,380 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:27,380 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:27,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:27,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:27,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:27,467 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:27,467 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:27,467 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:27,468 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 02:21:27,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:27,468 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:27,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1620 [2022-12-13 02:21:27,468 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:21:27,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash -737590654, now seen corresponding path program 1 times [2022-12-13 02:21:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:27,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288237609] [2022-12-13 02:21:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21: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:21:27,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:27,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288237609] [2022-12-13 02:21:27,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288237609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:27,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:27,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711166675] [2022-12-13 02:21:27,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:27,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:27,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:27,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:27,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:27,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:27,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:27,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:27,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:27,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:27,583 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:27,583 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:27,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:27,585 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:27,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:27,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:27,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:27,585 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:27,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:27,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:27,588 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:27,588 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:27,588 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:27,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:27,588 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:27,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:27,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:27,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:27,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:27,594 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:27,594 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:27,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:27,594 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:27,594 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:27,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:27,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:27,682 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:27,682 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 02:21:27,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:27,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:27,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1621 [2022-12-13 02:21:27,682 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:21:27,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:27,682 INFO L85 PathProgramCache]: Analyzing trace with hash -708961503, now seen corresponding path program 1 times [2022-12-13 02:21:27,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:27,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278657100] [2022-12-13 02:21:27,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:27,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:21:27,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:27,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278657100] [2022-12-13 02:21:27,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278657100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:27,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:27,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:27,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420618634] [2022-12-13 02:21:27,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:27,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:27,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:27,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:27,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:27,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:27,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:27,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:27,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:27,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:27,809 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:27,809 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:27,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:27,810 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:27,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:27,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:27,811 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:27,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:27,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:27,813 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:27,813 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:27,813 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:27,813 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:27,813 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:27,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:27,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:27,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:27,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:27,819 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:27,819 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:27,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:27,820 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:27,820 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:27,906 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:27,906 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:27,906 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:27,906 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 02:21:27,906 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:27,906 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:27,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1622 [2022-12-13 02:21:27,906 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:21:27,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:27,906 INFO L85 PathProgramCache]: Analyzing trace with hash -680332352, now seen corresponding path program 1 times [2022-12-13 02:21:27,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:27,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842223408] [2022-12-13 02:21:27,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:27,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:27,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 02:21:27,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:27,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842223408] [2022-12-13 02:21:27,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842223408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:27,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:27,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:27,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705447445] [2022-12-13 02:21:27,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:27,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:27,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:27,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:27,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:27,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:27,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:27,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:27,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:27,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:28,020 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:28,020 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:28,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:28,021 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:28,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:28,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:28,022 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:28,022 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:28,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:28,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:28,024 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,024 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:28,024 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:28,025 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:28,025 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,025 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:28,025 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:28,025 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:28,030 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:28,030 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:28,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:28,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:28,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:28,117 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:28,117 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:21:28,117 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:28,117 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 02:21:28,117 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:28,117 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:28,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1623 [2022-12-13 02:21:28,118 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:21:28,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash -651703201, now seen corresponding path program 1 times [2022-12-13 02:21:28,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:28,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824571597] [2022-12-13 02:21:28,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:28,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:28,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:21:28,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:28,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824571597] [2022-12-13 02:21:28,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824571597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:28,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:28,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:28,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681651528] [2022-12-13 02:21:28,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:28,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:28,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:28,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:28,190 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:28,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:28,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:28,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:28,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:28,258 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:28,258 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:28,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:28,259 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:28,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:28,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:28,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:28,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:28,259 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:28,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:28,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:28,262 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,262 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:28,262 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:28,262 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:28,262 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,262 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:28,262 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:28,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:28,268 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:28,268 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:28,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:28,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:28,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:28,354 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:28,355 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:28,355 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:28,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:28,355 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:28,355 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:28,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1624 [2022-12-13 02:21:28,355 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:21:28,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:28,355 INFO L85 PathProgramCache]: Analyzing trace with hash -623074050, now seen corresponding path program 1 times [2022-12-13 02:21:28,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:28,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569059143] [2022-12-13 02:21:28,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:28,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:21:28,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:28,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569059143] [2022-12-13 02:21:28,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569059143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:28,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:28,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:28,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313096908] [2022-12-13 02:21:28,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:28,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:28,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:28,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:28,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:28,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:28,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:28,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:28,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:28,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:28,471 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:28,471 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:28,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:28,472 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:28,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:28,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:28,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:28,473 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:28,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:28,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:28,475 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,475 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:28,475 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:28,476 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:28,476 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,476 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:28,476 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:28,476 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:28,481 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:28,481 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:28,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:28,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:28,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:28,568 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:28,568 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:21:28,568 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:28,568 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 02:21:28,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:28,569 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:28,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1625 [2022-12-13 02:21:28,569 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:21:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash -594444899, now seen corresponding path program 1 times [2022-12-13 02:21:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:28,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090234015] [2022-12-13 02:21:28,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:28,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:28,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:21:28,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:28,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090234015] [2022-12-13 02:21:28,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090234015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:28,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:28,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:28,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241987113] [2022-12-13 02:21:28,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:28,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:28,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:28,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:28,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:28,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:28,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:28,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:28,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:28,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:28,683 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:28,684 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:28,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:28,685 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:28,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:28,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:28,685 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:28,685 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:28,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:28,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:28,688 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,688 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:28,688 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:28,688 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:28,688 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:28,689 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:28,689 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:28,694 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:28,694 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:28,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:28,695 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:28,695 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:28,789 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:28,789 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:21:28,789 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:28,789 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 02:21:28,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:28,790 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:28,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1626 [2022-12-13 02:21:28,790 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:21:28,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:28,790 INFO L85 PathProgramCache]: Analyzing trace with hash -565815748, now seen corresponding path program 1 times [2022-12-13 02:21:28,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:28,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196983571] [2022-12-13 02:21:28,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:28,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:21:28,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:28,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196983571] [2022-12-13 02:21:28,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196983571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:28,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:28,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:28,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279460468] [2022-12-13 02:21:28,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:28,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:28,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:28,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:28,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:28,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:28,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:28,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:28,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:28,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:28,922 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:28,922 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:28,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:28,923 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:28,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:28,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:28,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:28,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:28,924 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:28,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:28,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:28,926 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,926 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:28,926 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:28,926 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:28,926 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,927 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:28,927 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:28,927 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:28,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:28,932 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:28,932 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:28,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:28,933 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:28,933 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:29,017 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:29,018 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:21:29,018 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:29,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:29,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:29,018 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:29,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1627 [2022-12-13 02:21:29,018 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:21:29,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash -537186597, now seen corresponding path program 1 times [2022-12-13 02:21:29,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:29,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660903187] [2022-12-13 02:21:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:29,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:21:29,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:29,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660903187] [2022-12-13 02:21:29,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660903187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:29,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:29,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:29,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616886737] [2022-12-13 02:21:29,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:29,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:29,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:29,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:29,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:29,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:29,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:29,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:29,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:29,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:29,129 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:29,130 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:29,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:29,131 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:29,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:29,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:29,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:29,131 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:29,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:29,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:29,134 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:29,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:29,134 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:29,134 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:29,134 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:29,134 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:29,134 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:29,134 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:29,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:29,140 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:29,140 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:29,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:29,140 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:29,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:29,224 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:29,224 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-13 02:21:29,224 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:29,224 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 02:21:29,224 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:29,224 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:29,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1628 [2022-12-13 02:21:29,224 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:21:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:29,225 INFO L85 PathProgramCache]: Analyzing trace with hash -508557446, now seen corresponding path program 1 times [2022-12-13 02:21:29,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:29,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526376559] [2022-12-13 02:21:29,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:29,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:29,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:21:29,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:29,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526376559] [2022-12-13 02:21:29,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526376559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:29,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:29,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075637561] [2022-12-13 02:21:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:29,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:29,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:29,276 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:29,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:29,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:29,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:29,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:29,341 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:29,341 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:29,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:29,342 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:29,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:29,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:29,342 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:29,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:29,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:29,345 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:29,345 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:29,345 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:29,345 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:29,345 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:29,345 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:29,345 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:29,345 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:29,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:29,351 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:29,351 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:29,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:29,351 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:29,351 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:29,437 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:29,438 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:29,438 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:29,438 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 02:21:29,438 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:29,438 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:29,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1629 [2022-12-13 02:21:29,438 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:21:29,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:29,438 INFO L85 PathProgramCache]: Analyzing trace with hash -479928295, now seen corresponding path program 1 times [2022-12-13 02:21:29,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:29,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108047688] [2022-12-13 02:21:29,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:29,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:29,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:21:29,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:29,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108047688] [2022-12-13 02:21:29,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108047688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:29,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:29,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:29,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215694410] [2022-12-13 02:21:29,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:29,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:29,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:29,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:29,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:29,486 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:29,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:29,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:29,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:29,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:29,560 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:29,560 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:29,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:29,561 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:29,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:29,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:29,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:29,561 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:29,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:29,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:29,564 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:29,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:29,564 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:29,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:29,564 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:29,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:29,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:29,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:29,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:29,570 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:29,570 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:29,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:29,571 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:29,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:29,658 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:29,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:29,659 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:29,659 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 02:21:29,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:29,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:29,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1630 [2022-12-13 02:21:29,659 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:21:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash -451299144, now seen corresponding path program 1 times [2022-12-13 02:21:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:29,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940693084] [2022-12-13 02:21:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:29,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 02:21:29,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:29,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940693084] [2022-12-13 02:21:29,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940693084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:29,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:29,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:29,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679272359] [2022-12-13 02:21:29,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:29,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:29,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:29,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:29,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:29,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:29,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:29,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:29,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:29,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:29,784 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:29,784 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:29,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:29,785 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:29,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:29,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:29,785 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:29,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:29,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:29,788 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:29,788 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:29,788 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:29,788 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:29,788 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:29,789 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:29,789 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:29,789 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:29,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:29,794 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:29,794 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:29,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:29,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:29,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:29,882 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:29,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:29,882 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:29,882 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 02:21:29,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:29,882 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:29,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1631 [2022-12-13 02:21:29,883 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:21:29,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:29,883 INFO L85 PathProgramCache]: Analyzing trace with hash -422669993, now seen corresponding path program 1 times [2022-12-13 02:21:29,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:29,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503612428] [2022-12-13 02:21:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:29,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:29,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:21:29,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:29,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503612428] [2022-12-13 02:21:29,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503612428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:29,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:29,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:29,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494538038] [2022-12-13 02:21:29,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:29,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:29,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:29,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:29,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:29,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:29,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:29,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:29,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:29,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:30,006 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:30,006 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:30,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:30,007 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:30,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:30,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:30,008 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:30,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:30,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:30,010 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:30,010 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:30,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:30,010 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,011 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:30,011 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:30,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:30,016 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:30,016 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:30,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:30,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:30,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:30,105 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:30,105 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:30,105 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:30,105 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 02:21:30,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:30,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:30,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1632 [2022-12-13 02:21:30,106 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:21:30,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:30,106 INFO L85 PathProgramCache]: Analyzing trace with hash -394040842, now seen corresponding path program 1 times [2022-12-13 02:21:30,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:30,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152307346] [2022-12-13 02:21:30,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:30,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:21:30,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:30,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152307346] [2022-12-13 02:21:30,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152307346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:30,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:30,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:30,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203563145] [2022-12-13 02:21:30,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:30,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:30,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:30,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:30,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:30,158 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:30,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:30,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:30,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:30,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:30,225 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:30,225 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:30,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:30,226 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:30,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:30,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:30,226 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:30,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:30,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:30,229 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:30,229 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:30,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:30,229 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:30,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:30,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:30,235 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:30,235 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:30,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:30,236 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:30,236 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:30,323 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:30,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:30,324 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:30,324 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 02:21:30,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:30,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:30,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1633 [2022-12-13 02:21:30,324 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:21:30,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash -365411691, now seen corresponding path program 1 times [2022-12-13 02:21:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:30,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895626403] [2022-12-13 02:21:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:30,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:30,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:21:30,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:30,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895626403] [2022-12-13 02:21:30,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895626403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:30,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:30,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:30,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675676464] [2022-12-13 02:21:30,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:30,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:30,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:30,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:30,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:30,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:30,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:30,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:30,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:30,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:30,510 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:30,510 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:30,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:30,511 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:30,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:30,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:30,512 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:30,512 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:30,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:30,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:30,515 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,515 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:30,515 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:30,515 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:30,515 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:30,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:30,516 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:30,521 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:30,521 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:30,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:30,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:30,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:30,611 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:30,611 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:30,611 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:30,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:30,611 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:30,611 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:30,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1634 [2022-12-13 02:21:30,612 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:21:30,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:30,612 INFO L85 PathProgramCache]: Analyzing trace with hash -336782540, now seen corresponding path program 1 times [2022-12-13 02:21:30,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:30,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963758866] [2022-12-13 02:21:30,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:30,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:30,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:21:30,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:30,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963758866] [2022-12-13 02:21:30,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963758866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:30,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:30,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377991829] [2022-12-13 02:21:30,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:30,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:30,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:30,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:30,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:30,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:30,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:30,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:30,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:30,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:30,738 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:30,739 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:30,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:30,740 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:30,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:30,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:30,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:30,740 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:30,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:30,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:30,743 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:30,743 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:30,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:30,743 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:30,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:30,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:30,749 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:30,749 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:21:30,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:30,750 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:30,750 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:30,838 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:30,839 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:30,839 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:30,839 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 02:21:30,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:30,839 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:30,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1635 [2022-12-13 02:21:30,839 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:21:30,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash -308153389, now seen corresponding path program 1 times [2022-12-13 02:21:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:30,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085379394] [2022-12-13 02:21:30,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:30,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:21:30,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:30,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085379394] [2022-12-13 02:21:30,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085379394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:30,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:30,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:30,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55299743] [2022-12-13 02:21:30,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:30,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:30,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:30,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:30,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:30,896 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:30,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:30,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:30,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:30,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:30,962 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:30,962 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:30,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:30,963 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:30,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:30,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:30,964 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:30,964 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:30,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:30,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:30,966 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,966 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:30,967 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:30,967 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:30,967 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,967 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:30,967 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:30,967 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:30,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:30,973 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:30,973 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:30,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:30,973 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:30,973 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:31,061 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:31,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:31,061 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:31,061 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 02:21:31,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:31,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:31,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1636 [2022-12-13 02:21:31,063 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:21:31,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:31,063 INFO L85 PathProgramCache]: Analyzing trace with hash -279524238, now seen corresponding path program 1 times [2022-12-13 02:21:31,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:31,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928608169] [2022-12-13 02:21:31,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:31,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:31,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 02:21:31,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:31,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928608169] [2022-12-13 02:21:31,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928608169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:31,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:31,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:31,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013024841] [2022-12-13 02:21:31,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:31,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:31,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:31,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:31,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:31,128 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:31,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:31,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:31,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:31,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:31,194 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:31,195 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:31,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:31,196 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:31,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:31,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:31,196 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:31,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:31,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:31,199 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:31,199 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:31,199 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:31,199 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:31,199 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:31,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:31,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:31,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:31,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:31,205 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:31,205 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:31,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:31,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:31,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:31,292 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:31,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:31,293 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:31,293 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 02:21:31,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:31,293 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:31,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1637 [2022-12-13 02:21:31,293 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:21:31,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash -250895087, now seen corresponding path program 1 times [2022-12-13 02:21:31,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:31,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607745224] [2022-12-13 02:21:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:31,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:21:31,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:31,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607745224] [2022-12-13 02:21:31,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607745224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:31,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:31,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:31,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382809415] [2022-12-13 02:21:31,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:31,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:31,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:31,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:31,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:31,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:31,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:31,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:31,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:31,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:31,439 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:31,439 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:31,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:31,440 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:31,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:31,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:31,441 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:31,441 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:31,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:31,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:31,444 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:31,444 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:31,444 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:31,444 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:31,444 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:31,444 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:31,444 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:31,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:31,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:31,450 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:31,450 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:31,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:31,450 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:31,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:31,538 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:31,538 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:31,538 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:31,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:31,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:31,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:31,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1638 [2022-12-13 02:21:31,538 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:21:31,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:31,539 INFO L85 PathProgramCache]: Analyzing trace with hash -222265936, now seen corresponding path program 1 times [2022-12-13 02:21:31,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:31,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004870767] [2022-12-13 02:21:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:31,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:31,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:21:31,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:31,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004870767] [2022-12-13 02:21:31,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004870767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:31,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:31,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:31,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591096012] [2022-12-13 02:21:31,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:31,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:31,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:31,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:31,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:31,590 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:31,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:31,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:31,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:31,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:31,656 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:31,656 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:31,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:31,657 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:31,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:31,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:31,657 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:31,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:31,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:31,660 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:31,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:31,660 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:31,660 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:31,660 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:31,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:31,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:31,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:31,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:31,666 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:31,666 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:31,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:31,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:31,667 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:31,754 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:31,755 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:31,755 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:31,755 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 02:21:31,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:31,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:31,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1639 [2022-12-13 02:21:31,755 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:21:31,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash -193636785, now seen corresponding path program 1 times [2022-12-13 02:21:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:31,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425234514] [2022-12-13 02:21:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:31,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:31,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:21:31,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:31,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425234514] [2022-12-13 02:21:31,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425234514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:31,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:31,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:31,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096167666] [2022-12-13 02:21:31,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:31,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:31,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:31,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:31,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:31,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:31,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:31,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:31,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:31,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:31,886 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:31,886 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:31,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:31,887 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:31,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:31,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:31,888 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:31,888 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:31,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:31,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:31,890 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:31,891 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:31,891 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:31,891 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:31,891 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:31,891 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:31,891 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:31,891 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:31,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:31,897 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:31,897 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:31,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:31,897 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:31,897 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:31,984 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:31,985 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:31,985 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:31,985 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 02:21:31,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:31,985 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:31,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1640 [2022-12-13 02:21:31,985 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:21:31,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash -165007634, now seen corresponding path program 1 times [2022-12-13 02:21:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:31,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181969163] [2022-12-13 02:21:31,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:31,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:32,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:21:32,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:32,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181969163] [2022-12-13 02:21:32,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181969163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:32,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:32,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073597788] [2022-12-13 02:21:32,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:32,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:32,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:32,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:32,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:32,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:32,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:32,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:32,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:32,100 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:32,101 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:32,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:32,102 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:32,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:32,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:32,102 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:32,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:32,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:32,105 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:32,105 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:32,105 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:32,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:32,105 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:32,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:32,105 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:32,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:32,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:32,111 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:32,111 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:32,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:32,111 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:32,111 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:32,199 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:32,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:32,200 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:32,200 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 02:21:32,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:32,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:32,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1641 [2022-12-13 02:21:32,200 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:21:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash -136378483, now seen corresponding path program 1 times [2022-12-13 02:21:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:32,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764947918] [2022-12-13 02:21:32,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:32,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:21:32,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:32,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764947918] [2022-12-13 02:21:32,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764947918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:32,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:32,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:32,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552876194] [2022-12-13 02:21:32,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:32,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:32,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:32,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:32,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:32,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:32,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:32,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:32,317 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:32,317 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:32,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:32,318 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:32,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:32,319 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:32,319 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:32,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:32,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:32,322 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:32,322 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:32,322 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:32,322 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:32,322 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:32,322 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:32,322 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:32,322 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:32,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:32,328 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:32,328 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:32,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:32,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:32,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:32,415 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:32,415 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:32,415 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:32,415 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 02:21:32,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:32,415 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:32,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1642 [2022-12-13 02:21:32,416 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:21:32,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash -107749332, now seen corresponding path program 1 times [2022-12-13 02:21:32,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:32,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888592925] [2022-12-13 02:21:32,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:32,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:32,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:21:32,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:32,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888592925] [2022-12-13 02:21:32,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888592925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:32,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:32,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:32,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779304163] [2022-12-13 02:21:32,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:32,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:32,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:32,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:32,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:32,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:32,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:32,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:32,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:32,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:32,561 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:32,561 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:32,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:32,562 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:32,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:32,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:32,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:32,563 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:32,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:32,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:32,565 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:32,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:32,565 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:32,566 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:32,566 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:32,566 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:32,566 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:32,566 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:32,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:32,571 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:32,572 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:32,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:32,572 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:32,572 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:32,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:32,660 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:32,660 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:32,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:32,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:32,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:32,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1643 [2022-12-13 02:21:32,661 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:21:32,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:32,661 INFO L85 PathProgramCache]: Analyzing trace with hash -79120181, now seen corresponding path program 1 times [2022-12-13 02:21:32,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:32,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672610752] [2022-12-13 02:21:32,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:32,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:32,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:21:32,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:32,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672610752] [2022-12-13 02:21:32,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672610752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:32,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:32,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:32,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576040337] [2022-12-13 02:21:32,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:32,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:32,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:32,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:32,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:32,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:32,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:32,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:32,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:32,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:32,781 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:32,781 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:32,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:32,782 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:32,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:32,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:32,783 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:32,783 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:32,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:32,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:32,785 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:32,785 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:32,786 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:32,786 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:32,786 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:32,786 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:32,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:32,786 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:32,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:32,791 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:32,792 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:32,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:32,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:32,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:32,881 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:32,881 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:32,881 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:32,881 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 02:21:32,881 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:32,881 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:32,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1644 [2022-12-13 02:21:32,882 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:21:32,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:32,882 INFO L85 PathProgramCache]: Analyzing trace with hash -50491030, now seen corresponding path program 1 times [2022-12-13 02:21:32,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:32,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580345443] [2022-12-13 02:21:32,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:32,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:32,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:21:32,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:32,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580345443] [2022-12-13 02:21:32,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580345443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:32,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:32,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:32,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900660206] [2022-12-13 02:21:32,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:32,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:32,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:32,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:32,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:32,941 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:32,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:32,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:32,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:32,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:33,008 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:33,008 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:33,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:33,009 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:33,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:33,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:33,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:33,010 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:33,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:33,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:33,012 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,013 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:33,013 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:33,013 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:33,013 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,013 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:33,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:33,013 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:33,018 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:33,019 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:33,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:33,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:33,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:33,131 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:33,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:21:33,132 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:33,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 02:21:33,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:33,132 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:33,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1645 [2022-12-13 02:21:33,132 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:21:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:33,132 INFO L85 PathProgramCache]: Analyzing trace with hash -21861879, now seen corresponding path program 1 times [2022-12-13 02:21:33,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:33,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373618403] [2022-12-13 02:21:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:33,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:33,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:21:33,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:33,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373618403] [2022-12-13 02:21:33,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373618403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:33,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:33,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:33,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927720046] [2022-12-13 02:21:33,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:33,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:33,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:33,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:33,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:33,184 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:33,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:33,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:33,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:33,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:33,260 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:33,260 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:33,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:33,261 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:33,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:33,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:33,262 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:33,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:33,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:33,264 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,264 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:33,264 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:33,264 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:33,264 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,265 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:33,265 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:33,265 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:33,270 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:33,270 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:33,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:33,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:33,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:33,359 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:33,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:33,360 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:33,360 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 02:21:33,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:33,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:33,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1646 [2022-12-13 02:21:33,360 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:21:33,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:33,360 INFO L85 PathProgramCache]: Analyzing trace with hash 6767272, now seen corresponding path program 1 times [2022-12-13 02:21:33,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:33,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566563061] [2022-12-13 02:21:33,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:33,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:33,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:21:33,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:33,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566563061] [2022-12-13 02:21:33,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566563061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:33,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:33,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956847960] [2022-12-13 02:21:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:33,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:33,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:33,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:33,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:33,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:33,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:33,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:33,478 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:33,478 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:33,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:33,479 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:33,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:33,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:33,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:33,480 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:33,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:33,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:33,482 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,482 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:33,483 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:33,483 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:33,483 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,483 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:33,483 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:33,483 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:33,489 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:33,489 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:33,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:33,489 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:33,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:33,579 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:33,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:33,579 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:33,579 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 02:21:33,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:33,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:33,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1647 [2022-12-13 02:21:33,579 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:21:33,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:33,580 INFO L85 PathProgramCache]: Analyzing trace with hash 35396423, now seen corresponding path program 1 times [2022-12-13 02:21:33,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:33,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873299239] [2022-12-13 02:21:33,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:33,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:33,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:21:33,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:33,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873299239] [2022-12-13 02:21:33,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873299239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:33,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:33,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:33,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443489777] [2022-12-13 02:21:33,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:33,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:33,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:33,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:33,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:33,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:33,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:33,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:33,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:33,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:33,727 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:33,727 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:33,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1129 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:33,728 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:33,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:33,729 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:33,729 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:33,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:33,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:33,731 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,731 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:33,731 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:33,731 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:33,731 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:33,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:33,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:33,737 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:33,737 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:33,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:33,738 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:33,738 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:33,828 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:33,828 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:21:33,828 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:33,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:33,829 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:33,829 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:33,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1648 [2022-12-13 02:21:33,829 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:21:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:33,829 INFO L85 PathProgramCache]: Analyzing trace with hash 64025574, now seen corresponding path program 1 times [2022-12-13 02:21:33,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:33,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715408484] [2022-12-13 02:21:33,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:33,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:33,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:21:33,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:33,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715408484] [2022-12-13 02:21:33,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715408484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:33,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:33,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:33,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747535258] [2022-12-13 02:21:33,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:33,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:33,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:33,900 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:33,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:33,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:33,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:33,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:33,977 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:33,977 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:33,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:33,978 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:33,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:33,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:33,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:33,979 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:33,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:33,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:33,981 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,981 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:33,981 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:33,981 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:33,981 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:33,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:33,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:33,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:33,987 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:33,987 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:33,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:33,988 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:33,988 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:34,076 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:34,077 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:34,077 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:34,077 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 02:21:34,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:34,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:34,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1649 [2022-12-13 02:21:34,077 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:21:34,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash 92654725, now seen corresponding path program 1 times [2022-12-13 02:21:34,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:34,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830951239] [2022-12-13 02:21:34,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:34,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:34,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:21:34,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:34,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830951239] [2022-12-13 02:21:34,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830951239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:34,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:34,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:34,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250555257] [2022-12-13 02:21:34,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:34,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:34,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:34,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:34,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:34,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:34,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:34,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:34,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:34,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:34,227 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:34,227 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:34,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:34,228 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:34,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:34,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:34,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:34,229 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:34,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:34,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:34,231 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:34,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:34,231 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:34,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:34,231 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:34,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:34,232 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:34,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:34,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:34,237 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:34,237 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:34,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:34,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:34,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:34,327 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:34,328 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:21:34,328 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:34,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:34,328 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:34,328 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:34,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1650 [2022-12-13 02:21:34,328 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:21:34,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:34,328 INFO L85 PathProgramCache]: Analyzing trace with hash 121283876, now seen corresponding path program 1 times [2022-12-13 02:21:34,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:34,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973371940] [2022-12-13 02:21:34,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:34,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21: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:21:34,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:34,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973371940] [2022-12-13 02:21:34,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973371940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:34,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:34,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:34,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218968813] [2022-12-13 02:21:34,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:34,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:34,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:34,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:34,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:34,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:34,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:34,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:34,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:34,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:34,445 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:34,446 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:34,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:34,447 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:34,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:34,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:34,447 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:34,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:34,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:34,450 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:34,450 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:34,450 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:34,450 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:34,450 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:34,450 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:34,450 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:34,450 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:34,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:34,456 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:34,456 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:34,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:34,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:34,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:34,542 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:34,543 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:34,543 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:34,543 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 02:21:34,543 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:34,543 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:34,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1651 [2022-12-13 02:21:34,544 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:21:34,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash 149913027, now seen corresponding path program 1 times [2022-12-13 02:21:34,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:34,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910393282] [2022-12-13 02:21:34,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:34,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:34,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:21:34,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:34,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910393282] [2022-12-13 02:21:34,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910393282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:34,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:34,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:34,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915195969] [2022-12-13 02:21:34,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:34,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:34,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:34,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:34,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:34,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:34,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:34,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:34,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:34,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:34,657 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:34,657 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:34,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:34,658 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:34,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:34,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:34,658 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:34,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:34,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:34,661 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:34,661 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:34,661 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:34,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:34,661 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:34,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:34,662 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:34,662 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:34,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:34,667 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:34,667 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:34,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:34,668 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:34,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:34,754 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:34,755 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:34,755 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:34,755 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 02:21:34,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:34,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:34,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1652 [2022-12-13 02:21:34,755 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:21:34,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash 178542178, now seen corresponding path program 1 times [2022-12-13 02:21:34,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:34,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448575606] [2022-12-13 02:21:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:34,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:34,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:21:34,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:34,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448575606] [2022-12-13 02:21:34,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448575606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:34,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:34,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:34,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772644626] [2022-12-13 02:21:34,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:34,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:34,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:34,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:34,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:34,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:34,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:34,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:34,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:34,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:34,878 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:34,879 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:34,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:34,880 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:34,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:34,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:34,880 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:34,880 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:34,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:34,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:34,883 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:34,883 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:34,883 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:34,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:34,883 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:34,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:34,883 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:34,883 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:34,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:34,889 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:34,889 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:34,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:34,889 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:34,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:34,978 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:34,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:34,979 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:34,979 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 02:21:34,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:34,979 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:34,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1653 [2022-12-13 02:21:34,979 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:21:34,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:34,979 INFO L85 PathProgramCache]: Analyzing trace with hash 207171329, now seen corresponding path program 1 times [2022-12-13 02:21:34,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:34,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124201827] [2022-12-13 02:21:34,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:34,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:35,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:21:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:35,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124201827] [2022-12-13 02:21:35,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124201827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:35,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:35,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117037978] [2022-12-13 02:21:35,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:35,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:35,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:35,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:35,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:35,040 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:35,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:35,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:35,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:35,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:35,106 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:35,106 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:35,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:35,107 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:35,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:35,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:35,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:35,107 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:35,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:35,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:35,110 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:35,110 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:35,110 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:35,110 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:35,110 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:35,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:35,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:35,111 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:35,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:35,116 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:35,116 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:35,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:35,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:35,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:35,204 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:35,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:35,205 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:35,205 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 02:21:35,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:35,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:35,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1654 [2022-12-13 02:21:35,205 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:21:35,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:35,205 INFO L85 PathProgramCache]: Analyzing trace with hash 235800480, now seen corresponding path program 1 times [2022-12-13 02:21:35,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:35,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435026933] [2022-12-13 02:21:35,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:35,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:35,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:21:35,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:35,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435026933] [2022-12-13 02:21:35,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435026933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:35,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:35,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:35,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266332722] [2022-12-13 02:21:35,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:35,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:35,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:35,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:35,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:35,257 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:35,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:35,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:35,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:35,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:35,333 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:35,333 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:35,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:35,334 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:35,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:35,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:35,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:35,335 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:35,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:35,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:35,337 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:35,338 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:35,338 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:35,338 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:35,338 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:35,338 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:35,338 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:35,338 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:35,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:35,344 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:35,344 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:35,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:35,344 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:35,344 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:35,432 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:35,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:35,432 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:35,432 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 02:21:35,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:35,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:35,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1655 [2022-12-13 02:21:35,432 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:21:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:35,433 INFO L85 PathProgramCache]: Analyzing trace with hash 264429631, now seen corresponding path program 1 times [2022-12-13 02:21:35,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:35,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237969842] [2022-12-13 02:21:35,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:35,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:21:35,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:35,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237969842] [2022-12-13 02:21:35,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237969842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:35,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:35,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:35,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691947224] [2022-12-13 02:21:35,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:35,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:35,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:35,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:35,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:35,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:35,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:35,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:35,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:35,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:35,550 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:35,551 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:35,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:35,552 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:35,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:35,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:35,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:35,552 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:35,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:35,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:35,555 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:35,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:35,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:35,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:35,555 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:35,555 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:35,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:35,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:35,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:35,561 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:35,561 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:35,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:35,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:35,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:35,648 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:35,648 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:35,648 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:35,648 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 02:21:35,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:35,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:35,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1656 [2022-12-13 02:21:35,648 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:21:35,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:35,648 INFO L85 PathProgramCache]: Analyzing trace with hash 293058782, now seen corresponding path program 1 times [2022-12-13 02:21:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:35,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556803964] [2022-12-13 02:21:35,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:35,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:35,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:21:35,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:35,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556803964] [2022-12-13 02:21:35,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556803964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:35,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:35,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:35,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616904844] [2022-12-13 02:21:35,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:35,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:35,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:35,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:35,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:35,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:35,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:35,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:35,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:35,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:35,773 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:35,773 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:35,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:35,774 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:35,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:35,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:35,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:35,775 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:35,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:35,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:35,777 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:35,777 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:35,777 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:35,778 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:35,778 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:35,778 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:35,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:35,778 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:35,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:35,783 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:35,783 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:35,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:35,784 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:35,784 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:35,870 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:35,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:35,871 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:35,871 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 02:21:35,871 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:35,871 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:35,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1657 [2022-12-13 02:21:35,871 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:21:35,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:35,871 INFO L85 PathProgramCache]: Analyzing trace with hash 321687933, now seen corresponding path program 1 times [2022-12-13 02:21:35,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:35,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450674607] [2022-12-13 02:21:35,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:35,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:35,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 02:21:35,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:35,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450674607] [2022-12-13 02:21:35,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450674607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:35,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:35,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:35,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200975016] [2022-12-13 02:21:35,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:35,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:35,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:35,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:35,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:35,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:35,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:35,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:35,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:35,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:36,003 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:36,003 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:36,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:36,004 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:36,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:36,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:36,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:36,004 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:36,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:36,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:36,007 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,007 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:36,007 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:36,007 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:36,007 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,007 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:36,008 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:36,008 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:36,021 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:36,021 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:36,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:36,021 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:36,021 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:36,108 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:36,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:21:36,108 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:36,108 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 02:21:36,108 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:36,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:36,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1658 [2022-12-13 02:21:36,108 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:21:36,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:36,109 INFO L85 PathProgramCache]: Analyzing trace with hash 350317084, now seen corresponding path program 1 times [2022-12-13 02:21:36,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:36,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385744864] [2022-12-13 02:21:36,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:36,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:36,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:21:36,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:36,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385744864] [2022-12-13 02:21:36,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385744864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:36,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:36,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:36,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433934892] [2022-12-13 02:21:36,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:36,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:36,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:36,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:36,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:36,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:36,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:36,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:36,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:36,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:36,242 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:36,243 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:36,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:36,244 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:36,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:36,244 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:36,244 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:36,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:36,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:36,247 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,247 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:36,247 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:36,247 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:36,247 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,247 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:36,247 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:36,247 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:36,253 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:36,253 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:36,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:36,253 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:36,253 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:36,340 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:36,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:36,340 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:36,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:36,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:36,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:36,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1659 [2022-12-13 02:21:36,340 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:21:36,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:36,340 INFO L85 PathProgramCache]: Analyzing trace with hash 378946235, now seen corresponding path program 1 times [2022-12-13 02:21:36,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:36,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598301943] [2022-12-13 02:21:36,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:36,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:36,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:21:36,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:36,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598301943] [2022-12-13 02:21:36,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598301943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:36,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:36,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:36,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596802899] [2022-12-13 02:21:36,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:36,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:36,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:36,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:36,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:36,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:36,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:36,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:36,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:36,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:36,482 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:36,482 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:36,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:36,483 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:36,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:36,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:36,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:36,483 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:36,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:36,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:36,486 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,486 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:36,486 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:36,486 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:36,486 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:36,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:36,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:36,492 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:36,492 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:36,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:36,493 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:36,493 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:36,580 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:36,580 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:36,580 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:36,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:36,580 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:36,580 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:36,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1660 [2022-12-13 02:21:36,581 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:21:36,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:36,581 INFO L85 PathProgramCache]: Analyzing trace with hash 407575386, now seen corresponding path program 1 times [2022-12-13 02:21:36,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:36,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840408152] [2022-12-13 02:21:36,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:36,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:36,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:21:36,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:36,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840408152] [2022-12-13 02:21:36,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840408152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:36,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:36,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:36,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074443224] [2022-12-13 02:21:36,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:36,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:36,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:36,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:36,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:36,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:36,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:36,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:36,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:36,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:36,708 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:36,709 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:36,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:36,710 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:36,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:36,710 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:36,710 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:36,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:36,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:36,713 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,713 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:36,713 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:36,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:36,713 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:36,713 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:36,713 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:36,719 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:36,719 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:36,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:36,720 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:36,720 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:36,807 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:36,808 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:36,808 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:36,808 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 02:21:36,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:36,808 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:36,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1661 [2022-12-13 02:21:36,808 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:21:36,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:36,808 INFO L85 PathProgramCache]: Analyzing trace with hash 436204537, now seen corresponding path program 1 times [2022-12-13 02:21:36,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:36,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731471335] [2022-12-13 02:21:36,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:36,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:36,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:21:36,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:36,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731471335] [2022-12-13 02:21:36,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731471335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:36,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:36,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:36,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519187440] [2022-12-13 02:21:36,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:36,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:36,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:36,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:36,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:36,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:36,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:36,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:36,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:36,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:36,930 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:36,931 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:36,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1128 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:36,932 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:36,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:36,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:36,932 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:36,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:36,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:36,935 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,935 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:36,935 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:36,935 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:36,935 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,935 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:36,935 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:36,936 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:36,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:36,941 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:36,941 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:36,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:36,942 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:36,942 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:37,029 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:37,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:37,029 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:37,030 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 02:21:37,030 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:37,030 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:37,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1662 [2022-12-13 02:21:37,030 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:21:37,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash 464833688, now seen corresponding path program 1 times [2022-12-13 02:21:37,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:37,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997664754] [2022-12-13 02:21:37,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:37,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:37,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:21:37,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:37,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997664754] [2022-12-13 02:21:37,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997664754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:37,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:37,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:37,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466798680] [2022-12-13 02:21:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:37,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:37,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:37,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:37,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:37,090 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:37,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:37,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:37,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:37,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:37,155 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:37,155 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:37,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:37,156 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:37,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:37,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:37,157 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:37,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:37,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:37,159 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:37,159 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:37,159 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:37,160 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:37,160 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:37,160 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:37,160 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:37,160 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:37,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:37,165 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:37,165 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:37,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:37,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:37,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:37,254 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:37,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:37,254 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:37,254 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 02:21:37,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:37,255 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:37,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1663 [2022-12-13 02:21:37,255 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:21:37,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:37,255 INFO L85 PathProgramCache]: Analyzing trace with hash 493462839, now seen corresponding path program 1 times [2022-12-13 02:21:37,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:37,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720559149] [2022-12-13 02:21:37,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:37,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:37,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:21:37,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:37,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720559149] [2022-12-13 02:21:37,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720559149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:37,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:37,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:37,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637675328] [2022-12-13 02:21:37,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:37,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:37,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:37,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:37,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:37,306 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:37,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:37,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:37,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:37,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:37,372 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:37,372 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:37,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:37,373 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:37,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:37,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:37,374 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:37,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:37,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:37,376 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:37,377 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:37,377 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:37,377 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:37,377 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:37,377 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:37,377 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:37,377 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:37,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:37,382 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:37,383 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:21:37,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:37,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:37,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:37,471 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:37,472 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:37,472 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:37,472 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 02:21:37,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:37,472 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:37,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1664 [2022-12-13 02:21:37,472 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:21:37,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash 522091990, now seen corresponding path program 1 times [2022-12-13 02:21:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:37,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390148123] [2022-12-13 02:21:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:37,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:21:37,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:37,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390148123] [2022-12-13 02:21:37,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390148123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:37,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:37,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:37,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901319322] [2022-12-13 02:21:37,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:37,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:37,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:37,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:37,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:37,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:37,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:37,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:37,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:37,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:37,601 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:37,601 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:37,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:37,602 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:37,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:37,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:37,602 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:37,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:37,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:37,605 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:37,605 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:37,605 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:37,605 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:37,605 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:37,605 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:37,605 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:37,605 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:37,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:37,611 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:37,611 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:37,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:37,612 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:37,612 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:37,699 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:37,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:37,700 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:37,700 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 02:21:37,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:37,700 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:37,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1665 [2022-12-13 02:21:37,700 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:21:37,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:37,700 INFO L85 PathProgramCache]: Analyzing trace with hash 550721141, now seen corresponding path program 1 times [2022-12-13 02:21:37,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:37,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261346114] [2022-12-13 02:21:37,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:37,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:37,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:21:37,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:37,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261346114] [2022-12-13 02:21:37,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261346114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:37,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:37,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:37,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159219610] [2022-12-13 02:21:37,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:37,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:37,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:37,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:37,751 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:37,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:37,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:37,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:37,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:37,827 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:37,827 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:37,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:37,828 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:37,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:37,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:37,828 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:37,828 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:37,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:37,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:37,831 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:37,831 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:37,831 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:37,831 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:37,831 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:37,832 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:37,832 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:37,832 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:37,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:37,837 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:37,837 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:21:37,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:37,838 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:37,838 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:37,923 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:37,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:37,924 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:37,924 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 02:21:37,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:37,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:37,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1666 [2022-12-13 02:21:37,924 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:21:37,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:37,924 INFO L85 PathProgramCache]: Analyzing trace with hash 579350292, now seen corresponding path program 1 times [2022-12-13 02:21:37,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:37,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244157815] [2022-12-13 02:21:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:37,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:21:37,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:37,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244157815] [2022-12-13 02:21:37,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244157815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:37,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:37,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331398134] [2022-12-13 02:21:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:37,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:37,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:37,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:37,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:37,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:37,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:37,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:37,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:38,041 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:38,041 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:38,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:38,042 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:38,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:38,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:38,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:38,043 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:38,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:38,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:38,045 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,045 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:38,045 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:38,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:38,045 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,046 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:38,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:38,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:38,060 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:38,060 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:38,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:38,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:38,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:38,148 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:38,148 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:21:38,148 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:38,148 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 02:21:38,148 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:38,148 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:38,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1667 [2022-12-13 02:21:38,148 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:21:38,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash 607979443, now seen corresponding path program 1 times [2022-12-13 02:21:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:38,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335974040] [2022-12-13 02:21:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:38,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:38,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 02:21:38,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:38,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335974040] [2022-12-13 02:21:38,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335974040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:38,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:38,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:38,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374827027] [2022-12-13 02:21:38,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:38,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:38,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:38,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:38,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:38,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:38,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:38,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:38,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:38,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:38,275 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:38,275 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:38,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:38,276 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:38,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:38,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:38,277 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:38,277 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:38,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:38,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:38,279 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,279 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:38,280 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:38,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:38,280 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,280 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:38,280 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:38,280 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:38,285 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:38,285 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:38,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:38,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:38,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:38,373 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:38,373 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:38,373 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:38,373 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 02:21:38,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:38,373 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:38,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1668 [2022-12-13 02:21:38,374 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:21:38,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:38,374 INFO L85 PathProgramCache]: Analyzing trace with hash 636608594, now seen corresponding path program 1 times [2022-12-13 02:21:38,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:38,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027488871] [2022-12-13 02:21:38,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:38,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21: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 02:21:38,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:38,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027488871] [2022-12-13 02:21:38,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027488871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:38,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:38,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942055700] [2022-12-13 02:21:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:38,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:38,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:38,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:38,424 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:38,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:38,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:38,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:38,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:38,501 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:38,501 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:38,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:38,502 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:38,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:38,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:38,503 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:38,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:38,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:38,505 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,505 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:38,505 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:38,506 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:38,506 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,506 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:38,506 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:38,506 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:38,511 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:38,511 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:21:38,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:38,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:38,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:38,600 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:38,600 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:38,601 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:38,601 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 02:21:38,601 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:38,601 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:38,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1669 [2022-12-13 02:21:38,601 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:21:38,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:38,601 INFO L85 PathProgramCache]: Analyzing trace with hash 665237745, now seen corresponding path program 1 times [2022-12-13 02:21:38,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:38,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325431976] [2022-12-13 02:21:38,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:38,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:38,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:21:38,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:38,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325431976] [2022-12-13 02:21:38,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325431976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:38,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:38,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:38,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005839267] [2022-12-13 02:21:38,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:38,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:38,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:38,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:38,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:38,650 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:38,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:38,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:38,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:38,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:38,716 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:38,716 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:38,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:38,718 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:38,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:38,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:38,718 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:38,718 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:38,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:38,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:38,721 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,721 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:38,721 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:38,721 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:38,721 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,721 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:38,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:38,722 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:38,727 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:38,727 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:38,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:38,728 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:38,728 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:38,816 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:38,816 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:38,816 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:38,816 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 02:21:38,816 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:38,816 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:38,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1670 [2022-12-13 02:21:38,816 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:21:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash 693866896, now seen corresponding path program 1 times [2022-12-13 02:21:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:38,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283299677] [2022-12-13 02:21:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:38,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 02:21:38,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:38,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283299677] [2022-12-13 02:21:38,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283299677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:38,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:38,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:38,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152572197] [2022-12-13 02:21:38,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:38,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:38,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:38,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:38,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:38,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:38,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:38,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:38,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:38,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:38,937 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:38,937 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:38,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:38,938 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:38,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:38,939 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:38,939 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:38,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:38,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:38,941 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,942 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:38,942 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:38,942 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:38,942 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,942 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:38,942 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:38,942 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:38,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:38,948 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:38,948 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:38,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:38,948 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:38,948 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:39,035 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:39,036 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:39,036 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:39,036 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 02:21:39,036 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:39,036 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:39,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1671 [2022-12-13 02:21:39,036 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:21:39,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:39,036 INFO L85 PathProgramCache]: Analyzing trace with hash 722496047, now seen corresponding path program 1 times [2022-12-13 02:21:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:39,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499441389] [2022-12-13 02:21:39,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:39,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:39,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 02:21:39,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:39,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499441389] [2022-12-13 02:21:39,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499441389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:39,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:39,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:39,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919456066] [2022-12-13 02:21:39,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:39,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:39,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:39,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:39,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:39,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:39,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:39,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:39,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:39,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:39,173 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:39,173 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:39,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:39,174 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:39,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:39,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:39,175 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:39,175 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:39,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:39,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:39,177 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:39,177 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:39,178 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:39,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:39,178 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:39,178 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:39,178 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:39,178 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:39,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:39,183 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:39,184 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:39,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:39,184 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:39,184 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:39,272 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:39,272 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:39,272 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:39,272 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 02:21:39,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:39,273 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:39,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1672 [2022-12-13 02:21:39,273 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:21:39,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:39,273 INFO L85 PathProgramCache]: Analyzing trace with hash 751125198, now seen corresponding path program 1 times [2022-12-13 02:21:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:39,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573591320] [2022-12-13 02:21:39,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:39,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:39,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 02:21:39,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:39,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573591320] [2022-12-13 02:21:39,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573591320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:39,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:39,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:39,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151092925] [2022-12-13 02:21:39,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:39,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:39,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:39,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:39,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:39,336 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:39,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:39,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:39,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:39,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:39,428 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:39,429 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:39,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:39,430 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:39,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:39,431 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:39,431 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:39,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:39,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:39,435 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:39,435 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:39,436 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:39,436 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:39,436 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:39,436 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:39,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:39,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:39,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:39,444 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:39,444 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:21:39,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:39,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:39,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:39,548 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:39,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 02:21:39,548 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:39,548 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 02:21:39,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:39,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:39,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1673 [2022-12-13 02:21:39,549 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:21:39,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:39,549 INFO L85 PathProgramCache]: Analyzing trace with hash 779754349, now seen corresponding path program 1 times [2022-12-13 02:21:39,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:39,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074254069] [2022-12-13 02:21:39,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:39,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:39,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:21:39,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:39,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074254069] [2022-12-13 02:21:39,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074254069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:39,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:39,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:39,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868025630] [2022-12-13 02:21:39,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:39,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:39,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:39,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:39,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:39,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:39,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:39,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:39,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:39,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:39,682 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:39,682 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:39,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:39,683 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:39,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:39,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:39,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:39,684 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:39,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:39,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:39,686 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:39,687 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:39,687 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:39,687 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:39,687 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:39,687 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:39,687 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:39,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:39,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:39,693 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:39,693 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:39,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:39,693 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:39,693 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:39,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:39,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:39,780 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:39,780 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 02:21:39,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:39,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:39,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1674 [2022-12-13 02:21:39,781 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:21:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash 808383500, now seen corresponding path program 1 times [2022-12-13 02:21:39,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:39,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624794362] [2022-12-13 02:21:39,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:39,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:39,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:21:39,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:39,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624794362] [2022-12-13 02:21:39,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624794362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:39,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:39,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:39,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915771719] [2022-12-13 02:21:39,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:39,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:39,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:39,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:39,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:39,831 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:39,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:39,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:39,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:39,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:39,904 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:39,904 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:39,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:39,906 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:39,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:39,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:39,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:39,906 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:39,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:39,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:39,909 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:39,909 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:39,909 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:39,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:39,909 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:39,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:39,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:39,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:39,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:39,915 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:39,915 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:39,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:39,916 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:39,916 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:40,003 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:40,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:40,003 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:40,003 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 02:21:40,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:40,004 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:40,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1675 [2022-12-13 02:21:40,004 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:21:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash 837012651, now seen corresponding path program 1 times [2022-12-13 02:21:40,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:40,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528257562] [2022-12-13 02:21:40,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:40,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:40,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:21:40,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:40,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528257562] [2022-12-13 02:21:40,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528257562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:40,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:40,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:40,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623711455] [2022-12-13 02:21:40,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:40,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:40,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:40,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:40,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:40,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:40,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:40,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:40,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:40,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:40,122 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:40,123 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:40,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:40,124 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:40,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:40,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:40,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:40,124 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:40,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:40,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:40,127 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:40,127 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:40,127 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:40,127 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:40,127 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:40,127 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:40,127 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:40,127 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:40,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:40,133 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:40,133 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:40,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:40,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:40,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:40,221 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:40,221 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:40,221 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:40,221 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 02:21:40,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:40,222 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:40,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1676 [2022-12-13 02:21:40,222 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:21:40,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:40,222 INFO L85 PathProgramCache]: Analyzing trace with hash 865641802, now seen corresponding path program 1 times [2022-12-13 02:21:40,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:40,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773567087] [2022-12-13 02:21:40,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:40,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:40,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:21:40,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:40,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773567087] [2022-12-13 02:21:40,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773567087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:40,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:40,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135941619] [2022-12-13 02:21:40,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:40,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:40,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:40,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:40,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:40,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:40,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:40,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:40,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:40,353 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:40,353 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:40,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:40,355 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:40,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:40,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:40,355 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:40,355 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:40,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:40,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:40,358 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:40,358 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:40,358 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:40,358 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:40,358 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:40,358 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:40,358 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:40,358 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:40,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:40,364 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:40,364 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:40,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:40,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:40,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:40,451 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:40,452 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:40,452 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:40,452 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 02:21:40,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:40,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:40,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1677 [2022-12-13 02:21:40,452 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:21:40,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash 894270953, now seen corresponding path program 1 times [2022-12-13 02:21:40,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:40,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528334216] [2022-12-13 02:21:40,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:40,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:40,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:21:40,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:40,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528334216] [2022-12-13 02:21:40,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528334216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:40,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:40,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:40,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415792055] [2022-12-13 02:21:40,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:40,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:40,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:40,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:40,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:40,504 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:40,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:40,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:40,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:40,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:40,571 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:40,571 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:40,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:40,572 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:40,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:40,572 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:40,572 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:40,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:40,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:40,575 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:40,575 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:40,575 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:40,575 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:40,575 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:40,575 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:40,575 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:40,575 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:40,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:40,581 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:40,581 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:40,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:40,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:40,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:40,669 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:40,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:40,669 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:40,669 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 02:21:40,669 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:40,669 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:40,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1678 [2022-12-13 02:21:40,669 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:21:40,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:40,670 INFO L85 PathProgramCache]: Analyzing trace with hash 922900104, now seen corresponding path program 1 times [2022-12-13 02:21:40,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:40,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871075131] [2022-12-13 02:21:40,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:40,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:40,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:21:40,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:40,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871075131] [2022-12-13 02:21:40,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871075131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:40,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:40,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:40,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349201126] [2022-12-13 02:21:40,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:40,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:40,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:40,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:40,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:40,720 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:40,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:40,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:40,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:40,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:40,786 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:40,786 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:40,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:40,787 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:40,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:40,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:40,788 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:40,788 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:40,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:40,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:40,790 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:40,790 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:40,790 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:40,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:40,790 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:40,791 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:40,791 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:40,791 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:40,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:40,796 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:40,796 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:40,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:40,797 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:40,797 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:40,884 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:40,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:40,885 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:40,885 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 02:21:40,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:40,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:40,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1679 [2022-12-13 02:21:40,885 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:21:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash 951529255, now seen corresponding path program 1 times [2022-12-13 02:21:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:40,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074456126] [2022-12-13 02:21:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:40,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:40,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:21:40,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:40,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074456126] [2022-12-13 02:21:40,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074456126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:40,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:40,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592349226] [2022-12-13 02:21:40,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:40,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:40,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:40,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:40,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:40,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:40,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:40,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:40,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:41,001 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:41,001 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:41,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:41,002 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:41,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:41,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:41,002 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:41,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:41,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:41,005 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:41,005 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:41,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:41,005 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:41,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:41,006 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:41,011 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:41,011 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:41,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:41,012 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:41,012 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:41,098 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:41,098 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:41,099 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:41,099 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 02:21:41,099 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:41,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:41,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1680 [2022-12-13 02:21:41,099 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:21:41,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:41,099 INFO L85 PathProgramCache]: Analyzing trace with hash 980158406, now seen corresponding path program 1 times [2022-12-13 02:21:41,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:41,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165529579] [2022-12-13 02:21:41,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:41,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:41,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:21:41,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:41,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165529579] [2022-12-13 02:21:41,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165529579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:41,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:41,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:41,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63929665] [2022-12-13 02:21:41,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:41,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:41,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:41,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:41,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:41,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:41,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:41,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:41,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:41,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:41,234 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:41,234 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:41,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:41,235 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:41,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:41,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:41,236 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:41,236 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:41,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:41,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:41,238 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,238 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:41,238 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:41,238 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:41,238 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,239 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:41,239 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:41,239 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:41,244 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:41,244 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:41,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:41,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:41,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:41,335 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:41,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:21:41,335 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:41,335 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 02:21:41,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:41,336 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:41,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1681 [2022-12-13 02:21:41,336 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:21:41,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1008787557, now seen corresponding path program 1 times [2022-12-13 02:21:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:41,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725740135] [2022-12-13 02:21:41,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:41,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:41,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:21:41,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:41,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725740135] [2022-12-13 02:21:41,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725740135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:41,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:41,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:41,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797036700] [2022-12-13 02:21:41,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:41,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:41,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:41,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:41,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:41,387 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:41,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:41,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:41,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:41,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:41,462 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:41,462 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:41,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:41,463 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:41,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:41,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:41,464 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:41,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:41,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:41,466 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,466 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:41,467 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:41,467 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:41,467 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,467 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:41,467 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:41,467 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:41,472 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:41,473 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:41,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:41,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:41,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:41,560 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:41,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:41,560 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:41,560 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 02:21:41,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:41,560 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:41,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1682 [2022-12-13 02:21:41,560 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:21:41,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:41,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1037416708, now seen corresponding path program 1 times [2022-12-13 02:21:41,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:41,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824953472] [2022-12-13 02:21:41,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:41,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:41,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:21:41,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:41,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824953472] [2022-12-13 02:21:41,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824953472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:41,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:41,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:41,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920249356] [2022-12-13 02:21:41,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:41,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:41,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:41,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:41,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:41,612 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:41,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:41,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:41,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:41,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:41,678 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:41,678 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:41,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:41,679 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:41,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:41,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:41,680 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:41,680 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:41,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:41,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:41,682 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,683 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:41,683 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:41,683 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:41,683 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,683 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:41,683 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:41,683 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:41,689 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:41,689 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:41,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:41,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:41,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:41,777 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:41,778 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:41,778 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:41,778 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 02:21:41,778 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:41,778 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:41,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1683 [2022-12-13 02:21:41,778 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:21:41,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:41,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1066045859, now seen corresponding path program 1 times [2022-12-13 02:21:41,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:41,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739339464] [2022-12-13 02:21:41,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:41,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:21:41,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:41,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739339464] [2022-12-13 02:21:41,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739339464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:41,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:41,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:41,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571033642] [2022-12-13 02:21:41,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:41,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:41,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:41,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:41,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:41,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:41,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:41,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:41,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:41,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:41,904 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:41,905 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:41,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:41,906 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:41,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:41,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:41,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:41,906 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:41,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:41,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:41,909 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,909 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:41,909 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:41,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:41,909 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:41,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:41,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:41,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:41,915 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:41,915 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:41,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:41,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:41,915 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:42,001 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:42,002 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:42,002 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:42,002 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 02:21:42,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:42,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:42,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1684 [2022-12-13 02:21:42,002 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:21:42,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:42,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1094675010, now seen corresponding path program 1 times [2022-12-13 02:21:42,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:42,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141811130] [2022-12-13 02:21:42,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:42,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:42,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:21:42,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:42,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141811130] [2022-12-13 02:21:42,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141811130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:42,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:42,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:42,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137940717] [2022-12-13 02:21:42,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:42,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:42,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:42,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:42,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:42,052 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:42,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:42,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:42,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:42,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:42,117 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:42,117 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:42,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:42,118 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:42,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:42,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:42,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:42,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:42,119 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:42,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:42,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:42,121 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:42,121 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:42,121 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:42,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:42,121 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:42,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:42,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:42,122 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:42,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:42,127 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:42,127 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:42,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:42,128 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:42,128 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:42,215 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:42,216 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:42,216 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:42,216 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 02:21:42,216 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:42,216 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:42,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1685 [2022-12-13 02:21:42,216 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:21:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1123304161, now seen corresponding path program 1 times [2022-12-13 02:21:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:42,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660191906] [2022-12-13 02:21:42,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:42,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:42,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:21:42,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:42,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660191906] [2022-12-13 02:21:42,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660191906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:42,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:42,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:42,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277298697] [2022-12-13 02:21:42,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:42,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:42,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:42,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:42,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:42,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:42,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:42,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:42,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:42,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:42,346 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:42,346 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:42,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:42,347 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:42,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:42,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:42,347 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:42,348 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:42,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:42,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:42,350 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:42,350 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:42,350 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:42,350 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:42,351 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:42,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:42,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:42,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:42,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:42,356 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:42,356 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:42,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 444 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:42,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:42,357 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:42,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:42,446 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:42,446 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:42,446 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 02:21:42,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:42,446 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:42,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1686 [2022-12-13 02:21:42,446 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:21:42,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:42,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1151933312, now seen corresponding path program 1 times [2022-12-13 02:21:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:42,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136968184] [2022-12-13 02:21:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:42,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:42,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:21:42,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:42,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136968184] [2022-12-13 02:21:42,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136968184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:42,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:42,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:42,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516443911] [2022-12-13 02:21:42,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:42,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:42,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:42,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:42,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:42,495 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:42,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:42,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:42,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:42,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:42,561 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:42,561 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:42,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:42,562 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:42,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:42,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:42,563 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:42,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:42,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:42,565 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:42,566 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:42,566 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:42,566 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:42,566 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:42,566 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:42,566 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:42,566 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:42,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:42,572 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:42,572 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:42,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:42,572 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:42,572 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:42,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:42,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:42,661 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:42,661 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 02:21:42,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:42,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:42,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1687 [2022-12-13 02:21:42,661 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:21:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:42,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1180562463, now seen corresponding path program 1 times [2022-12-13 02:21:42,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:42,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649415613] [2022-12-13 02:21:42,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:42,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:42,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:21:42,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:42,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649415613] [2022-12-13 02:21:42,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649415613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:42,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:42,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:42,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047704435] [2022-12-13 02:21:42,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:42,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:42,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:42,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:42,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:42,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:42,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:42,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:42,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:42,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:42,780 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:42,781 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:42,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:42,782 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:42,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:42,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:42,782 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:42,782 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:42,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:42,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:42,785 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:42,785 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:42,785 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:42,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:42,785 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:42,785 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:42,785 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:42,785 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:42,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:42,791 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:42,791 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:42,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:42,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:42,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:42,879 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:42,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:42,879 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:42,879 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 02:21:42,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:42,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:42,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1688 [2022-12-13 02:21:42,880 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:21:42,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:42,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1209191614, now seen corresponding path program 1 times [2022-12-13 02:21:42,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:42,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506676543] [2022-12-13 02:21:42,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:42,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:42,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:21:42,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:42,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506676543] [2022-12-13 02:21:42,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506676543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:42,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:42,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:42,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314342146] [2022-12-13 02:21:42,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:42,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:42,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:42,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:42,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:42,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:42,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:42,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:42,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:42,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:42,999 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:43,000 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:43,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:43,001 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:43,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:43,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:43,001 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:43,001 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:43,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:43,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:43,004 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,004 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:43,004 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:43,004 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:43,004 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,004 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:43,004 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:43,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:43,010 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:43,010 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:43,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:43,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:43,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:43,098 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:43,099 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:43,099 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:43,099 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 02:21:43,099 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:43,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:43,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1689 [2022-12-13 02:21:43,099 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:21:43,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1237820765, now seen corresponding path program 1 times [2022-12-13 02:21:43,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:43,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549150011] [2022-12-13 02:21:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:43,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:43,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:21:43,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:43,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549150011] [2022-12-13 02:21:43,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549150011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:43,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:43,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:43,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45040108] [2022-12-13 02:21:43,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:43,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:43,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:43,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:43,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:43,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:43,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:43,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:43,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:43,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:43,227 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:43,227 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:43,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:43,228 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:43,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:43,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:43,229 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:43,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:43,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:43,231 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,232 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:43,232 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:43,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:43,232 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:43,232 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:43,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:43,238 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:43,238 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:43,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:43,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:43,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:43,335 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:43,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:21:43,335 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:43,335 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 02:21:43,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:43,335 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:43,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1690 [2022-12-13 02:21:43,336 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:21:43,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1266449916, now seen corresponding path program 1 times [2022-12-13 02:21:43,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:43,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635989633] [2022-12-13 02:21:43,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:43,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:21:43,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:43,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635989633] [2022-12-13 02:21:43,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635989633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:43,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:43,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:43,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584871248] [2022-12-13 02:21:43,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:43,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:43,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:43,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:43,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:43,403 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:43,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:43,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:43,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:43,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:43,470 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:43,470 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:43,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:43,471 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:43,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:43,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:43,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:43,472 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:43,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:43,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:43,474 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,474 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:43,475 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:43,475 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:43,475 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,475 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:43,475 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:43,475 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:43,480 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:43,480 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:43,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:43,481 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:43,481 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:43,569 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:43,570 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:43,570 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:43,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:43,570 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:43,570 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:43,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1691 [2022-12-13 02:21:43,570 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:21:43,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1295079067, now seen corresponding path program 1 times [2022-12-13 02:21:43,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:43,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196652650] [2022-12-13 02:21:43,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:43,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:43,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:21:43,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:43,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196652650] [2022-12-13 02:21:43,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196652650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:43,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:43,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:43,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164272760] [2022-12-13 02:21:43,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:43,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:43,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:43,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:43,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:43,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:43,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:43,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:43,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:43,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:43,704 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:43,704 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:43,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:43,705 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:43,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:43,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:43,706 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:43,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:43,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:43,708 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,708 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:43,709 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:43,709 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:43,709 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:43,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:43,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:43,714 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:43,715 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:43,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:43,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:43,715 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:43,801 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:43,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:21:43,801 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:43,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:43,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:43,802 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:43,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1692 [2022-12-13 02:21:43,802 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:21:43,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1323708218, now seen corresponding path program 1 times [2022-12-13 02:21:43,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:43,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163790117] [2022-12-13 02:21:43,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:43,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:21:43,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:43,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163790117] [2022-12-13 02:21:43,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163790117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:43,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:43,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:43,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522006388] [2022-12-13 02:21:43,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:43,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:43,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:43,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:43,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:43,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:43,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:43,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:43,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:43,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:43,928 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:43,929 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:43,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:43,930 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:43,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:43,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:43,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:43,930 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:43,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:43,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:43,933 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,933 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:43,933 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:43,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:43,933 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,933 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:43,933 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:43,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:43,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:43,939 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:43,939 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:43,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:43,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:43,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:44,027 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:44,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:44,028 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:44,028 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 02:21:44,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:44,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:44,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1693 [2022-12-13 02:21:44,028 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:21:44,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:44,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1352337369, now seen corresponding path program 1 times [2022-12-13 02:21:44,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:44,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638203233] [2022-12-13 02:21:44,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:44,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:44,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:21:44,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:44,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638203233] [2022-12-13 02:21:44,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638203233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:44,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:44,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:44,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200886497] [2022-12-13 02:21:44,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:44,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:44,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:44,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:44,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:44,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:44,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:44,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:44,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:44,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:44,171 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:44,171 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:44,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:44,172 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:44,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:44,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:44,173 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:44,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:44,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:44,175 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:44,175 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:44,175 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:44,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:44,176 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:44,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:44,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:44,176 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:44,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:44,181 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:44,181 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:44,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:44,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:44,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:44,270 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:44,271 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:44,271 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:44,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:44,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:44,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:44,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1694 [2022-12-13 02:21:44,271 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:21:44,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:44,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1380966520, now seen corresponding path program 1 times [2022-12-13 02:21:44,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:44,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199217293] [2022-12-13 02:21:44,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:44,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:44,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:21:44,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:44,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199217293] [2022-12-13 02:21:44,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199217293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:44,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:44,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:44,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028280526] [2022-12-13 02:21:44,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:44,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:44,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:44,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:44,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:44,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:44,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:44,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:44,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:44,400 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:44,400 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:44,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:44,401 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:44,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:44,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:44,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:44,402 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:44,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:44,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:44,404 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:44,404 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:44,404 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:44,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:44,405 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:44,405 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:44,405 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:44,405 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:44,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:44,410 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:44,410 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:44,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:44,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:44,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:44,498 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:44,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:44,499 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:44,499 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 02:21:44,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:44,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:44,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1695 [2022-12-13 02:21:44,499 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:21:44,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:44,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1409595671, now seen corresponding path program 1 times [2022-12-13 02:21:44,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:44,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234135672] [2022-12-13 02:21:44,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:44,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:44,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:21:44,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:44,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234135672] [2022-12-13 02:21:44,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234135672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:44,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:44,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:44,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421742709] [2022-12-13 02:21:44,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:44,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:44,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:44,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:44,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:44,560 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:44,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:44,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:44,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:44,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:44,629 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:44,630 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:44,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:44,631 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:44,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:44,631 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:44,631 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:44,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:44,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:44,634 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:44,634 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:44,634 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:44,634 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:44,634 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:44,634 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:44,634 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:44,634 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:44,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:44,640 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:44,640 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:44,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:44,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:44,641 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:44,727 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:44,728 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:44,728 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:44,728 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 02:21:44,728 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:44,728 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:44,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1696 [2022-12-13 02:21:44,728 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:21:44,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:44,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1438224822, now seen corresponding path program 1 times [2022-12-13 02:21:44,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:44,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338497050] [2022-12-13 02:21:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:44,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:44,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:21:44,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:44,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338497050] [2022-12-13 02:21:44,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338497050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:44,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:44,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:44,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401133057] [2022-12-13 02:21:44,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:44,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:44,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:44,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:44,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:44,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:44,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:44,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:44,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:44,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:44,856 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:44,856 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:44,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:44,857 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:44,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:44,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:44,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:44,858 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:44,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:44,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:44,860 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:44,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:44,860 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:44,860 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:44,861 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:44,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:44,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:44,861 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:44,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:44,866 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:44,866 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:44,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:44,867 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:44,867 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:44,954 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:44,955 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:44,955 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:44,955 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 02:21:44,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:44,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:44,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1697 [2022-12-13 02:21:44,955 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:21:44,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1466853973, now seen corresponding path program 1 times [2022-12-13 02:21:44,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:44,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279785701] [2022-12-13 02:21:44,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:44,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:45,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:21:45,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:45,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279785701] [2022-12-13 02:21:45,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279785701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:45,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:45,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:45,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608167548] [2022-12-13 02:21:45,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:45,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:45,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:45,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:45,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:45,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:45,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:45,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:45,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:45,096 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:45,097 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:45,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:45,098 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:45,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:45,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:45,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:45,098 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:45,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:45,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:45,101 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:45,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:45,101 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:45,101 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:45,101 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:45,101 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:45,101 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:45,101 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:45,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:45,107 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:45,107 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:45,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:45,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:45,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:45,195 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:45,196 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:45,196 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:45,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:45,196 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:45,196 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:45,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1698 [2022-12-13 02:21:45,196 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:21:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1495483124, now seen corresponding path program 1 times [2022-12-13 02:21:45,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:45,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268039100] [2022-12-13 02:21:45,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:45,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:45,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:21:45,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:45,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268039100] [2022-12-13 02:21:45,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268039100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:45,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:45,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:45,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020680167] [2022-12-13 02:21:45,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:45,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:45,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:45,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:45,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:45,248 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:45,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:45,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:45,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:45,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:45,323 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:45,323 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:45,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:45,324 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:45,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:45,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:45,325 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:45,325 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:45,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:45,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:45,327 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:45,327 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:45,328 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:45,328 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:45,328 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:45,328 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:45,328 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:45,328 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:45,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:45,333 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:45,333 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:45,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:45,334 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:45,334 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:45,421 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:45,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:45,422 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:45,422 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 02:21:45,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:45,422 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:45,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1699 [2022-12-13 02:21:45,422 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:21:45,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:45,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1524112275, now seen corresponding path program 1 times [2022-12-13 02:21:45,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:45,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034936920] [2022-12-13 02:21:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:45,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:45,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:21:45,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:45,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034936920] [2022-12-13 02:21:45,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034936920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:45,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:45,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:45,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356448386] [2022-12-13 02:21:45,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:45,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:45,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:45,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:45,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:45,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:45,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:45,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:45,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:45,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:45,536 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:45,536 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:45,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:45,537 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:45,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:45,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:45,538 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:45,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:45,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:45,540 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:45,540 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:45,540 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:45,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:45,540 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:45,540 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:45,540 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:45,540 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:45,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:45,546 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:45,546 INFO L131 PetriNetUnfolder]: For 435/444 co-relation queries the response was YES. [2022-12-13 02:21:45,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/444 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:45,547 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:45,547 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:45,633 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:45,634 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:45,634 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:45,634 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 02:21:45,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:45,634 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:45,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1700 [2022-12-13 02:21:45,634 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:21:45,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:45,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1552741426, now seen corresponding path program 1 times [2022-12-13 02:21:45,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:45,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558806276] [2022-12-13 02:21:45,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:45,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:45,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:21:45,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:45,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558806276] [2022-12-13 02:21:45,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558806276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:45,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:45,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:45,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716756068] [2022-12-13 02:21:45,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:45,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:45,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:45,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:45,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:45,692 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:45,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:45,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:45,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:45,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:45,757 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:45,757 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:45,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:45,758 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:45,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:45,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:45,759 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:45,759 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:45,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:45,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:45,761 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:45,761 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:45,761 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:45,761 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:45,761 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:45,762 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:45,762 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:45,762 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:45,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:45,767 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:45,767 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:45,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:45,768 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:45,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:45,855 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:45,855 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:45,855 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:45,855 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 02:21:45,855 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:45,855 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:45,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1701 [2022-12-13 02:21:45,856 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:21:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1581370577, now seen corresponding path program 1 times [2022-12-13 02:21:45,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:45,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365319940] [2022-12-13 02:21:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:45,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:45,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:21:45,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:45,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365319940] [2022-12-13 02:21:45,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365319940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:45,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:45,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442401445] [2022-12-13 02:21:45,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:45,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:45,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:45,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:45,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:45,922 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:45,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:45,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:45,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:45,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:45,995 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:45,995 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:45,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:45,996 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:45,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:45,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:45,997 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:45,997 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:45,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:45,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:45,999 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:46,000 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:46,000 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:46,000 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,000 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:46,000 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:46,000 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:46,006 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:46,006 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:46,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:46,006 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:46,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:46,092 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:46,093 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:46,093 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:46,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:46,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:46,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:46,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1702 [2022-12-13 02:21:46,093 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:21:46,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1609999728, now seen corresponding path program 1 times [2022-12-13 02:21:46,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:46,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507511156] [2022-12-13 02:21:46,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:46,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:46,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:21:46,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:46,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507511156] [2022-12-13 02:21:46,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507511156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:46,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:46,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:46,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916095609] [2022-12-13 02:21:46,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:46,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:46,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:46,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:46,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:46,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:46,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:46,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:46,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:46,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:46,219 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:46,220 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:46,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:46,221 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:46,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:46,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:46,221 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:46,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:46,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:46,224 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:46,224 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:46,224 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:46,224 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,224 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:46,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:46,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:46,230 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:46,230 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:46,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:46,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:46,230 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:46,318 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:46,318 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:46,318 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:46,318 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 02:21:46,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:46,318 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:46,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1703 [2022-12-13 02:21:46,319 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:21:46,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:46,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1638628879, now seen corresponding path program 1 times [2022-12-13 02:21:46,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:46,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349994183] [2022-12-13 02:21:46,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:46,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:46,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:21:46,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349994183] [2022-12-13 02:21:46,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349994183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:46,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:46,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:46,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429300163] [2022-12-13 02:21:46,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:46,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:46,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:46,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:46,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:46,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:46,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:46,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:46,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:46,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:46,455 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:46,456 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:46,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:46,457 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:46,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:46,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:46,457 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:46,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:46,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:46,460 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,460 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:46,460 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:46,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:46,460 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,461 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:46,461 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:46,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:46,466 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:46,466 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:46,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:46,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:46,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:46,552 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:46,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:46,553 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:46,553 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 02:21:46,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:46,553 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:46,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1704 [2022-12-13 02:21:46,553 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:21:46,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:46,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1667258030, now seen corresponding path program 1 times [2022-12-13 02:21:46,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:46,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641552759] [2022-12-13 02:21:46,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:46,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:46,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:21:46,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:46,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641552759] [2022-12-13 02:21:46,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641552759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:46,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:46,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:46,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061636706] [2022-12-13 02:21:46,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:46,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:46,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:46,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:46,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:46,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:46,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:46,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:46,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:46,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:46,669 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:46,669 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:46,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:46,670 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:46,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:46,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:46,671 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:46,671 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:46,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:46,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:46,673 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,674 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:46,674 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:46,674 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:46,674 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,674 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:46,674 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:46,674 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:46,680 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:46,680 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:21:46,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:46,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:46,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:46,765 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:46,766 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:21:46,766 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:46,766 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 02:21:46,766 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:46,766 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:46,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1705 [2022-12-13 02:21:46,766 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:21:46,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:46,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1695887181, now seen corresponding path program 1 times [2022-12-13 02:21:46,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:46,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773369064] [2022-12-13 02:21:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:46,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:46,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:21:46,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:46,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773369064] [2022-12-13 02:21:46,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773369064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:46,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:46,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:46,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754717406] [2022-12-13 02:21:46,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:46,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:46,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:46,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:46,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:46,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:46,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:46,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:46,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:46,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:46,892 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:46,892 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:46,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:46,893 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:46,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:46,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:46,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:46,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:46,893 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:46,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:46,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:46,896 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:46,896 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:46,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:46,896 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,896 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:46,897 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:46,897 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:46,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:46,902 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:46,902 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:46,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:46,903 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:46,903 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:46,990 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:46,990 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:46,990 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:46,990 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 02:21:46,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:46,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:46,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1706 [2022-12-13 02:21:46,991 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:21:46,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1724516332, now seen corresponding path program 1 times [2022-12-13 02:21:46,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:46,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759048759] [2022-12-13 02:21:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:47,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:21:47,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:47,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759048759] [2022-12-13 02:21:47,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759048759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:47,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:47,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:47,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242503544] [2022-12-13 02:21:47,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:47,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:47,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:47,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:47,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:47,038 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:47,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:47,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:47,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:47,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:47,114 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:47,114 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:47,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:47,115 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:47,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:47,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:47,116 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:47,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:47,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:47,118 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:47,119 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:47,119 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:47,119 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:47,119 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:47,119 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:47,119 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:47,119 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:47,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:47,125 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:47,125 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:21:47,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:47,125 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:47,125 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:47,212 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:47,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:47,212 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:47,212 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 02:21:47,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:47,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:47,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1707 [2022-12-13 02:21:47,212 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:21:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1753145483, now seen corresponding path program 1 times [2022-12-13 02:21:47,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:47,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772061511] [2022-12-13 02:21:47,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:47,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:47,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:21:47,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:47,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772061511] [2022-12-13 02:21:47,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772061511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:47,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:47,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:47,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248657227] [2022-12-13 02:21:47,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:47,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:47,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:47,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:47,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:47,279 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:47,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:47,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:47,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:47,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:47,366 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:47,367 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:47,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:47,368 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:47,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:47,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:47,368 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:47,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:47,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:47,370 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:47,371 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:47,371 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:47,371 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:47,371 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:47,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:47,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:47,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:47,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:47,376 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:47,377 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:47,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:47,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:47,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:47,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:47,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:47,465 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:47,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:47,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:47,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:47,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1708 [2022-12-13 02:21:47,465 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:21:47,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:47,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1781774634, now seen corresponding path program 1 times [2022-12-13 02:21:47,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:47,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753020142] [2022-12-13 02:21:47,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:47,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:21:47,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:47,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753020142] [2022-12-13 02:21:47,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753020142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:47,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:47,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:47,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207717064] [2022-12-13 02:21:47,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:47,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:47,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:47,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:47,514 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:47,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:47,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:47,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:47,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:47,581 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:47,581 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:47,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:47,582 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:47,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:47,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:47,582 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:47,582 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:47,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:47,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:47,585 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:47,585 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:47,585 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:47,585 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:47,585 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:47,585 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:47,585 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:47,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:47,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:47,591 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:47,591 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:47,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:47,592 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:47,592 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:47,679 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:47,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:47,680 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:47,680 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 02:21:47,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:47,680 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:47,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1709 [2022-12-13 02:21:47,680 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:21:47,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1810403785, now seen corresponding path program 1 times [2022-12-13 02:21:47,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:47,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315906237] [2022-12-13 02:21:47,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:47,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:47,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:21:47,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:47,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315906237] [2022-12-13 02:21:47,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315906237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:47,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:47,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:47,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717467082] [2022-12-13 02:21:47,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:47,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:47,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:47,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:47,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:47,730 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:47,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:47,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:47,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:47,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:47,805 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:47,805 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:47,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:47,806 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:47,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:47,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:47,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:47,807 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:47,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:47,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:47,809 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:47,809 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:47,810 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:47,810 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:47,810 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:47,810 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:47,810 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:47,810 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:47,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:47,816 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:47,816 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:47,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:47,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:47,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:47,903 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:47,903 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:47,903 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:47,903 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 02:21:47,903 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:47,903 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:47,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1710 [2022-12-13 02:21:47,903 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:21:47,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1839032936, now seen corresponding path program 1 times [2022-12-13 02:21:47,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:47,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945813920] [2022-12-13 02:21:47,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:47,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:47,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:21:47,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:47,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945813920] [2022-12-13 02:21:47,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945813920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:47,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:47,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132747386] [2022-12-13 02:21:47,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:47,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:47,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:47,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:47,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:47,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:47,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:47,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:47,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:47,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:48,019 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:48,020 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:48,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:48,021 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:48,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:48,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:48,021 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:48,021 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:48,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:48,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:48,024 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,024 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:48,024 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:48,024 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:48,024 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,024 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:48,024 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:48,024 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:48,030 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:48,030 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:48,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:48,030 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:48,030 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:48,117 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:48,118 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:48,118 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:48,118 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 02:21:48,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:48,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:48,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1711 [2022-12-13 02:21:48,118 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:21:48,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1867662087, now seen corresponding path program 1 times [2022-12-13 02:21:48,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:48,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357689868] [2022-12-13 02:21:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:48,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:21:48,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:48,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357689868] [2022-12-13 02:21:48,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357689868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:48,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:48,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:48,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520066149] [2022-12-13 02:21:48,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:48,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:48,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:48,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:48,184 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:48,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:48,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:48,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:48,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:48,262 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:48,262 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:48,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:48,264 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:48,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:48,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:48,264 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:48,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:48,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:48,266 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,267 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:48,267 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:48,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:48,267 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,267 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:48,267 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:48,267 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:48,273 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:48,273 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:48,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:48,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:48,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:48,365 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:48,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:21:48,365 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:48,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:48,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:48,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:48,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1712 [2022-12-13 02:21:48,366 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:21:48,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1896291238, now seen corresponding path program 1 times [2022-12-13 02:21:48,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:48,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166528051] [2022-12-13 02:21:48,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:48,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:48,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:21:48,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:48,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166528051] [2022-12-13 02:21:48,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166528051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:48,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:48,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797523263] [2022-12-13 02:21:48,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:48,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:48,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:48,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:48,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:48,446 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:48,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:48,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:48,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:48,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:48,521 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:48,522 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:48,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:48,523 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:48,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:48,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:48,523 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:48,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:48,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:48,526 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,526 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:48,526 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:48,526 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:48,526 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:48,526 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:48,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:48,532 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:48,532 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:48,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:48,532 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:48,532 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:48,619 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:48,619 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:48,619 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:48,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:48,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:48,620 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:48,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1713 [2022-12-13 02:21:48,620 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:21:48,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1924920389, now seen corresponding path program 1 times [2022-12-13 02:21:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:48,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926400712] [2022-12-13 02:21:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:48,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:21:48,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:48,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926400712] [2022-12-13 02:21:48,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926400712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:48,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:48,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:48,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495512983] [2022-12-13 02:21:48,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:48,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:48,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:48,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:48,685 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:48,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:48,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:48,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:48,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:48,759 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:48,760 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:48,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:48,760 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:48,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:48,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:48,761 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:48,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:48,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:48,763 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:48,764 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:48,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:48,764 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:48,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:48,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:48,769 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:48,770 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:48,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:48,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:48,770 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:48,857 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:48,857 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:48,857 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:48,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:48,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:48,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:48,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1714 [2022-12-13 02:21:48,857 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:21:48,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1953549540, now seen corresponding path program 1 times [2022-12-13 02:21:48,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:48,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579353868] [2022-12-13 02:21:48,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:48,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:48,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:21:48,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:48,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579353868] [2022-12-13 02:21:48,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579353868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:48,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:48,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:48,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834139708] [2022-12-13 02:21:48,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:48,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:48,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:48,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:48,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:48,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:48,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:48,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:48,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:48,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:48,981 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:48,981 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:48,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:48,982 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:48,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:48,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:48,983 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:48,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:48,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:48,986 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,986 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:48,986 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:48,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:48,986 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:48,986 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:48,986 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:48,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:48,992 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:48,992 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:48,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:48,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:48,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:49,079 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:49,079 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:49,079 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:49,079 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 02:21:49,079 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:49,079 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:49,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1715 [2022-12-13 02:21:49,080 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:21:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1982178691, now seen corresponding path program 1 times [2022-12-13 02:21:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:49,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911574737] [2022-12-13 02:21:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:49,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:21:49,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:49,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911574737] [2022-12-13 02:21:49,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911574737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:49,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:49,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372939736] [2022-12-13 02:21:49,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:49,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:49,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:49,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:49,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:49,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:49,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:49,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:49,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:49,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:49,207 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:49,207 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:49,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:49,208 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:49,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:49,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:49,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:49,209 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:49,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:49,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:49,211 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:49,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:49,211 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:49,211 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:49,211 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:49,212 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:49,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:49,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:49,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:49,217 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:49,217 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:49,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:49,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:49,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:49,304 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:49,305 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:49,305 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:49,305 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 02:21:49,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:49,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:49,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1716 [2022-12-13 02:21:49,305 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:21:49,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2010807842, now seen corresponding path program 1 times [2022-12-13 02:21:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:49,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548568043] [2022-12-13 02:21:49,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:49,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:49,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:21:49,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:49,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548568043] [2022-12-13 02:21:49,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548568043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:49,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:49,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269896430] [2022-12-13 02:21:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:49,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:49,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:49,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:49,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:49,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:49,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:49,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:49,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:49,445 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:49,445 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:49,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:49,446 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:49,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:49,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:49,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:49,447 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:49,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:49,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:49,449 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:49,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:49,450 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:49,450 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:49,450 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:49,450 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:49,450 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:49,450 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:49,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:49,456 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:49,456 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:49,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:49,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:49,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:49,544 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:49,544 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:49,544 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:49,544 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 02:21:49,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:49,544 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:49,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1717 [2022-12-13 02:21:49,544 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:21:49,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2039436993, now seen corresponding path program 1 times [2022-12-13 02:21:49,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:49,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508494137] [2022-12-13 02:21:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:49,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:49,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:21:49,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:49,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508494137] [2022-12-13 02:21:49,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508494137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:49,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:49,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:49,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687625818] [2022-12-13 02:21:49,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:49,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:49,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:49,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:49,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:49,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:49,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:49,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:49,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:49,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:49,668 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:49,668 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:49,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:49,670 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:49,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:49,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:49,670 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:49,670 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:49,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:49,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:49,673 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:49,673 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:49,673 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:49,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:49,673 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:49,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:49,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:49,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:49,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:49,679 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:49,679 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:49,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:49,679 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:49,679 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:49,767 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:49,768 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:49,768 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:49,768 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 02:21:49,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:49,768 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:49,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1718 [2022-12-13 02:21:49,768 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:21:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2068066144, now seen corresponding path program 1 times [2022-12-13 02:21:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:49,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142456454] [2022-12-13 02:21:49,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:49,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:49,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:21:49,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:49,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142456454] [2022-12-13 02:21:49,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142456454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:49,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:49,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:49,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815491565] [2022-12-13 02:21:49,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:49,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:49,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:49,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:49,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:49,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:49,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:49,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:49,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:49,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:49,886 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:49,886 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:49,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:49,887 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:49,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:49,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:49,888 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:49,888 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:49,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:49,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:49,890 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:49,890 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:49,890 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:49,890 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:49,890 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:49,891 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:49,891 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:49,891 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:49,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:49,896 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:49,896 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:49,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:49,897 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:49,897 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:49,984 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:49,984 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:49,984 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:49,984 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 02:21:49,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:49,984 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:49,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1719 [2022-12-13 02:21:49,984 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:21:49,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:49,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2096695295, now seen corresponding path program 1 times [2022-12-13 02:21:49,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:49,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295713886] [2022-12-13 02:21:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:49,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21: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:21:50,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:50,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295713886] [2022-12-13 02:21:50,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295713886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:50,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:50,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:50,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545401560] [2022-12-13 02:21:50,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:50,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:50,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:50,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:50,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:50,037 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:50,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:50,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:50,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:50,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:50,111 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:50,112 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:50,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:50,113 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:50,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:50,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:50,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:50,113 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:50,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:50,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:50,116 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:50,116 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:50,116 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:50,116 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:50,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:50,117 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:50,122 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:50,122 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:50,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:50,123 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:50,123 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:50,209 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:50,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:50,210 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:50,210 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 02:21:50,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:50,210 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:50,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1720 [2022-12-13 02:21:50,210 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:21:50,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:50,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2125324446, now seen corresponding path program 1 times [2022-12-13 02:21:50,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:50,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111490736] [2022-12-13 02:21:50,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:50,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:50,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:21:50,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:50,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111490736] [2022-12-13 02:21:50,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111490736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:50,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:50,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:50,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767151204] [2022-12-13 02:21:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:50,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:50,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:50,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:50,260 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:50,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:50,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:50,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:50,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:50,327 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:50,327 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:50,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:50,328 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:50,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:50,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:50,329 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:50,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:50,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:50,331 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:50,331 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:50,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:50,332 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,332 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:50,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:50,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:50,338 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:50,338 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:50,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:50,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:50,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:50,425 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:50,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:50,426 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:50,426 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 02:21:50,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:50,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:50,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1721 [2022-12-13 02:21:50,426 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:21:50,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2141013699, now seen corresponding path program 1 times [2022-12-13 02:21:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:50,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969350516] [2022-12-13 02:21:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:50,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:21:50,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:50,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969350516] [2022-12-13 02:21:50,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969350516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:50,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:50,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:50,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195137128] [2022-12-13 02:21:50,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:50,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:50,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:50,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:50,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:50,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:50,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:50,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:50,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:50,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:50,564 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:50,564 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:50,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:50,565 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:50,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:50,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:50,566 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:50,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:50,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:50,568 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,568 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:50,568 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:50,569 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:50,569 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:50,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:50,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:50,574 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:50,574 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:21:50,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:50,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:50,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:50,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:50,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:21:50,661 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:50,661 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 02:21:50,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:50,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:50,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1722 [2022-12-13 02:21:50,661 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:21:50,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:50,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2112384548, now seen corresponding path program 1 times [2022-12-13 02:21:50,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:50,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658912550] [2022-12-13 02:21:50,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:50,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21: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:21:50,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:50,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658912550] [2022-12-13 02:21:50,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658912550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:50,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:50,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:50,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418168778] [2022-12-13 02:21:50,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:50,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:50,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:50,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:50,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:50,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:50,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:50,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:50,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:50,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:50,779 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:50,779 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:50,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1097 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:50,780 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:50,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:50,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:50,781 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:50,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:50,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:50,783 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,783 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:50,783 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:50,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:50,783 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:50,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:50,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:50,789 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:50,789 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:50,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:50,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:50,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:50,875 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:50,876 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:50,876 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:50,876 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 02:21:50,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:50,876 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:50,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1723 [2022-12-13 02:21:50,876 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:21:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:50,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2083755397, now seen corresponding path program 1 times [2022-12-13 02:21:50,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:50,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522643555] [2022-12-13 02:21:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:50,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:50,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:21:50,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:50,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522643555] [2022-12-13 02:21:50,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522643555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:50,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:50,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:50,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705334551] [2022-12-13 02:21:50,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:50,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:50,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:50,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:50,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:50,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:50,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:50,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:50,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:50,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:50,992 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:50,992 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:50,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:50,993 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:50,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:50,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:50,994 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:50,994 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:50,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:50,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:50,997 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,997 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:50,997 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:50,997 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:50,997 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:50,997 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:50,997 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:50,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:51,003 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:51,003 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:51,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:51,003 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:51,003 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:51,093 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:51,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:21:51,094 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:51,094 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 02:21:51,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:51,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:51,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1724 [2022-12-13 02:21:51,094 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:21:51,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:51,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2055126246, now seen corresponding path program 1 times [2022-12-13 02:21:51,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:51,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413712121] [2022-12-13 02:21:51,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:51,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:51,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:21:51,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:51,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413712121] [2022-12-13 02:21:51,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413712121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:51,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:51,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:51,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79329136] [2022-12-13 02:21:51,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:51,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:51,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:51,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:51,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:51,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:51,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:51,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:51,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:51,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:51,223 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:51,223 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:51,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:51,224 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:51,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:51,225 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:51,225 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:51,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:51,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:51,227 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:51,227 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:51,228 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:51,228 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:51,228 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:51,228 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:51,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:51,228 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:51,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:51,233 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:51,233 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:51,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:51,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:51,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:51,331 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:51,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:21:51,332 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:51,332 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 02:21:51,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:51,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:51,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1725 [2022-12-13 02:21:51,332 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:21:51,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2026497095, now seen corresponding path program 1 times [2022-12-13 02:21:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:51,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381842893] [2022-12-13 02:21:51,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:51,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:51,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:21:51,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:51,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381842893] [2022-12-13 02:21:51,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381842893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:51,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:51,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:51,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511123967] [2022-12-13 02:21:51,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:51,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:51,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:51,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:51,384 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:51,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:51,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:51,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:51,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:51,451 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:51,451 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:51,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:51,452 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:51,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:51,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:51,453 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:51,453 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:51,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:51,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:51,455 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:51,455 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:51,455 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:51,456 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:51,456 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:51,463 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:51,463 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:51,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:51,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:51,469 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:51,469 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:51,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:51,470 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:51,470 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:51,558 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:51,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:21:51,559 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:51,559 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 02:21:51,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:51,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:51,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1726 [2022-12-13 02:21:51,559 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:21:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:51,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1997867944, now seen corresponding path program 1 times [2022-12-13 02:21:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:51,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092918416] [2022-12-13 02:21:51,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:51,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:51,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:21:51,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:51,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092918416] [2022-12-13 02:21:51,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092918416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:51,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:51,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:51,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507042442] [2022-12-13 02:21:51,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:51,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:51,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:51,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:51,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:51,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:51,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:51,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:51,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:51,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:51,687 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:51,687 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:51,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:51,688 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:51,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:51,689 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:51,689 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:51,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:51,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:51,692 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:51,692 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:51,692 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:51,692 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:51,692 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:51,692 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:51,692 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:51,692 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:51,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:51,698 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:51,698 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:51,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:51,699 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:51,699 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:51,786 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:51,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:51,787 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:51,787 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 02:21:51,787 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:51,787 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:51,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1727 [2022-12-13 02:21:51,787 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:21:51,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:51,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1969238793, now seen corresponding path program 1 times [2022-12-13 02:21:51,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:51,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193630132] [2022-12-13 02:21:51,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:51,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:51,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:21:51,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:51,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193630132] [2022-12-13 02:21:51,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193630132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:51,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:51,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:51,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417528941] [2022-12-13 02:21:51,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:51,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:51,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:51,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:51,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:51,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:51,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:51,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:51,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:51,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:51,947 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:51,948 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:51,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:51,949 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:51,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:51,950 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:51,950 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:51,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:51,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:51,953 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:51,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:51,954 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:51,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:51,954 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:51,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:51,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:51,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:51,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:51,962 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:51,962 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:51,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:51,963 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:51,963 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:52,069 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:52,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:21:52,070 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:52,070 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 02:21:52,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:52,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:52,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1728 [2022-12-13 02:21:52,070 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:21:52,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:52,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1940609642, now seen corresponding path program 1 times [2022-12-13 02:21:52,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:52,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856072377] [2022-12-13 02:21:52,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:52,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:52,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:21:52,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:52,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856072377] [2022-12-13 02:21:52,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856072377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:52,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:52,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:52,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834320508] [2022-12-13 02:21:52,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:52,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:52,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:52,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:52,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:52,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:52,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:52,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:52,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:52,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:52,253 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:52,253 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:52,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:52,255 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:52,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:52,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:52,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:52,255 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:52,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:52,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:52,259 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:52,259 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:52,259 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:52,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:52,259 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:52,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:52,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:52,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:52,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:52,267 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:52,268 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:52,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:52,268 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:52,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:52,378 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:52,379 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:21:52,379 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:52,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:52,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:52,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:52,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1729 [2022-12-13 02:21:52,379 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:21:52,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:52,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1911980491, now seen corresponding path program 1 times [2022-12-13 02:21:52,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:52,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772195308] [2022-12-13 02:21:52,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:52,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:52,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:21:52,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:52,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772195308] [2022-12-13 02:21:52,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772195308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:52,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:52,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:52,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861019528] [2022-12-13 02:21:52,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:52,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:52,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:52,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:52,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:52,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:52,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:52,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:52,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:52,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:52,503 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:52,503 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:52,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:52,504 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:52,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:52,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:52,505 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:52,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:52,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:52,507 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:52,507 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:52,507 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:52,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:52,507 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:52,508 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:52,508 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:52,508 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:52,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:52,513 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:52,513 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:52,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:52,514 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:52,514 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:52,600 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:52,601 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:52,601 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:52,601 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 02:21:52,601 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:52,601 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:52,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1730 [2022-12-13 02:21:52,601 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:21:52,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1883351340, now seen corresponding path program 1 times [2022-12-13 02:21:52,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:52,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605810181] [2022-12-13 02:21:52,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:52,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:52,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:21:52,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:52,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605810181] [2022-12-13 02:21:52,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605810181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:52,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:52,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644541871] [2022-12-13 02:21:52,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:52,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:52,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:52,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:52,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:52,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:52,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:52,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:52,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:52,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:52,728 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:52,729 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:52,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:52,730 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:52,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:52,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:52,730 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:52,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:52,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:52,733 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:52,733 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:52,733 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:52,733 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:52,733 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:52,733 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:52,733 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:52,733 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:52,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:52,739 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:52,739 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:21:52,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:52,739 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:52,739 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:52,827 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:52,828 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:52,828 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:52,828 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 02:21:52,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:52,828 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:52,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1731 [2022-12-13 02:21:52,828 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:21:52,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1854722189, now seen corresponding path program 1 times [2022-12-13 02:21:52,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:52,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271786152] [2022-12-13 02:21:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:52,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:52,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:21:52,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:52,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271786152] [2022-12-13 02:21:52,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271786152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:52,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:52,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706149233] [2022-12-13 02:21:52,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:52,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:52,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:52,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:52,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:52,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:52,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:52,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:52,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:52,970 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:52,970 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:52,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:52,971 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:52,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:52,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:52,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:52,972 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:52,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:52,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:52,974 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:52,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:52,975 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:52,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:52,975 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:52,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:52,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:52,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:52,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:52,980 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:52,981 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:52,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:52,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:52,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:53,067 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:53,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:53,068 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:53,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:53,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:53,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:53,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1732 [2022-12-13 02:21:53,068 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:21:53,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:53,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1826093038, now seen corresponding path program 1 times [2022-12-13 02:21:53,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:53,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60891322] [2022-12-13 02:21:53,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:53,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:53,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:21:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:53,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60891322] [2022-12-13 02:21:53,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60891322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:53,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:53,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:53,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871644984] [2022-12-13 02:21:53,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:53,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:53,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:53,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:53,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:53,137 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:53,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:53,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:53,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:53,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:53,222 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:53,222 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:53,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:53,223 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:53,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:53,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:53,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:53,224 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:53,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:53,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:53,226 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:53,226 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:53,226 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:53,226 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:53,226 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:53,227 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:53,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:53,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:53,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:53,232 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:53,232 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:53,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:53,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:53,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:53,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:53,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:53,320 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:53,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:53,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:53,320 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:53,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1733 [2022-12-13 02:21:53,320 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:21:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1797463887, now seen corresponding path program 1 times [2022-12-13 02:21:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:53,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842175194] [2022-12-13 02:21:53,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:53,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:53,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:21:53,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:53,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842175194] [2022-12-13 02:21:53,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842175194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:53,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:53,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:53,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124303098] [2022-12-13 02:21:53,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:53,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:53,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:53,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:53,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:53,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:53,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:53,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:53,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:53,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:53,454 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:53,454 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:53,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:53,455 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:53,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:53,456 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:53,456 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:53,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:53,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:53,458 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:53,458 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:53,458 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:53,459 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:53,459 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:53,459 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:53,459 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:53,459 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:53,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:53,465 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:53,465 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:53,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:53,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:53,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:53,553 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:53,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:53,553 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:53,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:53,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:53,554 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:53,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1734 [2022-12-13 02:21:53,554 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:21:53,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:53,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1768834736, now seen corresponding path program 1 times [2022-12-13 02:21:53,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:53,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446295648] [2022-12-13 02:21:53,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:53,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:53,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:21:53,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:53,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446295648] [2022-12-13 02:21:53,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446295648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:53,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:53,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:53,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97055423] [2022-12-13 02:21:53,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:53,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:53,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:53,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:53,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:53,631 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:53,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:53,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:53,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:53,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:53,706 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:53,706 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:53,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:53,707 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:53,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:53,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:53,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:53,708 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:53,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:53,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:53,710 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:53,710 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:53,710 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:53,710 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:53,710 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:53,711 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:53,711 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:53,711 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:53,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:53,716 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:53,716 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:53,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:53,717 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:53,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:53,803 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:53,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:53,804 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:53,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:53,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:53,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:53,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1735 [2022-12-13 02:21:53,804 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:21:53,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:53,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1740205585, now seen corresponding path program 1 times [2022-12-13 02:21:53,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:53,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367766352] [2022-12-13 02:21:53,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:53,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:53,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:21:53,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:53,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367766352] [2022-12-13 02:21:53,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367766352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:53,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:53,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:53,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765635472] [2022-12-13 02:21:53,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:53,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:53,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:53,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:53,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:53,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:53,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:53,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:53,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:53,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:53,923 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:53,923 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:53,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:53,924 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:53,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:53,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:53,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:53,925 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:53,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:53,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:53,927 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:53,927 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:53,927 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:53,927 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:53,928 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:53,928 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:53,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:53,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:53,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:53,933 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:53,933 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:53,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:53,934 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:53,934 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:54,021 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:54,022 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:54,022 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:54,022 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 02:21:54,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:54,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:54,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1736 [2022-12-13 02:21:54,022 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:21:54,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:54,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1711576434, now seen corresponding path program 1 times [2022-12-13 02:21:54,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:54,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119379778] [2022-12-13 02:21:54,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:54,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:54,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:21:54,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:54,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119379778] [2022-12-13 02:21:54,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119379778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:54,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:54,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:54,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741353423] [2022-12-13 02:21:54,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:54,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:54,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:54,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:54,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:54,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:54,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:54,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:54,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:54,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:54,148 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:54,148 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:54,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:54,149 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:54,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:54,150 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:54,150 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:54,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:54,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:54,152 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:54,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:54,153 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:54,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:54,153 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:54,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:54,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:54,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:54,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:54,158 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:54,159 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:54,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:54,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:54,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:54,246 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:54,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:54,247 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:54,247 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 02:21:54,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:54,247 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:54,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1737 [2022-12-13 02:21:54,247 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:21:54,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:54,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1682947283, now seen corresponding path program 1 times [2022-12-13 02:21:54,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:54,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740471700] [2022-12-13 02:21:54,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:54,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:54,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:21:54,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:54,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740471700] [2022-12-13 02:21:54,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740471700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:54,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:54,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:54,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040132664] [2022-12-13 02:21:54,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:54,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:54,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:54,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:54,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:54,297 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:54,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:54,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:54,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:54,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:54,362 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:54,362 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:54,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:54,363 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:54,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:54,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:54,363 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:54,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:54,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:54,366 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:54,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:54,366 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:54,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:54,366 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:54,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:54,366 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:54,366 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:54,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:54,372 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:54,372 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:54,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:54,373 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:54,373 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:54,459 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:54,459 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:54,459 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:54,459 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 02:21:54,459 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:54,459 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:54,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1738 [2022-12-13 02:21:54,459 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:21:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1654318132, now seen corresponding path program 1 times [2022-12-13 02:21:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:54,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845877001] [2022-12-13 02:21:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:54,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:54,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:21:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:54,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845877001] [2022-12-13 02:21:54,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845877001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:54,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:54,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:54,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182315852] [2022-12-13 02:21:54,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:54,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:54,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:54,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:54,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:54,511 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:54,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:54,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:54,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:54,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:54,576 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:54,576 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:54,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:54,577 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:54,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:54,578 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:54,578 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:54,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:54,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:54,580 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:54,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:54,580 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:54,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:54,580 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:54,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:54,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:54,581 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:54,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:54,586 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:54,586 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:21:54,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:54,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:54,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:54,672 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:54,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:54,673 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:54,673 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 02:21:54,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:54,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:54,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1739 [2022-12-13 02:21:54,673 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:21:54,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:54,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1625688981, now seen corresponding path program 1 times [2022-12-13 02:21:54,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:54,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442470852] [2022-12-13 02:21:54,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:54,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:54,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:21:54,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:54,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442470852] [2022-12-13 02:21:54,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442470852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:54,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:54,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:54,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002112245] [2022-12-13 02:21:54,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:54,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:54,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:54,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:54,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:54,730 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:54,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:54,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:54,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:54,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:54,805 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:54,805 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:54,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:54,806 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:54,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:54,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:54,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:54,806 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:54,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:54,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:54,809 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:54,809 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:54,809 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:54,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:54,809 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:54,809 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:54,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:54,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:54,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:54,814 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:54,815 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:54,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:54,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:54,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:54,900 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:54,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:21:54,900 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:54,900 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 02:21:54,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:54,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:54,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1740 [2022-12-13 02:21:54,900 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:21:54,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:54,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1597059830, now seen corresponding path program 1 times [2022-12-13 02:21:54,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:54,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272075193] [2022-12-13 02:21:54,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:54,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:54,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:21:54,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:54,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272075193] [2022-12-13 02:21:54,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272075193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:54,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:54,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:54,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328669037] [2022-12-13 02:21:54,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:54,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:54,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:54,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:54,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:54,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:54,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:54,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:54,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:54,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:55,015 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:55,015 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:55,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:55,016 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:55,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:55,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:55,017 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:55,017 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:55,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:55,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:55,019 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,019 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:55,019 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:55,019 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:55,019 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,020 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:55,020 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:55,020 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:55,025 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:55,025 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:55,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:55,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:55,026 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:55,113 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:55,114 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:55,114 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:55,114 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 02:21:55,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:55,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:55,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1741 [2022-12-13 02:21:55,114 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:21:55,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1568430679, now seen corresponding path program 1 times [2022-12-13 02:21:55,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:55,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278122648] [2022-12-13 02:21:55,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:55,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:55,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 02:21:55,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:55,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278122648] [2022-12-13 02:21:55,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278122648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:55,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:55,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:55,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456884494] [2022-12-13 02:21:55,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:55,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:55,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:55,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:55,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:55,186 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:55,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:55,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:55,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:55,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:55,271 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:55,271 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:55,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:55,272 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:55,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:55,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:55,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:55,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:55,273 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:55,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:55,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:55,276 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,276 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:55,276 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:55,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:55,276 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:55,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:55,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:55,282 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:55,282 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:55,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:55,283 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:55,283 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:55,370 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:55,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:55,370 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:55,370 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 02:21:55,370 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:55,370 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:55,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1742 [2022-12-13 02:21:55,371 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:21:55,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:55,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1539801528, now seen corresponding path program 1 times [2022-12-13 02:21:55,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:55,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414341717] [2022-12-13 02:21:55,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:55,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:55,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:21:55,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:55,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414341717] [2022-12-13 02:21:55,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414341717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:55,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:55,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:55,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243445247] [2022-12-13 02:21:55,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:55,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:55,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:55,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:55,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:55,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:55,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:55,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:55,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:55,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:55,487 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:55,487 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:55,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:55,488 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:55,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:55,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:55,489 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:55,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:55,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:55,492 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,492 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:55,492 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:55,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:55,492 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,492 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:55,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:55,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:55,498 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:55,498 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:55,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:55,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:55,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:55,589 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:55,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:21:55,589 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:55,590 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 02:21:55,590 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:55,590 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:55,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1743 [2022-12-13 02:21:55,590 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:21:55,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:55,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1511172377, now seen corresponding path program 1 times [2022-12-13 02:21:55,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:55,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152518575] [2022-12-13 02:21:55,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:55,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:55,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 02:21:55,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:55,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152518575] [2022-12-13 02:21:55,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152518575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:55,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:55,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:55,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228075886] [2022-12-13 02:21:55,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:55,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:55,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:55,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:55,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:55,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:55,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:55,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:55,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:55,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:55,725 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:55,725 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:55,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:55,726 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:55,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:55,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:55,727 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:55,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:55,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:55,730 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,730 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:55,730 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:55,730 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:55,730 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:55,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:55,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:55,736 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:55,736 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:21:55,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:55,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:55,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:55,827 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:55,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:21:55,827 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:55,827 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 02:21:55,827 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:55,827 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:55,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1744 [2022-12-13 02:21:55,828 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:21:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1482543226, now seen corresponding path program 1 times [2022-12-13 02:21:55,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:55,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638612620] [2022-12-13 02:21:55,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:55,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:55,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:21:55,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:55,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638612620] [2022-12-13 02:21:55,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638612620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:55,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:55,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:55,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511547684] [2022-12-13 02:21:55,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:55,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:55,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:55,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:55,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:55,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:55,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:55,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:55,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:55,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:55,953 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:55,954 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:21:55,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:55,955 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:55,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:55,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:55,955 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:55,955 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:55,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:55,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:55,958 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,958 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:55,958 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:55,958 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:55,958 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,958 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:55,958 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:55,958 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:55,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:55,964 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:55,964 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:55,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:55,965 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:55,965 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:56,054 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:56,054 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:56,054 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:56,054 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 02:21:56,054 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:56,054 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:56,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1745 [2022-12-13 02:21:56,054 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:21:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1453914075, now seen corresponding path program 1 times [2022-12-13 02:21:56,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:56,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465385008] [2022-12-13 02:21:56,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:56,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:21:56,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:56,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465385008] [2022-12-13 02:21:56,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465385008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:56,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:56,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:56,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36673734] [2022-12-13 02:21:56,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:56,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:56,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:56,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:56,105 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:56,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:56,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:56,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:56,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:56,182 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:56,183 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:56,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:56,184 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:56,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:56,184 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:56,184 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:56,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:56,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:56,187 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:56,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:56,187 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:56,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:56,187 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:56,187 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:56,187 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:56,187 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:56,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:56,193 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:56,193 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:56,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:56,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:56,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:56,281 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:56,282 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:56,282 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:56,282 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 02:21:56,282 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:56,282 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:56,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1746 [2022-12-13 02:21:56,282 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:21:56,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:56,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1425284924, now seen corresponding path program 1 times [2022-12-13 02:21:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:56,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814643810] [2022-12-13 02:21:56,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:56,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:21:56,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:56,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814643810] [2022-12-13 02:21:56,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814643810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:56,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:56,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:56,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510465705] [2022-12-13 02:21:56,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:56,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:56,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:56,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:56,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:56,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:56,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:56,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:56,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:56,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:56,401 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:56,401 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:56,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:56,402 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:56,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:56,403 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:56,403 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:56,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:56,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:56,405 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:56,405 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:56,405 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:56,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:56,406 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:56,406 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:56,406 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:56,406 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:56,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:56,411 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:56,412 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:56,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:56,412 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:56,412 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:56,502 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:56,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:21:56,503 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:56,503 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 02:21:56,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:56,503 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:56,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1747 [2022-12-13 02:21:56,503 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:21:56,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:56,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1396655773, now seen corresponding path program 1 times [2022-12-13 02:21:56,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:56,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9214083] [2022-12-13 02:21:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:56,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:21:56,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:56,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9214083] [2022-12-13 02:21:56,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9214083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:56,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:56,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:56,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458156169] [2022-12-13 02:21:56,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:56,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:56,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:56,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:56,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:56,554 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:56,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:56,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:56,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:56,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:56,630 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:56,630 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:56,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:56,631 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:56,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:56,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:56,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:56,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:56,632 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:56,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:56,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:56,634 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:56,634 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:56,634 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:56,634 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:56,635 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:56,635 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:56,635 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:56,635 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:56,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:56,640 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:56,640 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:56,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:56,641 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:56,641 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:56,729 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:56,729 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:56,729 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:56,729 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 02:21:56,729 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:56,729 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:56,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1748 [2022-12-13 02:21:56,729 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:21:56,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1368026622, now seen corresponding path program 1 times [2022-12-13 02:21:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:56,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830487351] [2022-12-13 02:21:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:56,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:21:56,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:56,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830487351] [2022-12-13 02:21:56,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830487351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:56,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:56,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:56,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514626142] [2022-12-13 02:21:56,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:56,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:56,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:56,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:56,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:56,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:56,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:56,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:56,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:56,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:56,866 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:56,866 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:56,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:56,867 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:56,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:56,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:56,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:56,868 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:56,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:56,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:56,870 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:56,870 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:56,870 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:56,870 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:56,870 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:56,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:56,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:56,871 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:56,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:56,876 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:56,876 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:21:56,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:56,877 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:56,877 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:56,965 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:56,965 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:56,965 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:56,966 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 02:21:56,966 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:56,966 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:56,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1749 [2022-12-13 02:21:56,966 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:21:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:56,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1339397471, now seen corresponding path program 1 times [2022-12-13 02:21:56,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:56,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801212503] [2022-12-13 02:21:56,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:56,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:57,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 02:21:57,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:57,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801212503] [2022-12-13 02:21:57,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801212503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:57,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:57,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:57,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714060711] [2022-12-13 02:21:57,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:57,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:57,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:57,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:57,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:57,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:57,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:57,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:57,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:57,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:57,105 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:57,105 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:57,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:57,106 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:57,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:57,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:57,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:57,107 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:57,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:57,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:57,110 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:57,110 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:57,110 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:57,110 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:57,110 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:57,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:57,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:57,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:57,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:57,116 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:57,116 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:57,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:57,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:57,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:57,204 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:57,204 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:57,204 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:57,205 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 02:21:57,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:57,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:57,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1750 [2022-12-13 02:21:57,205 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:21:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:57,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1310768320, now seen corresponding path program 1 times [2022-12-13 02:21:57,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:57,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829809742] [2022-12-13 02:21:57,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:57,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:57,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:21:57,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:57,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829809742] [2022-12-13 02:21:57,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829809742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:57,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:57,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:57,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368899091] [2022-12-13 02:21:57,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:57,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:57,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:57,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:57,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:57,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:57,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:57,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:57,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:57,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:57,330 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:57,331 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:57,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:57,332 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:57,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:57,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:57,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:57,332 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:57,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:57,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:57,335 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:57,335 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:57,335 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:57,335 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:57,335 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:57,335 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:57,335 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:57,335 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:57,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:57,341 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:57,341 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:57,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:57,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:57,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:57,428 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:57,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:57,429 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:57,429 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 02:21:57,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:57,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:57,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1751 [2022-12-13 02:21:57,429 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:21:57,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1282139169, now seen corresponding path program 1 times [2022-12-13 02:21:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:57,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321065247] [2022-12-13 02:21:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:57,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:57,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:21:57,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:57,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321065247] [2022-12-13 02:21:57,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321065247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:57,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:57,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:57,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627070271] [2022-12-13 02:21:57,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:57,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:57,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:57,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:57,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:57,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:57,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:57,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:57,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:57,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:57,553 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:57,553 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:57,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:57,554 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:57,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:57,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:57,554 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:57,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:57,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:57,557 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:57,557 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:57,557 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:57,557 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:57,557 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:57,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:57,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:57,557 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:57,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:57,563 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:57,563 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:57,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:57,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:57,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:57,651 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:57,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:57,651 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:57,651 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 02:21:57,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:57,651 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:57,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1752 [2022-12-13 02:21:57,652 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:21:57,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:57,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1253510018, now seen corresponding path program 1 times [2022-12-13 02:21:57,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:57,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478328384] [2022-12-13 02:21:57,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:57,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:57,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:21:57,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:57,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478328384] [2022-12-13 02:21:57,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478328384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:57,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:57,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:57,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940701150] [2022-12-13 02:21:57,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:57,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:57,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:57,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:57,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:57,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:57,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:57,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:57,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:57,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:57,770 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:57,770 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:57,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:57,771 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:57,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:57,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:57,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:57,772 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:57,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:57,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:57,775 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:57,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:57,775 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:57,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:57,775 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:57,775 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:57,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:57,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:57,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:57,789 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:57,789 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:21:57,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:57,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:57,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:57,876 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:57,876 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:21:57,876 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:57,876 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 02:21:57,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:57,876 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:57,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1753 [2022-12-13 02:21:57,876 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:21:57,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1224880867, now seen corresponding path program 1 times [2022-12-13 02:21:57,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:57,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538366404] [2022-12-13 02:21:57,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:57,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:57,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:21:57,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:57,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538366404] [2022-12-13 02:21:57,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538366404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:57,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:57,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:57,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306585088] [2022-12-13 02:21:57,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:57,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:57,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:57,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:57,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:57,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:57,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:58,005 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:58,006 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:58,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:58,007 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:58,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:58,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:58,007 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:58,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:58,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:58,010 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:58,010 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:58,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:58,010 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:58,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:58,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:58,016 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:58,016 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:58,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:58,016 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:58,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:58,104 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:58,104 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:58,104 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:58,104 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 02:21:58,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:58,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:58,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1754 [2022-12-13 02:21:58,104 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:21:58,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1196251716, now seen corresponding path program 1 times [2022-12-13 02:21:58,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:58,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779338508] [2022-12-13 02:21:58,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:58,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:58,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:21:58,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:58,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779338508] [2022-12-13 02:21:58,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779338508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:58,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:58,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:58,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731783639] [2022-12-13 02:21:58,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:58,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:58,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:58,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:58,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:58,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:58,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:58,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:58,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:58,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:58,221 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:58,221 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:58,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:58,222 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:58,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:58,223 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:58,223 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:58,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:58,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:58,225 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,225 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:58,225 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:58,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:58,225 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,226 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:58,226 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:58,226 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:58,231 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:58,231 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:58,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:58,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:58,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:58,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:58,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:58,320 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:58,320 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 02:21:58,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:58,320 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:58,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1755 [2022-12-13 02:21:58,320 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:21:58,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:58,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1167622565, now seen corresponding path program 1 times [2022-12-13 02:21:58,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:58,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514435329] [2022-12-13 02:21:58,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:58,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:58,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 02:21:58,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:58,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514435329] [2022-12-13 02:21:58,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514435329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:58,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:58,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:58,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553150087] [2022-12-13 02:21:58,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:58,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:58,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:58,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:58,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:58,372 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:58,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:58,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:58,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:58,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:58,438 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:58,439 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:58,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:58,440 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:58,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:58,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:58,440 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:58,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:58,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:58,443 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,443 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:58,443 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:58,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:58,443 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,443 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:58,443 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:58,443 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:58,449 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:58,449 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:21:58,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:58,450 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:58,450 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:58,537 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:58,537 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:58,537 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:58,537 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 02:21:58,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:58,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:58,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1756 [2022-12-13 02:21:58,537 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:21:58,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:58,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1138993414, now seen corresponding path program 1 times [2022-12-13 02:21:58,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:58,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980539931] [2022-12-13 02:21:58,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:58,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:58,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:21:58,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:58,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980539931] [2022-12-13 02:21:58,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980539931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:58,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:58,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:21:58,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741973342] [2022-12-13 02:21:58,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:58,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:21:58,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:58,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:21:58,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:21:58,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:58,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:58,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:58,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:58,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:58,689 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:58,689 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:58,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:58,690 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:58,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:58,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:58,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:58,690 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:58,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:58,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:58,693 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,693 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:58,693 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:58,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:58,693 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:58,694 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:58,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:58,699 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:58,699 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:58,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:58,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:58,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:58,787 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:58,787 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:21:58,787 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:58,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:21:58,787 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:58,787 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:58,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1757 [2022-12-13 02:21:58,788 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:21:58,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1110364263, now seen corresponding path program 1 times [2022-12-13 02:21:58,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:58,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340968637] [2022-12-13 02:21:58,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:58,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:58,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:21:58,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:58,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340968637] [2022-12-13 02:21:58,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340968637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:58,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:58,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:58,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530027977] [2022-12-13 02:21:58,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:58,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:58,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:58,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:58,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:58,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:58,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:58,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:58,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:58,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:58,916 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:58,916 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:58,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:58,917 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:58,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:58,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:58,918 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:58,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:58,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:58,920 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,920 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:58,921 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:58,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:58,921 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:58,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:58,921 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:58,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:58,926 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:58,927 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:21:58,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:58,927 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:58,927 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:59,013 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:59,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:59,014 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:59,014 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 02:21:59,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:59,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:59,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1758 [2022-12-13 02:21:59,014 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:21:59,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:59,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1081735112, now seen corresponding path program 1 times [2022-12-13 02:21:59,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:59,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034929063] [2022-12-13 02:21:59,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:59,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:59,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:21:59,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:59,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034929063] [2022-12-13 02:21:59,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034929063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:59,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:59,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:59,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609164325] [2022-12-13 02:21:59,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:59,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:59,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:59,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:59,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:59,065 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:59,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:59,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:59,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:59,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:59,131 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:59,131 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:59,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:59,132 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:59,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:59,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:59,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:59,133 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:59,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:59,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:59,136 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:59,136 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:59,136 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:59,136 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:59,136 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:59,136 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:59,136 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:59,136 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:59,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:59,142 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:59,142 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:21:59,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:59,143 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:59,143 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:59,229 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:59,229 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:21:59,229 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:59,229 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 02:21:59,229 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:59,229 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:59,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1759 [2022-12-13 02:21:59,229 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:21:59,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:59,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1053105961, now seen corresponding path program 1 times [2022-12-13 02:21:59,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:59,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920820566] [2022-12-13 02:21:59,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:59,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:59,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:21:59,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:59,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920820566] [2022-12-13 02:21:59,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920820566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:59,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:59,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:59,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182723707] [2022-12-13 02:21:59,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:59,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:59,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:59,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:59,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:59,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:59,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:59,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:59,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:59,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:59,347 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:59,347 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:21:59,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:59,348 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:59,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:59,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:59,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:59,348 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:59,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:59,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:59,351 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:59,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:59,351 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:59,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:59,351 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:59,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:59,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:59,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:59,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:59,357 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:59,357 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:21:59,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:59,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:59,358 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:59,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:59,446 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:59,446 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:59,446 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 02:21:59,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:59,446 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:59,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1760 [2022-12-13 02:21:59,446 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:21:59,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:59,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1024476810, now seen corresponding path program 1 times [2022-12-13 02:21:59,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:59,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793371453] [2022-12-13 02:21:59,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:59,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:59,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:21:59,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:59,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793371453] [2022-12-13 02:21:59,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793371453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:59,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:59,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:59,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047394084] [2022-12-13 02:21:59,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:59,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:59,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:59,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:59,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:59,498 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:59,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:59,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:59,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:59,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:59,574 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:59,574 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:21:59,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:59,575 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:59,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:59,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:59,576 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:59,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:59,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:59,578 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:59,578 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:59,578 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:59,578 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:59,578 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:59,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:59,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:59,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:59,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:59,584 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:59,584 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:59,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:59,585 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:59,585 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:59,673 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:59,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:21:59,673 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:59,673 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 02:21:59,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:59,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:59,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1761 [2022-12-13 02:21:59,674 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:21:59,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:59,674 INFO L85 PathProgramCache]: Analyzing trace with hash -995847659, now seen corresponding path program 1 times [2022-12-13 02:21:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:59,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647728856] [2022-12-13 02:21:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:59,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:21:59,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:59,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647728856] [2022-12-13 02:21:59,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647728856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:59,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:59,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:59,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747170465] [2022-12-13 02:21:59,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:59,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:59,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:59,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:59,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:59,726 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:59,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:59,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:59,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:59,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:21:59,802 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:21:59,802 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:21:59,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:21:59,803 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:21:59,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:21:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:21:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:21:59,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:21:59,803 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:21:59,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:21:59,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:21:59,806 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:59,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:21:59,806 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:21:59,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:21:59,806 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:59,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:21:59,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:21:59,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:21:59,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:59,812 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:21:59,812 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:21:59,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:21:59,813 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:21:59,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:21:59,910 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:21:59,910 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:21:59,910 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:21:59,910 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 02:21:59,910 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:21:59,910 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:21:59,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1762 [2022-12-13 02:21:59,910 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:21:59,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:21:59,911 INFO L85 PathProgramCache]: Analyzing trace with hash -967218508, now seen corresponding path program 1 times [2022-12-13 02:21:59,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:21:59,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21318049] [2022-12-13 02:21:59,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:21:59,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:21:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:21:59,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:21:59,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:21:59,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21318049] [2022-12-13 02:21:59,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21318049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:21:59,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:21:59,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:21:59,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691400830] [2022-12-13 02:21:59,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:21:59,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:21:59,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:21:59,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:21:59,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:21:59,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:21:59,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:21:59,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:21:59,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:21:59,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:00,040 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:00,040 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:00,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:00,042 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:00,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:00,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:00,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:00,042 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:00,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:00,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:00,045 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,045 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:00,045 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:00,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:00,045 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:00,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:00,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:00,051 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:00,051 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:00,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:00,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:00,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:00,139 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:00,139 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:00,139 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:00,139 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 02:22:00,139 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:00,139 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:00,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1763 [2022-12-13 02:22:00,139 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:22:00,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:00,140 INFO L85 PathProgramCache]: Analyzing trace with hash -938589357, now seen corresponding path program 1 times [2022-12-13 02:22:00,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:00,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758639814] [2022-12-13 02:22:00,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:00,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:00,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:22:00,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:00,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758639814] [2022-12-13 02:22:00,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758639814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:00,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:00,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:00,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849293047] [2022-12-13 02:22:00,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:00,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:00,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:00,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:00,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:00,190 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:00,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:00,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:00,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:00,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:00,255 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:00,256 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:00,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:00,257 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:00,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:00,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:00,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:00,257 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:00,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:00,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:00,260 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,260 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:00,260 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:00,260 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:00,260 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,261 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:00,261 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:00,261 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:00,266 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:00,266 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:00,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:00,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:00,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:00,353 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:00,354 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:00,354 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:00,354 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 02:22:00,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:00,354 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:00,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1764 [2022-12-13 02:22:00,354 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:22:00,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:00,354 INFO L85 PathProgramCache]: Analyzing trace with hash -909960206, now seen corresponding path program 1 times [2022-12-13 02:22:00,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:00,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491162574] [2022-12-13 02:22:00,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:00,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:00,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:22:00,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:00,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491162574] [2022-12-13 02:22:00,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491162574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:00,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:00,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:00,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78694067] [2022-12-13 02:22:00,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:00,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:00,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:00,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:00,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:00,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:00,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:00,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:00,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:00,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:00,481 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:00,481 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:00,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:00,483 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:00,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:00,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:00,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:00,483 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:00,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:00,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:00,486 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,486 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:00,486 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:00,486 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:00,486 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,486 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:00,486 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:00,486 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:00,492 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:00,492 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:00,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:00,492 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:00,493 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:00,578 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:00,578 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:22:00,578 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:00,578 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 02:22:00,578 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:00,578 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:00,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1765 [2022-12-13 02:22:00,578 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:22:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:00,579 INFO L85 PathProgramCache]: Analyzing trace with hash -881331055, now seen corresponding path program 1 times [2022-12-13 02:22:00,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:00,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889547762] [2022-12-13 02:22:00,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:00,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:00,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:22:00,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:00,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889547762] [2022-12-13 02:22:00,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889547762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:00,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:00,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:00,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427309682] [2022-12-13 02:22:00,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:00,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:00,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:00,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:00,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:00,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:00,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:00,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:00,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:00,692 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:00,693 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:00,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:00,694 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:00,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:00,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:00,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:00,694 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:00,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:00,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:00,697 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,697 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:00,697 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:00,697 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:00,697 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,697 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:00,697 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:00,697 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:00,703 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:00,703 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:00,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:00,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:00,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:00,789 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:00,789 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:22:00,789 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:00,790 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 02:22:00,790 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:00,790 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:00,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1766 [2022-12-13 02:22:00,790 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:22:00,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:00,790 INFO L85 PathProgramCache]: Analyzing trace with hash -852701904, now seen corresponding path program 1 times [2022-12-13 02:22:00,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:00,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519292445] [2022-12-13 02:22:00,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:00,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:00,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 02:22:00,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:00,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519292445] [2022-12-13 02:22:00,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519292445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:00,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:00,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:00,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112649542] [2022-12-13 02:22:00,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:00,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:00,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:00,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:00,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:00,840 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:00,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:00,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:00,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:00,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:00,913 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:00,913 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:00,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:00,914 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:00,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:00,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:00,915 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:00,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:00,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:00,917 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,917 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:00,917 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:00,917 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:00,917 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,918 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:00,918 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:00,918 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:00,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:00,923 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:00,923 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:22:00,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:00,924 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:00,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:01,011 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:01,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:01,012 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:01,012 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 02:22:01,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:01,012 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:01,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1767 [2022-12-13 02:22:01,012 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:22:01,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash -824072753, now seen corresponding path program 1 times [2022-12-13 02:22:01,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:01,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255227495] [2022-12-13 02:22:01,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:01,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:01,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:22:01,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:01,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255227495] [2022-12-13 02:22:01,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255227495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:01,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:01,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:01,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019808412] [2022-12-13 02:22:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:01,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:01,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:01,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:01,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:01,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:01,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:01,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:01,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:01,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:01,127 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:01,127 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:01,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:01,128 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:01,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:01,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:01,129 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:01,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:01,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:01,131 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:01,131 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:01,131 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:01,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:01,131 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:01,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:01,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:01,132 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:01,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:01,137 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:01,137 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:01,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:01,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:01,138 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:01,224 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:01,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:01,225 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:01,225 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 02:22:01,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:01,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:01,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1768 [2022-12-13 02:22:01,225 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:22:01,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash -795443602, now seen corresponding path program 1 times [2022-12-13 02:22:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:01,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338147908] [2022-12-13 02:22:01,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:01,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:01,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:22:01,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:01,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338147908] [2022-12-13 02:22:01,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338147908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:01,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:01,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:01,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147909879] [2022-12-13 02:22:01,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:01,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:01,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:01,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:01,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:01,277 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:01,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:01,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:01,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:01,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:01,344 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:01,344 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:01,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:01,345 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:01,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:01,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:01,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:01,345 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:01,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:01,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:01,348 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:01,348 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:01,348 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:01,348 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:01,348 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:01,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:01,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:01,349 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:01,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:01,354 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:01,354 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:22:01,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:01,355 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:01,355 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:01,441 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:01,442 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:01,442 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:01,442 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 02:22:01,442 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:01,442 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:01,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1769 [2022-12-13 02:22:01,442 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:22:01,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:01,442 INFO L85 PathProgramCache]: Analyzing trace with hash -766814451, now seen corresponding path program 1 times [2022-12-13 02:22:01,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:01,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407877360] [2022-12-13 02:22:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:01,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:01,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:22:01,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:01,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407877360] [2022-12-13 02:22:01,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407877360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:01,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:01,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:01,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402256816] [2022-12-13 02:22:01,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:01,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:01,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:01,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:01,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:01,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:01,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:01,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:01,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:01,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:01,564 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:01,564 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:01,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:01,565 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:01,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:01,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:01,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:01,566 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:01,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:01,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:01,568 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:01,568 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:01,569 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:01,569 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:01,569 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:01,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:01,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:01,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:01,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:01,574 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:01,574 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:01,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:01,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:01,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:01,662 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:01,662 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:01,663 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:01,663 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 02:22:01,663 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:01,663 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:01,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1770 [2022-12-13 02:22:01,663 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:22:01,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:01,663 INFO L85 PathProgramCache]: Analyzing trace with hash -738185300, now seen corresponding path program 1 times [2022-12-13 02:22:01,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:01,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612999550] [2022-12-13 02:22:01,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:01,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:01,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:22:01,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:01,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612999550] [2022-12-13 02:22:01,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612999550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:01,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:01,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:01,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566307055] [2022-12-13 02:22:01,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:01,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:01,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:01,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:01,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:01,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:01,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:01,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:01,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:01,778 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:01,778 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:01,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:01,779 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:01,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:01,779 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:01,780 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:01,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:01,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:01,782 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:01,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:01,783 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:01,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:01,783 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:01,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:01,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:01,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:01,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:01,789 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:01,789 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:01,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 444 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:01,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:01,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:01,876 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:01,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:01,877 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:01,877 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 02:22:01,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:01,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:01,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1771 [2022-12-13 02:22:01,877 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:22:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash -709556149, now seen corresponding path program 1 times [2022-12-13 02:22:01,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:01,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644884439] [2022-12-13 02:22:01,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:01,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:01,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:22:01,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:01,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644884439] [2022-12-13 02:22:01,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644884439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:01,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:01,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:01,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828086060] [2022-12-13 02:22:01,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:01,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:01,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:01,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:01,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:01,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:01,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:01,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:01,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:01,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:02,010 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:02,010 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:02,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:02,011 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:02,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:02,012 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:02,012 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:02,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:02,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:02,014 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,014 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:02,014 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:02,014 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:02,014 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,015 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:02,015 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:02,015 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:02,020 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:02,020 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:02,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:02,021 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:02,021 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:02,107 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:02,107 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:02,107 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:02,107 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 02:22:02,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:02,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:02,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1772 [2022-12-13 02:22:02,108 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:22:02,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:02,108 INFO L85 PathProgramCache]: Analyzing trace with hash -680926998, now seen corresponding path program 1 times [2022-12-13 02:22:02,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:02,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208948371] [2022-12-13 02:22:02,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:02,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:02,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:22:02,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:02,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208948371] [2022-12-13 02:22:02,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208948371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:02,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:02,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:02,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114318948] [2022-12-13 02:22:02,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:02,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:02,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:02,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:02,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:02,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:02,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:02,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:02,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:02,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:02,231 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:02,232 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:02,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:02,233 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:02,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:02,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:02,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:02,233 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:02,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:02,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:02,236 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,236 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:02,236 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:02,236 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:02,236 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,236 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:02,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:02,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:02,242 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:02,242 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:02,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:02,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:02,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:02,329 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:02,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:02,329 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:02,329 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 02:22:02,329 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:02,329 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:02,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1773 [2022-12-13 02:22:02,329 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:22:02,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:02,329 INFO L85 PathProgramCache]: Analyzing trace with hash -652297847, now seen corresponding path program 1 times [2022-12-13 02:22:02,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:02,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997504728] [2022-12-13 02:22:02,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:02,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:02,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:22:02,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:02,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997504728] [2022-12-13 02:22:02,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997504728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:02,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:02,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:02,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228635481] [2022-12-13 02:22:02,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:02,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:02,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:02,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:02,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:02,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:02,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:02,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:02,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:02,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:02,465 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:02,465 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:02,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:02,466 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:02,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:02,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:02,466 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:02,466 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:02,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:02,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:02,469 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,469 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:02,469 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:02,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:02,469 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,469 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:02,469 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:02,469 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:02,475 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:02,475 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:22:02,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:02,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:02,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:02,563 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:02,563 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:02,563 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:02,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:02,564 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:02,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:02,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1774 [2022-12-13 02:22:02,564 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:22:02,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:02,564 INFO L85 PathProgramCache]: Analyzing trace with hash -623668696, now seen corresponding path program 1 times [2022-12-13 02:22:02,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:02,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652911845] [2022-12-13 02:22:02,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:02,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:02,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:22:02,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:02,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652911845] [2022-12-13 02:22:02,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652911845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:02,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:02,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:02,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83805670] [2022-12-13 02:22:02,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:02,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:02,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:02,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:02,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:02,630 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:02,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:02,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:02,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:02,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:02,707 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:02,708 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:02,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:02,709 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:02,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:02,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:02,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:02,709 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:02,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:02,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:02,712 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,712 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:02,712 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:02,712 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:02,712 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:02,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:02,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:02,718 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:02,718 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:02,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:02,719 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:02,719 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:02,805 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:02,805 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:02,805 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:02,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:02,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:02,805 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:02,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1775 [2022-12-13 02:22:02,806 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:22:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:02,806 INFO L85 PathProgramCache]: Analyzing trace with hash -595039545, now seen corresponding path program 1 times [2022-12-13 02:22:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:02,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444447608] [2022-12-13 02:22:02,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:02,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:02,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:22:02,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:02,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444447608] [2022-12-13 02:22:02,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444447608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:02,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:02,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827332232] [2022-12-13 02:22:02,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:02,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:02,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:02,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:02,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:02,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:02,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:02,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:02,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:02,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:02,928 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:02,929 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:02,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:02,930 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:02,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:02,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:02,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:02,930 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:02,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:02,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:02,933 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,933 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:02,933 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:02,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:02,933 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,934 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:02,934 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:02,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:02,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:02,939 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:02,939 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:02,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:02,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:02,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:03,026 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:03,026 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:03,026 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:03,026 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 02:22:03,027 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:03,027 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:03,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1776 [2022-12-13 02:22:03,027 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:22:03,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:03,027 INFO L85 PathProgramCache]: Analyzing trace with hash -566410394, now seen corresponding path program 1 times [2022-12-13 02:22:03,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:03,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634322886] [2022-12-13 02:22:03,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:03,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:03,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:22:03,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:03,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634322886] [2022-12-13 02:22:03,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634322886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:03,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:03,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:03,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774998610] [2022-12-13 02:22:03,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:03,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:03,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:03,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:03,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:03,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:03,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:03,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:03,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:03,153 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:03,153 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:03,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:03,154 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:03,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:03,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:03,155 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:03,155 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:03,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:03,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:03,157 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:03,157 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:03,157 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:03,157 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:03,157 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:03,158 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:03,158 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:03,158 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:03,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:03,163 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:03,163 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:03,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:03,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:03,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:03,251 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:03,251 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:03,251 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:03,251 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 02:22:03,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:03,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:03,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1777 [2022-12-13 02:22:03,251 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:22:03,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:03,252 INFO L85 PathProgramCache]: Analyzing trace with hash -537781243, now seen corresponding path program 1 times [2022-12-13 02:22:03,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:03,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078308712] [2022-12-13 02:22:03,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:03,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:03,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:22:03,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:03,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078308712] [2022-12-13 02:22:03,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078308712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:03,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:03,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:03,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192700218] [2022-12-13 02:22:03,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:03,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:03,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:03,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:03,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:03,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:03,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:03,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:03,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:03,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:03,366 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:03,366 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:03,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:03,367 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:03,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:03,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:03,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:03,368 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:03,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:03,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:03,370 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:03,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:03,370 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:03,371 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:03,371 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:03,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:03,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:03,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:03,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:03,376 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:03,376 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:03,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:03,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:03,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:03,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:03,464 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:03,464 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:03,464 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 02:22:03,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:03,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:03,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1778 [2022-12-13 02:22:03,465 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:22:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash -509152092, now seen corresponding path program 1 times [2022-12-13 02:22:03,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:03,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778389825] [2022-12-13 02:22:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:03,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:03,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:22:03,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:03,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778389825] [2022-12-13 02:22:03,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778389825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:03,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:03,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739816694] [2022-12-13 02:22:03,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:03,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:03,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:03,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:03,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:03,515 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:03,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:03,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:03,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:03,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:03,590 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:03,590 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:03,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:03,592 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:03,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:03,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:03,592 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:03,592 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:03,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:03,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:03,595 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:03,595 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:03,595 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:03,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:03,595 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:03,595 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:03,595 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:03,595 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:03,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:03,601 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:03,601 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:03,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:03,601 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:03,601 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:03,687 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:03,687 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:22:03,687 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:03,687 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 02:22:03,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:03,687 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:03,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1779 [2022-12-13 02:22:03,688 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:22:03,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash -480522941, now seen corresponding path program 1 times [2022-12-13 02:22:03,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:03,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425480705] [2022-12-13 02:22:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:03,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:03,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:22:03,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:03,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425480705] [2022-12-13 02:22:03,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425480705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:03,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:03,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:03,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767752889] [2022-12-13 02:22:03,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:03,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:03,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:03,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:03,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:03,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:03,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:03,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:03,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:03,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:03,837 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:03,837 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:03,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:03,838 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:03,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:03,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:03,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:03,839 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:03,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:03,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:03,841 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:03,842 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:03,842 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:03,842 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:03,842 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:03,842 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:03,842 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:03,842 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:03,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:03,848 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:03,848 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:03,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:03,848 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:03,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:03,942 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:03,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:22:03,942 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:03,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:03,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:03,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:03,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1780 [2022-12-13 02:22:03,943 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:22:03,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:03,943 INFO L85 PathProgramCache]: Analyzing trace with hash -451893790, now seen corresponding path program 1 times [2022-12-13 02:22:03,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:03,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306961222] [2022-12-13 02:22:03,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:03,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:04,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:22:04,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:04,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306961222] [2022-12-13 02:22:04,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306961222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:04,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:04,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:04,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440841819] [2022-12-13 02:22:04,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:04,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:04,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:04,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:04,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:04,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:04,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:04,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:04,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:04,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:04,087 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:04,087 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:04,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:04,088 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:04,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:04,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:04,088 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:04,088 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:04,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:04,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:04,091 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:04,091 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:04,091 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:04,091 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:04,091 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:04,092 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:04,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:04,092 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:04,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:04,097 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:04,097 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:04,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 465 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:04,098 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:04,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:04,185 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:04,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:04,185 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:04,185 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 02:22:04,185 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:04,185 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:04,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1781 [2022-12-13 02:22:04,186 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:22:04,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:04,186 INFO L85 PathProgramCache]: Analyzing trace with hash -423264639, now seen corresponding path program 1 times [2022-12-13 02:22:04,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:04,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328971990] [2022-12-13 02:22:04,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:04,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:04,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 02:22:04,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:04,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328971990] [2022-12-13 02:22:04,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328971990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:04,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:04,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:04,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310821174] [2022-12-13 02:22:04,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:04,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:04,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:04,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:04,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:04,235 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:04,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:04,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:04,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:04,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:04,311 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:04,311 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:04,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:04,312 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:04,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:04,313 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:04,313 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:04,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:04,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:04,315 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:04,316 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:04,316 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:04,316 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:04,316 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:04,316 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:04,316 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:04,316 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:04,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:04,322 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:04,322 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:04,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:04,322 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:04,322 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:04,410 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:04,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:04,411 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:04,411 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 02:22:04,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:04,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:04,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1782 [2022-12-13 02:22:04,411 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:22:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:04,411 INFO L85 PathProgramCache]: Analyzing trace with hash -394635488, now seen corresponding path program 1 times [2022-12-13 02:22:04,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:04,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401463586] [2022-12-13 02:22:04,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:04,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:22:04,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:04,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401463586] [2022-12-13 02:22:04,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401463586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:04,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:04,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595913165] [2022-12-13 02:22:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:04,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:04,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:04,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:04,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:04,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:04,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:04,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:04,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:04,554 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:04,554 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:04,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:04,555 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:04,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:04,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:04,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:04,556 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:04,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:04,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:04,558 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:04,558 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:04,558 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:04,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:04,559 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:04,559 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:04,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:04,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:04,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:04,564 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:04,564 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:04,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:04,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:04,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:04,653 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:04,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:04,653 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:04,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:04,653 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:04,653 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:04,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1783 [2022-12-13 02:22:04,653 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:22:04,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:04,654 INFO L85 PathProgramCache]: Analyzing trace with hash -366006337, now seen corresponding path program 1 times [2022-12-13 02:22:04,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:04,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423443642] [2022-12-13 02:22:04,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:04,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:04,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:22:04,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:04,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423443642] [2022-12-13 02:22:04,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423443642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:04,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:04,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:04,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012065814] [2022-12-13 02:22:04,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:04,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:04,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:04,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:04,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:04,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:04,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:04,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:04,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:04,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:04,772 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:04,772 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:04,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:04,773 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:04,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:04,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:04,774 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:04,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:04,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:04,776 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:04,776 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:04,776 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:04,776 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:04,776 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:04,777 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:04,777 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:04,777 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:04,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:04,782 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:04,782 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:04,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:04,783 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:04,783 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:04,870 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:04,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:04,871 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:04,871 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 02:22:04,871 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:04,871 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:04,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1784 [2022-12-13 02:22:04,871 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:22:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:04,871 INFO L85 PathProgramCache]: Analyzing trace with hash -337377186, now seen corresponding path program 1 times [2022-12-13 02:22:04,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:04,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611258284] [2022-12-13 02:22:04,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:04,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:04,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:22:04,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:04,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611258284] [2022-12-13 02:22:04,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611258284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:04,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:04,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:04,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526043053] [2022-12-13 02:22:04,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:04,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:04,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:04,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:04,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:04,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:04,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:04,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:04,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:04,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:05,005 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:05,005 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:05,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:05,006 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:05,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:05,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:05,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:05,007 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:05,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:05,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:05,009 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:05,009 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:05,009 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:05,010 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:05,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:05,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:05,015 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:05,015 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:05,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:05,016 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:05,016 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:05,102 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:05,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:05,103 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:05,103 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 02:22:05,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:05,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:05,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1785 [2022-12-13 02:22:05,103 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:22:05,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash -308748035, now seen corresponding path program 1 times [2022-12-13 02:22:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:05,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668923889] [2022-12-13 02:22:05,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:05,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:05,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:22:05,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:05,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668923889] [2022-12-13 02:22:05,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668923889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:05,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:05,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:05,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821166894] [2022-12-13 02:22:05,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:05,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:05,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:05,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:05,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:05,153 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:05,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:05,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:05,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:05,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:05,229 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:05,229 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:05,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:05,230 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:05,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:05,231 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:05,231 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:05,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:05,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:05,233 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,233 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:05,234 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:05,234 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:05,234 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,234 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:05,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:05,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:05,240 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:05,240 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:05,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:05,240 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:05,240 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:05,328 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:05,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:05,329 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:05,329 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 02:22:05,329 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:05,329 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:05,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1786 [2022-12-13 02:22:05,329 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:22:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash -280118884, now seen corresponding path program 1 times [2022-12-13 02:22:05,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:05,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982978464] [2022-12-13 02:22:05,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:05,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:05,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:22:05,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:05,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982978464] [2022-12-13 02:22:05,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982978464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:05,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:05,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:05,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645797746] [2022-12-13 02:22:05,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:05,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:05,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:05,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:05,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:05,381 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:05,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:05,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:05,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:05,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:05,449 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:05,449 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:05,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:05,450 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:05,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:05,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:05,451 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:05,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:05,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:05,454 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,454 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:05,454 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:05,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:05,454 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,454 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:05,454 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:05,454 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:05,460 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:05,460 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:05,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:05,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:05,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:05,549 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:05,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:05,549 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:05,549 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 02:22:05,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:05,550 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:05,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1787 [2022-12-13 02:22:05,550 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:22:05,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:05,550 INFO L85 PathProgramCache]: Analyzing trace with hash -251489733, now seen corresponding path program 1 times [2022-12-13 02:22:05,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:05,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349731573] [2022-12-13 02:22:05,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:05,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:05,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:22:05,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:05,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349731573] [2022-12-13 02:22:05,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349731573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:05,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:05,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:05,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295346852] [2022-12-13 02:22:05,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:05,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:05,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:05,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:05,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:05,602 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:05,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:05,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:05,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:05,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:05,668 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:05,669 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:05,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:05,670 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:05,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:05,670 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:05,670 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:05,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:05,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:05,673 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,673 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:05,673 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:05,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:05,673 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:05,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:05,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:05,679 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:05,679 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:05,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:05,679 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:05,679 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:05,768 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:05,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:05,769 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:05,769 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 02:22:05,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:05,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:05,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1788 [2022-12-13 02:22:05,769 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:22:05,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:05,769 INFO L85 PathProgramCache]: Analyzing trace with hash -222860582, now seen corresponding path program 1 times [2022-12-13 02:22:05,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:05,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494552797] [2022-12-13 02:22:05,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:05,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:05,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 02:22:05,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:05,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494552797] [2022-12-13 02:22:05,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494552797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:05,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:05,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:05,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710779427] [2022-12-13 02:22:05,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:05,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:05,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:05,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:05,821 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:05,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:05,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:05,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:05,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:05,890 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:05,890 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:05,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:05,891 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:05,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:05,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:05,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:05,892 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:05,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:05,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:05,894 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,894 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:05,895 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:05,895 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:05,895 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,895 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:05,895 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:05,895 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:05,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:05,902 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:05,902 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:05,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:05,903 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:05,903 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:06,001 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:06,002 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:22:06,002 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:06,002 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 02:22:06,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:06,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:06,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1789 [2022-12-13 02:22:06,002 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:22:06,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:06,002 INFO L85 PathProgramCache]: Analyzing trace with hash -194231431, now seen corresponding path program 1 times [2022-12-13 02:22:06,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:06,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592005283] [2022-12-13 02:22:06,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:06,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:06,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:22:06,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:06,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592005283] [2022-12-13 02:22:06,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592005283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:06,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:06,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:06,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651868387] [2022-12-13 02:22:06,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:06,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:06,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:06,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:06,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:06,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:06,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:06,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:06,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:06,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:06,148 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:06,148 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:06,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:06,149 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:06,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:06,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:06,150 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:06,150 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:06,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:06,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:06,154 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:06,154 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:06,154 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:06,154 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:06,154 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:06,154 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:06,154 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:06,167 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:06,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:06,190 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:06,191 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:06,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:06,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:06,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:06,289 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:06,290 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:22:06,290 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:06,290 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 02:22:06,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:06,290 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:06,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1790 [2022-12-13 02:22:06,290 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:22:06,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:06,291 INFO L85 PathProgramCache]: Analyzing trace with hash -165602280, now seen corresponding path program 1 times [2022-12-13 02:22:06,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:06,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134443086] [2022-12-13 02:22:06,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:06,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:06,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 02:22:06,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:06,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134443086] [2022-12-13 02:22:06,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134443086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:06,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:06,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:06,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335049088] [2022-12-13 02:22:06,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:06,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:06,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:06,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:06,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:06,345 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:06,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:06,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:06,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:06,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:06,435 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:06,435 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:06,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:06,436 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:06,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:06,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:06,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:06,437 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:06,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:06,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:06,439 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:06,439 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:06,439 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:06,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:06,440 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:06,440 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:06,440 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:06,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:06,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:06,445 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:06,445 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:06,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:06,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:06,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:06,534 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:06,534 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:06,534 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:06,534 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 02:22:06,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:06,534 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:06,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1791 [2022-12-13 02:22:06,535 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:22:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:06,535 INFO L85 PathProgramCache]: Analyzing trace with hash -136973129, now seen corresponding path program 1 times [2022-12-13 02:22:06,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:06,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680971328] [2022-12-13 02:22:06,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:06,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:06,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:22:06,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:06,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680971328] [2022-12-13 02:22:06,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680971328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:06,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:06,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:06,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794405109] [2022-12-13 02:22:06,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:06,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:06,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:06,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:06,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:06,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:06,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:06,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:06,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:06,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:06,677 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:06,677 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:06,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:06,678 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:06,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:06,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:06,679 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:06,679 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:06,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:06,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:06,681 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:06,681 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:06,681 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:06,682 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:06,682 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:06,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:06,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:06,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:06,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:06,688 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:06,688 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:06,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:06,688 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:06,688 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:06,776 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:06,777 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:06,777 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:06,777 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 02:22:06,777 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:06,777 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:06,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1792 [2022-12-13 02:22:06,777 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:22:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:06,777 INFO L85 PathProgramCache]: Analyzing trace with hash -108343978, now seen corresponding path program 1 times [2022-12-13 02:22:06,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:06,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036970430] [2022-12-13 02:22:06,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:06,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:06,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:22:06,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:06,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036970430] [2022-12-13 02:22:06,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036970430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:06,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:06,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:06,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32102976] [2022-12-13 02:22:06,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:06,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:06,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:06,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:06,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:06,830 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:06,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:06,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:06,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:06,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:06,896 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:06,896 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:06,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:06,897 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:06,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:06,898 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:06,898 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:06,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:06,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:06,900 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:06,900 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:06,901 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:06,901 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:06,901 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:06,901 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:06,901 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:06,901 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:06,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:06,906 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:06,907 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:06,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:06,907 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:06,907 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:06,994 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:06,994 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:06,994 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:06,994 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 02:22:06,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:06,994 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:06,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1793 [2022-12-13 02:22:06,995 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:22:06,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash -79714827, now seen corresponding path program 1 times [2022-12-13 02:22:06,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:06,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991826677] [2022-12-13 02:22:06,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:07,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:22:07,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:07,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991826677] [2022-12-13 02:22:07,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991826677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:07,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:07,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:07,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574448519] [2022-12-13 02:22:07,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:07,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:07,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:07,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:07,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:07,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:07,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:07,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:07,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:07,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:07,135 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:07,135 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:07,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:07,136 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:07,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:07,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:07,136 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:07,136 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:07,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:07,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:07,139 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:07,139 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:07,139 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:07,139 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:07,139 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:07,139 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:07,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:07,140 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:07,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:07,145 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:07,145 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:07,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:07,146 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:07,146 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:07,231 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:07,232 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:07,232 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:07,232 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 02:22:07,232 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:07,232 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:07,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1794 [2022-12-13 02:22:07,232 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:22:07,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:07,233 INFO L85 PathProgramCache]: Analyzing trace with hash -51085676, now seen corresponding path program 1 times [2022-12-13 02:22:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:07,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348822516] [2022-12-13 02:22:07,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:07,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:22:07,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:07,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348822516] [2022-12-13 02:22:07,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348822516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:07,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:07,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838242269] [2022-12-13 02:22:07,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:07,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:07,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:07,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:07,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:07,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:07,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:07,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:07,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:07,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:07,369 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:07,369 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:07,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:07,370 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:07,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:07,370 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:07,370 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:07,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:07,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:07,373 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:07,373 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:07,373 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:07,373 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:07,373 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:07,373 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:07,373 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:07,373 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:07,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:07,379 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:07,379 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:07,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:07,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:07,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:07,469 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:07,470 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:22:07,470 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:07,470 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 02:22:07,470 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:07,470 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:07,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1795 [2022-12-13 02:22:07,470 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:22:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:07,470 INFO L85 PathProgramCache]: Analyzing trace with hash -22456525, now seen corresponding path program 1 times [2022-12-13 02:22:07,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:07,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251866671] [2022-12-13 02:22:07,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:07,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:07,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:22:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:07,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251866671] [2022-12-13 02:22:07,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251866671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:07,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:07,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:07,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464267714] [2022-12-13 02:22:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:07,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:07,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:07,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:07,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:07,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:07,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:07,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:07,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:07,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:07,595 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:07,595 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:07,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:07,596 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:07,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:07,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:07,597 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:07,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:07,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:07,599 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:07,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:07,599 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:07,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:07,599 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:07,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:07,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:07,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:07,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:07,605 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:07,605 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:07,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:07,606 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:07,606 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:07,693 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:07,694 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:07,694 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:07,694 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 02:22:07,694 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:07,694 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:07,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1796 [2022-12-13 02:22:07,694 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:22:07,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash 6172626, now seen corresponding path program 1 times [2022-12-13 02:22:07,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:07,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757200577] [2022-12-13 02:22:07,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:07,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:07,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:22:07,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:07,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757200577] [2022-12-13 02:22:07,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757200577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:07,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:07,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509934858] [2022-12-13 02:22:07,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:07,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:07,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:07,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:07,760 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:07,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:07,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:07,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:07,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:07,833 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:07,834 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:07,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:07,835 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:07,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:07,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:07,835 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:07,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:07,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:07,838 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:07,838 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:07,838 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:07,838 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:07,838 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:07,838 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:07,838 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:07,838 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:07,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:07,844 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:07,844 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:07,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:07,845 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:07,845 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:07,931 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:07,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:07,932 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:07,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:07,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:07,932 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:07,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1797 [2022-12-13 02:22:07,932 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:22:07,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:07,932 INFO L85 PathProgramCache]: Analyzing trace with hash 34801777, now seen corresponding path program 1 times [2022-12-13 02:22:07,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:07,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061307656] [2022-12-13 02:22:07,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:07,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:07,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:22:07,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:07,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061307656] [2022-12-13 02:22:07,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061307656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:07,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:07,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667272622] [2022-12-13 02:22:07,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:07,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:07,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:07,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:07,984 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:07,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:07,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:07,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:07,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:08,058 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:08,058 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:08,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:08,060 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:08,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:08,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:08,060 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:08,060 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:08,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:08,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:08,063 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,063 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:08,063 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:08,063 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:08,063 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,063 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:08,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:08,063 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:08,069 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:08,069 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:08,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:08,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:08,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:08,156 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:08,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:08,156 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:08,156 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 02:22:08,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:08,164 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:08,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1798 [2022-12-13 02:22:08,164 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:22:08,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:08,165 INFO L85 PathProgramCache]: Analyzing trace with hash 63430928, now seen corresponding path program 1 times [2022-12-13 02:22:08,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:08,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270008946] [2022-12-13 02:22:08,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:08,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:22:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:08,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270008946] [2022-12-13 02:22:08,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270008946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:08,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:08,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:08,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191910452] [2022-12-13 02:22:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:08,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:08,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:08,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:08,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:08,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:08,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:08,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:08,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:08,294 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:08,294 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:08,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:08,295 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:08,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:08,295 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:08,295 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:08,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:08,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:08,298 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,298 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:08,298 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:08,298 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:08,298 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,298 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:08,298 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:08,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:08,304 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:08,304 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:08,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:08,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:08,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:08,392 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:08,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:08,393 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:08,393 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 02:22:08,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:08,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:08,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1799 [2022-12-13 02:22:08,393 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:22:08,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:08,393 INFO L85 PathProgramCache]: Analyzing trace with hash 92060079, now seen corresponding path program 1 times [2022-12-13 02:22:08,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:08,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63786090] [2022-12-13 02:22:08,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:08,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:08,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:22:08,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:08,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63786090] [2022-12-13 02:22:08,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63786090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:08,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:08,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:08,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046069477] [2022-12-13 02:22:08,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:08,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:08,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:08,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:08,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:08,444 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:08,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:08,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:08,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:08,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:08,520 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:08,520 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:08,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:08,521 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:08,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:08,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:08,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:08,522 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:08,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:08,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:08,524 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:08,524 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:08,524 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:08,524 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:08,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:08,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:08,530 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:08,530 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:08,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:08,531 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:08,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:08,619 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:08,619 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:08,619 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:08,619 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 02:22:08,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:08,619 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:08,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1800 [2022-12-13 02:22:08,620 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:22:08,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash 120689230, now seen corresponding path program 1 times [2022-12-13 02:22:08,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:08,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435044597] [2022-12-13 02:22:08,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:08,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:08,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:22:08,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:08,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435044597] [2022-12-13 02:22:08,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435044597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:08,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:08,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:08,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018622874] [2022-12-13 02:22:08,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:08,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:08,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:08,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:08,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:08,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:08,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:08,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:08,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:08,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:08,738 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:08,739 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:08,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:08,740 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:08,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:08,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:08,740 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:08,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:08,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:08,743 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:08,743 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:08,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:08,743 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:08,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:08,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:08,749 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:08,749 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:08,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:08,750 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:08,750 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:08,837 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:08,837 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:08,838 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:08,838 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 02:22:08,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:08,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:08,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1801 [2022-12-13 02:22:08,838 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:22:08,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:08,838 INFO L85 PathProgramCache]: Analyzing trace with hash 149318381, now seen corresponding path program 1 times [2022-12-13 02:22:08,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:08,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356939252] [2022-12-13 02:22:08,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:08,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:08,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:22:08,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:08,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356939252] [2022-12-13 02:22:08,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356939252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:08,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:08,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199467562] [2022-12-13 02:22:08,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:08,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:08,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:08,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:08,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:08,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:08,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:08,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:08,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:08,959 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:08,959 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:08,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:08,960 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:08,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:08,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:08,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:08,961 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:08,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:08,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:08,963 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,963 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:08,963 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:08,963 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:08,963 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:08,964 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:08,964 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:08,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:08,969 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:08,969 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:08,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:08,970 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:08,970 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:09,057 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:09,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:09,058 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:09,058 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 02:22:09,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:09,058 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:09,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1802 [2022-12-13 02:22:09,058 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:22:09,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:09,058 INFO L85 PathProgramCache]: Analyzing trace with hash 177947532, now seen corresponding path program 1 times [2022-12-13 02:22:09,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:09,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719262802] [2022-12-13 02:22:09,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:09,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:22:09,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:09,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719262802] [2022-12-13 02:22:09,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719262802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:09,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:09,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:09,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244372600] [2022-12-13 02:22:09,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:09,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:09,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:09,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:09,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:09,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:09,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:09,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:09,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:09,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:09,186 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:09,187 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:09,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:09,188 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:09,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:09,188 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:09,188 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:09,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:09,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:09,191 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:09,191 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:09,191 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:09,191 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:09,191 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:09,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:09,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:09,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:09,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:09,197 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:09,197 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:09,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:09,198 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:09,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:09,285 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:09,285 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:09,285 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:09,285 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 02:22:09,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:09,285 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:09,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1803 [2022-12-13 02:22:09,285 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:22:09,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:09,286 INFO L85 PathProgramCache]: Analyzing trace with hash 206576683, now seen corresponding path program 1 times [2022-12-13 02:22:09,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:09,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314664425] [2022-12-13 02:22:09,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:09,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:09,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:22:09,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:09,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314664425] [2022-12-13 02:22:09,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314664425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:09,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:09,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:09,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062679036] [2022-12-13 02:22:09,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:09,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:09,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:09,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:09,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:09,338 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:09,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:09,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:09,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:09,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:09,404 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:09,404 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:09,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:09,405 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:09,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:09,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:09,405 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:09,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:09,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:09,408 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:09,408 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:09,408 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:09,408 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:09,408 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:09,408 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:09,408 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:09,409 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:09,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:09,414 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:09,414 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:09,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:09,415 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:09,415 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:09,503 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:09,503 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:09,503 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:09,503 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 02:22:09,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:09,503 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:09,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1804 [2022-12-13 02:22:09,503 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:22:09,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:09,504 INFO L85 PathProgramCache]: Analyzing trace with hash 235205834, now seen corresponding path program 1 times [2022-12-13 02:22:09,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:09,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958093679] [2022-12-13 02:22:09,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:09,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:09,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 02:22:09,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:09,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958093679] [2022-12-13 02:22:09,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958093679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:09,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:09,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:09,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452447941] [2022-12-13 02:22:09,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:09,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:09,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:09,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:09,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:09,555 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:09,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:09,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:09,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:09,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:09,621 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:09,622 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:09,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:09,623 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:09,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:09,623 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:09,623 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:09,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:09,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:09,626 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:09,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:09,626 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:09,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:09,626 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:09,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:09,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:09,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:09,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:09,632 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:09,632 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:22:09,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:09,633 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:09,633 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:09,720 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:09,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:09,720 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:09,720 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 02:22:09,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:09,720 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:09,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1805 [2022-12-13 02:22:09,720 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:22:09,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:09,721 INFO L85 PathProgramCache]: Analyzing trace with hash 263834985, now seen corresponding path program 1 times [2022-12-13 02:22:09,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:09,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132903036] [2022-12-13 02:22:09,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:09,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:09,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:22:09,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:09,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132903036] [2022-12-13 02:22:09,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132903036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:09,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:09,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:09,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599960837] [2022-12-13 02:22:09,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:09,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:09,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:09,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:09,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:09,787 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:09,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:09,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:09,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:09,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:09,871 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:09,871 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:09,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:09,872 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:09,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:09,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:09,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:09,873 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:09,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:09,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:09,875 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:09,875 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:09,876 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:09,876 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:09,876 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:09,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:09,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:09,876 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:09,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:09,881 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:09,882 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:09,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:09,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:09,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:09,968 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:09,969 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:09,969 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:09,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:09,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:09,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:09,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1806 [2022-12-13 02:22:09,969 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:22:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash 292464136, now seen corresponding path program 1 times [2022-12-13 02:22:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:09,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471095826] [2022-12-13 02:22:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:10,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:22:10,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:10,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471095826] [2022-12-13 02:22:10,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471095826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:10,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:10,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:10,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711339355] [2022-12-13 02:22:10,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:10,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:10,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:10,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:10,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:10,037 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:10,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:10,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:10,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:10,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:10,121 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:10,121 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:10,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:10,122 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:10,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:10,123 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:10,123 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:10,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:10,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:10,125 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:10,125 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:10,126 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:10,126 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:10,126 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:10,126 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:10,126 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:10,126 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:10,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:10,131 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:10,132 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:10,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:10,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:10,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:10,230 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:10,230 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:22:10,230 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:10,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:10,230 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:10,230 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:10,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1807 [2022-12-13 02:22:10,230 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:22:10,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:10,231 INFO L85 PathProgramCache]: Analyzing trace with hash 321093287, now seen corresponding path program 1 times [2022-12-13 02:22:10,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:10,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20059398] [2022-12-13 02:22:10,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:10,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:10,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:22:10,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:10,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20059398] [2022-12-13 02:22:10,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20059398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:10,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:10,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:10,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563573486] [2022-12-13 02:22:10,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:10,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:10,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:10,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:10,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:10,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:10,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:10,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:10,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:10,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:10,366 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:10,366 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:10,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1129 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:10,367 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:10,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:10,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:10,368 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:10,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:10,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:10,370 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:10,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:10,371 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:10,371 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:10,371 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:10,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:10,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:10,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:10,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:10,376 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:10,376 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:22:10,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:10,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:10,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:10,462 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:10,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:22:10,463 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:10,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:10,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:10,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:10,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1808 [2022-12-13 02:22:10,463 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:22:10,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:10,463 INFO L85 PathProgramCache]: Analyzing trace with hash 349722438, now seen corresponding path program 1 times [2022-12-13 02:22:10,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:10,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540475326] [2022-12-13 02:22:10,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:10,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:22:10,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:10,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540475326] [2022-12-13 02:22:10,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540475326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:10,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:10,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:10,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869682173] [2022-12-13 02:22:10,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:10,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:10,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:10,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:10,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:10,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:10,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:10,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:10,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:10,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:10,602 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:10,602 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:10,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:10,603 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:10,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:10,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:10,604 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:10,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:10,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:10,607 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:10,607 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:10,607 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:10,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:10,607 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:10,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:10,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:10,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:10,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:10,613 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:10,613 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:22:10,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:10,613 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:10,613 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:10,700 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:10,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:10,700 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:10,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:10,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:10,701 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:10,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1809 [2022-12-13 02:22:10,701 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:22:10,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:10,701 INFO L85 PathProgramCache]: Analyzing trace with hash 378351589, now seen corresponding path program 1 times [2022-12-13 02:22:10,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:10,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529015937] [2022-12-13 02:22:10,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:10,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:10,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:22:10,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:10,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529015937] [2022-12-13 02:22:10,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529015937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:10,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:10,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:10,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016284288] [2022-12-13 02:22:10,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:10,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:10,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:10,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:10,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:10,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:10,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:10,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:10,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:10,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:10,826 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:10,826 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:10,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:10,827 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:10,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:10,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:10,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:10,828 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:10,828 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:10,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:10,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:10,831 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:10,831 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:10,831 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:10,831 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:10,831 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:10,831 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:10,831 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:10,831 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:10,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:10,837 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:10,837 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:10,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:10,837 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:10,837 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:10,927 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:10,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:10,927 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:10,927 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 02:22:10,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:10,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:10,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1810 [2022-12-13 02:22:10,928 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:22:10,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:10,928 INFO L85 PathProgramCache]: Analyzing trace with hash 406980740, now seen corresponding path program 1 times [2022-12-13 02:22:10,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:10,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908431600] [2022-12-13 02:22:10,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:10,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22: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:22:10,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:10,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908431600] [2022-12-13 02:22:10,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908431600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:10,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:10,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:10,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895002447] [2022-12-13 02:22:10,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:10,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:10,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:10,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:10,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:10,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:10,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:10,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:10,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:10,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:11,055 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:11,055 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:11,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:11,056 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:11,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:11,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:11,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:11,057 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:11,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:11,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:11,059 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,059 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:11,060 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:11,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:11,060 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:11,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:11,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:11,066 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:11,066 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:11,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:11,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:11,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:11,154 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:11,154 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:11,154 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:11,155 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 02:22:11,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:11,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:11,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1811 [2022-12-13 02:22:11,155 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:22:11,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash 435609891, now seen corresponding path program 1 times [2022-12-13 02:22:11,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:11,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276842689] [2022-12-13 02:22:11,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:11,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:11,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:22:11,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:11,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276842689] [2022-12-13 02:22:11,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276842689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:11,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:11,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:11,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786990433] [2022-12-13 02:22:11,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:11,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:11,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:11,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:11,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:11,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:11,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:11,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:11,317 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:11,317 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:11,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:11,318 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:11,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:11,318 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:11,319 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:11,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:11,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:11,321 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,321 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:11,321 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:11,321 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:11,321 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,322 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:11,322 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:11,322 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:11,327 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:11,327 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:11,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:11,328 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:11,328 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:11,414 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:11,415 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:11,415 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:11,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:11,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:11,415 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:11,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1812 [2022-12-13 02:22:11,415 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:22:11,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:11,415 INFO L85 PathProgramCache]: Analyzing trace with hash 464239042, now seen corresponding path program 1 times [2022-12-13 02:22:11,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:11,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802913322] [2022-12-13 02:22:11,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:11,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:22:11,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:11,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802913322] [2022-12-13 02:22:11,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802913322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:11,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:11,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:11,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405540003] [2022-12-13 02:22:11,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:11,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:11,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:11,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:11,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:11,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:11,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:11,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:11,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:11,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:11,548 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:11,548 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:11,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:11,549 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:11,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:11,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:11,549 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:11,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:11,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:11,552 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:11,552 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:11,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:11,552 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,552 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:11,552 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:11,552 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:11,558 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:11,558 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:11,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:11,559 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:11,559 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:11,643 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:11,643 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 02:22:11,643 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:11,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:11,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:11,644 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:11,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1813 [2022-12-13 02:22:11,644 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:22:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash 492868193, now seen corresponding path program 1 times [2022-12-13 02:22:11,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:11,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429977023] [2022-12-13 02:22:11,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:11,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:11,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:22:11,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:11,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429977023] [2022-12-13 02:22:11,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429977023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:11,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:11,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:11,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402582109] [2022-12-13 02:22:11,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:11,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:11,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:11,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:11,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:11,694 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:11,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:11,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:11,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:11,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:11,760 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:11,760 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:11,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:11,761 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:11,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:11,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:11,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:11,762 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:11,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:11,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:11,764 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:11,764 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:11,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:11,764 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:11,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:11,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:11,770 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:11,770 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:11,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:11,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:11,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:11,856 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:11,857 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:11,857 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:11,857 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 02:22:11,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:11,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:11,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1814 [2022-12-13 02:22:11,857 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:22:11,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:11,857 INFO L85 PathProgramCache]: Analyzing trace with hash 521497344, now seen corresponding path program 1 times [2022-12-13 02:22:11,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:11,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085753965] [2022-12-13 02:22:11,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:11,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:11,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:22:11,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:11,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085753965] [2022-12-13 02:22:11,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085753965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:11,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:11,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:11,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418074839] [2022-12-13 02:22:11,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:11,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:11,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:11,906 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:11,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:11,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:11,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:11,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:11,971 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:11,971 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:11,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:11,972 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:11,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:11,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:11,972 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:11,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:11,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:11,975 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,975 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:11,975 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:11,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:11,975 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:11,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:11,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:11,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:11,981 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:11,981 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:11,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:11,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:11,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:12,068 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:12,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:12,069 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:12,069 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 02:22:12,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:12,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:12,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1815 [2022-12-13 02:22:12,069 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:22:12,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash 550126495, now seen corresponding path program 1 times [2022-12-13 02:22:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:12,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712226253] [2022-12-13 02:22:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:12,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:22:12,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:12,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712226253] [2022-12-13 02:22:12,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712226253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:12,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:12,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:12,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389797060] [2022-12-13 02:22:12,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:12,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:12,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:12,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:12,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:12,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:12,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:12,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:12,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:12,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:12,195 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:12,195 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:12,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:12,196 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:12,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:12,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:12,197 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:12,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:12,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:12,199 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:12,199 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:12,199 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:12,199 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:12,200 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:12,200 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:12,200 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:12,200 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:12,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:12,205 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:12,205 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:12,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:12,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:12,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:12,294 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:12,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:12,294 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:12,295 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 02:22:12,295 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:12,295 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:12,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1816 [2022-12-13 02:22:12,295 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:22:12,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:12,295 INFO L85 PathProgramCache]: Analyzing trace with hash 578755646, now seen corresponding path program 1 times [2022-12-13 02:22:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:12,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519731501] [2022-12-13 02:22:12,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:12,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:12,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:22:12,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:12,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519731501] [2022-12-13 02:22:12,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519731501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:12,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:12,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791000581] [2022-12-13 02:22:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:12,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:12,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:12,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:12,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:12,347 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:12,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:12,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:12,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:12,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:12,425 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:12,425 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:12,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:12,426 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:12,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:12,426 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:12,427 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:12,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:12,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:12,429 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:12,429 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:12,429 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:12,429 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:12,429 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:12,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:12,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:12,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:12,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:12,435 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:12,435 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:12,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:12,436 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:12,436 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:12,523 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:12,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:12,524 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:12,524 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 02:22:12,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:12,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:12,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1817 [2022-12-13 02:22:12,524 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:22:12,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash 607384797, now seen corresponding path program 1 times [2022-12-13 02:22:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:12,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953021018] [2022-12-13 02:22:12,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:12,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:12,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:22:12,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:12,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953021018] [2022-12-13 02:22:12,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953021018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:12,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:12,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:12,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474206914] [2022-12-13 02:22:12,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:12,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:12,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:12,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:12,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:12,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:12,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:12,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:12,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:12,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:12,640 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:12,641 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:12,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:12,642 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:12,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:12,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:12,642 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:12,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:12,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:12,645 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:12,645 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:12,645 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:12,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:12,645 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:12,645 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:12,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:12,645 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:12,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:12,651 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:12,651 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:12,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:12,651 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:12,651 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:12,739 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:12,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:12,740 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:12,740 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 02:22:12,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:12,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:12,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1818 [2022-12-13 02:22:12,740 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:22:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash 636013948, now seen corresponding path program 1 times [2022-12-13 02:22:12,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:12,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884222891] [2022-12-13 02:22:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:12,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:12,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:22:12,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:12,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884222891] [2022-12-13 02:22:12,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884222891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:12,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:12,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:12,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128491945] [2022-12-13 02:22:12,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:12,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:12,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:12,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:12,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:12,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:12,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:12,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:12,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:12,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:12,867 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:12,868 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:12,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:12,869 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:12,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:12,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:12,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:12,869 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:12,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:12,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:12,872 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:12,872 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:12,872 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:12,872 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:12,872 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:12,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:12,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:12,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:12,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:12,878 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:12,878 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:12,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:12,879 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:12,879 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:12,967 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:12,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:12,967 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:12,967 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 02:22:12,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:12,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:12,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1819 [2022-12-13 02:22:12,967 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:22:12,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:12,968 INFO L85 PathProgramCache]: Analyzing trace with hash 664643099, now seen corresponding path program 1 times [2022-12-13 02:22:12,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:12,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476864514] [2022-12-13 02:22:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:12,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:13,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:22:13,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:13,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476864514] [2022-12-13 02:22:13,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476864514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:13,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:13,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:13,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711538720] [2022-12-13 02:22:13,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:13,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:13,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:13,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:13,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:13,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:13,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:13,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:13,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:13,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:13,081 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:13,081 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:13,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:13,083 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:13,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:13,083 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:13,083 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:13,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:13,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:13,086 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,086 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:13,086 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:13,086 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:13,086 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,086 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:13,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:13,086 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:13,092 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:13,092 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:22:13,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:13,093 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:13,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:13,179 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:13,180 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:13,180 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:13,180 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 02:22:13,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:13,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:13,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1820 [2022-12-13 02:22:13,180 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:22:13,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:13,180 INFO L85 PathProgramCache]: Analyzing trace with hash 693272250, now seen corresponding path program 1 times [2022-12-13 02:22:13,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:13,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535347682] [2022-12-13 02:22:13,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:13,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:13,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:22:13,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:13,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535347682] [2022-12-13 02:22:13,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535347682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:13,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:13,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099768661] [2022-12-13 02:22:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:13,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:13,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:13,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:13,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:13,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:13,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:13,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:13,310 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:13,311 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:13,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:13,312 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:13,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:13,312 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:13,312 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:13,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:13,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:13,315 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,315 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:13,315 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:13,315 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:13,315 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,315 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:13,315 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:13,315 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:13,321 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:13,321 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:13,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:13,321 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:13,321 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:13,410 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:13,410 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:13,410 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:13,410 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 02:22:13,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:13,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:13,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1821 [2022-12-13 02:22:13,410 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:22:13,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:13,411 INFO L85 PathProgramCache]: Analyzing trace with hash 721901401, now seen corresponding path program 1 times [2022-12-13 02:22:13,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:13,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730049507] [2022-12-13 02:22:13,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:13,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:13,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:22:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:13,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730049507] [2022-12-13 02:22:13,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730049507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:13,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:13,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:13,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300441934] [2022-12-13 02:22:13,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:13,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:13,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:13,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:13,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:13,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:13,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:13,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:13,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:13,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:13,527 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:13,527 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:13,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:13,528 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:13,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:13,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:13,529 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:13,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:13,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:13,531 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,531 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:13,531 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:13,532 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:13,532 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,532 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:13,532 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:13,532 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:13,538 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:13,538 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:13,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:13,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:13,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:13,626 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:13,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:13,626 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:13,626 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 02:22:13,627 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:13,627 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:13,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1822 [2022-12-13 02:22:13,627 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:22:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:13,627 INFO L85 PathProgramCache]: Analyzing trace with hash 750530552, now seen corresponding path program 1 times [2022-12-13 02:22:13,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:13,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873431314] [2022-12-13 02:22:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:13,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:13,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:22:13,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:13,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873431314] [2022-12-13 02:22:13,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873431314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:13,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:13,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:13,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264274527] [2022-12-13 02:22:13,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:13,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:13,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:13,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:13,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:13,679 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:13,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:13,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:13,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:13,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:13,746 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:13,746 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:13,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:13,747 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:13,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:13,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:13,748 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:13,748 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:13,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:13,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:13,750 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:13,750 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:13,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:13,750 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,751 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:13,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:13,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:13,756 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:13,756 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:22:13,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:13,757 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:13,757 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:13,844 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:13,844 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:13,844 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:13,844 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 02:22:13,844 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:13,844 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:13,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1823 [2022-12-13 02:22:13,845 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:22:13,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash 779159703, now seen corresponding path program 1 times [2022-12-13 02:22:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:13,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653530956] [2022-12-13 02:22:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:13,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:13,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:22:13,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:13,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653530956] [2022-12-13 02:22:13,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653530956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:13,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:13,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:13,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266457525] [2022-12-13 02:22:13,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:13,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:13,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:13,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:13,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:13,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:13,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:13,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:13,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:13,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:13,962 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:13,962 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:13,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:13,963 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:13,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:13,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:13,964 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:13,964 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:13,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:13,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:13,967 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,967 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:13,967 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:13,967 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:13,967 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,967 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:13,967 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:13,967 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:13,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:13,973 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:13,973 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:13,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:13,973 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:13,974 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:14,060 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:14,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:14,061 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:14,061 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 02:22:14,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:14,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:14,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1824 [2022-12-13 02:22:14,061 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:22:14,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:14,061 INFO L85 PathProgramCache]: Analyzing trace with hash 807788854, now seen corresponding path program 1 times [2022-12-13 02:22:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:14,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419150107] [2022-12-13 02:22:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:14,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:22:14,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:14,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419150107] [2022-12-13 02:22:14,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419150107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:14,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:14,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:14,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875415640] [2022-12-13 02:22:14,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:14,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:14,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:14,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:14,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:14,112 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:14,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:14,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:14,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:14,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:14,188 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:14,189 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:14,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:14,190 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:14,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:14,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:14,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:14,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:14,190 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:14,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:14,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:14,193 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:14,193 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:14,193 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:14,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:14,193 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:14,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:14,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:14,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:14,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:14,208 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:14,208 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:22:14,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:14,208 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:14,208 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:14,296 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:14,296 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:22:14,296 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:14,296 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 02:22:14,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:14,296 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:14,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1825 [2022-12-13 02:22:14,296 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:22:14,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash 836418005, now seen corresponding path program 1 times [2022-12-13 02:22:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:14,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129117939] [2022-12-13 02:22:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:14,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:22:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:14,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129117939] [2022-12-13 02:22:14,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129117939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:14,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:14,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314217036] [2022-12-13 02:22:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:14,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:14,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:14,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:14,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:14,347 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:14,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:14,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:14,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:14,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:14,422 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:14,422 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:14,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:14,423 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:14,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:14,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:14,424 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:14,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:14,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:14,426 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:14,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:14,426 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:14,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:14,426 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:14,427 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:14,427 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:14,427 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:14,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:14,432 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:14,432 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:14,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:14,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:14,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:14,520 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:14,520 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:14,520 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:14,520 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 02:22:14,520 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:14,520 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:14,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1826 [2022-12-13 02:22:14,520 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:22:14,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash 865047156, now seen corresponding path program 1 times [2022-12-13 02:22:14,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:14,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022938107] [2022-12-13 02:22:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:14,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:14,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:22:14,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:14,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022938107] [2022-12-13 02:22:14,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022938107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:14,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:14,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:14,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080346057] [2022-12-13 02:22:14,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:14,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:14,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:14,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:14,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:14,573 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:14,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:14,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:14,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:14,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:14,649 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:14,649 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:14,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:14,650 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:14,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:14,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:14,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:14,650 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:14,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:14,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:14,653 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:14,653 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:14,653 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:14,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:14,653 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:14,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:14,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:14,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:14,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:14,659 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:14,659 INFO L131 PetriNetUnfolder]: For 435/453 co-relation queries the response was YES. [2022-12-13 02:22:14,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/453 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:14,659 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:14,659 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:14,747 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:14,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:14,747 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:14,747 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 02:22:14,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:14,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:14,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1827 [2022-12-13 02:22:14,748 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:22:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash 893676307, now seen corresponding path program 1 times [2022-12-13 02:22:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:14,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890935930] [2022-12-13 02:22:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:14,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:14,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:22:14,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:14,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890935930] [2022-12-13 02:22:14,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890935930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:14,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:14,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:14,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684662167] [2022-12-13 02:22:14,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:14,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:14,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:14,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:14,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:14,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:14,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:14,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:14,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:14,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:14,861 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:14,862 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:14,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:14,863 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:14,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:14,863 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:14,863 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:14,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:14,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:14,866 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:14,866 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:14,866 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:14,866 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:14,866 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:14,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:14,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:14,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:14,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:14,872 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:14,872 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:14,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:14,872 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:14,872 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:14,959 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:14,960 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:14,960 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:14,960 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 02:22:14,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:14,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:14,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1828 [2022-12-13 02:22:14,960 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:22:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:14,960 INFO L85 PathProgramCache]: Analyzing trace with hash 922305458, now seen corresponding path program 1 times [2022-12-13 02:22:14,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:14,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369239970] [2022-12-13 02:22:14,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:14,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:15,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:22:15,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:15,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369239970] [2022-12-13 02:22:15,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369239970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:15,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:15,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:15,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851124922] [2022-12-13 02:22:15,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:15,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:15,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:15,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:15,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:15,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:15,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:15,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:15,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:15,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:15,077 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:15,078 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:15,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:15,079 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:15,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:15,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:15,079 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:15,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:15,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:15,082 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:15,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:15,082 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:15,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:15,082 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:15,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:15,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:15,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:15,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:15,088 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:15,088 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:15,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:15,088 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:15,088 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:15,175 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:15,176 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:15,176 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:15,176 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 02:22:15,176 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:15,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:15,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1829 [2022-12-13 02:22:15,176 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:22:15,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash 950934609, now seen corresponding path program 1 times [2022-12-13 02:22:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:15,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423019619] [2022-12-13 02:22:15,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:15,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:22:15,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:15,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423019619] [2022-12-13 02:22:15,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423019619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:15,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:15,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:15,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430387288] [2022-12-13 02:22:15,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:15,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:15,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:15,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:15,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:15,237 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:15,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:15,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:15,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:15,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:15,312 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:15,312 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:15,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:15,313 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:15,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:15,314 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:15,314 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:15,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:15,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:15,316 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:15,316 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:15,316 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:15,316 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:15,317 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:15,317 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:15,317 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:15,317 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:15,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:15,322 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:15,322 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:15,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:15,323 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:15,323 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:15,411 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:15,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:15,411 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:15,411 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 02:22:15,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:15,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:15,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1830 [2022-12-13 02:22:15,411 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:22:15,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash 979563760, now seen corresponding path program 1 times [2022-12-13 02:22:15,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:15,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707450808] [2022-12-13 02:22:15,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:15,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22: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:22:15,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:15,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707450808] [2022-12-13 02:22:15,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707450808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:15,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:15,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:15,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763844147] [2022-12-13 02:22:15,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:15,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:15,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:15,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:15,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:15,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:15,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:15,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:15,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:15,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:15,557 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:15,557 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:15,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:15,558 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:15,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:15,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:15,559 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:15,559 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:15,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:15,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:15,561 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:15,562 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:15,562 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:15,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:15,562 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:15,562 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:15,562 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:15,562 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:15,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:15,568 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:15,568 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:22:15,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:15,568 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:15,568 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:15,656 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:15,656 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:15,657 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:15,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:15,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:15,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:15,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1831 [2022-12-13 02:22:15,657 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:22:15,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:15,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1008192911, now seen corresponding path program 1 times [2022-12-13 02:22:15,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:15,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911854367] [2022-12-13 02:22:15,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:15,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:15,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:22:15,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:15,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911854367] [2022-12-13 02:22:15,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911854367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:15,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:15,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374218152] [2022-12-13 02:22:15,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:15,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:15,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:15,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:15,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:15,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:15,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:15,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:15,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:15,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:15,785 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:15,785 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:15,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:15,786 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:15,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:15,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:15,787 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:15,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:15,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:15,789 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:15,789 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:15,789 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:15,789 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:15,789 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:15,790 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:15,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:15,790 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:15,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:15,795 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:15,795 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:15,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:15,796 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:15,796 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:15,883 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:15,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:15,883 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:15,883 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 02:22:15,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:15,883 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:15,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1832 [2022-12-13 02:22:15,883 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:22:15,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:15,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1036822062, now seen corresponding path program 1 times [2022-12-13 02:22:15,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:15,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253839475] [2022-12-13 02:22:15,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:15,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:22:15,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:15,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253839475] [2022-12-13 02:22:15,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253839475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:15,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:15,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:15,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980055520] [2022-12-13 02:22:15,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:15,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:15,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:15,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:15,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:15,934 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:15,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:15,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:15,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:15,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:16,011 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:16,011 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:16,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:16,012 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:16,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:16,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:16,012 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:16,012 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:16,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:16,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:16,015 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,015 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:16,015 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:16,015 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:16,015 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,015 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:16,015 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:16,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:16,021 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:16,021 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:16,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:16,022 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:16,022 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:16,109 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:16,109 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:16,109 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:16,109 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 02:22:16,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:16,109 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:16,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1833 [2022-12-13 02:22:16,110 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:22:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1065451213, now seen corresponding path program 1 times [2022-12-13 02:22:16,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:16,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145603574] [2022-12-13 02:22:16,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:16,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:16,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 02:22:16,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:16,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145603574] [2022-12-13 02:22:16,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145603574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:16,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:16,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:16,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196190106] [2022-12-13 02:22:16,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:16,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:16,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:16,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:16,177 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:16,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:16,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:16,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:16,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:16,262 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:16,262 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:16,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:16,263 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:16,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:16,263 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:16,263 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:16,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:16,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:16,266 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,266 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:16,266 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:16,266 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:16,266 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,267 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:16,267 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:16,267 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:16,272 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:16,272 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:16,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:16,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:16,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:16,359 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:16,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:16,360 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:16,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:16,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:16,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:16,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1834 [2022-12-13 02:22:16,360 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:22:16,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:16,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1094080364, now seen corresponding path program 1 times [2022-12-13 02:22:16,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:16,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514635010] [2022-12-13 02:22:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:16,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:22:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:16,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514635010] [2022-12-13 02:22:16,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514635010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:16,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:16,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:16,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955496467] [2022-12-13 02:22:16,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:16,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:16,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:16,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:16,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:16,413 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:16,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:16,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:16,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:16,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:16,489 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:16,490 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:16,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:16,491 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:16,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:16,491 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:16,491 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:16,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:16,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:16,494 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,494 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:16,494 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:16,494 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:16,494 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,494 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:16,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:16,495 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:16,500 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:16,500 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:16,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:16,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:16,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:16,588 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:16,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:16,589 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:16,589 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 02:22:16,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:16,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:16,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1835 [2022-12-13 02:22:16,589 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:22:16,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:16,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1122709515, now seen corresponding path program 1 times [2022-12-13 02:22:16,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:16,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745377675] [2022-12-13 02:22:16,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:16,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22: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:22:16,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:16,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745377675] [2022-12-13 02:22:16,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745377675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:16,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:16,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:16,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77412058] [2022-12-13 02:22:16,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:16,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:16,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:16,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:16,656 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:16,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:16,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:16,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:16,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:16,740 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:16,740 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:16,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:16,741 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:16,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:16,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:16,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:16,742 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:16,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:16,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:16,744 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,745 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:16,745 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:16,745 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:16,745 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,745 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:16,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:16,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:16,751 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:16,751 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:16,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:16,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:16,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:16,838 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:16,839 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:16,839 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:16,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:16,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:16,839 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:16,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1836 [2022-12-13 02:22:16,839 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:22:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:16,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1151338666, now seen corresponding path program 1 times [2022-12-13 02:22:16,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:16,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051753745] [2022-12-13 02:22:16,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:16,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:16,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:22:16,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:16,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051753745] [2022-12-13 02:22:16,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051753745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:16,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:16,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:16,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949274692] [2022-12-13 02:22:16,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:16,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:16,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:16,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:16,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:16,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:16,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:16,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:16,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:16,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:16,966 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:16,967 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:16,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:16,968 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:16,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:16,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:16,968 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:16,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:16,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:16,971 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:16,971 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:16,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:16,971 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:16,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:16,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:16,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:16,977 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:16,977 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:16,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:16,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:16,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:17,064 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:17,065 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:17,065 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:17,065 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 02:22:17,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:17,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:17,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1837 [2022-12-13 02:22:17,065 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:22:17,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:17,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1179967817, now seen corresponding path program 1 times [2022-12-13 02:22:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:17,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065800848] [2022-12-13 02:22:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:17,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:22:17,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:17,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065800848] [2022-12-13 02:22:17,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065800848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:17,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:17,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:17,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928095629] [2022-12-13 02:22:17,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:17,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:17,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:17,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:17,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:17,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:17,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:17,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:17,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:17,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:17,194 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:17,194 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:17,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:17,195 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:17,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:17,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:17,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:17,196 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:17,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:17,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:17,198 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:17,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:17,198 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:17,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:17,199 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:17,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:17,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:17,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:17,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:17,204 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:17,204 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:22:17,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:17,205 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:17,205 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:17,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:17,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:17,292 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:17,292 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 02:22:17,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:17,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:17,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1838 [2022-12-13 02:22:17,292 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:22:17,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1208596968, now seen corresponding path program 1 times [2022-12-13 02:22:17,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:17,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367799222] [2022-12-13 02:22:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:17,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:22:17,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:17,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367799222] [2022-12-13 02:22:17,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367799222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:17,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:17,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500616251] [2022-12-13 02:22:17,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:17,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:17,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:17,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:17,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:17,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:17,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:17,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:17,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:17,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:17,452 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:17,452 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:17,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:17,453 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:17,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:17,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:17,454 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:17,454 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:17,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:17,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:17,456 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:17,456 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:17,456 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:17,457 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:17,457 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:17,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:17,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:17,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:17,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:17,462 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:17,462 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:17,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:17,463 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:17,463 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:17,551 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:17,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:17,552 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:17,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:17,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:17,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:17,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1839 [2022-12-13 02:22:17,552 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:22:17,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:17,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1237226119, now seen corresponding path program 1 times [2022-12-13 02:22:17,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:17,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744491777] [2022-12-13 02:22:17,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:17,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:17,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:22:17,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:17,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744491777] [2022-12-13 02:22:17,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744491777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:17,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:17,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:17,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884996133] [2022-12-13 02:22:17,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:17,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:17,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:17,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:17,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:17,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:17,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:17,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:17,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:17,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:17,703 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:17,703 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:17,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:17,704 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:17,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:17,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:17,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:17,705 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:17,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:17,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:17,708 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:17,708 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:17,708 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:17,708 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:17,708 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:17,708 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:17,708 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:17,708 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:17,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:17,714 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:17,714 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:17,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:17,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:17,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:17,802 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:17,803 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:17,803 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:17,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:17,803 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:17,803 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:17,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1840 [2022-12-13 02:22:17,803 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:22:17,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:17,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1265855270, now seen corresponding path program 1 times [2022-12-13 02:22:17,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:17,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376596045] [2022-12-13 02:22:17,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:17,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:17,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:22:17,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:17,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376596045] [2022-12-13 02:22:17,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376596045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:17,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:17,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:17,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127436721] [2022-12-13 02:22:17,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:17,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:17,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:17,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:17,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:17,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:17,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:17,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:17,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:17,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:17,928 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:17,929 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:17,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:17,930 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:17,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:17,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:17,930 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:17,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:17,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:17,933 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:17,933 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:17,933 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:17,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:17,933 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:17,933 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:17,933 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:17,933 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:17,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:17,939 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:17,939 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:17,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:17,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:17,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:18,027 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:18,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:18,028 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:18,028 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 02:22:18,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:18,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:18,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1841 [2022-12-13 02:22:18,028 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:22:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1294484421, now seen corresponding path program 1 times [2022-12-13 02:22:18,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:18,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484816984] [2022-12-13 02:22:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:18,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:18,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:22:18,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484816984] [2022-12-13 02:22:18,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484816984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:18,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:18,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:18,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763812608] [2022-12-13 02:22:18,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:18,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:18,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:18,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:18,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:18,080 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:18,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:18,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:18,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:18,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:18,146 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:18,147 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:18,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:18,148 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:18,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:18,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:18,148 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:18,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:18,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:18,151 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:18,151 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:18,151 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:18,151 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:18,151 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:18,151 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:18,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:18,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:18,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:18,157 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:18,157 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:18,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:18,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:18,158 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:18,246 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:18,246 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:18,246 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:18,246 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 02:22:18,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:18,246 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:18,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1842 [2022-12-13 02:22:18,246 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:22:18,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1323113572, now seen corresponding path program 1 times [2022-12-13 02:22:18,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:18,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901899140] [2022-12-13 02:22:18,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:18,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:18,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:22:18,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:18,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901899140] [2022-12-13 02:22:18,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901899140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:18,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:18,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:18,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785610397] [2022-12-13 02:22:18,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:18,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:18,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:18,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:18,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:18,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:18,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:18,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:18,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:18,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:18,382 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:18,382 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:18,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1129 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:18,383 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:18,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:18,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:18,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:18,384 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:18,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:18,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:18,386 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:18,386 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:18,386 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:18,386 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:18,386 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:18,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:18,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:18,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:18,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:18,392 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:18,392 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:22:18,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:18,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:18,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:18,478 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:18,479 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:18,479 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:18,479 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 02:22:18,479 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:18,479 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:18,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1843 [2022-12-13 02:22:18,479 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:22:18,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1351742723, now seen corresponding path program 1 times [2022-12-13 02:22:18,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:18,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374608699] [2022-12-13 02:22:18,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:18,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:18,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:22:18,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:18,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374608699] [2022-12-13 02:22:18,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374608699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:18,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:18,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:18,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839861014] [2022-12-13 02:22:18,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:18,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:18,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:18,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:18,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:18,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:18,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:18,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:18,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:18,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:18,591 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:18,591 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:18,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:18,592 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:18,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:18,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:18,593 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:18,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:18,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:18,595 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:18,595 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:18,595 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:18,596 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:18,596 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:18,596 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:18,596 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:18,596 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:18,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:18,601 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:18,601 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:18,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:18,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:18,602 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:18,688 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:18,688 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:22:18,688 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:18,688 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 02:22:18,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:18,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:18,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1844 [2022-12-13 02:22:18,689 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:22:18,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:18,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1380371874, now seen corresponding path program 1 times [2022-12-13 02:22:18,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:18,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094756183] [2022-12-13 02:22:18,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:18,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:18,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:22:18,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:18,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094756183] [2022-12-13 02:22:18,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094756183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:18,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:18,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222527827] [2022-12-13 02:22:18,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:18,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:18,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:18,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:18,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:18,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:18,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:18,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:18,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:18,805 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:18,806 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:18,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:18,807 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:18,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:18,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:18,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:18,807 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:18,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:18,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:18,810 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:18,810 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:18,810 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:18,810 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:18,810 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:18,810 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:18,810 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:18,810 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:18,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:18,816 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:18,816 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:18,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:18,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:18,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:18,902 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:18,902 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:22:18,902 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:18,902 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 02:22:18,902 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:18,902 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:18,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1845 [2022-12-13 02:22:18,902 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:22:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:18,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1409001025, now seen corresponding path program 1 times [2022-12-13 02:22:18,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:18,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998646668] [2022-12-13 02:22:18,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:18,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:18,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:22:18,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:18,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998646668] [2022-12-13 02:22:18,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998646668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:18,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:18,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:18,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576115672] [2022-12-13 02:22:18,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:18,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:18,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:18,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:18,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:18,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:18,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:18,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:18,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:18,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:19,027 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:19,027 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:19,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:19,028 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:19,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:19,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:19,028 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:19,028 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:19,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:19,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:19,031 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,031 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:19,031 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:19,031 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:19,031 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,032 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:19,032 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:19,032 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:19,037 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:19,037 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:22:19,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:19,038 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:19,038 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:19,124 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:19,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:19,125 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:19,125 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 02:22:19,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:19,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:19,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1846 [2022-12-13 02:22:19,125 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:22:19,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:19,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1437630176, now seen corresponding path program 1 times [2022-12-13 02:22:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:19,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870496751] [2022-12-13 02:22:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:19,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:19,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:22:19,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:19,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870496751] [2022-12-13 02:22:19,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870496751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:19,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:19,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:19,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241381811] [2022-12-13 02:22:19,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:19,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:19,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:19,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:19,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:19,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:19,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:19,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:19,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:19,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:19,248 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:19,248 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:19,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:19,250 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:19,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:19,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:19,250 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:19,250 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:19,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:19,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:19,253 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,253 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:19,253 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:19,253 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:19,253 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,253 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:19,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:19,253 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:19,259 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:19,259 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:22:19,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:19,259 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:19,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:19,346 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:19,346 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:19,346 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:19,346 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 02:22:19,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:19,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:19,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1847 [2022-12-13 02:22:19,347 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:22:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1466259327, now seen corresponding path program 1 times [2022-12-13 02:22:19,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:19,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254495821] [2022-12-13 02:22:19,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:19,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:19,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:22:19,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:19,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254495821] [2022-12-13 02:22:19,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254495821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:19,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:19,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:19,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620205817] [2022-12-13 02:22:19,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:19,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:19,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:19,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:19,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:19,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:19,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:19,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:19,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:19,478 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:19,479 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:19,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:19,480 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:19,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:19,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:19,480 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:19,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:19,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:19,483 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,483 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:19,483 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:19,483 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:19,483 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,483 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:19,483 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:19,483 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:19,489 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:19,489 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:19,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:19,489 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:19,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:19,576 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:19,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:19,576 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:19,576 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 02:22:19,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:19,577 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:19,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1848 [2022-12-13 02:22:19,577 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:22:19,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:19,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1494888478, now seen corresponding path program 1 times [2022-12-13 02:22:19,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:19,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331871125] [2022-12-13 02:22:19,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:19,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:19,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:22:19,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:19,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331871125] [2022-12-13 02:22:19,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331871125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:19,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:19,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:19,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671372853] [2022-12-13 02:22:19,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:19,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:19,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:19,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:19,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:19,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:19,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:19,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:19,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:19,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:19,696 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:19,697 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:19,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:19,698 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:19,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:19,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:19,698 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:19,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:19,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:19,701 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,701 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:19,701 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:19,701 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:19,701 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,701 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:19,701 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:19,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:19,707 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:19,707 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:19,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:19,708 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:19,708 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:19,794 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:19,795 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:19,795 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:19,795 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 02:22:19,795 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:19,795 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:19,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1849 [2022-12-13 02:22:19,795 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:22:19,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:19,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1523517629, now seen corresponding path program 1 times [2022-12-13 02:22:19,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:19,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430310838] [2022-12-13 02:22:19,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:19,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:19,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:22:19,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:19,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430310838] [2022-12-13 02:22:19,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430310838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:19,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:19,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086752598] [2022-12-13 02:22:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:19,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:19,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:19,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:19,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:19,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:19,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:19,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:19,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:19,924 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:19,925 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:19,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:19,926 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:19,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:19,926 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:19,926 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:19,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:19,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:19,929 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,929 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:19,929 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:19,929 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:19,929 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,929 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:19,929 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:19,929 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:19,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:19,935 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:19,935 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:19,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:19,936 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:19,936 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:20,023 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:20,023 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:20,023 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:20,023 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 02:22:20,023 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:20,023 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:20,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1850 [2022-12-13 02:22:20,023 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:22:20,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:20,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1552146780, now seen corresponding path program 1 times [2022-12-13 02:22:20,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:20,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292720269] [2022-12-13 02:22:20,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:20,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:20,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:22:20,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:20,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292720269] [2022-12-13 02:22:20,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292720269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:20,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:20,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:20,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391026598] [2022-12-13 02:22:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:20,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:20,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:20,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:20,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:20,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:20,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:20,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:20,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:20,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:20,150 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:20,151 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:20,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:20,152 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:20,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:20,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:20,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:20,152 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:20,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:20,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:20,155 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:20,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:20,155 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:20,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:20,155 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:20,155 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:20,156 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:20,156 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:20,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:20,161 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:20,161 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:20,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:20,162 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:20,162 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:20,249 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:20,249 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:20,249 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:20,249 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 02:22:20,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:20,250 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:20,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1851 [2022-12-13 02:22:20,250 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:22:20,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:20,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1580775931, now seen corresponding path program 1 times [2022-12-13 02:22:20,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:20,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689219116] [2022-12-13 02:22:20,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:20,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:20,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:22:20,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:20,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689219116] [2022-12-13 02:22:20,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689219116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:20,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:20,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753782144] [2022-12-13 02:22:20,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:20,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:20,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:20,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:20,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:20,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:20,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:20,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:20,374 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:20,374 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:20,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:20,375 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:20,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:20,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:20,376 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:20,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:20,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:20,378 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:20,378 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:20,379 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:20,379 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:20,379 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:20,379 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:20,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:20,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:20,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:20,385 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:20,385 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:20,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:20,385 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:20,385 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:20,474 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:20,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:20,474 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:20,474 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 02:22:20,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:20,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:20,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1852 [2022-12-13 02:22:20,475 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:22:20,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:20,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1609405082, now seen corresponding path program 1 times [2022-12-13 02:22:20,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:20,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967705599] [2022-12-13 02:22:20,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:20,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:20,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:22:20,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:20,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967705599] [2022-12-13 02:22:20,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967705599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:20,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:20,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:20,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59158443] [2022-12-13 02:22:20,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:20,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:20,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:20,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:20,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:20,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:20,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:20,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:20,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:20,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:20,628 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:20,628 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:20,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:20,629 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:20,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:20,630 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:20,630 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:20,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:20,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:20,632 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:20,632 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:20,633 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:20,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:20,633 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:20,633 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:20,633 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:20,633 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:20,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:20,638 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:20,639 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:20,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:20,639 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:20,639 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:20,727 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:20,727 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:20,727 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:20,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:20,728 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:20,728 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:20,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1853 [2022-12-13 02:22:20,728 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:22:20,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1638034233, now seen corresponding path program 1 times [2022-12-13 02:22:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:20,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10542933] [2022-12-13 02:22:20,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:20,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:20,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:22:20,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:20,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10542933] [2022-12-13 02:22:20,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10542933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:20,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:20,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135560064] [2022-12-13 02:22:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:20,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:20,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:20,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:20,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:20,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:20,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:20,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:20,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:20,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:20,845 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:20,845 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:20,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:20,846 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:20,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:20,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:20,847 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:20,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:20,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:20,849 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:20,849 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:20,849 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:20,849 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:20,850 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:20,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:20,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:20,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:20,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:20,855 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:20,855 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:22:20,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:20,856 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:20,856 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:20,943 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:20,944 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:20,944 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:20,944 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 02:22:20,944 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:20,944 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:20,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1854 [2022-12-13 02:22:20,944 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:22:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:20,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1666663384, now seen corresponding path program 1 times [2022-12-13 02:22:20,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:20,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773446560] [2022-12-13 02:22:20,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:20,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:20,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:22:20,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:20,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773446560] [2022-12-13 02:22:20,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773446560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:20,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:20,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:20,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080439018] [2022-12-13 02:22:20,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:20,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:20,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:20,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:20,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:20,998 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:20,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:20,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:20,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:20,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:21,079 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:21,079 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:21,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:21,080 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:21,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:21,080 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:21,080 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:21,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:21,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:21,083 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,083 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:21,083 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:21,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:21,083 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,084 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:21,084 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:21,084 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:21,089 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:21,089 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:21,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:21,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:21,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:21,178 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:21,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:21,178 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:21,178 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 02:22:21,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:21,178 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:21,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1855 [2022-12-13 02:22:21,179 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:22:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:21,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1695292535, now seen corresponding path program 1 times [2022-12-13 02:22:21,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:21,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532696916] [2022-12-13 02:22:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:21,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:21,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:22:21,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:21,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532696916] [2022-12-13 02:22:21,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532696916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:21,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:21,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:21,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306201499] [2022-12-13 02:22:21,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:21,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:21,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:21,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:21,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:21,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:21,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:21,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:21,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:21,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:21,307 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:21,307 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:21,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:21,309 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:21,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:21,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:21,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:21,309 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:21,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:21,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:21,312 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,312 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:21,312 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:21,312 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:21,312 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,312 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:21,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:21,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:21,318 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:21,318 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:21,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:21,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:21,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:21,407 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:21,407 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:21,407 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:21,408 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 02:22:21,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:21,408 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:21,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1856 [2022-12-13 02:22:21,408 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:22:21,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:21,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1723921686, now seen corresponding path program 1 times [2022-12-13 02:22:21,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:21,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727489254] [2022-12-13 02:22:21,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:21,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:21,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:22:21,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:21,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727489254] [2022-12-13 02:22:21,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727489254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:21,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:21,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:21,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069529676] [2022-12-13 02:22:21,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:21,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:21,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:21,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:21,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:21,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:21,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:21,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:21,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:21,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:21,543 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:21,543 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:21,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:21,544 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:21,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:21,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:21,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:21,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:21,545 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:21,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:21,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:21,547 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,548 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:21,548 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:21,548 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:21,548 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,548 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:21,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:21,548 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:21,554 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:21,554 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:21,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:21,554 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:21,554 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:21,650 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:21,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:22:21,651 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:21,651 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 02:22:21,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:21,651 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:21,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1857 [2022-12-13 02:22:21,651 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:22:21,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:21,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1752550837, now seen corresponding path program 1 times [2022-12-13 02:22:21,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:21,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247557764] [2022-12-13 02:22:21,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:21,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:22:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:21,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247557764] [2022-12-13 02:22:21,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247557764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:21,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:21,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:21,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474459709] [2022-12-13 02:22:21,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:21,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:21,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:21,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:21,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:21,702 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:21,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:21,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:21,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:21,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:21,769 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:21,769 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:21,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:21,770 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:21,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:21,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:21,771 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:21,771 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:21,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:21,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:21,773 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:21,773 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:21,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:21,773 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:21,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:21,774 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:21,779 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:21,779 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:22:21,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:21,780 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:21,780 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:21,867 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:21,868 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:21,868 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:21,868 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 02:22:21,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:21,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:21,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1858 [2022-12-13 02:22:21,868 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:22:21,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:21,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1781179988, now seen corresponding path program 1 times [2022-12-13 02:22:21,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:21,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760790940] [2022-12-13 02:22:21,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:21,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:21,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:22:21,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:21,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760790940] [2022-12-13 02:22:21,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760790940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:21,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:21,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:21,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052099299] [2022-12-13 02:22:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:21,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:21,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:21,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:21,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:21,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:21,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:21,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:21,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:21,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:21,986 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:21,986 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:21,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:21,987 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:21,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:21,988 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:21,988 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:21,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:21,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:21,990 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,990 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:21,990 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:21,990 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:21,990 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,991 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:21,991 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:21,991 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:21,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:21,996 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:21,996 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:22:21,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:21,997 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:21,997 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:22,084 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:22,085 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:22,085 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:22,085 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 02:22:22,085 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:22,085 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:22,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1859 [2022-12-13 02:22:22,085 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:22:22,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1809809139, now seen corresponding path program 1 times [2022-12-13 02:22:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:22,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008544356] [2022-12-13 02:22:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:22,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:22:22,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:22,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008544356] [2022-12-13 02:22:22,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008544356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:22,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:22,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:22,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564155515] [2022-12-13 02:22:22,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:22,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:22,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:22,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:22,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:22,153 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:22,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:22,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:22,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:22,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:22,238 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:22,238 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:22,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:22,239 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:22,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:22,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:22,240 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:22,240 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:22,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:22,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:22,242 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:22,242 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:22,243 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:22,243 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:22,243 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:22,247 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:22,247 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:22,247 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:22,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:22,254 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:22,255 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:22:22,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:22,255 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:22,256 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:22,350 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:22,350 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:22:22,350 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:22,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:22,350 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:22,351 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:22,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1860 [2022-12-13 02:22:22,351 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:22:22,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:22,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1838438290, now seen corresponding path program 1 times [2022-12-13 02:22:22,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:22,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308708266] [2022-12-13 02:22:22,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:22,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:22,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:22:22,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:22,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308708266] [2022-12-13 02:22:22,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308708266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:22,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:22,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:22,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116579819] [2022-12-13 02:22:22,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:22,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:22,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:22,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:22,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:22,403 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:22,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:22,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:22,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:22,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:22,490 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:22,490 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:22,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:22,491 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:22,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:22,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:22,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:22,492 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:22,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:22,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:22,494 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:22,494 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:22,494 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:22,494 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:22,494 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:22,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:22,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:22,495 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:22,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:22,500 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:22,500 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:22,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:22,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:22,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:22,589 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:22,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:22,590 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:22,590 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 02:22:22,590 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:22,590 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:22,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1861 [2022-12-13 02:22:22,590 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:22:22,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1867067441, now seen corresponding path program 1 times [2022-12-13 02:22:22,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:22,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657916405] [2022-12-13 02:22:22,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:22,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:22:22,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:22,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657916405] [2022-12-13 02:22:22,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657916405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:22,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:22,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:22,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380052245] [2022-12-13 02:22:22,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:22,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:22,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:22,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:22,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:22,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:22,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:22,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:22,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:22,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:22,744 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:22,744 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:22,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:22,745 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:22,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:22,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:22,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:22,746 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:22,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:22,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:22,748 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:22,748 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:22,749 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:22,749 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:22,749 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:22,749 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:22,749 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:22,749 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:22,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:22,755 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:22,755 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:22,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:22,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:22,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:22,842 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:22,843 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:22,843 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:22,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:22,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:22,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:22,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1862 [2022-12-13 02:22:22,843 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:22:22,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:22,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1895696592, now seen corresponding path program 1 times [2022-12-13 02:22:22,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:22,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821614185] [2022-12-13 02:22:22,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:22,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:22,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:22:22,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:22,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821614185] [2022-12-13 02:22:22,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821614185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:22,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:22,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:22,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542426125] [2022-12-13 02:22:22,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:22,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:22,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:22,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:22,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:22,910 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:22,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:22,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:22,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:22,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:22,988 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:22,988 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:22,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:22,989 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:22,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:22,990 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:22,990 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:22,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:22,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:22,992 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:22,992 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:22,992 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:22,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:22,992 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:22,993 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:22,993 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:22,993 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:22,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:22,998 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:22,998 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:22,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:22,999 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:22,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:23,086 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:23,086 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:23,086 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:23,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:23,086 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:23,086 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:23,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1863 [2022-12-13 02:22:23,086 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:22:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:23,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1924325743, now seen corresponding path program 1 times [2022-12-13 02:22:23,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:23,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429951078] [2022-12-13 02:22:23,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:23,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:23,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:22:23,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:23,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429951078] [2022-12-13 02:22:23,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429951078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:23,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:23,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:23,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641053734] [2022-12-13 02:22:23,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:23,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:23,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:23,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:23,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:23,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:23,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:23,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:23,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:23,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:23,206 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:23,206 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:23,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:23,207 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:23,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:23,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:23,208 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:23,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:23,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:23,210 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:23,210 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:23,210 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:23,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:23,210 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:23,211 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:23,211 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:23,211 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:23,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:23,216 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:23,216 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:23,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:23,217 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:23,217 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:23,305 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:23,305 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:23,305 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:23,305 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 02:22:23,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:23,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:23,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1864 [2022-12-13 02:22:23,306 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:22:23,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1952954894, now seen corresponding path program 1 times [2022-12-13 02:22:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:23,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510426336] [2022-12-13 02:22:23,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:23,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:23,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:22:23,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:23,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510426336] [2022-12-13 02:22:23,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510426336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:23,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:23,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:23,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445844882] [2022-12-13 02:22:23,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:23,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:23,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:23,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:23,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:23,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:23,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:23,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:23,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:23,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:23,424 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:23,424 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:23,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:23,425 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:23,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:23,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:23,426 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:23,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:23,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:23,428 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:23,428 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:23,428 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:23,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:23,428 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:23,429 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:23,429 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:23,429 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:23,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:23,442 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:23,443 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:23,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:23,443 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:23,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:23,530 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:23,531 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:22:23,531 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:23,531 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 02:22:23,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:23,531 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:23,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1865 [2022-12-13 02:22:23,531 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:22:23,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:23,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1981584045, now seen corresponding path program 1 times [2022-12-13 02:22:23,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:23,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388217351] [2022-12-13 02:22:23,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:23,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:23,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:22:23,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:23,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388217351] [2022-12-13 02:22:23,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388217351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:23,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:23,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:23,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503466175] [2022-12-13 02:22:23,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:23,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:23,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:23,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:23,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:23,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:23,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:23,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:23,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:23,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:23,658 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:23,658 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:23,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:23,659 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:23,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:23,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:23,659 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:23,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:23,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:23,662 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:23,662 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:23,662 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:23,662 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:23,662 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:23,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:23,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:23,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:23,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:23,668 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:23,668 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:23,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:23,669 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:23,669 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:23,756 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:23,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:23,756 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:23,756 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 02:22:23,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:23,757 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:23,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1866 [2022-12-13 02:22:23,757 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:22:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2010213196, now seen corresponding path program 1 times [2022-12-13 02:22:23,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:23,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672304689] [2022-12-13 02:22:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:23,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:22:23,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:23,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672304689] [2022-12-13 02:22:23,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672304689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:23,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:23,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:23,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540738953] [2022-12-13 02:22:23,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:23,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:23,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:23,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:23,809 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:23,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:23,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:23,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:23,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:23,875 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:23,875 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:23,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:23,876 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:23,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:23,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:23,877 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:23,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:23,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:23,880 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:23,880 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:23,880 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:23,880 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:23,880 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:23,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:23,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:23,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:23,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:23,886 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:23,886 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:22:23,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:23,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:23,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:23,974 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:23,975 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:23,975 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:23,975 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 02:22:23,975 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:23,975 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:23,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1867 [2022-12-13 02:22:23,975 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:22:23,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:23,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2038842347, now seen corresponding path program 1 times [2022-12-13 02:22:23,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:23,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764061309] [2022-12-13 02:22:23,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:23,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22: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:22:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:24,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764061309] [2022-12-13 02:22:24,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764061309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:24,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:24,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:24,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796144914] [2022-12-13 02:22:24,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:24,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:24,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:24,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:24,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:24,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:24,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:24,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:24,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:24,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:24,100 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:24,100 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:24,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:24,101 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:24,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:24,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:24,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:24,102 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:24,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:24,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:24,104 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:24,104 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:24,104 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:24,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:24,105 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:24,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:24,105 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:24,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:24,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:24,110 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:24,110 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:22:24,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:24,111 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:24,111 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:24,197 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:24,197 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:22:24,198 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:24,198 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 02:22:24,198 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:24,198 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:24,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1868 [2022-12-13 02:22:24,198 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:22:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:24,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2067471498, now seen corresponding path program 1 times [2022-12-13 02:22:24,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:24,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812601577] [2022-12-13 02:22:24,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:24,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:24,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:22:24,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:24,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812601577] [2022-12-13 02:22:24,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812601577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:24,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:24,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:24,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657319988] [2022-12-13 02:22:24,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:24,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:24,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:24,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:24,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:24,250 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:24,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:24,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:24,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:24,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:24,314 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:24,315 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:24,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:24,316 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:24,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:24,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:24,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:24,316 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:24,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:24,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:24,319 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:24,319 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:24,319 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:24,319 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:24,319 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:24,319 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:24,320 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:24,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:24,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:24,325 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:24,325 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:24,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:24,326 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:24,326 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:24,414 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:24,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:24,414 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:24,414 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 02:22:24,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:24,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:24,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1869 [2022-12-13 02:22:24,414 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:22:24,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:24,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2096100649, now seen corresponding path program 1 times [2022-12-13 02:22:24,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:24,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954595003] [2022-12-13 02:22:24,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:24,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:24,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:22:24,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:24,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954595003] [2022-12-13 02:22:24,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954595003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:24,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:24,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:24,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100680428] [2022-12-13 02:22:24,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:24,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:24,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:24,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:24,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:24,474 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:24,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:24,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:24,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:24,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:24,538 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:24,538 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:24,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:24,539 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:24,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:24,540 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:24,540 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:24,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:24,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:24,543 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:24,543 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:24,543 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:24,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:24,543 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:24,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:24,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:24,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:24,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:24,549 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:24,549 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:24,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:24,549 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:24,549 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:24,647 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:24,648 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:22:24,648 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:24,648 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 02:22:24,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:24,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:24,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1870 [2022-12-13 02:22:24,648 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:22:24,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:24,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2124729800, now seen corresponding path program 1 times [2022-12-13 02:22:24,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:24,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169173565] [2022-12-13 02:22:24,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:24,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:24,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:22:24,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:24,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169173565] [2022-12-13 02:22:24,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169173565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:24,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:24,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:24,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978975783] [2022-12-13 02:22:24,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:24,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:24,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:24,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:24,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:24,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:24,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:24,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:24,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:24,797 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:24,797 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:24,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:24,798 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:24,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:24,799 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:24,799 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:24,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:24,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:24,801 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:24,801 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:24,801 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:24,801 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:24,801 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:24,802 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:24,802 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:24,802 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:24,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:24,807 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:24,807 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:24,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:24,808 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:24,808 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:24,894 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:24,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:24,894 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:24,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:24,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:24,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:24,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1871 [2022-12-13 02:22:24,895 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:22:24,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:24,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2141608345, now seen corresponding path program 1 times [2022-12-13 02:22:24,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:24,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10994554] [2022-12-13 02:22:24,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:24,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:24,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:22:24,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:24,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10994554] [2022-12-13 02:22:24,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10994554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:24,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:24,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:24,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585107274] [2022-12-13 02:22:24,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:24,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:24,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:24,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:24,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:24,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:24,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:24,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:24,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:24,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:25,031 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:25,031 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:25,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:25,032 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:25,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:25,032 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:25,032 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:25,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:25,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:25,035 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,035 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:25,035 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:25,035 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:25,035 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,036 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:25,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:25,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:25,041 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:25,041 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:25,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:25,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:25,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:25,130 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:25,130 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:25,130 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:25,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:25,130 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:25,130 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:25,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1872 [2022-12-13 02:22:25,130 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:22:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2112979194, now seen corresponding path program 1 times [2022-12-13 02:22:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:25,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509197140] [2022-12-13 02:22:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:22:25,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:25,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509197140] [2022-12-13 02:22:25,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509197140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:25,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:25,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:25,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267432457] [2022-12-13 02:22:25,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:25,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:25,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:25,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:25,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:25,182 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:25,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:25,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:25,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:25,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:25,247 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:25,247 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:25,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:25,248 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:25,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:25,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:25,249 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:25,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:25,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:25,251 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,251 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:25,251 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:25,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:25,252 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,252 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:25,252 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:25,252 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:25,257 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:25,257 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:25,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:25,258 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:25,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:25,345 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:25,346 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:25,346 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:25,346 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 02:22:25,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:25,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:25,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1873 [2022-12-13 02:22:25,346 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:22:25,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2084350043, now seen corresponding path program 1 times [2022-12-13 02:22:25,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:25,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711910630] [2022-12-13 02:22:25,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:25,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:25,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:22:25,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:25,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711910630] [2022-12-13 02:22:25,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711910630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:25,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:25,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:25,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178766549] [2022-12-13 02:22:25,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:25,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:25,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:25,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:25,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:25,396 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:25,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:25,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:25,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:25,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:25,481 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:25,481 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:25,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:25,482 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:25,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:25,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:25,483 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:25,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:25,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:25,485 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,485 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:25,485 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:25,485 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:25,485 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,485 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:25,485 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:25,486 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:25,491 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:25,491 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:25,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:25,492 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:25,492 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:25,579 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:25,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:25,579 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:25,579 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 02:22:25,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:25,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:25,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1874 [2022-12-13 02:22:25,579 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:22:25,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:25,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2055720892, now seen corresponding path program 1 times [2022-12-13 02:22:25,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:25,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543662889] [2022-12-13 02:22:25,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:25,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:25,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:22:25,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:25,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543662889] [2022-12-13 02:22:25,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543662889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:25,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:25,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:25,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971292588] [2022-12-13 02:22:25,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:25,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:25,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:25,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:25,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:25,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:25,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:25,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:25,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:25,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:25,696 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:25,696 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:25,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:25,697 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:25,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:25,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:25,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:25,698 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:25,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:25,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:25,700 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,700 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:25,700 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:25,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:25,700 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,701 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:25,701 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:25,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:25,706 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:25,706 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:25,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:25,707 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:25,707 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:25,795 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:25,796 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:25,796 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:25,796 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 02:22:25,796 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:25,796 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:25,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1875 [2022-12-13 02:22:25,796 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:22:25,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2027091741, now seen corresponding path program 1 times [2022-12-13 02:22:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:25,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604225415] [2022-12-13 02:22:25,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:25,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:25,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:22:25,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:25,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604225415] [2022-12-13 02:22:25,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604225415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:25,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:25,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:25,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709515497] [2022-12-13 02:22:25,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:25,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:25,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:25,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:25,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:25,846 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:25,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:25,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:25,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:25,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:25,912 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:25,913 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:25,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:25,914 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:25,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:25,914 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:25,914 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:25,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:25,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:25,917 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,917 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:25,917 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:25,917 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:25,917 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,917 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:25,918 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:25,918 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:25,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:25,924 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:25,924 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:25,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:25,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:25,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:26,015 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:26,016 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:22:26,016 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:26,016 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 02:22:26,016 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:26,016 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:26,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1876 [2022-12-13 02:22:26,016 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:22:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1998462590, now seen corresponding path program 1 times [2022-12-13 02:22:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:26,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342657031] [2022-12-13 02:22:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:26,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:22:26,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:26,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342657031] [2022-12-13 02:22:26,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342657031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:26,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:26,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:26,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776162753] [2022-12-13 02:22:26,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:26,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:26,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:26,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:26,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:26,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:26,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:26,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:26,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:26,145 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:26,146 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:26,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:26,147 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:26,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:26,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:26,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:26,147 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:26,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:26,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:26,150 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:26,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:26,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:26,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:26,150 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:26,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:26,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:26,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:26,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:26,156 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:26,156 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:26,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:26,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:26,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:26,244 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:26,244 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:26,244 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:26,244 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 02:22:26,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:26,244 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:26,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1877 [2022-12-13 02:22:26,245 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:22:26,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:26,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1969833439, now seen corresponding path program 1 times [2022-12-13 02:22:26,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:26,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295509672] [2022-12-13 02:22:26,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:26,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:26,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:22:26,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:26,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295509672] [2022-12-13 02:22:26,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295509672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:26,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:26,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:26,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205144552] [2022-12-13 02:22:26,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:26,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:26,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:26,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:26,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:26,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:26,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:26,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:26,362 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:26,362 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:26,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:26,363 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:26,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:26,364 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:26,364 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:26,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:26,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:26,367 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:26,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:26,367 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:26,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:26,367 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:26,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:26,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:26,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:26,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:26,373 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:26,373 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:22:26,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:26,373 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:26,374 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:26,461 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:26,461 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:26,461 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:26,462 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 02:22:26,462 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:26,462 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:26,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1878 [2022-12-13 02:22:26,462 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:22:26,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:26,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1941204288, now seen corresponding path program 1 times [2022-12-13 02:22:26,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:26,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242956162] [2022-12-13 02:22:26,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:26,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:26,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:22:26,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:26,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242956162] [2022-12-13 02:22:26,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242956162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:26,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:26,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252150280] [2022-12-13 02:22:26,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:26,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:26,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:26,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:26,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:26,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:26,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:26,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:26,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:26,588 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:26,588 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:26,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:26,589 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:26,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:26,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:26,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:26,590 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:26,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:26,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:26,593 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:26,593 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:26,593 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:26,593 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:26,593 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:26,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:26,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:26,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:26,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:26,599 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:26,599 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:22:26,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:26,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:26,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:26,687 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:26,687 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:26,687 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:26,687 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 02:22:26,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:26,687 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:26,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1879 [2022-12-13 02:22:26,688 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:22:26,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:26,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1912575137, now seen corresponding path program 1 times [2022-12-13 02:22:26,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:26,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317722061] [2022-12-13 02:22:26,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:26,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:26,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:22:26,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:26,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317722061] [2022-12-13 02:22:26,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317722061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:26,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:26,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:26,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588191358] [2022-12-13 02:22:26,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:26,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:26,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:26,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:26,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:26,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:26,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:26,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:26,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:26,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:26,814 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:26,814 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:26,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:26,815 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:26,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:26,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:26,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:26,816 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:26,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:26,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:26,818 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:26,818 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:26,818 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:26,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:26,818 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:26,819 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:26,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:26,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:26,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:26,824 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:26,824 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:22:26,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:26,825 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:26,825 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:26,911 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:26,911 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:26,911 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:26,911 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 02:22:26,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:26,911 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:26,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1880 [2022-12-13 02:22:26,911 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:22:26,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:26,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1883945986, now seen corresponding path program 1 times [2022-12-13 02:22:26,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:26,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318833009] [2022-12-13 02:22:26,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:26,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:26,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:22:26,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:26,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318833009] [2022-12-13 02:22:26,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318833009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:26,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:26,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:26,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299412482] [2022-12-13 02:22:26,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:26,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:26,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:26,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:26,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:26,963 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:26,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:26,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:26,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:26,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:27,037 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:27,037 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:27,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:27,038 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:27,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:27,039 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:27,039 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:27,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:27,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:27,042 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:27,042 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:27,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:27,042 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,042 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:27,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:27,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:27,048 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:27,048 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:27,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:27,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:27,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:27,136 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:27,136 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:27,136 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:27,136 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 02:22:27,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:27,136 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:27,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1881 [2022-12-13 02:22:27,136 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:22:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1855316835, now seen corresponding path program 1 times [2022-12-13 02:22:27,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:27,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171338150] [2022-12-13 02:22:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:27,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:27,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:22:27,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:27,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171338150] [2022-12-13 02:22:27,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171338150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:27,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:27,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:27,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309089693] [2022-12-13 02:22:27,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:27,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:27,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:27,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:27,203 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:27,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:27,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:27,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:27,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:27,277 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:27,277 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:27,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:27,278 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:27,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:27,279 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:27,279 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:27,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:27,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:27,281 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:27,282 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:27,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:27,282 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:27,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:27,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:27,287 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:27,288 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:27,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:27,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:27,288 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:27,374 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:27,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:27,375 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:27,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:27,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:27,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:27,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1882 [2022-12-13 02:22:27,375 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:22:27,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:27,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1826687684, now seen corresponding path program 1 times [2022-12-13 02:22:27,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:27,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506034890] [2022-12-13 02:22:27,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:27,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:27,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:22:27,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:27,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506034890] [2022-12-13 02:22:27,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506034890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:27,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:27,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:27,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58276263] [2022-12-13 02:22:27,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:27,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:27,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:27,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:27,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:27,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:27,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:27,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:27,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:27,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:27,513 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:27,514 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:27,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:27,515 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:27,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:27,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:27,515 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:27,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:27,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:27,518 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:27,518 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:27,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:27,518 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,518 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:27,518 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:27,518 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:27,524 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:27,524 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:22:27,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:27,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:27,525 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:27,612 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:27,612 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:27,612 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:27,612 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 02:22:27,612 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:27,612 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:27,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1883 [2022-12-13 02:22:27,612 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:22:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1798058533, now seen corresponding path program 1 times [2022-12-13 02:22:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:27,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852853820] [2022-12-13 02:22:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:27,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:27,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:22:27,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:27,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852853820] [2022-12-13 02:22:27,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852853820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:27,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:27,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:27,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13381286] [2022-12-13 02:22:27,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:27,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:27,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:27,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:27,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:27,665 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:27,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:27,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:27,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:27,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:27,730 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:27,731 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:27,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:27,732 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:27,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:27,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:27,732 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:27,732 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:27,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:27,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:27,735 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,735 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:27,735 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:27,735 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:27,735 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,735 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:27,736 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:27,736 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:27,741 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:27,741 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:27,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:27,742 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:27,742 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:27,836 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:27,837 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:22:27,837 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:27,837 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 02:22:27,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:27,837 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:27,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1884 [2022-12-13 02:22:27,837 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:22:27,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1769429382, now seen corresponding path program 1 times [2022-12-13 02:22:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:27,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355079169] [2022-12-13 02:22:27,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:27,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:27,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:22:27,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:27,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355079169] [2022-12-13 02:22:27,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355079169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:27,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:27,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:27,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76036185] [2022-12-13 02:22:27,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:27,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:27,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:27,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:27,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:27,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:27,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:27,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:27,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:27,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:27,972 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:27,973 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:27,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:27,974 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:27,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:27,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:27,974 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:27,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:27,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:27,977 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:27,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:27,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:27,977 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:27,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:27,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:27,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:27,983 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:27,983 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:27,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:27,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:27,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:28,071 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:28,072 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:28,072 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:28,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:28,072 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:28,072 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:28,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1885 [2022-12-13 02:22:28,072 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:22:28,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:28,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1740800231, now seen corresponding path program 1 times [2022-12-13 02:22:28,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:28,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630733082] [2022-12-13 02:22:28,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:28,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:28,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:22:28,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:28,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630733082] [2022-12-13 02:22:28,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630733082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:28,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:28,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:28,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153234756] [2022-12-13 02:22:28,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:28,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:28,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:28,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:28,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:28,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:28,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:28,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:28,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:28,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:28,190 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:28,191 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:28,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:28,192 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:28,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:28,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:28,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:28,192 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:28,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:28,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:28,195 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:28,195 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:28,195 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:28,195 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:28,195 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:28,195 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:28,195 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:28,195 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:28,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:28,201 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:28,201 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:28,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:28,202 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:28,202 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:28,289 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:28,289 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:28,289 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:28,290 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 02:22:28,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:28,290 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:28,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1886 [2022-12-13 02:22:28,290 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:22:28,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:28,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1712171080, now seen corresponding path program 1 times [2022-12-13 02:22:28,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:28,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904113844] [2022-12-13 02:22:28,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:28,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:28,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:22:28,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:28,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904113844] [2022-12-13 02:22:28,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904113844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:28,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:28,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:28,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690455058] [2022-12-13 02:22:28,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:28,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:28,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:28,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:28,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:28,341 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:28,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:28,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:28,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:28,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:28,407 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:28,407 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:28,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:28,408 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:28,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:28,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:28,409 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:28,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:28,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:28,411 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:28,411 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:28,412 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:28,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:28,412 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:28,412 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:28,412 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:28,412 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:28,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:28,417 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:28,418 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:28,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:28,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:28,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:28,507 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:28,508 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:28,508 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:28,508 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 02:22:28,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:28,508 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:28,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1887 [2022-12-13 02:22:28,508 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:22:28,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:28,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1683541929, now seen corresponding path program 1 times [2022-12-13 02:22:28,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:28,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164617299] [2022-12-13 02:22:28,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:28,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:28,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 02:22:28,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:28,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164617299] [2022-12-13 02:22:28,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164617299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:28,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:28,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:28,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930356479] [2022-12-13 02:22:28,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:28,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:28,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:28,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:28,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:28,568 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:28,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:28,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:28,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:28,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:28,636 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:28,636 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:28,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:28,637 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:28,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:28,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:28,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:28,638 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:28,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:28,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:28,640 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:28,640 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:28,641 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:28,641 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:28,641 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:28,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:28,641 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:28,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:28,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:28,646 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:28,647 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:28,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:28,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:28,647 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:28,735 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:28,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:28,735 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:28,735 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 02:22:28,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:28,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:28,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1888 [2022-12-13 02:22:28,735 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:22:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1654912778, now seen corresponding path program 1 times [2022-12-13 02:22:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:28,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095887202] [2022-12-13 02:22:28,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:28,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:28,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:22:28,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:28,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095887202] [2022-12-13 02:22:28,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095887202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:28,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:28,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:28,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723894354] [2022-12-13 02:22:28,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:28,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:28,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:28,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:28,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:28,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:28,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:28,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:28,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:28,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:28,854 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:28,855 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:28,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:28,856 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:28,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:28,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:28,856 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:28,856 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:28,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:28,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:28,859 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:28,859 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:28,859 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:28,859 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:28,860 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:28,860 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:28,860 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:28,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:28,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:28,865 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:28,865 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:28,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:28,866 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:28,866 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:28,952 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:28,953 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:28,953 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:28,953 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 02:22:28,953 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:28,953 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:28,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1889 [2022-12-13 02:22:28,953 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:22:28,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:28,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1626283627, now seen corresponding path program 1 times [2022-12-13 02:22:28,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:28,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760817270] [2022-12-13 02:22:28,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:28,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:29,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:22:29,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:29,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760817270] [2022-12-13 02:22:29,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760817270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:29,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:29,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:29,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523811872] [2022-12-13 02:22:29,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:29,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:29,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:29,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:29,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:29,004 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:29,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:29,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:29,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:29,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:29,082 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:29,082 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:29,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:29,083 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:29,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:29,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:29,084 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:29,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:29,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:29,086 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:29,086 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:29,086 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:29,086 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:29,086 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:29,087 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:29,087 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:29,087 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:29,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:29,092 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:29,092 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:22:29,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:29,093 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:29,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:29,178 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:29,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:29,179 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:29,179 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 02:22:29,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:29,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:29,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1890 [2022-12-13 02:22:29,179 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:22:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1597654476, now seen corresponding path program 1 times [2022-12-13 02:22:29,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:29,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509199433] [2022-12-13 02:22:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:29,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:29,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:22:29,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:29,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509199433] [2022-12-13 02:22:29,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509199433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:29,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:29,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:29,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472412710] [2022-12-13 02:22:29,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:29,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:29,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:29,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:29,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:29,230 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:29,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:29,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:29,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:29,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:29,306 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:29,306 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:29,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:29,307 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:29,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:29,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:29,308 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:29,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:29,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:29,310 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:29,310 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:29,310 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:29,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:29,310 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:29,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:29,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:29,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:29,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:29,316 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:29,316 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:29,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:29,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:29,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:29,404 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:29,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:29,405 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:29,405 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 02:22:29,405 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:29,405 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:29,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1891 [2022-12-13 02:22:29,405 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:22:29,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1569025325, now seen corresponding path program 1 times [2022-12-13 02:22:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:29,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966189069] [2022-12-13 02:22:29,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:29,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 02:22:29,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:29,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966189069] [2022-12-13 02:22:29,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966189069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:29,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:29,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:29,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744035648] [2022-12-13 02:22:29,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:29,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:29,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:29,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:29,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:29,455 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:29,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:29,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:29,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:29,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:29,530 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:29,530 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:29,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:29,531 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:29,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:29,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:29,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:29,532 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:29,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:29,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:29,534 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:29,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:29,534 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:29,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:29,534 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:29,535 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:29,535 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:29,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:29,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:29,540 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:29,540 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:29,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:29,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:29,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:29,631 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:29,631 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:22:29,631 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:29,631 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 02:22:29,631 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:29,631 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:29,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1892 [2022-12-13 02:22:29,632 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:22:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1540396174, now seen corresponding path program 1 times [2022-12-13 02:22:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:29,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831642803] [2022-12-13 02:22:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:29,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:22:29,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:29,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831642803] [2022-12-13 02:22:29,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831642803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:29,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:29,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:29,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226233343] [2022-12-13 02:22:29,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:29,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:29,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:29,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:29,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:29,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:29,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:29,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:29,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:29,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:29,761 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:29,761 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:29,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:29,762 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:29,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:29,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:29,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:29,763 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:29,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:29,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:29,765 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:29,765 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:29,765 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:29,765 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:29,765 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:29,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:29,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:29,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:29,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:29,771 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:29,771 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:29,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:29,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:29,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:29,859 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:29,860 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:29,860 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:29,860 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 02:22:29,860 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:29,860 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:29,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1893 [2022-12-13 02:22:29,860 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:22:29,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1511767023, now seen corresponding path program 1 times [2022-12-13 02:22:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:29,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126428342] [2022-12-13 02:22:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:29,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:22:29,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:29,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126428342] [2022-12-13 02:22:29,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126428342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:29,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:29,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:29,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757604177] [2022-12-13 02:22:29,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:29,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:29,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:29,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:29,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:29,909 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:29,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:29,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:29,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:29,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:30,001 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:30,001 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:30,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:30,002 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:30,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:30,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:30,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:30,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:30,003 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:30,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:30,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:30,006 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,006 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:30,006 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:30,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:30,006 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:30,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:30,006 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:30,012 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:30,012 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:30,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:30,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:30,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:30,100 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:30,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:30,100 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:30,100 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 02:22:30,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:30,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:30,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1894 [2022-12-13 02:22:30,100 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:22:30,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:30,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1483137872, now seen corresponding path program 1 times [2022-12-13 02:22:30,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:30,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183003876] [2022-12-13 02:22:30,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:30,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:30,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:22:30,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:30,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183003876] [2022-12-13 02:22:30,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183003876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:30,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:30,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:30,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960491315] [2022-12-13 02:22:30,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:30,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:30,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:30,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:30,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:30,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:30,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:30,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:30,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:30,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:30,230 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:30,230 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:30,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:30,231 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:30,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:30,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:30,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:30,232 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:30,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:30,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:30,234 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,234 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:30,234 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:30,234 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:30,234 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,235 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:30,235 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:30,235 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:30,240 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:30,240 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:30,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:30,241 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:30,241 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:30,328 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:30,328 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:30,328 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:30,328 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 02:22:30,328 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:30,328 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:30,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1895 [2022-12-13 02:22:30,329 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:22:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:30,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1454508721, now seen corresponding path program 1 times [2022-12-13 02:22:30,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:30,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506304647] [2022-12-13 02:22:30,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:30,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:30,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:22:30,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:30,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506304647] [2022-12-13 02:22:30,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506304647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:30,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:30,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:30,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35501722] [2022-12-13 02:22:30,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:30,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:30,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:30,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:30,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:30,381 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:30,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:30,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:30,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:30,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:30,447 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:30,447 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:30,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:30,448 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:30,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:30,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:30,449 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:30,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:30,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:30,451 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,451 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:30,452 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:30,452 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:30,452 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,452 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:30,452 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:30,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:30,458 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:30,458 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:30,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:30,458 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:30,458 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:30,546 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:30,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:30,547 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:30,547 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 02:22:30,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:30,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:30,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1896 [2022-12-13 02:22:30,547 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:22:30,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:30,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1425879570, now seen corresponding path program 1 times [2022-12-13 02:22:30,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:30,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453039567] [2022-12-13 02:22:30,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:30,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:30,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:22:30,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:30,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453039567] [2022-12-13 02:22:30,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453039567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:30,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:30,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:30,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645994492] [2022-12-13 02:22:30,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:30,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:30,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:30,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:30,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:30,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:30,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:30,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:30,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:30,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:30,674 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:30,675 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:30,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1089 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:30,676 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:30,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:30,676 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:30,676 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:30,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:30,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:30,679 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,679 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:30,679 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:30,679 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:30,679 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,679 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:30,679 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:30,679 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:30,685 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:30,685 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:22:30,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:30,686 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:30,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:30,773 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:30,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:30,774 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:30,774 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 02:22:30,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:30,774 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:30,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1897 [2022-12-13 02:22:30,774 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:22:30,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1397250419, now seen corresponding path program 1 times [2022-12-13 02:22:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:30,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41347133] [2022-12-13 02:22:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:30,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:22:30,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:30,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41347133] [2022-12-13 02:22:30,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41347133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:30,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:30,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:30,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929081012] [2022-12-13 02:22:30,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:30,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:30,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:30,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:30,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:30,826 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:30,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:30,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:30,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:30,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:30,903 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:30,903 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:30,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:30,904 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:30,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:30,905 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:30,905 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:30,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:30,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:30,907 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:30,908 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:30,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:30,908 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,908 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:30,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:30,908 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:30,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:30,913 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:30,914 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:22:30,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:30,914 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:30,914 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:31,002 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:31,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:31,003 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:31,003 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 02:22:31,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:31,003 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:31,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1898 [2022-12-13 02:22:31,003 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:22:31,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:31,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1368621268, now seen corresponding path program 1 times [2022-12-13 02:22:31,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:31,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357753123] [2022-12-13 02:22:31,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:31,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:31,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:22:31,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:31,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357753123] [2022-12-13 02:22:31,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357753123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:31,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:31,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965685080] [2022-12-13 02:22:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:31,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:31,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:31,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:31,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:31,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:31,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:31,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:31,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:31,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:31,124 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:31,125 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:31,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:31,126 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:31,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:31,126 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:31,126 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:31,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:31,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:31,129 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:31,129 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:31,129 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:31,129 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:31,129 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:31,129 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:31,129 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:31,129 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:31,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:31,135 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:31,135 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:22:31,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:31,136 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:31,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:31,224 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:31,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:31,225 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:31,225 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 02:22:31,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:31,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:31,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1899 [2022-12-13 02:22:31,225 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:22:31,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:31,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1339992117, now seen corresponding path program 1 times [2022-12-13 02:22:31,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:31,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163017819] [2022-12-13 02:22:31,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:31,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:31,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:22:31,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:31,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163017819] [2022-12-13 02:22:31,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163017819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:31,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:31,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:31,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306423281] [2022-12-13 02:22:31,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:31,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:31,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:31,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:31,275 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:31,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:31,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:31,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:31,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:31,351 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:31,352 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:31,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:31,353 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:31,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:31,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:31,353 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:31,353 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:31,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:31,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:31,356 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:31,356 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:31,356 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:31,356 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:31,356 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:31,356 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:31,356 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:31,356 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:31,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:31,362 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:31,362 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:31,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:31,363 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:31,363 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:31,452 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:31,452 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:31,452 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:31,452 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 02:22:31,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:31,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:31,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1900 [2022-12-13 02:22:31,452 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:22:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1311362966, now seen corresponding path program 1 times [2022-12-13 02:22:31,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:31,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004043680] [2022-12-13 02:22:31,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:31,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:31,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:22:31,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:31,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004043680] [2022-12-13 02:22:31,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004043680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:31,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:31,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:31,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718398197] [2022-12-13 02:22:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:31,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:31,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:31,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:31,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:31,504 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:31,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:31,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:31,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:31,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:31,580 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:31,580 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:31,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:31,581 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:31,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:31,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:31,581 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:31,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:31,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:31,584 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:31,584 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:31,584 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:31,584 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:31,584 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:31,584 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:31,584 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:31,584 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:31,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:31,590 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:31,590 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:31,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:31,590 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:31,590 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:31,679 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:31,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:31,679 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:31,679 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 02:22:31,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:31,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:31,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1901 [2022-12-13 02:22:31,679 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:22:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1282733815, now seen corresponding path program 1 times [2022-12-13 02:22:31,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:31,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887777930] [2022-12-13 02:22:31,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:31,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:31,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:22:31,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:31,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887777930] [2022-12-13 02:22:31,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887777930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:31,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:31,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:31,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338593983] [2022-12-13 02:22:31,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:31,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:31,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:31,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:31,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:31,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:31,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:31,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:31,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:31,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:31,803 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:31,804 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:31,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:31,805 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:31,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:31,805 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:31,805 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:31,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:31,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:31,808 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:31,808 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:31,808 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:31,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:31,808 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:31,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:31,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:31,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:31,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:31,814 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:31,814 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:31,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:31,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:31,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:31,903 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:31,903 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:31,903 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:31,903 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 02:22:31,903 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:31,903 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:31,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1902 [2022-12-13 02:22:31,904 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:22:31,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1254104664, now seen corresponding path program 1 times [2022-12-13 02:22:31,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:31,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666997672] [2022-12-13 02:22:31,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:31,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 02:22:31,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:31,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666997672] [2022-12-13 02:22:31,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666997672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:31,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:31,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:31,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858631972] [2022-12-13 02:22:31,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:31,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:31,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:31,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:31,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:31,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:31,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:31,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:31,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:31,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:32,022 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:32,022 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:32,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:32,023 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:32,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:32,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:32,024 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:32,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:32,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:32,026 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,026 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:32,026 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:32,026 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:32,026 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,026 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:32,027 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:32,027 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:32,032 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:32,032 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:22:32,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:32,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:32,033 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:32,121 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:32,121 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:32,122 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:32,122 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 02:22:32,122 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:32,122 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:32,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1903 [2022-12-13 02:22:32,122 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:22:32,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:32,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1225475513, now seen corresponding path program 1 times [2022-12-13 02:22:32,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:32,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039148099] [2022-12-13 02:22:32,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:32,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:32,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:22:32,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:32,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039148099] [2022-12-13 02:22:32,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039148099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:32,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:32,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:32,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865766635] [2022-12-13 02:22:32,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:32,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:32,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:32,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:32,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:32,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:32,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:32,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:32,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:32,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:32,241 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:32,241 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:32,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:32,242 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:32,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:32,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:32,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:32,243 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:32,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:32,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:32,245 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:32,245 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:32,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:32,245 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,246 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:32,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:32,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:32,251 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:32,251 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:32,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:32,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:32,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:32,343 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:32,343 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:22:32,344 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:32,344 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 02:22:32,344 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:32,344 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:32,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1904 [2022-12-13 02:22:32,344 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:22:32,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:32,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1196846362, now seen corresponding path program 1 times [2022-12-13 02:22:32,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:32,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972507956] [2022-12-13 02:22:32,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:32,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:32,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:22:32,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:32,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972507956] [2022-12-13 02:22:32,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972507956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:32,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:32,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:32,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095415979] [2022-12-13 02:22:32,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:32,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:32,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:32,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:32,413 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:32,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:32,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:32,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:32,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:32,497 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:32,497 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:32,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:32,499 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:32,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:32,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:32,499 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:32,499 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:32,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:32,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:32,502 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,502 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:32,502 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:32,502 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:32,502 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,502 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:32,502 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:32,502 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:32,508 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:32,508 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:22:32,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:32,509 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:32,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:32,596 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:32,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:32,597 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:32,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:32,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:32,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:32,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1905 [2022-12-13 02:22:32,597 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:22:32,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1168217211, now seen corresponding path program 1 times [2022-12-13 02:22:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:32,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975691224] [2022-12-13 02:22:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:32,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:32,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:22:32,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:32,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975691224] [2022-12-13 02:22:32,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975691224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:32,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:32,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:32,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42604810] [2022-12-13 02:22:32,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:32,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:32,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:32,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:32,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:32,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:32,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:32,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:32,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:32,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:32,748 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:32,748 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:32,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:32,750 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:32,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:32,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:32,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:32,750 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:32,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:32,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:32,753 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:32,753 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:32,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:32,753 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:32,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:32,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:32,759 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:32,759 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:32,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:32,759 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:32,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:32,847 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:32,848 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:32,848 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:32,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:32,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:32,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:32,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1906 [2022-12-13 02:22:32,848 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:22:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1139588060, now seen corresponding path program 1 times [2022-12-13 02:22:32,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:32,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002870057] [2022-12-13 02:22:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:32,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:22:32,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:32,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002870057] [2022-12-13 02:22:32,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002870057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:32,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:32,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:32,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109774630] [2022-12-13 02:22:32,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:32,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:32,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:32,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:32,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:32,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:32,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:32,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:32,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:32,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:32,967 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:32,968 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:32,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:32,969 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:32,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:32,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:32,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:32,969 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:32,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:32,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:32,972 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,972 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:32,972 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:32,972 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:32,972 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,972 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:32,972 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:32,972 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:32,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:32,978 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:32,978 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:32,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:32,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:32,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:33,067 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:33,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:33,068 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:33,068 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 02:22:33,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:33,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:33,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1907 [2022-12-13 02:22:33,068 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:22:33,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:33,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1110958909, now seen corresponding path program 1 times [2022-12-13 02:22:33,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:33,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847365729] [2022-12-13 02:22:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:33,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:33,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:22:33,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:33,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847365729] [2022-12-13 02:22:33,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847365729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:33,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:33,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:33,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822894538] [2022-12-13 02:22:33,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:33,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:33,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:33,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:33,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:33,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:33,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:33,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:33,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:33,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:33,184 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:33,185 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:33,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:33,186 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:33,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:33,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:33,186 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:33,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:33,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:33,189 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:33,189 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:33,189 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:33,189 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:33,189 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:33,189 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:33,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:33,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:33,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:33,195 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:33,195 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:33,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:33,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:33,196 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:33,284 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:33,285 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:33,285 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:33,285 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 02:22:33,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:33,285 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:33,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1908 [2022-12-13 02:22:33,285 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:22:33,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:33,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1082329758, now seen corresponding path program 1 times [2022-12-13 02:22:33,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:33,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248109114] [2022-12-13 02:22:33,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:33,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:33,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:22:33,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:33,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248109114] [2022-12-13 02:22:33,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248109114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:33,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:33,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:33,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123544882] [2022-12-13 02:22:33,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:33,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:33,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:33,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:33,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:33,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:33,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:33,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:33,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:33,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:33,411 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:33,411 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:33,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1095 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:33,412 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:33,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:33,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:33,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:33,412 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:33,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:33,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:33,415 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:33,415 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:33,415 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:33,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:33,415 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:33,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:33,416 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:33,416 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:33,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:33,421 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:33,421 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:22:33,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:33,422 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:33,422 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:33,509 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:33,509 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:33,509 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:33,509 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 02:22:33,509 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:33,509 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:33,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1909 [2022-12-13 02:22:33,509 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:22:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1053700607, now seen corresponding path program 1 times [2022-12-13 02:22:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:33,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454020443] [2022-12-13 02:22:33,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:33,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 02:22:33,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:33,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454020443] [2022-12-13 02:22:33,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454020443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:33,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:33,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:33,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490874215] [2022-12-13 02:22:33,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:33,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:33,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:33,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:33,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:33,577 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:33,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:33,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:33,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:33,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:33,654 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:33,654 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:33,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:33,655 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:33,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:33,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:33,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:33,656 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:33,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:33,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:33,658 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:33,658 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:33,658 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:33,658 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:33,658 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:33,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:33,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:33,659 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:33,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:33,664 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:33,664 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:33,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:33,665 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:33,665 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:33,753 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:33,753 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:33,753 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:33,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:33,753 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:33,753 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:33,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1910 [2022-12-13 02:22:33,754 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:22:33,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1025071456, now seen corresponding path program 1 times [2022-12-13 02:22:33,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:33,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674875647] [2022-12-13 02:22:33,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:33,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:33,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 02:22:33,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:33,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674875647] [2022-12-13 02:22:33,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674875647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:33,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:33,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790460817] [2022-12-13 02:22:33,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:33,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:33,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:33,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:33,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:33,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:33,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:33,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:33,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:33,872 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:33,873 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:33,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:33,874 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:33,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:33,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:33,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:33,874 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:33,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:33,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:33,877 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:33,877 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:33,877 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:33,877 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:33,877 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:33,877 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:33,878 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:33,878 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:33,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:33,883 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:33,883 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:33,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:33,884 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:33,884 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:33,972 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:33,972 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:33,972 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:33,972 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 02:22:33,973 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:33,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:33,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1911 [2022-12-13 02:22:33,973 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:22:33,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:33,973 INFO L85 PathProgramCache]: Analyzing trace with hash -996442305, now seen corresponding path program 1 times [2022-12-13 02:22:33,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:33,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513677189] [2022-12-13 02:22:33,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:33,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:34,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:22:34,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:34,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513677189] [2022-12-13 02:22:34,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513677189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:34,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:34,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:34,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143291363] [2022-12-13 02:22:34,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:34,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:34,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:34,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:34,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:34,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:34,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:34,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:34,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:34,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:34,092 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:34,092 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:34,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:34,093 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:34,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:34,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:34,094 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:34,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:34,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:34,096 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:34,096 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:34,096 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:34,096 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:34,096 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:34,097 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:34,097 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:34,097 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:34,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:34,102 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:34,102 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:34,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:34,103 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:34,103 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:34,191 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:34,192 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:34,192 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:34,192 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 02:22:34,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:34,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:34,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1912 [2022-12-13 02:22:34,192 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:22:34,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:34,192 INFO L85 PathProgramCache]: Analyzing trace with hash -967813154, now seen corresponding path program 1 times [2022-12-13 02:22:34,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:34,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235821471] [2022-12-13 02:22:34,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:34,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:34,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:22:34,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:34,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235821471] [2022-12-13 02:22:34,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235821471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:34,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:34,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867881657] [2022-12-13 02:22:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:34,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:34,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:34,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:34,259 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:34,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:34,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:34,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:34,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:34,334 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:34,334 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:34,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:34,335 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:34,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:34,336 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:34,336 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:34,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:34,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:34,338 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:34,338 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:34,339 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:34,339 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:34,339 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:34,339 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:34,339 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:34,339 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:34,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:34,345 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:34,345 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:34,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:34,345 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:34,345 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:34,432 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:34,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:34,433 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:34,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:34,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:34,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:34,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1913 [2022-12-13 02:22:34,433 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:22:34,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash -939184003, now seen corresponding path program 1 times [2022-12-13 02:22:34,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:34,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481988547] [2022-12-13 02:22:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:34,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:34,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:22:34,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:34,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481988547] [2022-12-13 02:22:34,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481988547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:34,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:34,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:34,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777294877] [2022-12-13 02:22:34,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:34,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:34,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:34,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:34,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:34,486 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:34,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:34,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:34,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:34,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:34,564 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:34,564 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:34,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:34,565 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:34,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:34,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:34,565 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:34,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:34,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:34,568 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:34,568 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:34,568 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:34,568 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:34,568 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:34,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:34,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:34,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:34,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:34,574 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:34,574 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:34,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:34,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:34,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:34,673 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:34,674 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:22:34,674 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:34,674 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 02:22:34,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:34,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:34,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1914 [2022-12-13 02:22:34,674 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:22:34,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash -910554852, now seen corresponding path program 1 times [2022-12-13 02:22:34,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:34,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991040032] [2022-12-13 02:22:34,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:34,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:34,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:22:34,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:34,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991040032] [2022-12-13 02:22:34,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991040032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:34,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:34,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:34,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728745869] [2022-12-13 02:22:34,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:34,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:34,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:34,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:34,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:34,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:34,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:34,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:34,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:34,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:34,794 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:34,795 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:34,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:34,796 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:34,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:34,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:34,796 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:34,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:34,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:34,799 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:34,799 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:34,799 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:34,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:34,799 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:34,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:34,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:34,799 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:34,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:34,805 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:34,805 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:34,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:34,805 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:34,805 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:34,894 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:34,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:34,894 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:34,894 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 02:22:34,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:34,894 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:34,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1915 [2022-12-13 02:22:34,895 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:22:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:34,895 INFO L85 PathProgramCache]: Analyzing trace with hash -881925701, now seen corresponding path program 1 times [2022-12-13 02:22:34,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:34,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224006125] [2022-12-13 02:22:34,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:34,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:34,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:22:34,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:34,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224006125] [2022-12-13 02:22:34,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224006125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:34,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:34,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:34,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707314213] [2022-12-13 02:22:34,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:34,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:34,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:34,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:34,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:34,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:34,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:34,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:34,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:34,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:35,012 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:35,012 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:35,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:35,014 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:35,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:35,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:35,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:35,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:35,014 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:35,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:35,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:35,017 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,017 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:35,017 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:35,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:35,017 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:35,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:35,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:35,023 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:35,023 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:35,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:35,023 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:35,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:35,113 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:35,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:35,113 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:35,113 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 02:22:35,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:35,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:35,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1916 [2022-12-13 02:22:35,114 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:22:35,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:35,114 INFO L85 PathProgramCache]: Analyzing trace with hash -853296550, now seen corresponding path program 1 times [2022-12-13 02:22:35,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:35,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686094509] [2022-12-13 02:22:35,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:35,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:35,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:22:35,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:35,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686094509] [2022-12-13 02:22:35,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686094509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:35,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:35,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:35,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447042870] [2022-12-13 02:22:35,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:35,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:35,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:35,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:35,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:35,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:35,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:35,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:35,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:35,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:35,232 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:35,232 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:35,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:35,233 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:35,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:35,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:35,234 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:35,234 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:35,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:35,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:35,237 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,237 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:35,237 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:35,237 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:35,237 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:35,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:35,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:35,243 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:35,243 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:22:35,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:35,244 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:35,244 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:35,331 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:35,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:35,332 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:35,332 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 02:22:35,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:35,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:35,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1917 [2022-12-13 02:22:35,332 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:22:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:35,332 INFO L85 PathProgramCache]: Analyzing trace with hash -824667399, now seen corresponding path program 1 times [2022-12-13 02:22:35,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:35,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897598397] [2022-12-13 02:22:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:35,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:35,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:22:35,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:35,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897598397] [2022-12-13 02:22:35,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897598397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:35,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:35,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:35,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370901878] [2022-12-13 02:22:35,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:35,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:35,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:35,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:35,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:35,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:35,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:35,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:35,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:35,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:35,462 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:35,462 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:35,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:35,463 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:35,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:35,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:35,464 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:35,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:35,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:35,466 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,467 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:35,467 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:35,467 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:35,467 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,467 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:35,467 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:35,467 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:35,473 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:35,473 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:35,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:35,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:35,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:35,561 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:35,562 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:35,562 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:35,562 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 02:22:35,562 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:35,562 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:35,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1918 [2022-12-13 02:22:35,562 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:22:35,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash -796038248, now seen corresponding path program 1 times [2022-12-13 02:22:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:35,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243192045] [2022-12-13 02:22:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:35,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:35,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:22:35,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:35,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243192045] [2022-12-13 02:22:35,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243192045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:35,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:35,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:35,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496990634] [2022-12-13 02:22:35,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:35,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:35,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:35,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:35,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:35,644 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:35,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:35,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:35,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:35,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:35,722 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:35,722 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:35,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:35,724 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:35,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:35,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:35,724 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:35,724 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:35,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:35,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:35,727 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,727 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:35,727 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:35,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:35,727 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:35,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:35,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:35,733 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:35,733 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:22:35,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:35,734 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:35,734 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:35,822 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:35,822 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:35,823 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:35,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:35,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:35,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:35,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1919 [2022-12-13 02:22:35,823 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:22:35,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:35,823 INFO L85 PathProgramCache]: Analyzing trace with hash -767409097, now seen corresponding path program 1 times [2022-12-13 02:22:35,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:35,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839397561] [2022-12-13 02:22:35,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:35,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:35,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:22:35,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:35,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839397561] [2022-12-13 02:22:35,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839397561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:35,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:35,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:35,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850021203] [2022-12-13 02:22:35,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:35,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:35,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:35,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:35,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:35,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:35,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:35,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:35,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:35,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:35,970 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:35,970 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:35,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:35,971 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:35,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:35,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:35,971 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:35,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:35,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:35,974 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:35,974 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:35,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:35,974 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,974 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:35,974 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:35,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:35,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:35,980 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:35,980 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:22:35,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:35,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:35,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:36,068 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:36,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:36,069 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:36,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:36,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:36,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:36,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1920 [2022-12-13 02:22:36,069 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:22:36,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:36,069 INFO L85 PathProgramCache]: Analyzing trace with hash -738779946, now seen corresponding path program 1 times [2022-12-13 02:22:36,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:36,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79612690] [2022-12-13 02:22:36,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:36,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:36,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 02:22:36,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:36,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79612690] [2022-12-13 02:22:36,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79612690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:36,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:36,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:36,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118576922] [2022-12-13 02:22:36,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:36,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:36,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:36,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:36,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:36,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:36,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:36,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:36,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:36,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:36,198 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:36,198 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:36,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:36,199 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:36,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:36,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:36,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:36,200 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:36,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:36,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:36,202 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:36,202 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:36,202 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:36,202 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:36,202 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:36,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:36,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:36,203 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:36,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:36,210 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:36,210 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:36,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:36,210 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:36,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:36,300 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:36,300 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:22:36,300 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:36,300 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 02:22:36,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:36,301 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:36,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1921 [2022-12-13 02:22:36,301 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:22:36,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash -710150795, now seen corresponding path program 1 times [2022-12-13 02:22:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:36,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027518373] [2022-12-13 02:22:36,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:36,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:36,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:22:36,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:36,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027518373] [2022-12-13 02:22:36,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027518373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:36,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:36,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:36,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879708994] [2022-12-13 02:22:36,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:36,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:36,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:36,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:36,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:36,351 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:36,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:36,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:36,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:36,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:36,427 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:36,427 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:36,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:36,428 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:36,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:36,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:36,429 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:36,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:36,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:36,431 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:36,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:36,432 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:36,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:36,432 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:36,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:36,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:36,432 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:36,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:36,438 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:36,438 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:36,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:36,438 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:36,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:36,527 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:36,527 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:36,527 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:36,527 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 02:22:36,527 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:36,527 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:36,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1922 [2022-12-13 02:22:36,527 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:22:36,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:36,528 INFO L85 PathProgramCache]: Analyzing trace with hash -681521644, now seen corresponding path program 1 times [2022-12-13 02:22:36,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:36,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699155243] [2022-12-13 02:22:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:36,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:36,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:22:36,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:36,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699155243] [2022-12-13 02:22:36,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699155243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:36,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:36,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:36,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760511537] [2022-12-13 02:22:36,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:36,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:36,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:36,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:36,595 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:36,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:36,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:36,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:36,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:36,675 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:36,675 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:36,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:36,676 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:36,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:36,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:36,677 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:36,677 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:36,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:36,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:36,679 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:36,680 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:36,680 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:36,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:36,680 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:36,680 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:36,680 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:36,680 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:36,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:36,686 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:36,686 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:36,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:36,686 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:36,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:36,774 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:36,775 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:36,775 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:36,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:36,775 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:36,775 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:36,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1923 [2022-12-13 02:22:36,775 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:22:36,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash -652892493, now seen corresponding path program 1 times [2022-12-13 02:22:36,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:36,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094945893] [2022-12-13 02:22:36,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:36,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:36,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:22:36,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:36,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094945893] [2022-12-13 02:22:36,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094945893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:36,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:36,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:36,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984824970] [2022-12-13 02:22:36,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:36,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:36,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:36,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:36,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:36,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:36,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:36,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:36,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:36,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:36,902 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:36,902 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:36,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:36,903 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:36,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:36,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:36,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:36,903 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:36,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:36,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:36,906 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:36,906 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:36,906 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:36,906 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:36,906 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:36,906 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:36,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:36,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:36,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:36,912 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:36,912 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:36,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:36,913 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:36,913 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:37,000 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:37,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:37,001 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:37,001 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 02:22:37,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:37,001 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:37,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1924 [2022-12-13 02:22:37,001 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:22:37,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash -624263342, now seen corresponding path program 1 times [2022-12-13 02:22:37,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:37,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566890730] [2022-12-13 02:22:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:37,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:37,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:22:37,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:37,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566890730] [2022-12-13 02:22:37,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566890730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:37,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:37,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:37,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563244491] [2022-12-13 02:22:37,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:37,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:37,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:37,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:37,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:37,054 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:37,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:37,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:37,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:37,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:37,131 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:37,131 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:37,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:37,132 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:37,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:37,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:37,133 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:37,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:37,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:37,135 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:37,135 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:37,135 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:37,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:37,135 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:37,136 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:37,136 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:37,136 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:37,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:37,141 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:37,141 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:37,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:37,142 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:37,142 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:37,233 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:37,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:22:37,233 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:37,233 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 02:22:37,233 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:37,234 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:37,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1925 [2022-12-13 02:22:37,234 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:22:37,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:37,234 INFO L85 PathProgramCache]: Analyzing trace with hash -595634191, now seen corresponding path program 1 times [2022-12-13 02:22:37,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:37,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181163515] [2022-12-13 02:22:37,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:37,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:37,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:22:37,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:37,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181163515] [2022-12-13 02:22:37,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181163515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:37,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:37,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:37,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425238649] [2022-12-13 02:22:37,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:37,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:37,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:37,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:37,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:37,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:37,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:37,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:37,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:37,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:37,351 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:37,351 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:37,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:37,352 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:37,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:37,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:37,352 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:37,353 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:37,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:37,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:37,355 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:37,355 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:37,355 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:37,355 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:37,355 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:37,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:37,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:37,356 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:37,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:37,361 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:37,361 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:37,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:37,362 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:37,362 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:37,450 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:37,450 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:37,450 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:37,450 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 02:22:37,450 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:37,450 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:37,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1926 [2022-12-13 02:22:37,451 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:22:37,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:37,451 INFO L85 PathProgramCache]: Analyzing trace with hash -567005040, now seen corresponding path program 1 times [2022-12-13 02:22:37,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:37,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240804689] [2022-12-13 02:22:37,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:37,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:37,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:22:37,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:37,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240804689] [2022-12-13 02:22:37,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240804689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:37,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:37,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:37,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759056833] [2022-12-13 02:22:37,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:37,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:37,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:37,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:37,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:37,503 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:37,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:37,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:37,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:37,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:37,569 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:37,569 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:37,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:37,570 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:37,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:37,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:37,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:37,571 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:37,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:37,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:37,573 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:37,573 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:37,573 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:37,573 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:37,573 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:37,574 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:37,574 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:37,574 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:37,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:37,579 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:37,579 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:37,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:37,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:37,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:37,667 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:37,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:37,667 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:37,668 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 02:22:37,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:37,668 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:37,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1927 [2022-12-13 02:22:37,668 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:22:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:37,668 INFO L85 PathProgramCache]: Analyzing trace with hash -538375889, now seen corresponding path program 1 times [2022-12-13 02:22:37,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:37,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489357027] [2022-12-13 02:22:37,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:37,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:37,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:22:37,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:37,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489357027] [2022-12-13 02:22:37,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489357027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:37,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:37,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:37,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069880591] [2022-12-13 02:22:37,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:37,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:37,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:37,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:37,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:37,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:37,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:37,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:37,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:37,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:37,804 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:37,804 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:37,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:37,805 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:37,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:37,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:37,806 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:37,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:37,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:37,809 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:37,809 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:37,809 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:37,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:37,809 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:37,809 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:37,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:37,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:37,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:37,815 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:37,815 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:37,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:37,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:37,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:37,903 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:37,904 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:37,904 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:37,904 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 02:22:37,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:37,904 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:37,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1928 [2022-12-13 02:22:37,904 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:22:37,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:37,904 INFO L85 PathProgramCache]: Analyzing trace with hash -509746738, now seen corresponding path program 1 times [2022-12-13 02:22:37,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:37,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312803863] [2022-12-13 02:22:37,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:37,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:37,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 02:22:37,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:37,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312803863] [2022-12-13 02:22:37,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312803863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:37,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:37,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:37,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145720834] [2022-12-13 02:22:37,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:37,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:37,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:37,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:37,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:37,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:37,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:37,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:37,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:37,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:38,021 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:38,021 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:38,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:38,022 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:38,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:38,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:38,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:38,023 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:38,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:38,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:38,025 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,025 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:38,026 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:38,026 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:38,026 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,026 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:38,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:38,026 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:38,031 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:38,032 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:38,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:38,032 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:38,032 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:38,120 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:38,120 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:38,120 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:38,120 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 02:22:38,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:38,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:38,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1929 [2022-12-13 02:22:38,120 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:22:38,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:38,121 INFO L85 PathProgramCache]: Analyzing trace with hash -481117587, now seen corresponding path program 1 times [2022-12-13 02:22:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:38,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427462527] [2022-12-13 02:22:38,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:38,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:38,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:22:38,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:38,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427462527] [2022-12-13 02:22:38,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427462527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:38,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:38,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:38,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614588470] [2022-12-13 02:22:38,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:38,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:38,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:38,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:38,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:38,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:38,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:38,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:38,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:38,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:38,236 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:38,236 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:38,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:38,237 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:38,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:38,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:38,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:38,238 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:38,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:38,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:38,240 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,240 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:38,240 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:38,240 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:38,241 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,241 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:38,241 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:38,241 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:38,246 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:38,246 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:38,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:38,247 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:38,247 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:38,334 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:38,334 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:38,334 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:38,334 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 02:22:38,334 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:38,334 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:38,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1930 [2022-12-13 02:22:38,334 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:22:38,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:38,335 INFO L85 PathProgramCache]: Analyzing trace with hash -452488436, now seen corresponding path program 1 times [2022-12-13 02:22:38,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:38,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165758038] [2022-12-13 02:22:38,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:38,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:38,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:22:38,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:38,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165758038] [2022-12-13 02:22:38,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165758038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:38,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:38,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:38,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714446395] [2022-12-13 02:22:38,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:38,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:38,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:38,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:38,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:38,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:38,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:38,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:38,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:38,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:38,468 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:38,468 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:38,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:38,469 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:38,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:38,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:38,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:38,469 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:38,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:38,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:38,472 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,472 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:38,472 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:38,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:38,472 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:38,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:38,473 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:38,478 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:38,478 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:22:38,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:38,479 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:38,479 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:38,565 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:38,566 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:38,566 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:38,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:38,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:38,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:38,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1931 [2022-12-13 02:22:38,566 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:22:38,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:38,566 INFO L85 PathProgramCache]: Analyzing trace with hash -423859285, now seen corresponding path program 1 times [2022-12-13 02:22:38,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:38,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7545273] [2022-12-13 02:22:38,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:38,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:22:38,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:38,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7545273] [2022-12-13 02:22:38,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7545273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:38,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:38,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:38,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563319932] [2022-12-13 02:22:38,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:38,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:38,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:38,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:38,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:38,618 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:38,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:38,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:38,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:38,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:38,692 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:38,692 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:38,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:38,693 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:38,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:38,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:38,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:38,694 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:38,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:38,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:38,696 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,696 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:38,697 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:38,697 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:38,697 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,697 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:38,697 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:38,697 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:38,702 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:38,703 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:38,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:38,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:38,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:38,790 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:38,790 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:38,790 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:38,790 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 02:22:38,790 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:38,790 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:38,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1932 [2022-12-13 02:22:38,790 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:22:38,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash -395230134, now seen corresponding path program 1 times [2022-12-13 02:22:38,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:38,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305185443] [2022-12-13 02:22:38,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:38,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22: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:22:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:38,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305185443] [2022-12-13 02:22:38,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305185443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:38,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:38,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:38,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007566658] [2022-12-13 02:22:38,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:38,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:38,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:38,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:38,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:38,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:38,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:38,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:38,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:38,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:38,920 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:38,920 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:38,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:38,921 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:38,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:38,921 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:38,921 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:38,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:38,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:38,924 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:38,924 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:38,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:38,924 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,924 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:38,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:38,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:38,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:38,930 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:38,930 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:38,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:38,931 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:38,931 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:39,018 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:39,019 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:39,019 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:39,019 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 02:22:39,019 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:39,019 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:39,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1933 [2022-12-13 02:22:39,019 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:22:39,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:39,019 INFO L85 PathProgramCache]: Analyzing trace with hash -366600983, now seen corresponding path program 1 times [2022-12-13 02:22:39,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:39,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033651404] [2022-12-13 02:22:39,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:39,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:22:39,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:39,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033651404] [2022-12-13 02:22:39,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033651404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:39,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:39,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:39,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583268738] [2022-12-13 02:22:39,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:39,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:39,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:39,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:39,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:39,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:39,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:39,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:39,137 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:39,137 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:39,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:39,138 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:39,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:39,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:39,139 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:39,139 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:39,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:39,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:39,141 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:39,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:39,142 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:39,142 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:39,142 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:39,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:39,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:39,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:39,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:39,148 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:39,148 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:39,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:39,148 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:39,148 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:39,236 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:39,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:39,237 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:39,237 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 02:22:39,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:39,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:39,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1934 [2022-12-13 02:22:39,237 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:22:39,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash -337971832, now seen corresponding path program 1 times [2022-12-13 02:22:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:39,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110867788] [2022-12-13 02:22:39,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:39,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:39,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:22:39,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:39,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110867788] [2022-12-13 02:22:39,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110867788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:39,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:39,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:39,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354765192] [2022-12-13 02:22:39,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:39,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:39,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:39,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:39,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:39,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:39,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:39,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:39,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:39,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:39,383 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:39,383 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:39,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:39,384 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:39,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:39,385 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:39,385 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:39,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:39,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:39,387 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:39,387 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:39,387 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:39,387 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:39,387 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:39,388 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:39,388 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:39,388 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:39,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:39,393 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:39,393 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:39,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:39,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:39,394 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:39,481 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:39,482 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:39,482 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:39,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:39,482 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:39,482 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:39,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1935 [2022-12-13 02:22:39,482 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:22:39,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:39,482 INFO L85 PathProgramCache]: Analyzing trace with hash -309342681, now seen corresponding path program 1 times [2022-12-13 02:22:39,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:39,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565888433] [2022-12-13 02:22:39,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:39,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:39,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:22:39,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:39,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565888433] [2022-12-13 02:22:39,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565888433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:39,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:39,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:39,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238747758] [2022-12-13 02:22:39,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:39,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:39,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:39,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:39,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:39,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:39,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:39,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:39,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:39,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:39,599 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:39,599 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:39,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:39,601 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:39,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:39,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:39,601 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:39,601 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:39,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:39,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:39,604 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:39,604 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:39,604 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:39,604 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:39,604 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:39,604 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:39,604 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:39,604 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:39,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:39,610 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:39,610 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:22:39,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:39,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:39,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:39,698 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:39,698 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:39,698 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:39,698 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 02:22:39,698 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:39,698 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:39,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1936 [2022-12-13 02:22:39,699 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:22:39,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:39,699 INFO L85 PathProgramCache]: Analyzing trace with hash -280713530, now seen corresponding path program 1 times [2022-12-13 02:22:39,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:39,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479770490] [2022-12-13 02:22:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:39,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:22:39,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:39,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479770490] [2022-12-13 02:22:39,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479770490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:39,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:39,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:39,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954531265] [2022-12-13 02:22:39,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:39,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:39,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:39,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:39,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:39,757 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:39,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:39,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:39,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:39,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:39,823 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:39,823 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:39,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:39,824 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:39,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:39,824 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:39,824 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:39,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:39,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:39,827 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:39,827 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:39,827 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:39,827 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:39,827 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:39,828 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:39,828 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:39,828 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:39,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:39,833 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:39,833 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:39,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:39,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:39,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:39,921 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:39,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:39,922 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:39,922 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 02:22:39,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:39,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:39,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1937 [2022-12-13 02:22:39,922 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:22:39,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:39,922 INFO L85 PathProgramCache]: Analyzing trace with hash -252084379, now seen corresponding path program 1 times [2022-12-13 02:22:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:39,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929846589] [2022-12-13 02:22:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:39,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:22:39,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:39,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929846589] [2022-12-13 02:22:39,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929846589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:39,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:39,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074456830] [2022-12-13 02:22:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:39,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:39,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:39,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:39,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:39,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:39,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:39,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:39,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:40,043 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:40,043 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:40,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:40,044 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:40,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:40,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:40,045 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:40,045 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:40,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:40,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:40,047 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:40,048 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:40,048 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:40,048 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,048 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:40,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:40,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:40,054 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:40,054 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:22:40,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:40,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:40,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:40,142 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:40,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:40,142 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:40,142 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 02:22:40,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:40,142 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:40,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1938 [2022-12-13 02:22:40,143 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:22:40,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash -223455228, now seen corresponding path program 1 times [2022-12-13 02:22:40,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:40,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148231103] [2022-12-13 02:22:40,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:40,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:40,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:22:40,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:40,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148231103] [2022-12-13 02:22:40,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148231103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:40,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:40,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:40,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369800695] [2022-12-13 02:22:40,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:40,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:40,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:40,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:40,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:40,195 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:40,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:40,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:40,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:40,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:40,261 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:40,261 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:40,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:40,262 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:40,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:40,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:40,263 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:40,263 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:40,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:40,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:40,265 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,266 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:40,266 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:40,266 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:40,266 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,266 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:40,266 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:40,266 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:40,272 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:40,272 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:22:40,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:40,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:40,272 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:40,360 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:40,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:40,360 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:40,360 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 02:22:40,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:40,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:40,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1939 [2022-12-13 02:22:40,360 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:22:40,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:40,361 INFO L85 PathProgramCache]: Analyzing trace with hash -194826077, now seen corresponding path program 1 times [2022-12-13 02:22:40,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:40,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740002666] [2022-12-13 02:22:40,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:40,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:22:40,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:40,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740002666] [2022-12-13 02:22:40,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740002666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:40,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:40,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:40,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729843332] [2022-12-13 02:22:40,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:40,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:40,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:40,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:40,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:40,412 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:40,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:40,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:40,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:40,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:40,479 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:40,479 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:40,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:40,480 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:40,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:40,481 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:40,481 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:40,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:40,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:40,483 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,483 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:40,483 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:40,483 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:40,484 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,484 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:40,484 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:40,484 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:40,489 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:40,489 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:40,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:40,490 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:40,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:40,577 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:40,578 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:40,578 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:40,578 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 02:22:40,578 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:40,578 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:40,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1940 [2022-12-13 02:22:40,578 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:22:40,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:40,578 INFO L85 PathProgramCache]: Analyzing trace with hash -166196926, now seen corresponding path program 1 times [2022-12-13 02:22:40,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:40,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813083626] [2022-12-13 02:22:40,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:40,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:40,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:22:40,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:40,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813083626] [2022-12-13 02:22:40,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813083626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:40,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:40,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:40,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655471008] [2022-12-13 02:22:40,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:40,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:40,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:40,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:40,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:40,631 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:40,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:40,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:40,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:40,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:40,706 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:40,706 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:40,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:40,707 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:40,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:40,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:40,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:40,708 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:40,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:40,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:40,710 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,710 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:40,710 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:40,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:40,711 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,711 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:40,711 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:40,711 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:40,716 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:40,716 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:40,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:40,717 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:40,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:40,805 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:40,805 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:40,805 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:40,805 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 02:22:40,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:40,806 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:40,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1941 [2022-12-13 02:22:40,806 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:22:40,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:40,806 INFO L85 PathProgramCache]: Analyzing trace with hash -137567775, now seen corresponding path program 1 times [2022-12-13 02:22:40,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:40,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951412403] [2022-12-13 02:22:40,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:40,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:40,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:22:40,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:40,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951412403] [2022-12-13 02:22:40,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951412403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:40,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:40,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:40,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664549274] [2022-12-13 02:22:40,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:40,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:40,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:40,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:40,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:40,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:40,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:40,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:40,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:40,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:40,926 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:40,926 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:40,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:40,927 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:40,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:40,927 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:40,927 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:40,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:40,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:40,930 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:40,930 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:40,930 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:40,930 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:40,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:40,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:40,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:40,936 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:40,936 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:40,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:40,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:40,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:41,025 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:41,026 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:41,026 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:41,026 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 02:22:41,026 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:41,026 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:41,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1942 [2022-12-13 02:22:41,026 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:22:41,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash -108938624, now seen corresponding path program 1 times [2022-12-13 02:22:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:41,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657484650] [2022-12-13 02:22:41,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:41,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:41,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:22:41,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:41,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657484650] [2022-12-13 02:22:41,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657484650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:41,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:41,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:41,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699683621] [2022-12-13 02:22:41,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:41,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:41,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:41,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:41,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:41,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:41,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:41,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:41,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:41,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:41,155 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:41,155 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:41,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:41,156 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:41,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:41,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:41,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:41,157 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:41,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:41,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:41,160 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:41,160 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:41,160 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:41,160 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:41,160 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:41,160 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:41,160 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:41,160 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:41,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:41,166 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:41,166 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:41,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:41,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:41,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:41,254 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:41,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:41,255 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:41,255 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 02:22:41,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:41,255 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:41,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1943 [2022-12-13 02:22:41,255 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:22:41,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:41,255 INFO L85 PathProgramCache]: Analyzing trace with hash -80309473, now seen corresponding path program 1 times [2022-12-13 02:22:41,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:41,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752153742] [2022-12-13 02:22:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:41,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:22:41,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:41,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752153742] [2022-12-13 02:22:41,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752153742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:41,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:41,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:41,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576890998] [2022-12-13 02:22:41,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:41,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:41,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:41,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:41,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:41,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:41,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:41,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:41,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:41,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:41,386 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:41,386 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:41,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:41,387 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:41,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:41,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:41,388 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:41,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:41,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:41,390 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:41,390 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:41,390 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:41,390 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:41,390 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:41,391 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:41,391 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:41,391 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:41,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:41,396 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:41,396 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:41,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:41,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:41,397 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:41,485 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:41,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:41,486 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:41,486 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 02:22:41,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:41,486 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:41,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1944 [2022-12-13 02:22:41,486 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:22:41,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash -51680322, now seen corresponding path program 1 times [2022-12-13 02:22:41,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:41,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057629177] [2022-12-13 02:22:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:41,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:41,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:22:41,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:41,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057629177] [2022-12-13 02:22:41,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057629177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:41,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:41,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:41,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999715847] [2022-12-13 02:22:41,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:41,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:41,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:41,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:41,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:41,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:41,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:41,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:41,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:41,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:41,631 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:41,631 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:41,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:41,632 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:41,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:41,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:41,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:41,633 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:41,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:41,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:41,635 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:41,635 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:41,636 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:41,636 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:41,636 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:41,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:41,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:41,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:41,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:41,641 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:41,642 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:41,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:41,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:41,642 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:41,741 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:41,742 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:22:41,742 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:41,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:41,742 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:41,742 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:41,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1945 [2022-12-13 02:22:41,742 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:22:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -23051171, now seen corresponding path program 1 times [2022-12-13 02:22:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:41,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844490832] [2022-12-13 02:22:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:41,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:41,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:22:41,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:41,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844490832] [2022-12-13 02:22:41,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844490832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:41,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:41,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:41,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607302694] [2022-12-13 02:22:41,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:41,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:41,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:41,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:41,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:41,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:41,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:41,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:41,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:41,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:41,856 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:41,856 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:41,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:41,858 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:41,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:41,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:41,858 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:41,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:41,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:41,861 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:41,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:41,861 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:41,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:41,861 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:41,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:41,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:41,861 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:41,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:41,867 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:41,867 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:22:41,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:41,868 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:41,868 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:41,957 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:41,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:41,957 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:41,957 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 02:22:41,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:41,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:41,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1946 [2022-12-13 02:22:41,958 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:22:41,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash 5577980, now seen corresponding path program 1 times [2022-12-13 02:22:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:41,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205191299] [2022-12-13 02:22:41,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:41,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:42,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:22:42,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:42,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205191299] [2022-12-13 02:22:42,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205191299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:42,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:42,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:42,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649000875] [2022-12-13 02:22:42,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:42,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:42,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:42,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:42,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:42,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:42,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:42,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:42,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:42,103 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:42,103 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:42,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:42,104 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:42,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:42,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:42,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:42,105 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:42,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:42,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:42,107 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:42,107 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:42,107 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:42,108 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:42,108 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:42,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:42,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:42,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:42,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:42,113 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:42,113 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:22:42,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:42,114 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:42,114 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:42,203 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:42,204 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:42,204 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:42,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:42,204 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:42,204 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:42,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1947 [2022-12-13 02:22:42,204 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:22:42,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:42,204 INFO L85 PathProgramCache]: Analyzing trace with hash 34207131, now seen corresponding path program 1 times [2022-12-13 02:22:42,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:42,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860048101] [2022-12-13 02:22:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:42,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:42,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 02:22:42,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:42,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860048101] [2022-12-13 02:22:42,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860048101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:42,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:42,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:42,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383586721] [2022-12-13 02:22:42,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:42,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:42,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:42,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:42,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:42,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:42,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:42,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:42,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:42,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:42,333 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:42,333 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:42,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:42,334 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:42,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:42,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:42,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:42,335 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:42,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:42,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:42,337 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:42,337 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:42,337 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:42,338 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:42,338 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:42,338 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:42,338 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:42,338 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:42,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:42,343 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:42,344 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:42,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:42,344 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:42,344 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:42,431 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:42,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:42,431 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:42,431 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 02:22:42,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:42,431 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:42,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1948 [2022-12-13 02:22:42,432 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:22:42,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:42,432 INFO L85 PathProgramCache]: Analyzing trace with hash 62836282, now seen corresponding path program 1 times [2022-12-13 02:22:42,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:42,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770320304] [2022-12-13 02:22:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:42,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:22:42,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:42,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770320304] [2022-12-13 02:22:42,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770320304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:42,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:42,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:42,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574315375] [2022-12-13 02:22:42,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:42,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:42,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:42,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:42,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:42,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:42,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:42,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:42,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:42,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:42,559 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:42,559 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:42,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:42,560 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:42,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:42,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:42,561 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:42,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:42,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:42,564 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:42,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:42,564 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:42,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:42,564 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:42,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:42,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:42,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:42,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:42,570 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:42,570 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:42,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:42,571 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:42,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:42,659 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:42,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:42,659 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:42,660 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 02:22:42,660 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:42,660 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:42,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1949 [2022-12-13 02:22:42,660 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:22:42,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash 91465433, now seen corresponding path program 1 times [2022-12-13 02:22:42,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:42,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509253587] [2022-12-13 02:22:42,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:42,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:42,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:22:42,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:42,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509253587] [2022-12-13 02:22:42,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509253587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:42,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:42,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:42,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031340608] [2022-12-13 02:22:42,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:42,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:42,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:42,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:42,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:42,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:42,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:42,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:42,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:42,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:42,788 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:42,788 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:42,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:42,789 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:42,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:42,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:42,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:42,790 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:42,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:42,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:42,792 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:42,792 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:42,792 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:42,792 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:42,792 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:42,793 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:42,793 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:42,793 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:42,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:42,798 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:42,798 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:42,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:42,799 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:42,799 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:42,885 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:42,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:42,885 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:42,885 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 02:22:42,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:42,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:42,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1950 [2022-12-13 02:22:42,885 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:22:42,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:42,886 INFO L85 PathProgramCache]: Analyzing trace with hash 120094584, now seen corresponding path program 1 times [2022-12-13 02:22:42,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:42,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913300486] [2022-12-13 02:22:42,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:42,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:42,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:22:42,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:42,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913300486] [2022-12-13 02:22:42,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913300486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:42,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:42,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:42,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837954711] [2022-12-13 02:22:42,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:42,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:42,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:42,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:42,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:42,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:42,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:42,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:42,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:42,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:43,012 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:43,012 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:43,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:43,013 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:43,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:43,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:43,014 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:43,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:43,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:43,016 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,016 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:43,016 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:43,016 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:43,016 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:43,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:43,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:43,022 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:43,022 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:43,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:43,023 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:43,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:43,109 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:43,109 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:43,109 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:43,110 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 02:22:43,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:43,110 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:43,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1951 [2022-12-13 02:22:43,110 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:22:43,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:43,110 INFO L85 PathProgramCache]: Analyzing trace with hash 148723735, now seen corresponding path program 1 times [2022-12-13 02:22:43,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:43,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331735924] [2022-12-13 02:22:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:43,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22: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:22:43,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:43,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331735924] [2022-12-13 02:22:43,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331735924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:43,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:43,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:43,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118935447] [2022-12-13 02:22:43,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:43,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:43,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:43,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:43,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:43,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:43,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:43,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:43,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:43,237 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:43,237 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:43,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:43,238 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:43,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:43,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:43,238 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:43,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:43,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:43,241 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,241 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:43,241 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:43,241 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:43,241 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,241 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:43,242 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:43,242 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:43,247 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:43,247 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:43,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:43,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:43,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:43,335 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:43,336 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:43,336 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:43,336 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 02:22:43,336 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:43,336 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:43,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1952 [2022-12-13 02:22:43,336 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:22:43,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash 177352886, now seen corresponding path program 1 times [2022-12-13 02:22:43,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:43,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475937337] [2022-12-13 02:22:43,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:22:43,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:43,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475937337] [2022-12-13 02:22:43,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475937337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:43,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:43,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:43,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726588266] [2022-12-13 02:22:43,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:43,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:43,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:43,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:43,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:43,388 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:43,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:43,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:43,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:43,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:43,455 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:43,455 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:43,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:43,456 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:43,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:43,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:43,457 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:43,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:43,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:43,459 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,460 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:43,460 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:43,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:43,460 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:43,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:43,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:43,466 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:43,466 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:22:43,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:43,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:43,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:43,554 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:43,555 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:43,555 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:43,555 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 02:22:43,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:43,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:43,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1953 [2022-12-13 02:22:43,555 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:22:43,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash 205982037, now seen corresponding path program 1 times [2022-12-13 02:22:43,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:43,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516535137] [2022-12-13 02:22:43,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:43,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:43,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:22:43,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:43,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516535137] [2022-12-13 02:22:43,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516535137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:43,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:43,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:43,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873743243] [2022-12-13 02:22:43,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:43,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:43,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:43,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:43,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:43,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:43,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:43,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:43,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:43,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:43,683 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:43,683 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:43,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:43,684 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:43,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:43,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:43,685 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:43,685 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:43,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:43,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:43,687 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,687 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:43,687 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:43,688 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:43,688 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:43,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:43,688 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:43,693 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:43,694 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:43,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:43,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:43,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:43,789 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:43,790 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:22:43,790 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:43,790 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 02:22:43,790 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:43,790 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:43,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1954 [2022-12-13 02:22:43,790 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:22:43,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash 234611188, now seen corresponding path program 1 times [2022-12-13 02:22:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:43,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913578896] [2022-12-13 02:22:43,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:43,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:43,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 02:22:43,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:43,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913578896] [2022-12-13 02:22:43,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913578896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:43,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:43,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:43,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533945390] [2022-12-13 02:22:43,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:43,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:43,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:43,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:43,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:43,843 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:43,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:43,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:43,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:43,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:43,909 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:43,909 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:43,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:43,910 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:43,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:43,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:43,911 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:43,911 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:43,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:43,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:43,914 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,914 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:43,914 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:43,914 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:43,914 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,914 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:43,914 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:43,914 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:43,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:43,920 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:43,920 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:43,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:43,920 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:43,921 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:44,007 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:44,007 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:44,007 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:44,007 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 02:22:44,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:44,008 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:44,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1955 [2022-12-13 02:22:44,008 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:22:44,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:44,008 INFO L85 PathProgramCache]: Analyzing trace with hash 263240339, now seen corresponding path program 1 times [2022-12-13 02:22:44,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:44,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370946280] [2022-12-13 02:22:44,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:44,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:22:44,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:44,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370946280] [2022-12-13 02:22:44,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370946280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:44,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:44,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:44,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839444024] [2022-12-13 02:22:44,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:44,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:44,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:44,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:44,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:44,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:44,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:44,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:44,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:44,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:44,127 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:44,127 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:44,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:44,128 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:44,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:44,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:44,129 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:44,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:44,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:44,131 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:44,132 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:44,132 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:44,132 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:44,132 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:44,132 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:44,132 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:44,132 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:44,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:44,138 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:44,138 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:44,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:44,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:44,138 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:44,226 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:44,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:44,227 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:44,227 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 02:22:44,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:44,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:44,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1956 [2022-12-13 02:22:44,227 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:22:44,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash 291869490, now seen corresponding path program 1 times [2022-12-13 02:22:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:44,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727720599] [2022-12-13 02:22:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:44,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:44,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:22:44,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:44,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727720599] [2022-12-13 02:22:44,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727720599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:44,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:44,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:44,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606966205] [2022-12-13 02:22:44,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:44,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:44,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:44,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:44,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:44,277 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:44,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:44,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:44,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:44,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:44,343 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:44,344 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:44,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:44,345 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:44,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:44,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:44,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:44,345 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:44,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:44,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:44,348 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:44,348 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:44,348 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:44,348 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:44,348 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:44,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:44,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:44,348 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:44,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:44,354 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:44,354 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:44,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:44,355 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:44,355 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:44,443 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:44,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:44,444 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:44,444 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 02:22:44,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:44,444 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:44,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1957 [2022-12-13 02:22:44,444 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:22:44,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:44,444 INFO L85 PathProgramCache]: Analyzing trace with hash 320498641, now seen corresponding path program 1 times [2022-12-13 02:22:44,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:44,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988529637] [2022-12-13 02:22:44,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:44,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:44,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:22:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:44,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988529637] [2022-12-13 02:22:44,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988529637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:44,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:44,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:44,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745376763] [2022-12-13 02:22:44,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:44,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:44,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:44,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:44,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:44,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:44,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:44,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:44,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:44,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:44,597 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:44,598 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:44,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:44,599 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:44,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:44,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:44,599 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:44,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:44,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:44,602 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:44,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:44,602 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:44,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:44,602 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:44,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:44,602 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:44,602 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:44,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:44,608 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:44,608 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:44,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:44,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:44,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:44,698 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:44,698 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:44,698 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:44,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:44,698 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:44,698 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:44,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1958 [2022-12-13 02:22:44,699 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:22:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash 349127792, now seen corresponding path program 1 times [2022-12-13 02:22:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:44,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932142148] [2022-12-13 02:22:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:44,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:44,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:22:44,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:44,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932142148] [2022-12-13 02:22:44,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932142148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:44,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:44,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:44,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201773792] [2022-12-13 02:22:44,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:44,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:44,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:44,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:44,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:44,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:44,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:44,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:44,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:44,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:44,839 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:44,839 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:44,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:44,840 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:44,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:44,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:44,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:44,840 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:44,840 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:44,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:44,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:44,843 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:44,843 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:44,843 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:44,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:44,843 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:44,843 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:44,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:44,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:44,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:44,849 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:44,849 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:44,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:44,850 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:44,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:44,937 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:44,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:44,938 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:44,938 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 02:22:44,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:44,938 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:44,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1959 [2022-12-13 02:22:44,938 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:22:44,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash 377756943, now seen corresponding path program 1 times [2022-12-13 02:22:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:44,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233363759] [2022-12-13 02:22:44,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:44,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:44,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:22:44,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:44,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233363759] [2022-12-13 02:22:44,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233363759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:44,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:44,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:44,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530681817] [2022-12-13 02:22:44,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:44,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:44,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:44,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:44,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:44,990 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:44,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:44,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:44,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:44,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:45,066 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:45,067 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:45,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:45,068 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:45,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:45,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:45,068 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:45,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:45,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:45,071 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:45,071 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:45,071 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:45,071 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:45,071 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:45,071 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:45,071 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:45,071 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:45,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:45,077 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:45,077 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:45,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:45,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:45,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:45,165 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:45,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:45,166 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:45,166 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 02:22:45,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:45,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:45,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1960 [2022-12-13 02:22:45,166 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:22:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:45,166 INFO L85 PathProgramCache]: Analyzing trace with hash 406386094, now seen corresponding path program 1 times [2022-12-13 02:22:45,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:45,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410958415] [2022-12-13 02:22:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:45,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:45,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:22:45,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:45,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410958415] [2022-12-13 02:22:45,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410958415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:45,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:45,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:45,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160164189] [2022-12-13 02:22:45,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:45,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:45,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:45,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:45,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:45,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:45,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:45,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:45,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:45,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:45,314 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:45,314 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:45,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:45,315 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:45,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:45,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:45,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:45,316 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:45,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:45,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:45,318 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:45,318 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:45,319 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:45,319 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:45,319 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:45,319 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:45,319 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:45,319 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:45,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:45,325 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:45,325 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:45,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:45,325 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:45,325 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:45,412 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:45,413 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:45,413 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:45,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:45,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:45,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:45,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1961 [2022-12-13 02:22:45,413 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:22:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash 435015245, now seen corresponding path program 1 times [2022-12-13 02:22:45,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:45,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304799532] [2022-12-13 02:22:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:45,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:45,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:22:45,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:45,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304799532] [2022-12-13 02:22:45,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304799532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:45,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:45,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:45,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157263750] [2022-12-13 02:22:45,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:45,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:45,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:45,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:45,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:45,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:45,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:45,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:45,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:45,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:45,540 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:45,540 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:45,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:45,542 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:45,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:45,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:45,542 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:45,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:45,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:45,545 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:45,545 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:45,545 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:45,545 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:45,545 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:45,545 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:45,545 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:45,545 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:45,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:45,551 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:45,551 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:45,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:45,552 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:45,552 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:45,640 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:45,640 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:45,640 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:45,640 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 02:22:45,640 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:45,640 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:45,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1962 [2022-12-13 02:22:45,640 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:22:45,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:45,641 INFO L85 PathProgramCache]: Analyzing trace with hash 463644396, now seen corresponding path program 1 times [2022-12-13 02:22:45,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:45,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774039281] [2022-12-13 02:22:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:45,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:45,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:22:45,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:45,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774039281] [2022-12-13 02:22:45,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774039281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:45,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:45,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:45,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248721653] [2022-12-13 02:22:45,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:45,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:45,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:45,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:45,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:45,694 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:45,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:45,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:45,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:45,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:45,780 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:45,780 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:45,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:45,781 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:45,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:45,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:45,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:45,781 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:45,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:45,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:45,784 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:45,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:45,784 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:45,784 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:45,784 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:45,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:45,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:45,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:45,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:45,790 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:45,790 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:45,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:45,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:45,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:45,877 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:45,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:45,878 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:45,878 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 02:22:45,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:45,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:45,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1963 [2022-12-13 02:22:45,878 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:22:45,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash 492273547, now seen corresponding path program 1 times [2022-12-13 02:22:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:45,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994416148] [2022-12-13 02:22:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:45,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:45,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:22:45,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:45,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994416148] [2022-12-13 02:22:45,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994416148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:45,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:45,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:45,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036053005] [2022-12-13 02:22:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:45,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:45,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:45,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:45,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:45,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:45,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:45,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:45,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:45,995 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:45,995 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:45,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:45,996 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:45,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:45,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:45,997 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:45,997 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:45,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:45,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:46,000 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:46,000 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:46,000 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:46,000 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,000 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:46,000 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:46,000 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:46,006 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:46,006 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:46,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:46,006 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:46,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:46,094 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:46,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:46,094 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:46,094 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 02:22:46,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:46,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:46,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1964 [2022-12-13 02:22:46,094 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:22:46,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:46,095 INFO L85 PathProgramCache]: Analyzing trace with hash 520902698, now seen corresponding path program 1 times [2022-12-13 02:22:46,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:46,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258608360] [2022-12-13 02:22:46,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:46,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:46,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:22:46,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:46,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258608360] [2022-12-13 02:22:46,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258608360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:46,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:46,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:46,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199646514] [2022-12-13 02:22:46,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:46,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:46,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:46,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:46,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:46,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:46,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:46,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:46,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:46,220 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:46,220 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:46,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:46,221 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:46,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:46,222 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:46,222 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:46,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:46,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:46,224 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:46,224 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:46,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:46,225 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,225 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:46,225 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:46,225 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:46,230 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:46,230 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:46,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:46,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:46,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:46,317 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:46,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:22:46,317 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:46,317 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 02:22:46,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:46,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:46,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1965 [2022-12-13 02:22:46,318 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:22:46,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:46,318 INFO L85 PathProgramCache]: Analyzing trace with hash 549531849, now seen corresponding path program 1 times [2022-12-13 02:22:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:46,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042981548] [2022-12-13 02:22:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:46,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:46,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:22:46,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:46,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042981548] [2022-12-13 02:22:46,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042981548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:46,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:46,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:46,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548683093] [2022-12-13 02:22:46,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:46,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:46,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:46,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:46,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:46,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:46,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:46,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:46,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:46,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:46,445 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:46,445 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:46,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:46,446 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:46,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:46,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:46,447 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:46,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:46,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:46,449 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:46,449 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:46,450 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:46,450 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,450 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:46,450 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:46,450 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:46,455 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:46,456 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:46,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:46,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:46,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:46,541 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:46,542 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:22:46,542 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:46,542 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 02:22:46,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:46,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:46,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1966 [2022-12-13 02:22:46,542 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:22:46,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash 578161000, now seen corresponding path program 1 times [2022-12-13 02:22:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:46,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310871612] [2022-12-13 02:22:46,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:46,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:46,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:22:46,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:46,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310871612] [2022-12-13 02:22:46,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310871612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:46,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:46,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:46,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006233757] [2022-12-13 02:22:46,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:46,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:46,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:46,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:46,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:46,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:46,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:46,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:46,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:46,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:46,676 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:46,676 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:46,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:46,677 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:46,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:46,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:46,678 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:46,678 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:46,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:46,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:46,680 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,680 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:46,681 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:46,681 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:46,681 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,681 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:46,681 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:46,681 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:46,687 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:46,687 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:46,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:46,687 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:46,687 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:46,773 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:46,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:46,774 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:46,774 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 02:22:46,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:46,774 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:46,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1967 [2022-12-13 02:22:46,774 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:22:46,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash 606790151, now seen corresponding path program 1 times [2022-12-13 02:22:46,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:46,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203942583] [2022-12-13 02:22:46,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:46,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:22:46,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:46,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203942583] [2022-12-13 02:22:46,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203942583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:46,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:46,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:46,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900281302] [2022-12-13 02:22:46,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:46,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:46,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:46,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:46,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:46,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:46,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:46,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:46,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:46,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:46,910 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:46,910 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:46,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:46,912 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:46,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:46,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:46,912 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:46,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:46,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:46,915 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,915 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:46,915 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:46,915 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:46,915 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:46,915 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:46,915 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:46,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:46,921 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:46,921 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:46,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:46,921 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:46,921 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:47,008 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:47,008 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:47,008 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:47,008 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 02:22:47,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:47,008 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:47,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1968 [2022-12-13 02:22:47,009 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:22:47,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:47,009 INFO L85 PathProgramCache]: Analyzing trace with hash 635419302, now seen corresponding path program 1 times [2022-12-13 02:22:47,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:47,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592618743] [2022-12-13 02:22:47,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:47,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:47,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:22:47,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:47,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592618743] [2022-12-13 02:22:47,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592618743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:47,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:47,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:47,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817647496] [2022-12-13 02:22:47,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:47,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:47,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:47,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:47,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:47,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:47,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:47,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:47,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:47,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:47,124 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:47,125 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:47,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:47,126 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:47,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:47,126 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:47,126 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:47,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:47,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:47,129 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:47,129 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:47,129 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:47,129 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:47,129 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:47,129 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:47,129 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:47,129 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:47,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:47,135 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:47,135 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:47,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:47,135 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:47,135 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:47,222 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:47,222 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:47,222 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:47,222 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 02:22:47,223 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:47,223 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:47,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1969 [2022-12-13 02:22:47,223 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:22:47,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:47,223 INFO L85 PathProgramCache]: Analyzing trace with hash 664048453, now seen corresponding path program 1 times [2022-12-13 02:22:47,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:47,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160384196] [2022-12-13 02:22:47,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:47,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:47,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:22:47,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:47,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160384196] [2022-12-13 02:22:47,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160384196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:47,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:47,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:47,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692310539] [2022-12-13 02:22:47,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:47,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:47,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:47,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:47,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:47,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:47,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:47,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:47,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:47,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:47,338 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:47,338 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:47,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:47,339 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:47,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:47,340 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:47,340 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:47,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:47,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:47,342 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:47,342 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:47,342 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:47,342 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:47,342 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:47,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:47,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:47,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:47,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:47,348 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:47,348 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:22:47,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:47,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:47,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:47,435 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:47,435 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:47,435 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:47,435 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 02:22:47,435 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:47,435 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:47,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1970 [2022-12-13 02:22:47,436 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:22:47,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:47,436 INFO L85 PathProgramCache]: Analyzing trace with hash 692677604, now seen corresponding path program 1 times [2022-12-13 02:22:47,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:47,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533116906] [2022-12-13 02:22:47,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:47,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:22:47,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:47,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533116906] [2022-12-13 02:22:47,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533116906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:47,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:47,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:47,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253742328] [2022-12-13 02:22:47,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:47,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:47,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:47,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:47,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:47,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:47,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:47,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:47,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:47,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:47,550 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:47,550 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:47,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:47,551 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:47,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:47,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:47,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:47,552 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:47,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:47,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:47,554 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:47,554 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:47,554 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:47,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:47,554 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:47,555 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:47,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:47,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:47,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:47,560 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:47,560 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:47,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:47,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:47,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:47,648 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:47,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:47,649 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:47,649 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 02:22:47,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:47,649 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:47,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1971 [2022-12-13 02:22:47,649 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:22:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash 721306755, now seen corresponding path program 1 times [2022-12-13 02:22:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:47,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962561611] [2022-12-13 02:22:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:47,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:47,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:22:47,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:47,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962561611] [2022-12-13 02:22:47,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962561611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:47,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:47,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:47,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116012147] [2022-12-13 02:22:47,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:47,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:47,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:47,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:47,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:47,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:47,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:47,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:47,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:47,808 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:47,808 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:47,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:47,809 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:47,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:47,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:47,810 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:47,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:47,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:47,813 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:47,813 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:47,813 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:47,813 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:47,813 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:47,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:47,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:47,813 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:47,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:47,819 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:47,819 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:47,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:47,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:47,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:47,906 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:47,906 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:47,906 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:47,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:47,906 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:47,906 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:47,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1972 [2022-12-13 02:22:47,907 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:22:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:47,907 INFO L85 PathProgramCache]: Analyzing trace with hash 749935906, now seen corresponding path program 1 times [2022-12-13 02:22:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:47,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288299519] [2022-12-13 02:22:47,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:47,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:47,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:22:47,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:47,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288299519] [2022-12-13 02:22:47,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288299519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:47,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:47,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:47,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131458506] [2022-12-13 02:22:47,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:47,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:47,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:47,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:47,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:47,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:47,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:47,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:47,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:47,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:48,025 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:48,025 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:48,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:48,026 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:48,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:48,027 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:48,027 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:48,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:48,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:48,029 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,029 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:48,029 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:48,029 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:48,029 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:48,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:48,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:48,035 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:48,035 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:48,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:48,036 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:48,036 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:48,123 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:48,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:48,123 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:48,123 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 02:22:48,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:48,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:48,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1973 [2022-12-13 02:22:48,123 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:22:48,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash 778565057, now seen corresponding path program 1 times [2022-12-13 02:22:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:48,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088750113] [2022-12-13 02:22:48,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:48,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:22:48,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:48,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088750113] [2022-12-13 02:22:48,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088750113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:48,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:48,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:48,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759411799] [2022-12-13 02:22:48,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:48,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:48,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:48,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:48,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:48,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:48,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:48,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:48,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:48,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:48,241 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:48,241 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:48,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:48,242 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:48,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:48,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:48,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:48,242 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:48,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:48,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:48,245 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:48,245 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:48,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:48,245 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:48,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:48,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:48,251 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:48,251 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:48,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:48,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:48,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:48,339 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:48,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:48,340 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:48,340 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 02:22:48,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:48,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:48,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1974 [2022-12-13 02:22:48,340 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:22:48,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash 807194208, now seen corresponding path program 1 times [2022-12-13 02:22:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:48,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165381764] [2022-12-13 02:22:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:48,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:22:48,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:48,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165381764] [2022-12-13 02:22:48,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165381764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:48,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:48,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:48,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751541567] [2022-12-13 02:22:48,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:48,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:48,392 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:48,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:48,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:48,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:48,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:48,468 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:48,468 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:48,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:48,469 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:48,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:48,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:48,470 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:48,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:48,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:48,472 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,472 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:48,472 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:48,473 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:48,473 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,473 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:48,473 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:48,473 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:48,478 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:48,478 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:48,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:48,479 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:48,479 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:48,566 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:48,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:48,567 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:48,567 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 02:22:48,567 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:48,567 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:48,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1975 [2022-12-13 02:22:48,567 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:22:48,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:48,567 INFO L85 PathProgramCache]: Analyzing trace with hash 835823359, now seen corresponding path program 1 times [2022-12-13 02:22:48,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:48,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211782252] [2022-12-13 02:22:48,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:48,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:48,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:22:48,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:48,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211782252] [2022-12-13 02:22:48,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211782252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:48,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:48,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:48,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735364648] [2022-12-13 02:22:48,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:48,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:48,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:48,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:48,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:48,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:48,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:48,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:48,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:48,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:48,695 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:48,695 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:48,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:48,696 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:48,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:48,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:48,697 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:48,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:48,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:48,699 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,699 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:48,700 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:48,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:48,700 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:48,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:48,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:48,706 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:48,706 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:48,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:48,706 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:48,706 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:48,793 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:48,793 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:48,793 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:48,793 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 02:22:48,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:48,793 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:48,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1976 [2022-12-13 02:22:48,794 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:22:48,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:48,794 INFO L85 PathProgramCache]: Analyzing trace with hash 864452510, now seen corresponding path program 1 times [2022-12-13 02:22:48,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:48,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937210552] [2022-12-13 02:22:48,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:48,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:48,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:22:48,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:48,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937210552] [2022-12-13 02:22:48,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937210552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:48,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:48,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:48,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209677261] [2022-12-13 02:22:48,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:48,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:48,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:48,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:48,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:48,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:48,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:48,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:48,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:48,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:48,916 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:48,916 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:48,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:48,917 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:48,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:48,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:48,918 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:48,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:48,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:48,920 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,920 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:48,920 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:48,920 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:48,920 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:48,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:48,921 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:48,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:48,926 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:48,926 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:48,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:48,927 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:48,927 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:49,018 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:49,018 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:22:49,018 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:49,018 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 02:22:49,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:49,018 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:49,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1977 [2022-12-13 02:22:49,018 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:22:49,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:49,019 INFO L85 PathProgramCache]: Analyzing trace with hash 893081661, now seen corresponding path program 1 times [2022-12-13 02:22:49,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:49,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810290367] [2022-12-13 02:22:49,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:49,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:49,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:22:49,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:49,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810290367] [2022-12-13 02:22:49,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810290367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:49,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:49,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:49,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271787280] [2022-12-13 02:22:49,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:49,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:49,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:49,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:49,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:49,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:49,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:49,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:49,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:49,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:49,148 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:49,148 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:49,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:49,150 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:49,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:49,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:49,150 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:49,150 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:49,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:49,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:49,153 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:49,153 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:49,153 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:49,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:49,153 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:49,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:49,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:49,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:49,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:49,159 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:49,159 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:49,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:49,160 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:49,160 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:49,247 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:49,248 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:49,248 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:49,248 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 02:22:49,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:49,248 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:49,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1978 [2022-12-13 02:22:49,248 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:22:49,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash 921710812, now seen corresponding path program 1 times [2022-12-13 02:22:49,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:49,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496356535] [2022-12-13 02:22:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:49,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:49,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:22:49,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:49,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496356535] [2022-12-13 02:22:49,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496356535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:49,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:49,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:49,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876887834] [2022-12-13 02:22:49,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:49,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:49,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:49,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:49,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:49,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:49,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:49,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:49,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:49,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:49,365 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:49,365 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:49,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:49,366 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:49,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:49,367 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:49,367 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:49,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:49,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:49,369 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:49,369 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:49,370 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:49,370 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:49,370 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:49,370 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:49,370 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:49,370 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:49,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:49,376 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:49,376 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:49,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:49,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:49,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:49,465 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:49,466 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:49,466 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:49,466 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 02:22:49,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:49,466 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:49,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1979 [2022-12-13 02:22:49,466 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:22:49,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:49,466 INFO L85 PathProgramCache]: Analyzing trace with hash 950339963, now seen corresponding path program 1 times [2022-12-13 02:22:49,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:49,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641990643] [2022-12-13 02:22:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:49,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:49,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:22:49,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:49,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641990643] [2022-12-13 02:22:49,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641990643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:49,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:49,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:49,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343484479] [2022-12-13 02:22:49,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:49,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:49,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:49,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:49,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:49,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:49,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:49,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:49,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:49,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:49,594 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:49,594 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:49,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:49,596 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:49,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:49,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:49,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:49,596 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:49,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:49,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:49,599 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:49,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:49,599 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:49,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:49,599 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:49,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:49,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:49,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:49,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:49,605 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:49,605 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:49,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:49,606 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:49,606 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:49,693 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:49,693 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:49,693 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:49,694 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 02:22:49,694 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:49,694 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:49,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1980 [2022-12-13 02:22:49,694 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:22:49,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:49,694 INFO L85 PathProgramCache]: Analyzing trace with hash 978969114, now seen corresponding path program 1 times [2022-12-13 02:22:49,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:49,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587023824] [2022-12-13 02:22:49,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:49,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:49,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:22:49,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:49,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587023824] [2022-12-13 02:22:49,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587023824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:49,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:49,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:49,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301960960] [2022-12-13 02:22:49,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:49,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:49,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:49,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:49,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:49,746 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:49,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:49,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:49,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:49,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:49,832 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:49,832 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:49,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:49,833 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:49,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:49,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:49,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:49,834 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:49,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:49,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:49,836 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:49,837 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:49,837 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:49,837 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:49,837 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:49,837 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:49,837 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:49,837 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:49,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:49,843 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:49,843 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:49,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:49,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:49,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:49,930 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:49,931 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:49,931 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:49,931 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 02:22:49,931 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:49,931 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:49,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1981 [2022-12-13 02:22:49,931 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:22:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:49,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1007598265, now seen corresponding path program 1 times [2022-12-13 02:22:49,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:49,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189604016] [2022-12-13 02:22:49,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:49,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:49,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:22:49,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:49,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189604016] [2022-12-13 02:22:49,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189604016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:49,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:49,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:49,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092419234] [2022-12-13 02:22:49,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:49,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:49,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:49,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:49,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:49,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:49,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:49,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:49,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:49,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:50,059 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:50,059 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:50,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:50,060 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:50,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:50,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:50,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:50,061 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:50,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:50,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:50,064 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,064 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:50,064 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:50,064 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:50,064 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:50,064 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:50,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:50,070 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:50,070 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:50,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:50,070 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:50,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:50,157 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:50,157 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:50,157 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:50,157 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 02:22:50,157 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:50,157 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:50,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1982 [2022-12-13 02:22:50,157 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:22:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1036227416, now seen corresponding path program 1 times [2022-12-13 02:22:50,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:50,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622568440] [2022-12-13 02:22:50,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:50,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:50,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:22:50,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:50,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622568440] [2022-12-13 02:22:50,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622568440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:50,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:50,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:50,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019147768] [2022-12-13 02:22:50,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:50,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:50,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:50,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:50,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:50,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:50,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:50,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:50,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:50,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:50,276 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:50,276 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:50,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:50,277 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:50,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:50,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:50,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:50,278 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:50,278 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:50,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:50,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:50,280 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,280 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:50,280 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:50,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:50,280 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,280 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:50,280 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:50,281 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:50,286 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:50,286 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:50,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:50,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:50,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:50,375 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:50,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:50,376 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:50,376 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 02:22:50,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:50,376 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:50,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1983 [2022-12-13 02:22:50,376 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:22:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1064856567, now seen corresponding path program 1 times [2022-12-13 02:22:50,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:50,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179867676] [2022-12-13 02:22:50,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:50,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:50,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:22:50,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:50,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179867676] [2022-12-13 02:22:50,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179867676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:50,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:50,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:50,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813135659] [2022-12-13 02:22:50,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:50,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:50,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:50,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:50,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:50,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:50,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:50,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:50,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:50,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:50,495 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:50,495 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:50,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:50,496 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:50,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:50,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:50,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:50,496 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:50,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:50,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:50,499 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:50,499 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:50,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:50,499 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:50,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:50,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:50,505 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:50,505 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:50,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:50,506 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:50,506 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:50,593 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:50,593 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:50,593 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:50,593 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 02:22:50,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:50,594 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:50,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1984 [2022-12-13 02:22:50,594 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:22:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1093485718, now seen corresponding path program 1 times [2022-12-13 02:22:50,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:50,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132698588] [2022-12-13 02:22:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:50,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:50,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:22:50,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:50,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132698588] [2022-12-13 02:22:50,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132698588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:50,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:50,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:50,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949523656] [2022-12-13 02:22:50,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:50,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:50,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:50,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:50,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:50,646 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:50,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:50,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:50,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:50,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:50,712 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:50,712 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:50,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:50,713 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:50,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:50,713 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:50,713 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:50,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:50,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:50,716 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,716 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:50,716 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:50,716 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:50,716 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,716 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:50,716 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:50,716 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:50,722 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:50,722 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:50,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:50,723 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:50,723 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:50,810 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:50,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:50,811 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:50,811 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 02:22:50,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:50,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:50,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1985 [2022-12-13 02:22:50,811 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:22:50,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:50,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1122114869, now seen corresponding path program 1 times [2022-12-13 02:22:50,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:50,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687152333] [2022-12-13 02:22:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:50,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:22:50,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:50,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687152333] [2022-12-13 02:22:50,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687152333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:50,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:50,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:50,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501675359] [2022-12-13 02:22:50,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:50,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:50,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:50,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:50,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:50,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:50,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:50,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:50,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:50,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:50,947 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:50,947 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:50,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:50,948 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:50,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:50,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:50,949 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:50,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:50,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:50,952 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,952 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:50,952 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:50,952 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:50,952 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,952 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:50,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:50,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:50,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:50,958 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:50,958 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:50,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:50,958 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:50,958 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:51,046 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:51,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:51,047 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:51,047 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 02:22:51,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:51,047 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:51,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1986 [2022-12-13 02:22:51,047 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:22:51,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:51,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1150744020, now seen corresponding path program 1 times [2022-12-13 02:22:51,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:51,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203245646] [2022-12-13 02:22:51,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:51,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:51,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:22:51,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:51,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203245646] [2022-12-13 02:22:51,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203245646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:51,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:51,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:51,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347232856] [2022-12-13 02:22:51,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:51,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:51,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:51,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:51,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:51,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:51,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:51,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:51,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:51,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:51,163 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:51,164 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:51,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:51,165 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:51,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:51,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:51,165 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:51,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:51,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:51,168 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:51,168 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:51,168 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:51,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:51,168 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:51,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:51,168 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:51,168 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:51,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:51,174 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:51,174 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:51,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:51,174 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:51,174 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:51,262 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:51,263 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:51,263 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:51,263 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 02:22:51,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:51,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:51,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1987 [2022-12-13 02:22:51,263 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:22:51,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:51,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1179373171, now seen corresponding path program 1 times [2022-12-13 02:22:51,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:51,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619857263] [2022-12-13 02:22:51,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:51,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:51,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:22:51,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:51,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619857263] [2022-12-13 02:22:51,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619857263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:51,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:51,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:51,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996921689] [2022-12-13 02:22:51,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:51,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:51,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:51,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:51,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:51,312 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:51,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:51,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:51,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:51,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:51,401 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:51,401 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:51,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:51,403 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:51,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:51,403 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:51,403 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:51,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:51,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:51,407 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:51,407 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:51,407 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:51,407 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:51,407 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:51,407 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:51,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:51,407 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:51,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:51,414 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:51,415 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:51,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:51,415 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:51,415 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:51,522 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:51,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:22:51,522 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:51,522 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 02:22:51,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:51,523 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:51,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1988 [2022-12-13 02:22:51,523 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:22:51,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:51,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1208002322, now seen corresponding path program 1 times [2022-12-13 02:22:51,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:51,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285420899] [2022-12-13 02:22:51,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:51,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:51,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:22:51,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:51,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285420899] [2022-12-13 02:22:51,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285420899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:51,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:51,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:51,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313351217] [2022-12-13 02:22:51,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:51,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:51,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:51,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:51,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:51,588 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:51,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:51,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:51,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:51,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:51,675 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:51,676 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:51,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:51,677 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:51,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:51,678 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:51,678 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:51,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:51,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:51,681 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:51,681 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:51,681 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:51,681 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:51,681 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:51,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:51,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:51,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:51,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:51,689 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:51,689 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:22:51,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:51,690 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:51,690 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:51,845 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:51,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 02:22:51,846 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:51,846 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 02:22:51,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:51,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:51,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1989 [2022-12-13 02:22:51,846 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:22:51,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:51,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1236631473, now seen corresponding path program 1 times [2022-12-13 02:22:51,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:51,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10829407] [2022-12-13 02:22:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:51,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:51,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:22:51,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:51,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10829407] [2022-12-13 02:22:51,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10829407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:51,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:51,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938234208] [2022-12-13 02:22:51,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:51,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:51,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:51,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:51,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:51,909 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:51,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:51,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:51,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:51,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:52,028 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:52,028 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:52,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:52,029 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:52,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:52,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:52,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:52,030 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:52,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:52,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:52,033 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,033 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:52,033 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:52,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:52,034 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:52,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:52,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:52,041 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:52,042 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:52,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:52,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:52,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:52,149 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:52,150 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:22:52,150 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:52,150 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 02:22:52,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:52,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:52,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1990 [2022-12-13 02:22:52,151 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:22:52,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:52,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1265260624, now seen corresponding path program 1 times [2022-12-13 02:22:52,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:52,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134038517] [2022-12-13 02:22:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:52,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:52,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:22:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:52,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134038517] [2022-12-13 02:22:52,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134038517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:52,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:52,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753197667] [2022-12-13 02:22:52,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:52,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:52,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:52,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:52,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:52,214 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:52,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:52,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:52,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:52,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:52,311 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:52,311 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:52,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:52,312 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:52,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:52,313 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:52,313 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:52,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:52,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:52,316 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,316 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:52,316 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:52,317 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:52,317 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,317 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:52,317 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:52,317 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:52,324 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:52,325 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:52,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:52,325 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:52,325 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:52,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:52,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 02:22:52,427 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:52,427 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 02:22:52,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:52,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:52,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1991 [2022-12-13 02:22:52,427 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:22:52,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:52,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1293889775, now seen corresponding path program 1 times [2022-12-13 02:22:52,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:52,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167657156] [2022-12-13 02:22:52,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:52,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:52,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:22:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:52,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167657156] [2022-12-13 02:22:52,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167657156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:52,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:52,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:52,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94219683] [2022-12-13 02:22:52,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:52,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:52,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:52,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:52,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:52,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:52,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:52,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:52,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:52,546 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:52,546 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:52,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:52,547 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:52,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:52,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:52,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:52,548 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:52,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:52,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:52,550 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,551 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:52,551 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:52,551 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:52,551 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,551 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:52,551 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:52,551 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:52,557 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:52,557 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:52,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:52,557 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:52,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:52,644 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:52,645 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:52,645 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:52,645 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 02:22:52,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:52,645 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:52,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1992 [2022-12-13 02:22:52,645 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:22:52,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1322518926, now seen corresponding path program 1 times [2022-12-13 02:22:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:52,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808191678] [2022-12-13 02:22:52,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:52,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:52,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 02:22:52,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:52,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808191678] [2022-12-13 02:22:52,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808191678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:52,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:52,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:52,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874635459] [2022-12-13 02:22:52,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:52,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:52,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:52,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:52,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:52,695 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:52,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:52,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:52,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:52,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:52,771 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:52,771 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:52,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:52,772 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:52,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:52,773 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:52,773 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:52,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:52,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:52,775 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:52,775 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:52,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:52,775 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,776 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:52,776 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:52,776 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:52,781 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:52,781 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:22:52,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:52,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:52,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:52,869 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:52,869 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:52,869 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:52,869 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 02:22:52,869 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:52,869 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:52,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1993 [2022-12-13 02:22:52,870 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:22:52,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1351148077, now seen corresponding path program 1 times [2022-12-13 02:22:52,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:52,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976982865] [2022-12-13 02:22:52,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:52,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:22:52,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:52,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976982865] [2022-12-13 02:22:52,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976982865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:52,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:52,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:52,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989276348] [2022-12-13 02:22:52,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:52,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:52,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:52,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:52,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:52,922 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:52,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:52,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:52,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:52,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:52,990 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:52,990 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:52,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:52,991 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:52,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:52,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:52,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:52,992 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:52,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:52,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:52,994 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,994 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:52,994 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:52,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:52,994 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:52,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:52,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:52,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:53,000 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:53,001 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:53,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:53,001 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:53,001 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:53,090 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:53,090 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:53,090 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:53,090 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 02:22:53,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:53,090 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:53,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1994 [2022-12-13 02:22:53,090 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:22:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:53,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1379777228, now seen corresponding path program 1 times [2022-12-13 02:22:53,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:53,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014890758] [2022-12-13 02:22:53,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:53,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:22:53,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:53,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014890758] [2022-12-13 02:22:53,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014890758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:53,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:53,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:53,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874374711] [2022-12-13 02:22:53,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:53,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:53,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:53,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:53,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:53,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:53,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:53,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:53,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:53,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:53,216 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:53,217 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:53,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:53,218 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:53,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:53,218 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:53,218 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:53,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:53,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:53,221 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:53,221 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:53,221 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:53,221 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:53,221 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:53,221 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:53,221 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:53,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:53,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:53,227 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:53,227 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:53,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:53,228 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:53,228 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:53,317 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:53,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:53,317 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:53,317 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 02:22:53,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:53,318 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:53,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1995 [2022-12-13 02:22:53,318 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:22:53,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:53,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1408406379, now seen corresponding path program 1 times [2022-12-13 02:22:53,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:53,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303340178] [2022-12-13 02:22:53,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:53,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:53,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:22:53,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:53,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303340178] [2022-12-13 02:22:53,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303340178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:53,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:53,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:53,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671177177] [2022-12-13 02:22:53,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:53,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:53,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:53,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:53,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:53,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:53,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:53,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:53,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:53,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:53,437 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:53,437 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:53,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:53,438 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:53,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:53,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:53,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:53,439 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:53,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:53,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:53,441 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:53,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:53,442 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:53,442 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:53,442 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:53,442 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:53,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:53,442 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:53,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:53,448 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:53,448 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:53,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:53,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:53,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:53,537 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:53,537 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:53,537 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:53,537 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 02:22:53,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:53,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:53,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1996 [2022-12-13 02:22:53,538 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:22:53,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:53,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1437035530, now seen corresponding path program 1 times [2022-12-13 02:22:53,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:53,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364664617] [2022-12-13 02:22:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:53,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:22:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:53,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364664617] [2022-12-13 02:22:53,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364664617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:53,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:53,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:53,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334181144] [2022-12-13 02:22:53,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:53,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:53,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:53,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:53,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:53,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:53,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:53,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:53,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:53,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:53,654 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:53,655 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:53,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:53,656 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:53,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:53,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:53,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:53,656 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:53,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:53,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:53,659 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:53,659 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:53,659 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:53,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:53,659 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:53,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:53,660 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:53,660 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:53,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:53,665 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:53,665 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:22:53,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:53,666 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:53,666 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:53,754 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:53,755 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:53,755 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:53,755 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 02:22:53,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:53,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:53,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1997 [2022-12-13 02:22:53,755 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:22:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1465664681, now seen corresponding path program 1 times [2022-12-13 02:22:53,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:53,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038700082] [2022-12-13 02:22:53,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:53,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:53,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 02:22:53,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:53,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038700082] [2022-12-13 02:22:53,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038700082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:53,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:53,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:53,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490132640] [2022-12-13 02:22:53,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:53,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:53,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:53,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:53,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:53,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:53,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:53,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:53,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:53,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:53,872 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:53,872 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:53,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:53,873 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:53,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:53,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:53,874 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:53,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:53,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:53,876 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:53,876 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:53,876 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:53,876 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:53,876 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:53,877 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:53,877 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:53,877 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:53,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:53,882 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:53,882 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:53,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:53,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:53,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:53,972 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:53,973 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:22:53,973 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:53,973 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 02:22:53,973 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:53,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:53,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1998 [2022-12-13 02:22:53,973 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:22:53,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1494293832, now seen corresponding path program 1 times [2022-12-13 02:22:53,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:53,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029904029] [2022-12-13 02:22:53,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:53,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:54,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:22:54,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:54,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029904029] [2022-12-13 02:22:54,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029904029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:54,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:54,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:54,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108393311] [2022-12-13 02:22:54,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:54,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:54,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:54,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:54,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:54,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:54,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:54,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:54,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:54,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:54,108 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:54,108 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:54,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:54,109 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:54,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:54,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:54,110 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:54,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:54,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:54,112 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,112 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:54,113 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:54,113 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:54,113 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,113 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:54,113 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:54,113 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:54,118 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:54,118 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:54,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:54,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:54,119 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:54,207 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:54,208 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:54,208 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:54,208 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 02:22:54,208 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:54,208 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:54,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1999 [2022-12-13 02:22:54,208 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:22:54,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1522922983, now seen corresponding path program 1 times [2022-12-13 02:22:54,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:54,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505585679] [2022-12-13 02:22:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:54,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:54,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:22:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:54,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505585679] [2022-12-13 02:22:54,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505585679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:54,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:54,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:54,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73985794] [2022-12-13 02:22:54,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:54,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:54,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:54,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:54,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:54,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:54,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:54,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:54,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:54,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:54,327 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:54,328 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:54,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:54,329 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:54,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:54,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:54,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:54,329 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:54,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:54,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:54,331 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:54,332 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:54,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:54,332 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,332 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:54,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:54,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:54,337 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:54,337 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:54,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:54,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:54,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:54,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:54,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:54,427 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:54,427 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 02:22:54,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:54,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:54,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2000 [2022-12-13 02:22:54,427 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:22:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1551552134, now seen corresponding path program 1 times [2022-12-13 02:22:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:54,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393009789] [2022-12-13 02:22:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:54,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:54,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:22:54,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:54,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393009789] [2022-12-13 02:22:54,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393009789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:54,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:54,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:54,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757759146] [2022-12-13 02:22:54,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:54,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:54,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:54,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:54,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:54,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:54,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:54,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:54,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:54,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:54,546 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:54,546 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:54,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:54,547 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:54,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:54,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:54,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:54,548 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:54,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:54,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:54,550 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,550 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:54,550 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:54,550 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:54,550 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,551 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:54,551 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:54,551 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:54,556 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:54,556 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:22:54,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:54,557 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:54,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:54,646 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:54,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:54,647 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:54,647 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 02:22:54,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:54,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:54,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2001 [2022-12-13 02:22:54,647 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:22:54,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:54,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1580181285, now seen corresponding path program 1 times [2022-12-13 02:22:54,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:54,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737068493] [2022-12-13 02:22:54,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:54,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:54,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:22:54,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:54,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737068493] [2022-12-13 02:22:54,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737068493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:54,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:54,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:54,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237475223] [2022-12-13 02:22:54,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:54,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:54,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:54,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:54,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:54,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:54,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:54,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:54,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:54,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:54,775 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:54,775 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:54,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:54,776 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:54,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:54,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:54,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:54,777 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:54,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:54,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:54,780 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,780 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:54,780 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:54,780 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:54,780 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:54,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:54,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:54,786 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:54,786 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:54,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:54,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:54,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:54,875 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:54,876 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:54,876 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:54,876 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 02:22:54,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:54,876 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:54,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2002 [2022-12-13 02:22:54,876 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:22:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1608810436, now seen corresponding path program 1 times [2022-12-13 02:22:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:54,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406952447] [2022-12-13 02:22:54,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:54,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:54,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 02:22:54,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:54,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406952447] [2022-12-13 02:22:54,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406952447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:54,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:54,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:54,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382630016] [2022-12-13 02:22:54,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:54,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:54,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:54,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:54,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:54,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:54,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:54,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:54,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:54,994 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:54,994 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:54,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:54,995 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:54,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:54,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:54,996 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:54,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:54,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:54,998 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,998 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:54,998 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:54,998 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:54,998 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,999 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:54,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:54,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:54,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:55,004 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:55,004 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:55,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:55,005 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:55,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:55,094 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:55,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:55,094 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:55,095 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 02:22:55,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:55,095 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:55,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2003 [2022-12-13 02:22:55,095 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:22:55,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:55,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1637439587, now seen corresponding path program 1 times [2022-12-13 02:22:55,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:55,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646290804] [2022-12-13 02:22:55,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:55,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:55,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:22:55,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:55,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646290804] [2022-12-13 02:22:55,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646290804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:55,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:55,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:55,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184779914] [2022-12-13 02:22:55,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:55,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:55,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:55,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:55,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:55,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:55,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:55,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:55,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:55,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:55,222 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:55,222 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:55,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:55,223 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:55,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:55,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:55,224 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:55,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:55,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:55,226 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:55,226 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:55,227 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:55,227 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:55,227 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:55,227 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:55,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:55,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:55,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:55,232 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:55,233 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:22:55,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:55,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:55,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:55,322 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:55,323 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:55,323 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:55,323 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 02:22:55,323 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:55,323 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:55,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2004 [2022-12-13 02:22:55,323 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:22:55,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1666068738, now seen corresponding path program 1 times [2022-12-13 02:22:55,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:55,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896899928] [2022-12-13 02:22:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:55,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:55,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:22:55,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:55,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896899928] [2022-12-13 02:22:55,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896899928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:55,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:55,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145927824] [2022-12-13 02:22:55,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:55,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:55,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:55,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:55,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:55,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:55,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:55,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:55,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:55,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:55,443 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:55,444 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:55,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:55,445 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:55,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:55,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:55,445 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:55,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:55,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:55,448 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:55,448 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:55,448 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:55,448 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:55,448 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:55,448 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:55,448 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:55,448 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:55,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:55,454 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:55,454 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:22:55,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:55,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:55,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:55,543 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:55,543 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:55,543 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:55,543 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 02:22:55,543 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:55,543 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:55,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2005 [2022-12-13 02:22:55,543 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:22:55,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1694697889, now seen corresponding path program 1 times [2022-12-13 02:22:55,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:55,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265121881] [2022-12-13 02:22:55,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:55,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:22:55,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:55,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265121881] [2022-12-13 02:22:55,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265121881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:55,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:55,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:55,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102624099] [2022-12-13 02:22:55,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:55,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:55,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:55,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:55,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:55,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:55,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:55,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:55,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:55,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:55,672 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:55,672 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:55,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:55,673 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:55,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:55,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:55,673 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:55,673 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:55,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:55,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:55,676 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:55,676 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:55,676 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:55,676 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:55,676 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:55,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:55,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:55,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:55,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:55,682 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:55,682 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:55,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:55,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:55,683 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:55,772 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:55,773 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:22:55,773 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:55,773 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 02:22:55,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:55,773 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:55,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2006 [2022-12-13 02:22:55,773 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:22:55,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:55,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1723327040, now seen corresponding path program 1 times [2022-12-13 02:22:55,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:55,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593678488] [2022-12-13 02:22:55,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:55,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:22:55,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:55,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593678488] [2022-12-13 02:22:55,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593678488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:55,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:55,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:55,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768628891] [2022-12-13 02:22:55,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:55,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:55,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:55,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:55,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:55,826 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:55,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:55,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:55,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:55,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:55,893 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:55,893 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:55,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:55,894 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:55,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:55,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:55,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:55,895 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:55,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:55,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:55,898 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:55,898 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:55,898 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:55,898 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:55,898 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:55,898 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:55,898 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:55,898 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:55,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:55,904 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:55,904 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:22:55,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:55,904 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:55,904 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:55,996 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:55,996 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:22:55,996 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:55,996 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 02:22:55,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:55,997 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:55,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2007 [2022-12-13 02:22:55,997 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:22:55,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1751956191, now seen corresponding path program 1 times [2022-12-13 02:22:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:55,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335455102] [2022-12-13 02:22:55,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:55,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:56,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:22:56,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:56,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335455102] [2022-12-13 02:22:56,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335455102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:56,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:56,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:56,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55649799] [2022-12-13 02:22:56,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:56,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:56,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:56,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:56,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:56,052 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:56,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:56,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:56,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:56,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:56,130 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:56,130 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:56,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:56,131 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:56,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:56,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:56,132 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:56,132 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:56,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:56,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:56,134 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:56,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:56,135 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:56,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:56,135 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:56,135 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:56,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:56,135 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:56,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:56,141 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:56,141 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:22:56,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:56,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:56,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:56,231 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:56,231 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:56,231 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:56,231 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 02:22:56,231 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:56,231 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:56,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2008 [2022-12-13 02:22:56,231 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:22:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1780585342, now seen corresponding path program 1 times [2022-12-13 02:22:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:56,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586025871] [2022-12-13 02:22:56,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:56,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:22:56,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:56,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586025871] [2022-12-13 02:22:56,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586025871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:56,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:56,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72904879] [2022-12-13 02:22:56,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:56,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:56,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:56,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:56,285 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:56,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:56,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:56,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:56,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:56,361 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:56,361 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:56,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:56,362 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:56,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:56,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:56,363 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:56,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:56,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:56,365 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:56,365 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:56,366 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:56,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:56,366 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:56,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:56,366 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:56,366 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:56,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:56,371 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:56,372 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:56,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:56,372 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:56,372 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:56,460 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:56,460 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:56,460 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:56,460 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 02:22:56,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:56,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:56,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2009 [2022-12-13 02:22:56,461 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:22:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1809214493, now seen corresponding path program 1 times [2022-12-13 02:22:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:56,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896656664] [2022-12-13 02:22:56,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:22:56,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:56,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896656664] [2022-12-13 02:22:56,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896656664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:56,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:56,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:56,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899649230] [2022-12-13 02:22:56,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:56,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:56,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:56,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:56,514 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:56,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:56,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:56,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:56,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:56,591 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:56,591 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:56,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:56,592 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:56,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:56,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:56,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:56,593 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:56,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:56,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:56,595 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:56,595 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:56,595 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:56,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:56,596 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:56,596 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:56,596 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:56,596 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:56,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:56,601 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:56,601 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:56,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:56,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:56,602 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:56,691 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:56,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:56,691 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:56,692 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 02:22:56,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:56,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:56,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2010 [2022-12-13 02:22:56,692 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:22:56,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:56,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1837843644, now seen corresponding path program 1 times [2022-12-13 02:22:56,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:56,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929564208] [2022-12-13 02:22:56,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:56,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:56,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:22:56,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:56,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929564208] [2022-12-13 02:22:56,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929564208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:56,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:56,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:56,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703103785] [2022-12-13 02:22:56,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:56,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:56,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:56,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:56,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:56,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:56,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:56,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:56,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:56,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:56,819 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:56,820 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:56,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:56,821 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:56,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:56,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:56,821 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:56,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:56,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:56,824 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:56,824 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:56,824 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:56,824 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:56,824 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:56,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:56,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:56,824 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:56,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:56,830 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:56,830 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:56,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:56,831 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:56,831 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:56,919 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:56,920 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:56,920 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:56,920 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 02:22:56,920 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:56,920 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:56,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2011 [2022-12-13 02:22:56,920 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:22:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:56,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1866472795, now seen corresponding path program 1 times [2022-12-13 02:22:56,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:56,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97605212] [2022-12-13 02:22:56,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:56,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:56,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:22:56,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:56,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97605212] [2022-12-13 02:22:56,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97605212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:56,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:56,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:56,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498365894] [2022-12-13 02:22:56,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:56,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:56,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:56,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:56,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:56,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:56,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:56,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:56,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:56,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:57,040 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:57,040 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:57,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:57,041 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:57,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:57,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:57,041 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:57,041 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:57,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:57,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:57,044 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:57,044 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:57,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:57,044 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,044 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:57,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:57,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:57,050 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:57,050 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:57,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:57,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:57,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:57,142 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:57,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:22:57,142 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:57,143 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 02:22:57,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:57,143 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:57,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2012 [2022-12-13 02:22:57,143 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:22:57,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:57,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1895101946, now seen corresponding path program 1 times [2022-12-13 02:22:57,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:57,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140469239] [2022-12-13 02:22:57,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:57,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:57,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:22:57,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:57,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140469239] [2022-12-13 02:22:57,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140469239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:57,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:57,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:57,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181845116] [2022-12-13 02:22:57,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:57,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:57,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:57,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:57,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:57,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:57,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:57,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:57,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:57,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:57,268 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:57,268 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:57,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:57,269 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:57,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:57,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:57,269 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:57,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:57,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:57,272 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:57,272 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:57,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:57,272 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:57,273 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:57,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:57,278 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:57,278 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:22:57,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:57,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:57,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:57,366 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:57,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:57,367 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:57,367 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 02:22:57,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:57,367 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:57,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2013 [2022-12-13 02:22:57,367 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:22:57,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1923731097, now seen corresponding path program 1 times [2022-12-13 02:22:57,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:57,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005383263] [2022-12-13 02:22:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:57,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:57,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:22:57,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:57,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005383263] [2022-12-13 02:22:57,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005383263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:57,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:57,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:57,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175087207] [2022-12-13 02:22:57,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:57,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:57,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:57,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:57,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:57,427 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:57,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:57,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:57,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:57,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:57,507 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:57,508 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:57,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:57,509 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:57,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:57,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:57,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:57,509 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:57,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:57,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:57,512 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:57,512 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:57,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:57,512 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:57,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:57,512 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:57,518 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:57,518 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:57,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:57,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:57,519 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:57,606 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:57,606 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:57,606 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:57,606 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 02:22:57,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:57,606 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:57,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2014 [2022-12-13 02:22:57,606 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:22:57,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:57,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1952360248, now seen corresponding path program 1 times [2022-12-13 02:22:57,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:57,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696281103] [2022-12-13 02:22:57,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:57,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:22:57,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:57,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696281103] [2022-12-13 02:22:57,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696281103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:57,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:57,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:57,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030483296] [2022-12-13 02:22:57,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:57,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:57,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:57,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:57,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:57,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:57,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:57,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:57,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:57,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:57,724 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:57,724 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:57,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:57,725 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:57,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:57,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:57,725 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:57,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:57,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:57,728 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,728 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:57,728 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:57,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:57,728 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,729 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:57,729 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:57,729 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:57,734 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:57,734 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:57,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:57,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:57,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:57,822 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:57,822 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:57,822 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:57,823 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 02:22:57,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:57,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:57,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2015 [2022-12-13 02:22:57,823 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:22:57,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:57,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1980989399, now seen corresponding path program 1 times [2022-12-13 02:22:57,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:57,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467809849] [2022-12-13 02:22:57,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:57,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:57,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 02:22:57,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:57,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467809849] [2022-12-13 02:22:57,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467809849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:57,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:57,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:57,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921851797] [2022-12-13 02:22:57,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:57,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:57,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:57,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:57,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:57,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:57,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:57,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:57,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:57,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:57,949 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:57,949 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:22:57,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:57,950 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:57,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:57,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:57,950 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:57,950 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:57,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:57,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:57,953 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,953 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:57,953 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:57,953 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:57,953 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,953 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:57,953 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:57,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:57,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:57,959 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:57,959 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:22:57,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:57,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:57,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:58,047 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:58,047 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:58,047 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:58,047 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 02:22:58,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:58,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:58,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2016 [2022-12-13 02:22:58,048 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:22:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:58,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2009618550, now seen corresponding path program 1 times [2022-12-13 02:22:58,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:58,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979839305] [2022-12-13 02:22:58,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:58,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:58,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:22:58,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:58,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979839305] [2022-12-13 02:22:58,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979839305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:58,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:58,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:58,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780784180] [2022-12-13 02:22:58,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:58,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:58,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:58,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:58,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:58,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:58,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:58,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:58,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:58,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:58,182 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:58,182 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:58,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:58,183 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:58,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:58,184 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:58,184 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:58,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:58,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:58,186 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:58,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:58,187 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:58,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:58,187 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:58,187 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:58,187 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:58,187 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:58,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:58,192 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:58,193 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:58,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:58,193 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:58,193 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:58,279 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:58,280 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:22:58,280 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:58,280 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 02:22:58,280 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:58,280 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:58,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2017 [2022-12-13 02:22:58,280 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:22:58,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:58,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2038247701, now seen corresponding path program 1 times [2022-12-13 02:22:58,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:58,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237798269] [2022-12-13 02:22:58,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:58,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:58,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:22:58,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:58,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237798269] [2022-12-13 02:22:58,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237798269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:58,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:58,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:58,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442506549] [2022-12-13 02:22:58,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:58,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:58,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:58,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:58,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:58,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:58,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:58,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:58,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:58,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:58,399 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:58,399 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:22:58,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:58,400 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:58,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:58,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:58,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:58,401 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:58,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:58,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:58,403 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:58,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:58,403 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:58,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:58,404 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:58,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:58,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:58,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:58,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:58,409 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:58,410 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:58,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:58,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:58,410 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:58,499 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:58,500 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:58,500 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:58,500 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 02:22:58,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:58,500 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:58,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2018 [2022-12-13 02:22:58,500 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:22:58,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:58,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2066876852, now seen corresponding path program 1 times [2022-12-13 02:22:58,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:58,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129138483] [2022-12-13 02:22:58,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:58,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:58,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:22:58,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:58,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129138483] [2022-12-13 02:22:58,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129138483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:58,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:58,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:58,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230170981] [2022-12-13 02:22:58,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:58,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:58,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:58,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:58,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:58,554 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:58,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:58,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:58,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:58,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:58,630 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:58,630 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:58,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:58,631 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:58,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:58,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:58,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:58,632 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:58,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:58,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:58,634 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:58,634 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:58,634 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:58,634 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:58,635 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:58,635 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:58,635 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:58,635 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:58,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:58,640 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:58,640 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:58,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:58,641 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:58,641 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:58,729 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:58,729 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:58,729 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:58,729 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 02:22:58,729 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:58,729 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:58,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2019 [2022-12-13 02:22:58,729 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:22:58,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:58,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2095506003, now seen corresponding path program 1 times [2022-12-13 02:22:58,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:58,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379828692] [2022-12-13 02:22:58,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:58,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:58,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:22:58,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:58,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379828692] [2022-12-13 02:22:58,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379828692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:58,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:58,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:58,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482320404] [2022-12-13 02:22:58,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:58,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:58,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:58,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:58,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:58,784 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:58,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:58,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:58,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:58,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:58,850 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:58,850 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:58,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:58,851 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:58,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:58,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:58,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:58,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:58,852 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:58,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:58,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:58,855 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:58,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:58,855 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:58,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:58,855 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:58,855 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:58,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:58,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:58,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:58,861 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:58,861 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:22:58,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:58,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:58,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:58,948 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:58,949 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:22:58,949 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:58,949 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 02:22:58,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:58,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:58,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2020 [2022-12-13 02:22:58,949 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:22:58,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:58,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2124135154, now seen corresponding path program 1 times [2022-12-13 02:22:58,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:58,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817537251] [2022-12-13 02:22:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:58,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:59,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:22:59,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:59,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817537251] [2022-12-13 02:22:59,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817537251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:59,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:59,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:59,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209329939] [2022-12-13 02:22:59,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:59,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:59,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:59,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:59,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:59,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:59,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:59,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:59,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:59,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:59,078 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:59,079 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:59,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:59,080 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:59,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:59,080 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:59,080 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:59,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:59,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:59,083 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:59,083 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:59,083 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:59,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:59,083 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:59,083 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:59,083 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:59,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:59,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:59,089 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:59,089 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:22:59,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:59,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:59,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:59,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:59,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:59,178 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:59,178 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 02:22:59,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:59,178 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:59,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2021 [2022-12-13 02:22:59,178 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:22:59,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:59,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2142202991, now seen corresponding path program 1 times [2022-12-13 02:22:59,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:59,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278771695] [2022-12-13 02:22:59,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:59,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:59,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:22:59,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:59,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278771695] [2022-12-13 02:22:59,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278771695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:59,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:59,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:59,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130487038] [2022-12-13 02:22:59,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:59,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:59,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:59,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:59,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:59,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:59,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:59,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:59,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:59,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:59,322 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:59,322 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:59,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:59,323 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:59,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:59,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:59,323 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:59,323 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:59,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:59,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:59,326 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:59,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:59,326 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:59,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:59,326 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:59,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:59,327 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:59,327 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:59,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:59,332 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:59,332 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:22:59,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:59,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:59,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:59,421 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:59,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:59,422 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:59,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:59,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:59,422 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:59,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2022 [2022-12-13 02:22:59,422 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:22:59,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2113573840, now seen corresponding path program 1 times [2022-12-13 02:22:59,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:59,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32270678] [2022-12-13 02:22:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:59,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:59,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:22:59,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:59,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32270678] [2022-12-13 02:22:59,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32270678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:59,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:59,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:59,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081597972] [2022-12-13 02:22:59,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:59,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:59,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:59,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:59,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:59,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:59,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:59,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:59,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:59,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:59,549 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:59,549 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:22:59,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:59,550 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:59,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:59,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:59,551 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:59,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:59,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:59,553 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:59,553 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:59,553 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:59,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:59,553 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:59,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:59,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:59,554 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:59,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:59,559 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:59,559 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:22:59,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:59,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:59,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:59,649 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:59,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:22:59,649 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:59,649 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 02:22:59,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:59,649 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:59,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2023 [2022-12-13 02:22:59,650 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:22:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2084944689, now seen corresponding path program 1 times [2022-12-13 02:22:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:59,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259358331] [2022-12-13 02:22:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:59,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:59,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:22:59,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:59,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259358331] [2022-12-13 02:22:59,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259358331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:59,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:59,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:22:59,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922393031] [2022-12-13 02:22:59,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:59,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:22:59,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:59,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:22:59,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:22:59,702 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:59,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:22:59,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:59,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:59,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:22:59,778 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:22:59,779 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:22:59,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:22:59,780 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:22:59,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:22:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:22:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:22:59,780 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:22:59,780 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:22:59,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:22:59,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:22:59,783 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:59,783 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:22:59,783 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:22:59,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:22:59,783 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:59,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:22:59,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:22:59,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:22:59,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:59,789 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:22:59,789 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:22:59,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:22:59,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:22:59,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:22:59,878 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:22:59,878 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:22:59,878 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:22:59,878 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 02:22:59,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:22:59,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:59,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2024 [2022-12-13 02:22:59,879 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:22:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:22:59,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2056315538, now seen corresponding path program 1 times [2022-12-13 02:22:59,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:22:59,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110951481] [2022-12-13 02:22:59,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:22:59,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:22:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:22:59,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:22:59,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:22:59,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110951481] [2022-12-13 02:22:59,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110951481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:22:59,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:22:59,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:22:59,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940183361] [2022-12-13 02:22:59,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:22:59,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:22:59,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:22:59,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:22:59,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:22:59,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:22:59,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:22:59,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:22:59,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:22:59,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:00,032 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:00,033 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:00,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:00,034 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:00,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:00,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:00,034 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:00,034 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:00,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:00,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:00,037 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,037 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:00,037 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:00,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:00,037 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,037 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:00,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:00,038 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:00,043 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:00,043 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:00,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:00,044 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:00,044 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:00,131 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:00,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:00,131 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:00,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:00,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:00,132 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:00,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2025 [2022-12-13 02:23:00,132 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:23:00,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:00,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2027686387, now seen corresponding path program 1 times [2022-12-13 02:23:00,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:00,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905928393] [2022-12-13 02:23:00,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:00,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:00,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:23:00,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:00,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905928393] [2022-12-13 02:23:00,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905928393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:00,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:00,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:00,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387423782] [2022-12-13 02:23:00,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:00,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:00,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:00,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:00,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:00,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:00,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:00,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:00,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:00,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:00,263 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:00,264 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:00,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:00,265 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:00,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:00,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:00,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:00,265 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:00,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:00,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:00,268 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,268 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:00,268 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:00,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:00,268 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,268 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:00,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:00,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:00,274 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:00,274 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:00,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:00,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:00,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:00,361 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:00,362 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:00,362 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:00,362 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 02:23:00,362 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:00,362 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:00,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2026 [2022-12-13 02:23:00,362 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:23:00,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1999057236, now seen corresponding path program 1 times [2022-12-13 02:23:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:00,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586373627] [2022-12-13 02:23:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:00,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:23:00,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:00,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586373627] [2022-12-13 02:23:00,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586373627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:00,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:00,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:00,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658519364] [2022-12-13 02:23:00,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:00,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:00,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:00,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:00,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:00,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:00,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:00,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:00,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:00,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:00,479 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:00,479 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:00,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:00,480 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:00,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:00,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:00,481 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:00,481 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:00,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:00,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:00,484 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,484 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:00,484 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:00,484 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:00,484 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,484 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:00,484 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:00,484 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:00,490 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:00,490 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:00,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:00,490 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:00,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:00,577 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:00,578 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:00,578 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:00,578 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 02:23:00,578 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:00,578 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:00,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2027 [2022-12-13 02:23:00,578 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:23:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:00,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1970428085, now seen corresponding path program 1 times [2022-12-13 02:23:00,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:00,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916525502] [2022-12-13 02:23:00,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:00,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:00,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:23:00,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:00,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916525502] [2022-12-13 02:23:00,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916525502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:00,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:00,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:00,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798263301] [2022-12-13 02:23:00,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:00,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:00,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:00,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:00,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:00,631 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:00,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:00,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:00,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:00,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:00,707 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:00,707 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:00,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:00,708 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:00,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:00,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:00,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:00,709 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:00,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:00,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:00,711 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:00,711 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:00,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:00,711 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:00,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:00,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:00,717 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:00,717 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:00,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:00,718 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:00,718 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:00,806 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:00,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:00,806 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:00,806 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 02:23:00,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:00,806 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:00,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2028 [2022-12-13 02:23:00,807 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:23:00,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1941798934, now seen corresponding path program 1 times [2022-12-13 02:23:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:00,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520900025] [2022-12-13 02:23:00,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:00,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:00,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:23:00,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:00,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520900025] [2022-12-13 02:23:00,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520900025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:00,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:00,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157679841] [2022-12-13 02:23:00,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:00,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:00,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:00,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:00,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:00,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:00,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:00,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:00,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:00,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:00,927 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:00,928 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:00,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:00,929 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:00,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:00,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:00,929 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:00,929 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:00,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:00,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:00,932 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,932 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:00,932 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:00,932 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:00,932 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:00,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:00,933 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:00,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:00,938 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:00,938 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:00,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:00,939 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:00,939 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:01,025 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:01,025 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:01,025 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:01,025 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 02:23:01,026 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:01,026 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:01,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2029 [2022-12-13 02:23:01,026 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:23:01,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:01,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1913169783, now seen corresponding path program 1 times [2022-12-13 02:23:01,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:01,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681715401] [2022-12-13 02:23:01,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:01,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:01,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:23:01,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:01,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681715401] [2022-12-13 02:23:01,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681715401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:01,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:01,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:01,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128905456] [2022-12-13 02:23:01,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:01,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:01,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:01,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:01,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:01,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:01,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:01,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:01,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:01,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:01,145 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:01,145 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:01,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:01,156 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:01,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:01,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:01,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:01,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:01,156 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:01,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:01,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:01,159 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:01,159 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:01,159 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:01,159 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:01,159 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:01,159 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:01,159 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:01,159 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:01,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:01,165 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:01,165 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:23:01,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:01,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:01,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:01,253 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:01,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:01,254 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:01,254 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 02:23:01,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:01,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:01,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2030 [2022-12-13 02:23:01,254 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:23:01,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:01,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1884540632, now seen corresponding path program 1 times [2022-12-13 02:23:01,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:01,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395322137] [2022-12-13 02:23:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:01,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:01,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:23:01,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:01,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395322137] [2022-12-13 02:23:01,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395322137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:01,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:01,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:01,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15188267] [2022-12-13 02:23:01,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:01,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:01,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:01,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:01,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:01,304 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:01,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:01,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:01,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:01,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:01,378 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:01,379 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:01,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:01,380 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:01,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:01,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:01,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:01,380 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:01,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:01,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:01,383 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:01,383 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:01,383 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:01,383 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:01,383 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:01,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:01,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:01,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:01,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:01,389 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:01,389 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:01,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:01,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:01,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:01,476 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:01,476 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:01,476 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:01,476 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 02:23:01,476 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:01,476 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:01,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2031 [2022-12-13 02:23:01,476 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:23:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:01,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1855911481, now seen corresponding path program 1 times [2022-12-13 02:23:01,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:01,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996397213] [2022-12-13 02:23:01,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:01,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:01,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:23:01,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:01,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996397213] [2022-12-13 02:23:01,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996397213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:01,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:01,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:01,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772661746] [2022-12-13 02:23:01,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:01,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:01,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:01,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:01,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:01,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:01,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:01,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:01,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:01,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:01,602 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:01,602 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:01,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:01,603 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:01,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:01,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:01,604 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:01,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:01,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:01,606 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:01,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:01,606 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:01,606 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:01,606 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:01,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:01,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:01,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:01,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:01,612 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:01,612 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:01,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:01,613 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:01,613 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:01,700 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:01,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:01,700 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:01,700 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 02:23:01,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:01,700 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:01,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2032 [2022-12-13 02:23:01,701 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:23:01,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1827282330, now seen corresponding path program 1 times [2022-12-13 02:23:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:01,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206299702] [2022-12-13 02:23:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:01,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:23:01,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:01,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206299702] [2022-12-13 02:23:01,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206299702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:01,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:01,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:01,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548165385] [2022-12-13 02:23:01,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:01,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:01,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:01,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:01,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:01,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:01,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:01,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:01,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:01,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:01,830 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:01,830 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:01,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:01,831 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:01,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:01,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:01,831 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:01,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:01,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:01,834 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:01,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:01,834 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:01,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:01,834 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:01,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:01,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:01,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:01,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:01,840 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:01,840 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:01,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 444 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:01,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:01,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:01,927 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:01,928 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:01,928 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:01,928 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 02:23:01,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:01,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:01,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2033 [2022-12-13 02:23:01,928 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:23:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1798653179, now seen corresponding path program 1 times [2022-12-13 02:23:01,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:01,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605152440] [2022-12-13 02:23:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:01,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:23:01,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:01,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605152440] [2022-12-13 02:23:01,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605152440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:01,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:01,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:01,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020912912] [2022-12-13 02:23:01,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:01,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:01,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:01,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:01,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:01,997 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:01,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:01,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:01,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:01,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:02,082 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:02,082 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:02,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:02,083 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:02,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:02,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:02,084 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:02,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:02,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:02,086 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:02,086 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:02,086 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:02,087 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:02,087 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:02,087 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:02,087 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:02,087 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:02,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:02,092 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:02,092 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:02,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:02,093 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:02,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:02,179 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:02,180 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:02,180 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:02,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:02,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:02,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:02,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2034 [2022-12-13 02:23:02,180 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:23:02,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:02,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1770024028, now seen corresponding path program 1 times [2022-12-13 02:23:02,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:02,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442621259] [2022-12-13 02:23:02,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:02,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:02,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:23:02,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:02,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442621259] [2022-12-13 02:23:02,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442621259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:02,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:02,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:02,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856803279] [2022-12-13 02:23:02,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:02,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:02,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:02,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:02,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:02,257 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:02,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:02,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:02,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:02,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:02,325 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:02,325 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:02,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:02,326 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:02,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:02,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:02,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:02,327 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:02,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:02,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:02,329 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:02,330 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:02,330 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:02,330 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:02,330 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:02,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:02,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:02,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:02,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:02,336 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:02,336 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:02,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:02,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:02,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:02,423 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:02,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:02,424 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:02,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:02,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:02,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:02,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2035 [2022-12-13 02:23:02,424 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:23:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1741394877, now seen corresponding path program 1 times [2022-12-13 02:23:02,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:02,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096906943] [2022-12-13 02:23:02,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:02,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:02,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:23:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:02,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096906943] [2022-12-13 02:23:02,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096906943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:02,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:02,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:02,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344047503] [2022-12-13 02:23:02,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:02,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:02,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:02,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:02,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:02,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:02,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:02,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:02,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:02,550 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:02,550 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:02,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:02,551 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:02,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:02,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:02,552 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:02,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:02,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:02,554 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:02,554 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:02,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:02,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:02,555 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:02,555 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:02,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:02,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:02,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:02,560 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:02,561 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:02,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:02,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:02,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:02,649 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:02,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:02,649 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:02,649 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 02:23:02,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:02,649 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:02,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2036 [2022-12-13 02:23:02,650 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:23:02,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:02,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1712765726, now seen corresponding path program 1 times [2022-12-13 02:23:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:02,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936587732] [2022-12-13 02:23:02,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:02,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:02,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:23:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:02,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936587732] [2022-12-13 02:23:02,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936587732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:02,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:02,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286801758] [2022-12-13 02:23:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:02,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:02,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:02,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:02,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:02,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:02,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:02,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:02,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:02,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:02,803 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:02,803 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:02,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:02,804 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:02,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:02,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:02,804 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:02,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:02,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:02,807 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:02,807 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:02,807 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:02,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:02,807 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:02,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:02,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:02,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:02,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:02,813 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:02,813 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:02,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:02,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:02,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:02,900 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:02,901 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:02,901 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:02,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:02,901 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:02,901 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:02,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2037 [2022-12-13 02:23:02,901 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:23:02,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:02,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1684136575, now seen corresponding path program 1 times [2022-12-13 02:23:02,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:02,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291653180] [2022-12-13 02:23:02,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:02,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:02,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 02:23:02,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:02,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291653180] [2022-12-13 02:23:02,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291653180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:02,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:02,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:02,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927811998] [2022-12-13 02:23:02,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:02,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:02,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:02,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:02,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:02,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:02,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:02,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:02,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:02,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:03,031 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:03,031 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:03,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:03,032 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:03,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:03,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:03,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:03,033 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:03,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:03,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:03,035 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,035 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:03,035 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:03,035 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:03,035 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,036 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:03,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:03,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:03,041 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:03,041 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:03,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:03,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:03,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:03,130 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:03,130 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:03,131 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:03,131 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 02:23:03,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:03,131 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:03,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2038 [2022-12-13 02:23:03,131 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:23:03,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:03,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1655507424, now seen corresponding path program 1 times [2022-12-13 02:23:03,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:03,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140080203] [2022-12-13 02:23:03,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:03,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:03,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:03,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140080203] [2022-12-13 02:23:03,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140080203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:03,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:03,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:03,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150970891] [2022-12-13 02:23:03,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:03,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:03,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:03,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:03,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:03,196 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:03,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:03,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:03,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:03,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:03,272 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:03,272 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:03,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:03,273 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:03,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:03,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:03,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:03,273 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:03,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:03,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:03,276 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,276 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:03,276 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:03,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:03,277 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,277 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:03,277 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:03,277 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:03,282 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:03,283 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:03,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:03,283 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:03,283 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:03,370 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:03,371 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:03,371 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:03,371 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 02:23:03,371 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:03,371 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:03,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2039 [2022-12-13 02:23:03,371 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:23:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:03,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1626878273, now seen corresponding path program 1 times [2022-12-13 02:23:03,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:03,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941906076] [2022-12-13 02:23:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:03,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:03,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:03,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941906076] [2022-12-13 02:23:03,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941906076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:03,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:03,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:03,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701961082] [2022-12-13 02:23:03,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:03,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:03,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:03,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:03,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:03,423 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:03,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:03,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:03,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:03,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:03,498 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:03,498 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:03,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:03,499 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:03,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:03,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:03,500 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:03,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:03,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:03,502 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,502 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:03,502 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:03,502 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:03,502 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,503 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:03,503 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:03,503 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:03,508 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:03,508 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:03,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:03,509 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:03,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:03,596 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:03,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:03,597 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:03,597 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 02:23:03,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:03,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:03,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2040 [2022-12-13 02:23:03,597 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:23:03,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:03,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1598249122, now seen corresponding path program 1 times [2022-12-13 02:23:03,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:03,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569677666] [2022-12-13 02:23:03,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:03,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:03,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:23:03,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:03,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569677666] [2022-12-13 02:23:03,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569677666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:03,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:03,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:03,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835618041] [2022-12-13 02:23:03,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:03,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:03,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:03,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:03,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:03,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:03,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:03,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:03,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:03,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:03,725 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:03,725 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:03,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:03,726 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:03,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:03,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:03,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:03,727 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:03,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:03,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:03,729 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,730 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:03,730 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:03,730 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:03,730 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:03,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:03,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:03,736 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:03,736 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:23:03,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:03,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:03,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:03,823 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:03,824 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:03,824 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:03,824 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 02:23:03,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:03,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:03,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2041 [2022-12-13 02:23:03,824 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:23:03,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:03,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1569619971, now seen corresponding path program 1 times [2022-12-13 02:23:03,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:03,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2207803] [2022-12-13 02:23:03,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:03,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:03,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:23:03,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:03,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2207803] [2022-12-13 02:23:03,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2207803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:03,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:03,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:03,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959559873] [2022-12-13 02:23:03,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:03,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:03,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:03,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:03,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:03,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:03,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:03,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:03,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:03,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:03,953 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:03,953 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:03,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:03,954 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:03,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:03,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:03,954 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:03,954 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:03,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:03,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:03,957 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,957 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:03,957 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:03,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:03,957 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:03,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:03,958 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:03,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:03,963 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:03,963 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:03,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:03,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:03,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:04,051 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:04,051 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:04,051 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:04,051 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 02:23:04,051 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:04,051 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:04,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2042 [2022-12-13 02:23:04,052 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:23:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1540990820, now seen corresponding path program 1 times [2022-12-13 02:23:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:04,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062834354] [2022-12-13 02:23:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:04,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:04,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:23:04,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:04,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062834354] [2022-12-13 02:23:04,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062834354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:04,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:04,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:04,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032073943] [2022-12-13 02:23:04,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:04,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:04,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:04,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:04,105 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:04,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:04,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:04,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:04,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:04,171 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:04,171 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:04,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:04,172 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:04,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:04,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:04,173 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:04,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:04,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:04,175 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:04,175 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:04,176 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:04,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:04,176 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:04,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:04,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:04,176 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:04,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:04,190 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:04,190 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:04,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:04,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:04,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:04,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:04,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:23:04,278 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:04,278 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 02:23:04,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:04,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:04,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2043 [2022-12-13 02:23:04,278 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:23:04,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:04,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1512361669, now seen corresponding path program 1 times [2022-12-13 02:23:04,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:04,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134528793] [2022-12-13 02:23:04,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:04,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 02:23:04,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:04,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134528793] [2022-12-13 02:23:04,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134528793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:04,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:04,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:04,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019340655] [2022-12-13 02:23:04,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:04,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:04,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:04,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:04,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:04,345 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:04,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:04,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:04,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:04,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:04,428 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:04,428 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:04,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:04,430 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:04,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:04,430 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:04,430 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:04,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:04,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:04,433 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:04,433 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:04,433 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:04,433 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:04,433 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:04,433 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:04,433 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:04,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:04,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:04,439 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:04,439 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:04,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:04,439 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:04,440 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:04,527 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:04,527 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:04,527 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:04,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:04,527 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:04,527 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:04,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2044 [2022-12-13 02:23:04,527 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:23:04,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:04,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1483732518, now seen corresponding path program 1 times [2022-12-13 02:23:04,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:04,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851898757] [2022-12-13 02:23:04,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:04,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:04,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:23:04,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:04,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851898757] [2022-12-13 02:23:04,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851898757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:04,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:04,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:04,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666345384] [2022-12-13 02:23:04,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:04,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:04,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:04,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:04,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:04,580 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:04,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:04,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:04,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:04,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:04,656 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:04,656 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:04,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:04,657 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:04,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:04,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:04,658 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:04,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:04,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:04,660 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:04,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:04,660 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:04,660 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:04,660 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:04,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:04,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:04,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:04,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:04,666 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:04,666 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:04,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:04,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:04,667 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:04,754 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:04,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:04,754 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:04,754 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 02:23:04,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:04,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:04,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2045 [2022-12-13 02:23:04,755 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:23:04,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:04,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1455103367, now seen corresponding path program 1 times [2022-12-13 02:23:04,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:04,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171609215] [2022-12-13 02:23:04,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:04,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:04,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 02:23:04,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:04,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171609215] [2022-12-13 02:23:04,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171609215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:04,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:04,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:04,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413258300] [2022-12-13 02:23:04,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:04,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:04,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:04,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:04,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:04,823 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:04,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:04,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:04,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:04,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:04,898 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:04,898 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:04,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:04,899 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:04,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:04,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:04,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:04,900 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:04,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:04,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:04,902 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:04,902 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:04,902 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:04,902 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:04,902 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:04,903 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:04,903 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:04,903 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:04,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:04,908 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:04,908 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:04,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:04,909 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:04,909 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:04,994 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:04,995 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:04,995 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:04,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:04,995 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:04,995 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:04,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2046 [2022-12-13 02:23:04,995 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:23:04,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:04,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1426474216, now seen corresponding path program 1 times [2022-12-13 02:23:04,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:04,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101003219] [2022-12-13 02:23:04,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:04,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:05,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:23:05,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:05,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101003219] [2022-12-13 02:23:05,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101003219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:05,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:05,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:05,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515921912] [2022-12-13 02:23:05,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:05,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:05,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:05,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:05,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:05,050 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:05,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:05,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:05,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:05,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:05,117 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:05,118 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:05,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:05,119 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:05,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:05,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:05,119 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:05,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:05,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:05,122 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:05,122 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:05,122 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:05,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:05,122 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:05,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:05,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:05,122 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:05,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:05,128 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:05,128 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:05,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:05,128 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:05,128 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:05,225 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:05,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:23:05,226 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:05,226 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 02:23:05,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:05,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:05,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2047 [2022-12-13 02:23:05,226 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:23:05,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:05,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1397845065, now seen corresponding path program 1 times [2022-12-13 02:23:05,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:05,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125549589] [2022-12-13 02:23:05,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:05,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23: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:23:05,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:05,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125549589] [2022-12-13 02:23:05,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125549589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:05,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:05,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:05,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182861455] [2022-12-13 02:23:05,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:05,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:05,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:05,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:05,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:05,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:05,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:05,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:05,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:05,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:05,362 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:05,362 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:05,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:05,363 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:05,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:05,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:05,364 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:05,364 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:05,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:05,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:05,366 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:05,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:05,367 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:05,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:05,367 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:05,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:05,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:05,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:05,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:05,373 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:05,373 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:05,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:05,373 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:05,373 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:05,459 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:05,459 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:23:05,459 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:05,460 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 02:23:05,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:05,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:05,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2048 [2022-12-13 02:23:05,460 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:23:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:05,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1369215914, now seen corresponding path program 1 times [2022-12-13 02:23:05,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:05,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139726305] [2022-12-13 02:23:05,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:05,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:05,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:23:05,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:05,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139726305] [2022-12-13 02:23:05,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139726305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:05,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:05,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:05,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518920573] [2022-12-13 02:23:05,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:05,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:05,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:05,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:05,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:05,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:05,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:05,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:05,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:05,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:05,601 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:05,602 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:05,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:05,603 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:05,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:05,603 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:05,603 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:05,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:05,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:05,606 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:05,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:05,606 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:05,606 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:05,606 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:05,606 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:05,606 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:05,606 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:05,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:05,612 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:05,612 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:05,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:05,612 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:05,612 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:05,701 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:05,701 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:05,701 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:05,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:05,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:05,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:05,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2049 [2022-12-13 02:23:05,702 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:23:05,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:05,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1340586763, now seen corresponding path program 1 times [2022-12-13 02:23:05,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:05,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312922282] [2022-12-13 02:23:05,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:05,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23: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:23:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:05,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312922282] [2022-12-13 02:23:05,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312922282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:05,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:05,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:05,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273285878] [2022-12-13 02:23:05,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:05,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:05,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:05,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:05,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:05,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:05,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:05,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:05,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:05,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:05,819 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:05,819 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:05,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:05,820 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:05,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:05,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:05,821 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:05,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:05,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:05,823 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:05,824 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:05,824 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:05,824 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:05,824 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:05,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:05,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:05,824 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:05,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:05,829 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:05,830 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:05,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:05,830 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:05,830 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:05,924 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:05,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:23:05,925 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:05,925 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 02:23:05,925 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:05,925 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:05,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2050 [2022-12-13 02:23:05,925 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:23:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1311957612, now seen corresponding path program 1 times [2022-12-13 02:23:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:05,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20768083] [2022-12-13 02:23:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:05,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:05,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:23:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:05,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20768083] [2022-12-13 02:23:05,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20768083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:05,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:05,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:05,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413486682] [2022-12-13 02:23:05,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:05,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:05,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:05,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:05,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:05,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:05,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:05,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:05,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:05,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:06,071 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:06,071 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:06,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:06,073 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:06,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:06,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:06,073 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:06,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:06,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:06,076 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:06,076 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:06,076 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:06,076 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:06,076 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:06,076 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:06,076 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:06,076 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:06,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:06,082 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:06,082 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:06,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:06,082 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:06,083 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:06,169 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:06,170 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:06,170 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:06,170 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 02:23:06,170 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:06,170 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:06,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2051 [2022-12-13 02:23:06,170 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:23:06,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:06,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1283328461, now seen corresponding path program 1 times [2022-12-13 02:23:06,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:06,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863568895] [2022-12-13 02:23:06,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:06,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:06,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:23:06,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:06,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863568895] [2022-12-13 02:23:06,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863568895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:06,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:06,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:06,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954223054] [2022-12-13 02:23:06,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:06,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:06,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:06,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:06,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:06,252 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:06,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:06,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:06,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:06,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:06,327 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:06,327 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:06,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:06,328 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:06,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:06,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:06,328 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:06,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:06,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:06,331 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:06,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:06,331 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:06,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:06,331 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:06,332 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:06,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:06,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:06,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:06,337 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:06,337 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:06,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:06,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:06,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:06,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:06,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:06,424 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:06,424 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 02:23:06,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:06,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:06,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2052 [2022-12-13 02:23:06,424 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:23:06,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:06,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1254699310, now seen corresponding path program 1 times [2022-12-13 02:23:06,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:06,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404404710] [2022-12-13 02:23:06,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:06,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:06,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:23:06,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:06,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404404710] [2022-12-13 02:23:06,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404404710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:06,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:06,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493675896] [2022-12-13 02:23:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:06,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:06,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:06,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:06,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:06,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:06,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:06,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:06,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:06,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:06,554 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:06,555 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:06,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:06,556 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:06,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:06,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:06,556 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:06,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:06,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:06,559 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:06,559 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:06,559 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:06,559 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:06,559 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:06,559 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:06,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:06,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:06,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:06,565 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:06,565 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:06,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:06,566 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:06,566 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:06,653 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:06,654 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:06,654 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:06,654 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 02:23:06,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:06,654 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:06,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2053 [2022-12-13 02:23:06,654 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:23:06,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:06,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1226070159, now seen corresponding path program 1 times [2022-12-13 02:23:06,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:06,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300555416] [2022-12-13 02:23:06,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:06,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:06,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:23:06,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:06,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300555416] [2022-12-13 02:23:06,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300555416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:06,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:06,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:06,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965903163] [2022-12-13 02:23:06,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:06,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:06,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:06,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:06,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:06,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:06,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:06,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:06,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:06,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:06,781 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:06,781 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:06,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:06,782 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:06,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:06,782 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:06,782 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:06,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:06,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:06,785 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:06,785 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:06,785 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:06,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:06,785 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:06,785 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:06,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:06,786 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:06,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:06,791 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:06,791 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:06,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:06,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:06,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:06,878 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:06,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:06,879 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:06,879 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 02:23:06,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:06,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:06,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2054 [2022-12-13 02:23:06,879 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:23:06,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:06,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1197441008, now seen corresponding path program 1 times [2022-12-13 02:23:06,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:06,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683075460] [2022-12-13 02:23:06,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:06,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:06,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:23:06,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:06,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683075460] [2022-12-13 02:23:06,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683075460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:06,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:06,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:06,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184737907] [2022-12-13 02:23:06,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:06,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:06,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:06,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:06,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:06,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:06,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:06,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:06,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:06,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:06,996 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:06,996 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:06,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:06,997 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:06,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:06,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:06,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:06,998 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:06,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:07,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:07,000 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:07,000 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:07,000 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:07,000 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,001 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:07,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:07,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:07,006 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:07,006 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:07,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:07,007 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:07,007 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:07,095 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:07,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:07,096 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:07,096 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 02:23:07,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:07,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:07,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2055 [2022-12-13 02:23:07,096 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:23:07,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:07,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1168811857, now seen corresponding path program 1 times [2022-12-13 02:23:07,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:07,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76588487] [2022-12-13 02:23:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:07,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:23:07,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:07,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76588487] [2022-12-13 02:23:07,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76588487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:07,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:07,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:07,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222178035] [2022-12-13 02:23:07,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:07,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:07,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:07,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:07,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:07,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:07,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:07,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:07,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:07,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:07,227 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:07,227 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:07,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:07,228 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:07,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:07,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:07,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:07,229 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:07,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:07,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:07,231 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:07,231 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:07,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:07,231 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:07,232 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:07,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:07,237 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:07,237 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:07,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:07,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:07,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:07,335 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:07,336 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:23:07,336 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:07,336 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 02:23:07,336 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:07,336 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:07,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2056 [2022-12-13 02:23:07,336 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:23:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:07,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1140182706, now seen corresponding path program 1 times [2022-12-13 02:23:07,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:07,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032411452] [2022-12-13 02:23:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:07,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:23:07,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:07,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032411452] [2022-12-13 02:23:07,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032411452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:07,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:07,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:07,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112886857] [2022-12-13 02:23:07,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:07,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:07,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:07,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:07,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:07,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:07,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:07,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:07,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:07,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:07,457 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:07,457 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:07,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:07,458 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:07,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:07,459 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:07,459 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:07,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:07,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:07,462 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:07,462 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:07,462 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:07,462 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,462 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:07,462 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:07,462 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:07,468 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:07,468 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:07,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:07,469 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:07,469 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:07,556 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:07,556 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:07,556 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:07,556 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 02:23:07,556 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:07,556 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:07,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2057 [2022-12-13 02:23:07,556 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:23:07,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:07,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1111553555, now seen corresponding path program 1 times [2022-12-13 02:23:07,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:07,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003912223] [2022-12-13 02:23:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:07,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:07,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:23:07,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:07,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003912223] [2022-12-13 02:23:07,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003912223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:07,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:07,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:07,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980285129] [2022-12-13 02:23:07,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:07,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:07,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:07,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:07,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:07,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:07,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:07,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:07,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:07,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:07,693 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:07,693 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:07,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:07,694 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:07,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:07,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:07,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:07,695 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:07,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:07,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:07,697 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,697 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:07,698 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:07,698 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:07,698 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,698 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:07,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:07,698 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:07,704 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:07,704 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:07,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:07,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:07,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:07,794 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:07,794 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:07,794 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:07,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:07,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:07,794 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:07,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2058 [2022-12-13 02:23:07,794 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:23:07,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:07,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1082924404, now seen corresponding path program 1 times [2022-12-13 02:23:07,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:07,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117314736] [2022-12-13 02:23:07,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:07,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:07,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:23:07,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:07,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117314736] [2022-12-13 02:23:07,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117314736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:07,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:07,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:07,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712053913] [2022-12-13 02:23:07,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:07,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:07,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:07,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:07,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:07,864 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:07,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:07,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:07,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:07,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:07,949 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:07,949 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:07,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:07,950 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:07,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:07,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:07,951 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:07,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:07,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:07,953 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,953 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:07,953 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:07,953 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:07,953 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:07,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:07,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:07,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:07,959 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:07,959 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:07,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:07,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:07,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:08,049 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:08,049 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:08,049 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:08,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:08,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:08,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:08,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2059 [2022-12-13 02:23:08,050 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:23:08,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1054295253, now seen corresponding path program 1 times [2022-12-13 02:23:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:08,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281206293] [2022-12-13 02:23:08,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:08,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:08,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:23:08,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:08,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281206293] [2022-12-13 02:23:08,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281206293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:08,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:08,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:08,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528886228] [2022-12-13 02:23:08,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:08,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:08,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:08,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:08,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:08,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:08,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:08,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:08,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:08,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:08,180 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:08,180 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:08,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:08,181 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:08,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:08,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:08,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:08,182 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:08,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:08,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:08,184 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:08,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:08,184 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:08,185 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:08,185 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:08,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:08,185 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:08,185 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:08,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:08,190 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:08,191 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:08,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:08,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:08,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:08,279 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:08,279 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:08,280 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:08,280 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 02:23:08,280 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:08,280 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:08,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2060 [2022-12-13 02:23:08,280 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:23:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1025666102, now seen corresponding path program 1 times [2022-12-13 02:23:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:08,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639993787] [2022-12-13 02:23:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:08,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:08,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:23:08,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:08,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639993787] [2022-12-13 02:23:08,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639993787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:08,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:08,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:08,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067176763] [2022-12-13 02:23:08,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:08,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:08,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:08,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:08,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:08,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:08,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:08,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:08,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:08,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:08,444 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:08,444 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:08,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:08,445 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:08,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:08,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:08,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:08,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:08,445 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:08,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:08,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:08,448 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:08,448 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:08,448 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:08,448 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:08,448 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:08,449 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:08,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:08,449 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:08,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:08,454 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:08,454 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:08,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:08,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:08,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:08,542 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:08,543 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:08,543 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:08,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:08,543 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:08,543 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:08,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2061 [2022-12-13 02:23:08,543 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:23:08,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:08,543 INFO L85 PathProgramCache]: Analyzing trace with hash -997036951, now seen corresponding path program 1 times [2022-12-13 02:23:08,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:08,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191027085] [2022-12-13 02:23:08,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:08,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:08,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 02:23:08,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:08,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191027085] [2022-12-13 02:23:08,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191027085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:08,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:08,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:08,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250868300] [2022-12-13 02:23:08,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:08,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:08,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:08,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:08,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:08,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:08,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:08,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:08,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:08,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:08,672 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:08,672 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:08,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:08,674 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:08,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:08,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:08,674 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:08,674 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:08,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:08,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:08,676 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:08,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:08,677 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:08,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:08,677 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:08,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:08,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:08,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:08,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:08,683 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:08,683 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:08,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:08,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:08,683 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:08,772 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:08,773 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:08,773 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:08,773 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 02:23:08,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:08,773 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:08,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2062 [2022-12-13 02:23:08,773 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:23:08,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:08,773 INFO L85 PathProgramCache]: Analyzing trace with hash -968407800, now seen corresponding path program 1 times [2022-12-13 02:23:08,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:08,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151806250] [2022-12-13 02:23:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:08,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:08,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:23:08,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:08,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151806250] [2022-12-13 02:23:08,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151806250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:08,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:08,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:08,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215631985] [2022-12-13 02:23:08,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:08,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:08,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:08,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:08,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:08,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:08,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:08,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:08,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:08,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:08,926 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:08,927 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:08,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:08,928 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:08,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:08,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:08,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:08,928 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:08,928 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:08,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:08,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:08,931 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:08,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:08,931 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:08,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:08,931 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:08,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:08,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:08,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:08,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:08,937 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:08,937 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:08,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:08,938 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:08,938 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:09,027 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:09,027 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:09,027 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:09,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:09,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:09,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:09,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2063 [2022-12-13 02:23:09,028 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:23:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:09,028 INFO L85 PathProgramCache]: Analyzing trace with hash -939778649, now seen corresponding path program 1 times [2022-12-13 02:23:09,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:09,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143847917] [2022-12-13 02:23:09,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:09,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:09,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:23:09,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:09,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143847917] [2022-12-13 02:23:09,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143847917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:09,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:09,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:09,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923126812] [2022-12-13 02:23:09,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:09,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:09,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:09,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:09,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:09,080 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:09,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:09,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:09,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:09,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:09,146 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:09,146 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:09,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:09,147 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:09,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:09,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:09,148 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:09,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:09,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:09,151 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:09,151 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:09,151 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:09,151 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:09,151 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:09,151 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:09,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:09,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:09,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:09,157 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:09,157 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:09,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:09,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:09,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:09,245 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:09,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:09,245 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:09,245 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 02:23:09,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:09,245 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:09,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2064 [2022-12-13 02:23:09,245 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:23:09,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash -911149498, now seen corresponding path program 1 times [2022-12-13 02:23:09,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:09,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720048987] [2022-12-13 02:23:09,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:09,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:09,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:23:09,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:09,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720048987] [2022-12-13 02:23:09,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720048987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:09,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:09,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267470511] [2022-12-13 02:23:09,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:09,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:09,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:09,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:09,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:09,310 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:09,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:09,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:09,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:09,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:09,375 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:09,375 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:09,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:09,376 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:09,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:09,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:09,377 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:09,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:09,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:09,379 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:09,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:09,380 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:09,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:09,380 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:09,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:09,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:09,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:09,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:09,385 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:09,386 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:09,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:09,386 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:09,386 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:09,473 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:09,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:09,474 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:09,474 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 02:23:09,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:09,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:09,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2065 [2022-12-13 02:23:09,474 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:23:09,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:09,474 INFO L85 PathProgramCache]: Analyzing trace with hash -882520347, now seen corresponding path program 1 times [2022-12-13 02:23:09,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:09,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143876530] [2022-12-13 02:23:09,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:09,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:09,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:23:09,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143876530] [2022-12-13 02:23:09,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143876530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:09,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:09,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251520103] [2022-12-13 02:23:09,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:09,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:09,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:09,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:09,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:09,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:09,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:09,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:09,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:09,594 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:09,594 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:09,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:09,595 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:09,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:09,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:09,596 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:09,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:09,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:09,598 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:09,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:09,598 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:09,598 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:09,598 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:09,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:09,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:09,599 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:09,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:09,604 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:09,604 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:09,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:09,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:09,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:09,692 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:09,693 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:09,693 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:09,693 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 02:23:09,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:09,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:09,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2066 [2022-12-13 02:23:09,693 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:23:09,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:09,693 INFO L85 PathProgramCache]: Analyzing trace with hash -853891196, now seen corresponding path program 1 times [2022-12-13 02:23:09,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:09,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611449212] [2022-12-13 02:23:09,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:09,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:09,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 02:23:09,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:09,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611449212] [2022-12-13 02:23:09,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611449212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:09,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:09,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:09,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659940533] [2022-12-13 02:23:09,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:09,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:09,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:09,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:09,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:09,748 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:09,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:09,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:09,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:09,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:09,814 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:09,814 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:09,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:09,815 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:09,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:09,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:09,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:09,816 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:09,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:09,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:09,818 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:09,818 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:09,818 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:09,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:09,819 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:09,819 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:09,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:09,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:09,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:09,824 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:09,824 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:09,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:09,825 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:09,825 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:09,913 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:09,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:09,914 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:09,914 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 02:23:09,914 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:09,914 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:09,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2067 [2022-12-13 02:23:09,914 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:23:09,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash -825262045, now seen corresponding path program 1 times [2022-12-13 02:23:09,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:09,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199124704] [2022-12-13 02:23:09,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:09,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:23:09,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:09,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199124704] [2022-12-13 02:23:09,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199124704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:09,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:09,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:09,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320279643] [2022-12-13 02:23:09,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:09,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:09,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:09,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:09,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:09,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:09,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:09,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:09,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:09,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:10,044 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:10,044 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:10,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:10,045 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:10,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:10,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:10,046 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:10,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:10,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:10,048 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:10,048 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:10,048 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:10,048 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:10,049 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:10,049 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:10,054 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:10,054 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:10,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:10,055 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:10,055 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:10,142 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:10,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:10,142 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:10,142 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 02:23:10,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:10,143 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:10,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2068 [2022-12-13 02:23:10,143 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:23:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:10,143 INFO L85 PathProgramCache]: Analyzing trace with hash -796632894, now seen corresponding path program 1 times [2022-12-13 02:23:10,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:10,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666328398] [2022-12-13 02:23:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:10,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:10,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:23:10,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:10,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666328398] [2022-12-13 02:23:10,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666328398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:10,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:10,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:10,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689013184] [2022-12-13 02:23:10,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:10,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:10,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:10,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:10,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:10,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:10,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:10,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:10,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:10,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:10,274 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:10,275 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:10,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:10,276 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:10,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:10,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:10,276 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:10,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:10,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:10,279 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,279 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:10,279 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:10,279 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:10,279 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,280 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:10,280 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:10,280 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:10,296 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:10,296 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:10,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:10,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:10,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:10,386 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:10,386 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:23:10,386 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:10,386 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 02:23:10,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:10,386 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:10,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2069 [2022-12-13 02:23:10,386 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:23:10,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:10,387 INFO L85 PathProgramCache]: Analyzing trace with hash -768003743, now seen corresponding path program 1 times [2022-12-13 02:23:10,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:10,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36237107] [2022-12-13 02:23:10,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:10,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:10,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:10,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36237107] [2022-12-13 02:23:10,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36237107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:10,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:10,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:10,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43465240] [2022-12-13 02:23:10,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:10,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:10,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:10,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:10,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:10,440 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:10,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:10,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:10,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:10,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:10,505 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:10,505 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:10,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:10,507 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:10,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:10,507 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:10,507 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:10,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:10,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:10,510 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,510 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:10,510 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:10,510 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:10,510 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,510 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:10,510 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:10,510 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:10,516 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:10,516 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:10,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:10,517 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:10,517 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:10,604 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:10,604 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:10,605 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:10,605 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 02:23:10,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:10,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:10,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2070 [2022-12-13 02:23:10,605 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:23:10,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:10,605 INFO L85 PathProgramCache]: Analyzing trace with hash -739374592, now seen corresponding path program 1 times [2022-12-13 02:23:10,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:10,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322864009] [2022-12-13 02:23:10,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:10,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:10,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322864009] [2022-12-13 02:23:10,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322864009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:10,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:10,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:10,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714867588] [2022-12-13 02:23:10,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:10,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:10,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:10,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:10,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:10,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:10,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:10,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:10,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:10,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:10,725 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:10,725 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:10,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:10,727 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:10,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:10,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:10,727 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:10,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:10,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:10,730 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,730 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:10,730 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:10,730 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:10,730 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:10,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:10,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:10,736 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:10,736 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:10,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:10,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:10,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:10,824 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:10,825 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:10,825 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:10,825 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 02:23:10,825 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:10,825 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:10,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2071 [2022-12-13 02:23:10,825 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:23:10,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:10,825 INFO L85 PathProgramCache]: Analyzing trace with hash -710745441, now seen corresponding path program 1 times [2022-12-13 02:23:10,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:10,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078530275] [2022-12-13 02:23:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:10,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:10,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:23:10,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:10,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078530275] [2022-12-13 02:23:10,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078530275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:10,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:10,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:10,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217396367] [2022-12-13 02:23:10,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:10,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:10,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:10,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:10,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:10,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:10,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:10,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:10,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:10,954 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:10,954 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:10,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:10,955 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:10,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:10,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:10,956 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:10,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:10,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:10,958 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,958 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:10,958 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:10,958 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:10,958 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,959 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:10,959 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:10,959 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:10,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:10,964 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:10,964 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:10,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:10,965 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:10,965 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:11,055 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:11,055 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:23:11,055 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:11,055 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 02:23:11,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:11,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:11,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2072 [2022-12-13 02:23:11,055 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:23:11,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:11,056 INFO L85 PathProgramCache]: Analyzing trace with hash -682116290, now seen corresponding path program 1 times [2022-12-13 02:23:11,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:11,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538556359] [2022-12-13 02:23:11,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:11,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:11,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 02:23:11,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:11,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538556359] [2022-12-13 02:23:11,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538556359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:11,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:11,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:11,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078628502] [2022-12-13 02:23:11,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:11,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:11,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:11,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:11,111 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:11,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:11,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:11,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:11,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:11,178 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:11,178 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:11,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:11,179 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:11,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:11,180 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:11,180 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:11,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:11,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:11,183 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:11,183 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:11,183 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:11,183 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:11,183 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:11,183 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:11,183 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:11,183 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:11,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:11,189 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:11,189 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:23:11,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:11,189 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:11,189 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:11,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:11,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:11,278 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:11,278 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 02:23:11,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:11,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:11,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2073 [2022-12-13 02:23:11,278 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:23:11,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:11,278 INFO L85 PathProgramCache]: Analyzing trace with hash -653487139, now seen corresponding path program 1 times [2022-12-13 02:23:11,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:11,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9426114] [2022-12-13 02:23:11,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:11,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:11,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:23:11,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:11,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9426114] [2022-12-13 02:23:11,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9426114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:11,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:11,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:11,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383096826] [2022-12-13 02:23:11,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:11,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:11,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:11,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:11,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:11,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:11,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:11,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:11,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:11,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:11,447 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:11,447 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:11,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:11,448 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:11,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:11,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:11,449 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:11,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:11,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:11,451 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:11,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:11,452 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:11,452 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:11,452 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:11,452 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:11,452 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:11,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:11,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:11,458 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:11,458 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:11,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:11,458 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:11,458 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:11,547 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:11,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:11,547 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:11,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:11,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:11,548 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:11,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2074 [2022-12-13 02:23:11,548 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:23:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash -624857988, now seen corresponding path program 1 times [2022-12-13 02:23:11,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:11,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825654412] [2022-12-13 02:23:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:11,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:23:11,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:11,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825654412] [2022-12-13 02:23:11,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825654412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:11,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:11,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:11,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350092668] [2022-12-13 02:23:11,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:11,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:11,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:11,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:11,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:11,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:11,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:11,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:11,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:11,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:11,680 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:11,680 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:11,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:11,682 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:11,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:11,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:11,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:11,682 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:11,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:11,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:11,685 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:11,685 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:11,685 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:11,685 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:11,685 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:11,685 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:11,685 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:11,685 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:11,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:11,691 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:11,691 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:11,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:11,692 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:11,692 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:11,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:11,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:11,780 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:11,780 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 02:23:11,780 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:11,780 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:11,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2075 [2022-12-13 02:23:11,780 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:23:11,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash -596228837, now seen corresponding path program 1 times [2022-12-13 02:23:11,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:11,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152532785] [2022-12-13 02:23:11,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:11,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:11,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:23:11,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:11,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152532785] [2022-12-13 02:23:11,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152532785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:11,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:11,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:11,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729117977] [2022-12-13 02:23:11,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:11,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:11,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:11,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:11,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:11,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:11,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:11,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:11,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:11,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:11,911 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:11,911 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:11,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:11,912 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:11,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:11,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:11,913 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:11,913 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:11,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:11,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:11,915 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:11,915 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:11,916 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:11,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:11,916 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:11,916 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:11,916 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:11,916 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:11,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:11,921 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:11,922 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:11,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:11,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:11,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:12,010 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:12,010 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:12,010 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:12,011 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 02:23:12,011 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:12,011 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:12,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2076 [2022-12-13 02:23:12,011 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:23:12,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:12,011 INFO L85 PathProgramCache]: Analyzing trace with hash -567599686, now seen corresponding path program 1 times [2022-12-13 02:23:12,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:12,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792482020] [2022-12-13 02:23:12,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:12,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:12,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:23:12,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:12,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792482020] [2022-12-13 02:23:12,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792482020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:12,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:12,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:12,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592215221] [2022-12-13 02:23:12,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:12,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:12,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:12,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:12,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:12,063 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:12,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:12,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:12,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:12,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:12,129 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:12,129 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:12,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:12,130 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:12,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:12,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:12,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:12,130 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:12,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:12,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:12,133 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:12,133 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:12,133 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:12,133 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:12,133 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:12,133 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:12,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:12,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:12,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:12,139 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:12,139 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:12,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:12,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:12,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:12,226 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:12,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:12,227 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:12,227 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 02:23:12,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:12,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:12,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2077 [2022-12-13 02:23:12,227 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:23:12,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash -538970535, now seen corresponding path program 1 times [2022-12-13 02:23:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:12,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939328624] [2022-12-13 02:23:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:12,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:12,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:23:12,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:12,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939328624] [2022-12-13 02:23:12,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939328624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:12,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:12,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:12,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145382357] [2022-12-13 02:23:12,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:12,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:12,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:12,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:12,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:12,281 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:12,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:12,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:12,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:12,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:12,359 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:12,359 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:12,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1127 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:12,360 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:12,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:12,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:12,360 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:12,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:12,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:12,363 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:12,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:12,363 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:12,363 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:12,363 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:12,363 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:12,363 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:12,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:12,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:12,369 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:12,369 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:12,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:12,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:12,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:12,455 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:12,456 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:12,456 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:12,456 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 02:23:12,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:12,456 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:12,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2078 [2022-12-13 02:23:12,456 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:23:12,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:12,456 INFO L85 PathProgramCache]: Analyzing trace with hash -510341384, now seen corresponding path program 1 times [2022-12-13 02:23:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:12,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29544737] [2022-12-13 02:23:12,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:12,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:12,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:23:12,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:12,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29544737] [2022-12-13 02:23:12,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29544737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:12,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:12,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:12,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32155788] [2022-12-13 02:23:12,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:12,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:12,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:12,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:12,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:12,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:12,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:12,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:12,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:12,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:12,608 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:12,609 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:12,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:12,610 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:12,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:12,610 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:12,610 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:12,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:12,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:12,613 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:12,613 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:12,613 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:12,613 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:12,613 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:12,613 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:12,613 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:12,613 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:12,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:12,619 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:12,619 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:12,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:12,619 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:12,619 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:12,708 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:12,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:12,708 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:12,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:12,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:12,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:12,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2079 [2022-12-13 02:23:12,708 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:23:12,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:12,709 INFO L85 PathProgramCache]: Analyzing trace with hash -481712233, now seen corresponding path program 1 times [2022-12-13 02:23:12,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:12,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514958017] [2022-12-13 02:23:12,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:12,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:12,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:23:12,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:12,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514958017] [2022-12-13 02:23:12,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514958017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:12,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:12,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:12,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226682005] [2022-12-13 02:23:12,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:12,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:12,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:12,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:12,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:12,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:12,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:12,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:12,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:12,829 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:12,829 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:12,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:12,830 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:12,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:12,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:12,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:12,831 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:12,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:12,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:12,833 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:12,833 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:12,834 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:12,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:12,834 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:12,834 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:12,834 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:12,834 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:12,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:12,839 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:12,840 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:12,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:12,840 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:12,840 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:12,927 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:12,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:12,927 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:12,928 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 02:23:12,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:12,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:12,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2080 [2022-12-13 02:23:12,928 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:23:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:12,928 INFO L85 PathProgramCache]: Analyzing trace with hash -453083082, now seen corresponding path program 1 times [2022-12-13 02:23:12,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:12,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365257713] [2022-12-13 02:23:12,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:12,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:12,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:23:12,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:12,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365257713] [2022-12-13 02:23:12,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365257713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:12,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:12,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:12,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138949457] [2022-12-13 02:23:12,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:12,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:12,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:12,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:12,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:12,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:12,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:12,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:12,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:13,057 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:13,057 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:13,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:13,059 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:13,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:13,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:13,059 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:13,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:13,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:13,062 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,062 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:13,062 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:13,062 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:13,062 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,062 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:13,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:13,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:13,068 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:13,068 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:13,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:13,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:13,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:13,156 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:13,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:13,156 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:13,156 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 02:23:13,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:13,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:13,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2081 [2022-12-13 02:23:13,156 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:23:13,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash -424453931, now seen corresponding path program 1 times [2022-12-13 02:23:13,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:13,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042908821] [2022-12-13 02:23:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:13,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:13,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:23:13,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:13,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042908821] [2022-12-13 02:23:13,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042908821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:13,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:13,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:13,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401874829] [2022-12-13 02:23:13,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:13,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:13,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:13,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:13,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:13,226 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:13,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:13,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:13,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:13,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:13,294 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:13,294 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:13,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:13,295 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:13,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:13,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:13,296 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:13,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:13,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:13,308 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,308 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:13,308 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:13,308 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:13,308 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,309 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:13,309 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:13,309 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:13,315 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:13,315 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:13,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:13,315 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:13,315 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:13,401 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:13,402 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:13,402 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:13,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:13,402 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:13,402 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:13,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2082 [2022-12-13 02:23:13,402 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:23:13,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:13,402 INFO L85 PathProgramCache]: Analyzing trace with hash -395824780, now seen corresponding path program 1 times [2022-12-13 02:23:13,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:13,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290092233] [2022-12-13 02:23:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:13,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:13,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 02:23:13,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:13,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290092233] [2022-12-13 02:23:13,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290092233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:13,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:13,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:13,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991722811] [2022-12-13 02:23:13,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:13,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:13,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:13,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:13,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:13,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:13,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:13,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:13,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:13,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:13,530 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:13,531 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:13,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:13,532 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:13,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:13,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:13,532 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:13,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:13,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:13,535 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:13,535 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:13,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:13,535 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,535 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:13,535 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:13,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:13,541 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:13,541 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:13,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:13,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:13,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:13,629 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:13,629 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:13,629 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:13,630 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 02:23:13,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:13,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:13,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2083 [2022-12-13 02:23:13,630 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:23:13,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:13,630 INFO L85 PathProgramCache]: Analyzing trace with hash -367195629, now seen corresponding path program 1 times [2022-12-13 02:23:13,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:13,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493442057] [2022-12-13 02:23:13,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:13,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:13,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:23:13,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:13,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493442057] [2022-12-13 02:23:13,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493442057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:13,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:13,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:13,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951225128] [2022-12-13 02:23:13,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:13,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:13,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:13,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:13,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:13,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:13,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:13,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:13,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:13,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:13,751 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:13,752 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:13,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:13,753 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:13,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:13,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:13,753 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:13,753 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:13,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:13,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:13,756 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,756 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:13,756 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:13,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:13,756 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:13,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:13,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:13,762 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:13,762 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:13,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:13,762 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:13,762 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:13,850 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:13,851 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:13,851 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:13,851 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 02:23:13,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:13,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:13,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2084 [2022-12-13 02:23:13,851 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:23:13,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash -338566478, now seen corresponding path program 1 times [2022-12-13 02:23:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:13,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316284036] [2022-12-13 02:23:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:13,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:23:13,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:13,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316284036] [2022-12-13 02:23:13,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316284036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:13,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:13,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:13,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451869326] [2022-12-13 02:23:13,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:13,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:13,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:13,906 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:13,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:13,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:13,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:13,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:13,981 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:13,982 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:13,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:13,983 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:13,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:13,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:13,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:13,983 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:13,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:13,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:13,986 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,986 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:13,986 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:13,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:13,986 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,987 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:13,987 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:13,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:13,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:13,992 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:13,992 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:13,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:13,993 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:13,993 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:14,079 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:14,080 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:14,080 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:14,080 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 02:23:14,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:14,080 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:14,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2085 [2022-12-13 02:23:14,080 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:23:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash -309937327, now seen corresponding path program 1 times [2022-12-13 02:23:14,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:14,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107961684] [2022-12-13 02:23:14,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:14,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:14,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:23:14,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:14,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107961684] [2022-12-13 02:23:14,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107961684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:14,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:14,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:14,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504840158] [2022-12-13 02:23:14,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:14,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:14,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:14,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:14,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:14,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:14,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:14,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:14,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:14,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:14,198 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:14,198 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:14,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:14,199 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:14,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:14,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:14,200 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:14,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:14,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:14,202 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:14,202 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:14,202 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:14,202 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:14,202 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:14,202 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:14,202 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:14,203 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:14,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:14,208 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:14,208 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:23:14,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:14,209 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:14,209 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:14,296 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:14,297 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:14,297 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:14,297 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 02:23:14,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:14,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:14,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2086 [2022-12-13 02:23:14,297 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:23:14,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash -281308176, now seen corresponding path program 1 times [2022-12-13 02:23:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:14,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419280714] [2022-12-13 02:23:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23: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:23:14,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:14,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419280714] [2022-12-13 02:23:14,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419280714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:14,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:14,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:14,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265770186] [2022-12-13 02:23:14,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:14,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:14,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:14,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:14,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:14,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:14,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:14,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:14,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:14,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:14,431 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:14,432 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:14,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:14,433 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:14,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:14,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:14,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:14,433 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:14,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:14,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:14,436 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:14,436 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:14,436 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:14,436 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:14,436 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:14,436 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:14,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:14,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:14,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:14,442 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:14,442 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:14,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:14,442 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:14,442 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:14,529 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:14,530 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:14,530 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:14,530 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 02:23:14,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:14,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:14,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2087 [2022-12-13 02:23:14,530 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:23:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:14,530 INFO L85 PathProgramCache]: Analyzing trace with hash -252679025, now seen corresponding path program 1 times [2022-12-13 02:23:14,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:14,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945446861] [2022-12-13 02:23:14,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:14,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:14,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:23:14,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:14,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945446861] [2022-12-13 02:23:14,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945446861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:14,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:14,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:14,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236496298] [2022-12-13 02:23:14,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:14,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:14,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:14,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:14,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:14,583 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:14,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:14,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:14,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:14,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:14,649 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:14,649 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:14,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:14,650 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:14,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:14,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:14,651 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:14,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:14,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:14,653 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:14,653 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:14,654 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:14,654 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:14,654 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:14,654 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:14,654 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:14,654 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:14,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:14,659 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:14,660 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:14,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:14,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:14,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:14,747 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:14,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:14,748 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:14,748 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 02:23:14,748 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:14,748 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:14,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2088 [2022-12-13 02:23:14,748 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:23:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash -224049874, now seen corresponding path program 1 times [2022-12-13 02:23:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:14,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105148003] [2022-12-13 02:23:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:14,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:14,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:23:14,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:14,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105148003] [2022-12-13 02:23:14,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105148003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:14,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:14,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:14,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209648623] [2022-12-13 02:23:14,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:14,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:14,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:14,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:14,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:14,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:14,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:14,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:14,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:14,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:14,866 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:14,867 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:14,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:14,868 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:14,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:14,868 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:14,868 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:14,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:14,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:14,871 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:14,871 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:14,871 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:14,871 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:14,871 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:14,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:14,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:14,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:14,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:14,877 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:14,877 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:14,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:14,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:14,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:14,966 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:14,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:14,967 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:14,967 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 02:23:14,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:14,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:14,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2089 [2022-12-13 02:23:14,967 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:23:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash -195420723, now seen corresponding path program 1 times [2022-12-13 02:23:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:14,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612057111] [2022-12-13 02:23:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:14,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:15,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:23:15,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:15,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612057111] [2022-12-13 02:23:15,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612057111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:15,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:15,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:15,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148904247] [2022-12-13 02:23:15,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:15,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:15,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:15,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:15,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:15,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:15,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:15,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:15,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:15,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:15,099 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:15,100 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:15,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:15,101 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:15,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:15,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:15,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:15,101 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:15,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:15,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:15,104 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:15,104 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:15,104 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:15,104 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:15,104 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:15,104 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:15,104 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:15,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:15,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:15,110 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:15,110 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:15,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:15,111 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:15,111 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:15,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:15,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:15,200 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:15,200 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 02:23:15,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:15,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:15,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2090 [2022-12-13 02:23:15,201 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:23:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash -166791572, now seen corresponding path program 1 times [2022-12-13 02:23:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:15,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129489687] [2022-12-13 02:23:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:15,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:23:15,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:15,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129489687] [2022-12-13 02:23:15,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129489687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:15,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:15,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:15,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592857351] [2022-12-13 02:23:15,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:15,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:15,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:15,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:15,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:15,255 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:15,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:15,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:15,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:15,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:15,336 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:15,337 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:15,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:15,338 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:15,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:15,338 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:15,339 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:15,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:15,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:15,341 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:15,341 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:15,341 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:15,341 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:15,341 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:15,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:15,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:15,342 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:15,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:15,349 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:15,349 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:15,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:15,350 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:15,350 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:15,443 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:15,443 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:23:15,443 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:15,443 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 02:23:15,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:15,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:15,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2091 [2022-12-13 02:23:15,444 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:23:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:15,444 INFO L85 PathProgramCache]: Analyzing trace with hash -138162421, now seen corresponding path program 1 times [2022-12-13 02:23:15,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:15,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442195199] [2022-12-13 02:23:15,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:15,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:15,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:23:15,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:15,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442195199] [2022-12-13 02:23:15,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442195199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:15,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:15,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:15,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129678812] [2022-12-13 02:23:15,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:15,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:15,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:15,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:15,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:15,504 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:15,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:15,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:15,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:15,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:15,588 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:15,588 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:15,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:15,590 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:15,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:15,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:15,590 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:15,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:15,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:15,593 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:15,593 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:15,593 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:15,593 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:15,593 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:15,594 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:15,594 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:15,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:15,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:15,601 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:15,601 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:15,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:15,601 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:15,601 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:15,695 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:15,695 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:23:15,695 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:15,695 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 02:23:15,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:15,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:15,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2092 [2022-12-13 02:23:15,696 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:23:15,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:15,696 INFO L85 PathProgramCache]: Analyzing trace with hash -109533270, now seen corresponding path program 1 times [2022-12-13 02:23:15,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:15,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114104184] [2022-12-13 02:23:15,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:15,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:15,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:23:15,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:15,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114104184] [2022-12-13 02:23:15,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114104184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:15,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:15,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:15,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990371945] [2022-12-13 02:23:15,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:15,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:15,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:15,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:15,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:15,750 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:15,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:15,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:15,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:15,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:15,827 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:15,827 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:15,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:15,828 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:15,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:15,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:15,829 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:15,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:15,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:15,832 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:15,832 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:15,832 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:15,832 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:15,832 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:15,832 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:15,832 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:15,832 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:15,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:15,838 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:15,838 INFO L131 PetriNetUnfolder]: For 435/453 co-relation queries the response was YES. [2022-12-13 02:23:15,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/453 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:15,838 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:15,838 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:15,927 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:15,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:15,927 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:15,928 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 02:23:15,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:15,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:15,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2093 [2022-12-13 02:23:15,928 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:23:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash -80904119, now seen corresponding path program 1 times [2022-12-13 02:23:15,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:15,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908923346] [2022-12-13 02:23:15,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:15,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:15,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:23:15,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:15,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908923346] [2022-12-13 02:23:15,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908923346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:15,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:15,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:15,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943120686] [2022-12-13 02:23:15,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:15,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:15,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:15,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:15,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:15,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:15,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:15,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:15,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:15,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:16,057 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:16,058 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:16,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:16,059 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:16,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:16,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:16,059 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:16,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:16,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:16,062 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,062 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:16,062 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:16,062 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:16,062 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,062 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:16,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:16,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:16,068 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:16,068 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:16,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:16,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:16,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:16,155 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:16,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:16,156 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:16,156 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 02:23:16,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:16,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:16,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2094 [2022-12-13 02:23:16,156 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:23:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash -52274968, now seen corresponding path program 1 times [2022-12-13 02:23:16,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:16,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035768165] [2022-12-13 02:23:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:16,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:16,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:23:16,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:16,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035768165] [2022-12-13 02:23:16,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035768165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:16,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:16,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:16,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411754008] [2022-12-13 02:23:16,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:16,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:16,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:16,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:16,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:16,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:16,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:16,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:16,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:16,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:16,280 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:16,281 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:16,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:16,282 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:16,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:16,282 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:16,282 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:16,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:16,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:16,285 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,285 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:16,285 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:16,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:16,285 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,285 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:16,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:16,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:16,291 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:16,291 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:16,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:16,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:16,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:16,379 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:16,380 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:16,380 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:16,380 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 02:23:16,380 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:16,380 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:16,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2095 [2022-12-13 02:23:16,380 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:23:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:16,380 INFO L85 PathProgramCache]: Analyzing trace with hash -23645817, now seen corresponding path program 1 times [2022-12-13 02:23:16,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:16,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414811510] [2022-12-13 02:23:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:16,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:23:16,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:16,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414811510] [2022-12-13 02:23:16,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414811510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:16,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:16,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:16,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508509927] [2022-12-13 02:23:16,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:16,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:16,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:16,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:16,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:16,450 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:16,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:16,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:16,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:16,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:16,517 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:16,518 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:16,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:16,519 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:16,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:16,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:16,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:16,519 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:16,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:16,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:16,522 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,522 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:16,522 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:16,522 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:16,522 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,522 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:16,522 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:16,522 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:16,528 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:16,528 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:16,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:16,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:16,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:16,625 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:16,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:23:16,626 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:16,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:16,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:16,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:16,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2096 [2022-12-13 02:23:16,626 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:23:16,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:16,626 INFO L85 PathProgramCache]: Analyzing trace with hash 4983334, now seen corresponding path program 1 times [2022-12-13 02:23:16,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:16,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139607746] [2022-12-13 02:23:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:16,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:16,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:23:16,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:16,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139607746] [2022-12-13 02:23:16,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139607746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:16,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:16,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:16,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824435455] [2022-12-13 02:23:16,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:16,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:16,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:16,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:16,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:16,677 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:16,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:16,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:16,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:16,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:16,753 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:16,753 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:16,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:16,754 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:16,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:16,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:16,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:16,755 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:16,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:16,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:16,757 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,757 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:16,757 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:16,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:16,758 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,758 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:16,758 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:16,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:16,763 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:16,763 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:16,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:16,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:16,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:16,851 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:16,851 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:16,851 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:16,851 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 02:23:16,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:16,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:16,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2097 [2022-12-13 02:23:16,852 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:23:16,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:16,852 INFO L85 PathProgramCache]: Analyzing trace with hash 33612485, now seen corresponding path program 1 times [2022-12-13 02:23:16,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:16,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663530042] [2022-12-13 02:23:16,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:16,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23: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:23:16,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:16,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663530042] [2022-12-13 02:23:16,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663530042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:16,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:16,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:16,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133070934] [2022-12-13 02:23:16,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:16,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:16,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:16,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:16,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:16,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:16,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:16,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:16,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:16,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:16,969 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:16,970 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:16,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:16,971 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:16,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:16,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:16,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:16,971 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:16,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:16,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:16,974 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:16,974 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:16,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:16,974 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,974 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:16,974 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:16,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:16,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:16,980 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:16,980 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:16,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:16,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:16,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:17,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:17,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:17,070 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:17,070 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 02:23:17,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:17,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:17,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2098 [2022-12-13 02:23:17,071 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:23:17,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:17,071 INFO L85 PathProgramCache]: Analyzing trace with hash 62241636, now seen corresponding path program 1 times [2022-12-13 02:23:17,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:17,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980459158] [2022-12-13 02:23:17,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:17,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 02:23:17,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:17,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980459158] [2022-12-13 02:23:17,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980459158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:17,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:17,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843425047] [2022-12-13 02:23:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:17,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:17,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:17,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:17,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:17,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:17,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:17,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:17,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:17,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:17,196 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:17,196 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:17,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:17,198 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:17,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:17,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:17,198 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:17,198 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:17,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:17,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:17,201 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:17,201 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:17,201 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:17,201 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:17,201 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:17,201 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:17,201 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:17,201 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:17,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:17,207 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:17,207 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:17,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:17,208 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:17,208 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:17,295 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:17,295 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:17,295 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:17,295 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 02:23:17,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:17,296 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:17,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2099 [2022-12-13 02:23:17,296 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:23:17,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:17,296 INFO L85 PathProgramCache]: Analyzing trace with hash 90870787, now seen corresponding path program 1 times [2022-12-13 02:23:17,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:17,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573638943] [2022-12-13 02:23:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:17,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:17,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:23:17,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:17,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573638943] [2022-12-13 02:23:17,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573638943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:17,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:17,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:17,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283155391] [2022-12-13 02:23:17,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:17,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:17,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:17,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:17,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:17,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:17,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:17,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:17,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:17,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:17,443 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:17,443 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:17,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:17,445 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:17,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:17,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:17,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:17,445 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:17,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:17,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:17,448 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:17,448 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:17,448 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:17,448 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:17,448 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:17,448 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:17,448 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:17,448 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:17,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:17,454 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:17,454 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:23:17,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:17,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:17,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:17,541 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:17,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:17,541 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:17,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:17,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:17,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:17,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2100 [2022-12-13 02:23:17,542 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:23:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash 119499938, now seen corresponding path program 1 times [2022-12-13 02:23:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:17,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368412878] [2022-12-13 02:23:17,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:17,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:23:17,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:17,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368412878] [2022-12-13 02:23:17,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368412878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:17,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:17,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:17,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252660982] [2022-12-13 02:23:17,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:17,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:17,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:17,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:17,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:17,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:17,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:17,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:17,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:17,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:17,672 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:17,672 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:17,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:17,673 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:17,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:17,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:17,674 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:17,674 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:17,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:17,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:17,676 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:17,676 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:17,676 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:17,676 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:17,676 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:17,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:17,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:17,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:17,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:17,682 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:17,683 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:23:17,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:17,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:17,683 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:17,771 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:17,772 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:17,772 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:17,772 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 02:23:17,772 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:17,772 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:17,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2101 [2022-12-13 02:23:17,772 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:23:17,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:17,772 INFO L85 PathProgramCache]: Analyzing trace with hash 148129089, now seen corresponding path program 1 times [2022-12-13 02:23:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:17,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060602701] [2022-12-13 02:23:17,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:17,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:17,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:23:17,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:17,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060602701] [2022-12-13 02:23:17,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060602701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:17,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:17,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756951765] [2022-12-13 02:23:17,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:17,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:17,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:17,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:17,836 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:17,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:17,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:17,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:17,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:17,902 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:17,902 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:17,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:17,903 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:17,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:17,904 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:17,904 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:17,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:17,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:17,907 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:17,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:17,907 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:17,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:17,907 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:17,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:17,907 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:17,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:17,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:17,913 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:17,913 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:17,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:17,913 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:17,913 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:18,000 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:18,000 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:18,000 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:18,000 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 02:23:18,000 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:18,000 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:18,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2102 [2022-12-13 02:23:18,001 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:23:18,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:18,001 INFO L85 PathProgramCache]: Analyzing trace with hash 176758240, now seen corresponding path program 1 times [2022-12-13 02:23:18,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:18,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102095320] [2022-12-13 02:23:18,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:18,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:18,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:23:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:18,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102095320] [2022-12-13 02:23:18,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102095320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:18,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:18,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:18,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789836987] [2022-12-13 02:23:18,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:18,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:18,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:18,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:18,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:18,054 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:18,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:18,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:18,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:18,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:18,130 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:18,130 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:18,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:18,131 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:18,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:18,132 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:18,132 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:18,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:18,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:18,134 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:18,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:18,134 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:18,134 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:18,134 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:18,135 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:18,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:18,135 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:18,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:18,140 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:18,140 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:18,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:18,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:18,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:18,228 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:18,228 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:18,228 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:18,228 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 02:23:18,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:18,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:18,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2103 [2022-12-13 02:23:18,228 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:23:18,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:18,229 INFO L85 PathProgramCache]: Analyzing trace with hash 205387391, now seen corresponding path program 1 times [2022-12-13 02:23:18,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:18,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849919347] [2022-12-13 02:23:18,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:18,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:18,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:23:18,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:18,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849919347] [2022-12-13 02:23:18,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849919347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:18,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:18,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:18,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736787118] [2022-12-13 02:23:18,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:18,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:18,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:18,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:18,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:18,281 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:18,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:18,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:18,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:18,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:18,346 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:18,346 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:18,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:18,347 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:18,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:18,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:18,348 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:18,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:18,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:18,351 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:18,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:18,351 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:18,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:18,351 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:18,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:18,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:18,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:18,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:18,357 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:18,357 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:18,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:18,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:18,357 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:18,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:18,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:18,445 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:18,445 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 02:23:18,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:18,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:18,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2104 [2022-12-13 02:23:18,445 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:23:18,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:18,446 INFO L85 PathProgramCache]: Analyzing trace with hash 234016542, now seen corresponding path program 1 times [2022-12-13 02:23:18,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:18,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193397045] [2022-12-13 02:23:18,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:18,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:18,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:23:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:18,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193397045] [2022-12-13 02:23:18,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193397045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:18,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:18,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971674439] [2022-12-13 02:23:18,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:18,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:18,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:18,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:18,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:18,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:18,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:18,567 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:18,567 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:18,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:18,568 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:18,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:18,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:18,568 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:18,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:18,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:18,571 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:18,571 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:18,571 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:18,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:18,571 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:18,571 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:18,571 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:18,571 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:18,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:18,577 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:18,577 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:18,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:18,577 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:18,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:18,664 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:18,665 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:18,665 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:18,665 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 02:23:18,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:18,665 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:18,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2105 [2022-12-13 02:23:18,665 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:23:18,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:18,665 INFO L85 PathProgramCache]: Analyzing trace with hash 262645693, now seen corresponding path program 1 times [2022-12-13 02:23:18,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:18,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167462761] [2022-12-13 02:23:18,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:18,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:18,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:23:18,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:18,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167462761] [2022-12-13 02:23:18,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167462761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:18,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:18,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:18,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955187699] [2022-12-13 02:23:18,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:18,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:18,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:18,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:18,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:18,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:18,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:18,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:18,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:18,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:18,780 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:18,780 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:18,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1095 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:18,781 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:18,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:18,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:18,782 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:18,782 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:18,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:18,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:18,784 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:18,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:18,784 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:18,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:18,785 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:18,785 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:18,785 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:18,785 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:18,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:18,790 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:18,791 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:18,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:18,791 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:18,791 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:18,878 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:18,878 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:18,878 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:18,878 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 02:23:18,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:18,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:18,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2106 [2022-12-13 02:23:18,879 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:23:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash 291274844, now seen corresponding path program 1 times [2022-12-13 02:23:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:18,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976196014] [2022-12-13 02:23:18,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:18,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:23:18,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:18,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976196014] [2022-12-13 02:23:18,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976196014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:18,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:18,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:18,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469793488] [2022-12-13 02:23:18,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:18,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:18,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:18,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:18,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:18,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:18,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:18,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:18,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:18,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:19,006 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:19,006 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:19,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:19,007 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:19,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:19,008 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:19,008 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:19,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:19,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:19,010 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:19,010 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:19,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:19,011 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,011 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:19,011 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:19,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:19,016 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:19,016 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:19,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:19,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:19,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:19,106 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:19,106 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:19,106 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:19,106 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 02:23:19,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:19,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:19,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2107 [2022-12-13 02:23:19,107 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:23:19,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:19,107 INFO L85 PathProgramCache]: Analyzing trace with hash 319903995, now seen corresponding path program 1 times [2022-12-13 02:23:19,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:19,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340775533] [2022-12-13 02:23:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:19,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:19,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:23:19,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:19,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340775533] [2022-12-13 02:23:19,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340775533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:19,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:19,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:19,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046519996] [2022-12-13 02:23:19,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:19,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:19,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:19,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:19,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:19,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:19,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:19,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:19,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:19,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:19,227 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:19,227 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:19,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:19,228 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:19,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:19,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:19,229 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:19,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:19,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:19,231 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:19,231 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:19,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:19,231 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:19,232 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:19,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:19,237 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:19,237 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:19,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:19,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:19,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:19,325 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:19,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:19,325 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:19,325 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 02:23:19,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:19,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:19,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2108 [2022-12-13 02:23:19,325 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:23:19,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash 348533146, now seen corresponding path program 1 times [2022-12-13 02:23:19,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:19,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089825583] [2022-12-13 02:23:19,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:19,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:19,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:23:19,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:19,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089825583] [2022-12-13 02:23:19,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089825583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:19,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:19,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:19,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688071466] [2022-12-13 02:23:19,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:19,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:19,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:19,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:19,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:19,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:19,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:19,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:19,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:19,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:19,456 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:19,456 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:19,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:19,457 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:19,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:19,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:19,458 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:19,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:19,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:19,460 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,461 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:19,461 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:19,461 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:19,461 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,461 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:19,461 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:19,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:19,467 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:19,467 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:19,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:19,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:19,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:19,555 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:19,555 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:19,555 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:19,555 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 02:23:19,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:19,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:19,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2109 [2022-12-13 02:23:19,556 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:23:19,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash 377162297, now seen corresponding path program 1 times [2022-12-13 02:23:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:19,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475381897] [2022-12-13 02:23:19,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:19,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:19,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:23:19,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:19,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475381897] [2022-12-13 02:23:19,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475381897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:19,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:19,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:19,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680487599] [2022-12-13 02:23:19,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:19,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:19,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:19,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:19,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:19,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:19,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:19,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:19,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:19,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:19,672 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:19,672 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:19,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:19,673 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:19,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:19,674 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:19,674 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:19,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:19,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:19,677 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:19,677 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:19,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:19,677 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:19,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:19,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:19,683 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:19,683 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:19,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:19,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:19,683 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:19,772 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:19,773 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:19,773 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:19,773 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 02:23:19,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:19,773 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:19,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2110 [2022-12-13 02:23:19,773 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:23:19,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash 405791448, now seen corresponding path program 1 times [2022-12-13 02:23:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:19,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295288188] [2022-12-13 02:23:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:19,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:23:19,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:19,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295288188] [2022-12-13 02:23:19,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295288188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:19,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:19,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:19,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797648334] [2022-12-13 02:23:19,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:19,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:19,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:19,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:19,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:19,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:19,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:19,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:19,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:19,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:19,904 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:19,904 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:19,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:19,906 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:19,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:19,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:19,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:19,906 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:19,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:19,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:19,908 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,908 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:19,909 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:19,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:19,909 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:19,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:19,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:19,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:19,914 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:19,915 INFO L131 PetriNetUnfolder]: For 435/444 co-relation queries the response was YES. [2022-12-13 02:23:19,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/444 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:19,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:19,915 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:20,002 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:20,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:20,003 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:20,003 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 02:23:20,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:20,003 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:20,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2111 [2022-12-13 02:23:20,003 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:23:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:20,004 INFO L85 PathProgramCache]: Analyzing trace with hash 434420599, now seen corresponding path program 1 times [2022-12-13 02:23:20,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:20,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250506708] [2022-12-13 02:23:20,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:20,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:20,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:23:20,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:20,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250506708] [2022-12-13 02:23:20,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250506708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:20,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:20,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:20,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771391440] [2022-12-13 02:23:20,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:20,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:20,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:20,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:20,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:20,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:20,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:20,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:20,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:20,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:20,120 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:20,121 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:20,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:20,122 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:20,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:20,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:20,122 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:20,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:20,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:20,125 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:20,125 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:20,125 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:20,125 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:20,125 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:20,125 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:20,125 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:20,125 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:20,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:20,141 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:20,141 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:20,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:20,142 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:20,142 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:20,230 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:20,230 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:23:20,231 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:20,231 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 02:23:20,231 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:20,231 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:20,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2112 [2022-12-13 02:23:20,231 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:23:20,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash 463049750, now seen corresponding path program 1 times [2022-12-13 02:23:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:20,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816624572] [2022-12-13 02:23:20,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:20,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:20,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:23:20,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:20,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816624572] [2022-12-13 02:23:20,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816624572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:20,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:20,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601361973] [2022-12-13 02:23:20,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:20,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:20,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:20,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:20,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:20,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:20,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:20,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:20,375 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:20,375 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:20,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:20,376 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:20,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:20,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:20,377 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:20,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:20,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:20,379 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:20,379 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:20,380 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:20,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:20,380 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:20,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:20,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:20,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:20,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:20,386 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:20,386 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:23:20,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:20,386 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:20,386 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:20,475 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:20,476 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:20,476 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:20,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:20,476 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:20,476 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:20,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2113 [2022-12-13 02:23:20,476 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:23:20,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:20,477 INFO L85 PathProgramCache]: Analyzing trace with hash 491678901, now seen corresponding path program 1 times [2022-12-13 02:23:20,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:20,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980862741] [2022-12-13 02:23:20,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:20,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:20,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:23:20,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:20,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980862741] [2022-12-13 02:23:20,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980862741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:20,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:20,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:20,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702967611] [2022-12-13 02:23:20,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:20,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:20,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:20,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:20,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:20,532 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:20,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:20,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:20,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:20,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:20,606 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:20,606 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:20,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:20,607 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:20,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:20,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:20,608 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:20,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:20,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:20,610 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:20,610 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:20,610 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:20,610 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:20,610 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:20,611 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:20,611 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:20,611 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:20,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:20,616 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:20,616 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:20,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:20,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:20,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:20,704 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:20,704 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:20,704 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:20,704 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 02:23:20,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:20,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:20,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2114 [2022-12-13 02:23:20,704 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:23:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:20,705 INFO L85 PathProgramCache]: Analyzing trace with hash 520308052, now seen corresponding path program 1 times [2022-12-13 02:23:20,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:20,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712066962] [2022-12-13 02:23:20,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:20,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:20,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:23:20,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:20,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712066962] [2022-12-13 02:23:20,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712066962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:20,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:20,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6521005] [2022-12-13 02:23:20,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:20,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:20,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:20,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:20,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:20,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:20,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:20,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:20,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:20,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:20,833 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:20,834 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:20,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:20,835 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:20,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:20,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:20,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:20,835 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:20,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:20,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:20,838 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:20,838 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:20,838 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:20,838 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:20,838 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:20,839 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:20,839 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:20,839 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:20,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:20,844 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:20,844 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:20,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:20,845 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:20,845 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:20,932 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:20,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:20,932 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:20,933 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 02:23:20,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:20,933 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:20,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2115 [2022-12-13 02:23:20,933 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:23:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:20,933 INFO L85 PathProgramCache]: Analyzing trace with hash 548937203, now seen corresponding path program 1 times [2022-12-13 02:23:20,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:20,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910498759] [2022-12-13 02:23:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:20,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:20,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:23:20,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:20,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910498759] [2022-12-13 02:23:20,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910498759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:20,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:20,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:20,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430968824] [2022-12-13 02:23:20,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:20,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:20,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:20,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:20,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:20,985 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:20,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:20,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:20,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:20,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:21,053 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:21,053 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:21,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:21,054 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:21,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:21,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:21,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:21,055 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:21,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:21,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:21,057 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,057 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:21,057 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:21,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:21,057 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,058 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:21,058 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:21,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:21,063 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:21,063 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:21,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:21,064 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:21,064 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:21,175 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:21,176 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:23:21,176 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:21,176 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 02:23:21,176 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:21,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:21,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2116 [2022-12-13 02:23:21,176 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:23:21,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:21,176 INFO L85 PathProgramCache]: Analyzing trace with hash 577566354, now seen corresponding path program 1 times [2022-12-13 02:23:21,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:21,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783740254] [2022-12-13 02:23:21,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:21,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:21,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:23:21,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:21,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783740254] [2022-12-13 02:23:21,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783740254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:21,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:21,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096022031] [2022-12-13 02:23:21,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:21,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:21,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:21,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:21,228 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:21,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:21,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:21,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:21,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:21,305 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:21,305 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:21,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:21,306 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:21,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:21,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:21,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:21,307 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:21,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:21,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:21,309 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,309 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:21,309 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:21,309 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:21,310 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,310 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:21,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:21,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:21,315 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:21,315 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:21,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:21,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:21,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:21,403 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:21,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:21,404 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:21,404 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 02:23:21,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:21,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:21,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2117 [2022-12-13 02:23:21,404 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:23:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:21,405 INFO L85 PathProgramCache]: Analyzing trace with hash 606195505, now seen corresponding path program 1 times [2022-12-13 02:23:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:21,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527857606] [2022-12-13 02:23:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:21,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:21,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:23:21,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:21,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527857606] [2022-12-13 02:23:21,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527857606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:21,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:21,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:21,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547474509] [2022-12-13 02:23:21,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:21,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:21,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:21,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:21,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:21,466 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:21,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:21,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:21,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:21,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:21,531 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:21,531 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:21,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:21,532 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:21,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:21,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:21,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:21,533 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:21,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:21,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:21,536 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:21,536 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:21,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:21,536 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:21,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:21,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:21,542 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:21,542 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:21,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:21,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:21,543 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:21,631 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:21,631 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:21,632 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:21,632 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 02:23:21,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:21,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:21,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2118 [2022-12-13 02:23:21,632 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:23:21,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:21,632 INFO L85 PathProgramCache]: Analyzing trace with hash 634824656, now seen corresponding path program 1 times [2022-12-13 02:23:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:21,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715420164] [2022-12-13 02:23:21,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:21,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:21,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:23:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:21,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715420164] [2022-12-13 02:23:21,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715420164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:21,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:21,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772699535] [2022-12-13 02:23:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:21,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:21,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:21,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:21,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:21,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:21,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:21,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:21,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:21,750 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:21,750 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:21,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:21,751 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:21,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:21,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:21,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:21,751 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:21,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:21,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:21,754 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,754 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:21,754 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:21,754 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:21,754 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,754 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:21,754 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:21,754 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:21,760 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:21,760 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:21,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 465 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:21,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:21,761 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:21,848 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:21,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:21,849 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:21,849 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 02:23:21,849 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:21,849 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:21,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2119 [2022-12-13 02:23:21,849 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:23:21,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:21,849 INFO L85 PathProgramCache]: Analyzing trace with hash 663453807, now seen corresponding path program 1 times [2022-12-13 02:23:21,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:21,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286918565] [2022-12-13 02:23:21,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:21,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:21,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:23:21,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:21,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286918565] [2022-12-13 02:23:21,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286918565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:21,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:21,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:21,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301378493] [2022-12-13 02:23:21,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:21,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:21,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:21,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:21,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:21,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:21,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:21,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:21,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:21,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:21,969 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:21,969 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:21,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:21,971 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:21,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:21,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:21,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:21,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:21,971 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:21,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:21,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:21,973 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,973 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:21,974 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:21,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:21,974 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,974 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:21,974 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:21,974 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:21,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:21,980 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:21,980 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:21,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:21,980 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:21,980 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:22,071 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:22,072 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:23:22,072 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:22,072 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 02:23:22,072 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:22,072 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:22,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2120 [2022-12-13 02:23:22,072 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:23:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:22,072 INFO L85 PathProgramCache]: Analyzing trace with hash 692082958, now seen corresponding path program 1 times [2022-12-13 02:23:22,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:22,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130720363] [2022-12-13 02:23:22,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:22,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:22,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:23:22,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:22,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130720363] [2022-12-13 02:23:22,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130720363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:22,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:22,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:22,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469323709] [2022-12-13 02:23:22,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:22,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:22,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:22,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:22,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:22,126 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:22,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:22,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:22,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:22,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:22,194 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:22,194 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:22,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:22,195 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:22,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:22,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:22,196 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:22,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:22,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:22,198 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:22,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:22,198 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:22,199 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:22,199 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:22,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:22,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:22,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:22,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:22,205 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:22,205 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:22,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:22,205 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:22,205 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:22,295 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:22,296 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:23:22,296 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:22,296 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 02:23:22,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:22,296 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:22,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2121 [2022-12-13 02:23:22,296 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:23:22,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:22,296 INFO L85 PathProgramCache]: Analyzing trace with hash 720712109, now seen corresponding path program 1 times [2022-12-13 02:23:22,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:22,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060728218] [2022-12-13 02:23:22,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:22,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:22,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 02:23:22,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:22,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060728218] [2022-12-13 02:23:22,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060728218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:22,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:22,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:22,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596442245] [2022-12-13 02:23:22,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:22,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:22,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:22,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:22,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:22,350 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:22,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:22,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:22,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:22,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:22,416 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:22,416 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:22,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:22,417 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:22,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:22,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:22,417 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:22,418 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:22,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:22,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:22,420 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:22,420 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:22,420 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:22,420 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:22,420 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:22,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:22,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:22,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:22,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:22,426 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:22,426 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:22,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:22,427 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:22,427 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:22,515 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:22,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:22,515 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:22,515 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 02:23:22,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:22,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:22,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2122 [2022-12-13 02:23:22,516 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:23:22,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash 749341260, now seen corresponding path program 1 times [2022-12-13 02:23:22,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:22,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858624534] [2022-12-13 02:23:22,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:22,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:23:22,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:22,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858624534] [2022-12-13 02:23:22,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858624534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:22,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:22,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:22,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93010421] [2022-12-13 02:23:22,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:22,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:22,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:22,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:22,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:22,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:22,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:22,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:22,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:22,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:22,648 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:22,648 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:22,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1127 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:22,649 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:22,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:22,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:22,650 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:22,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:22,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:22,652 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:22,652 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:22,652 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:22,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:22,652 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:22,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:22,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:22,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:22,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:22,658 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:22,658 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:22,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:22,659 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:22,659 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:22,746 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:22,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:22,747 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:22,747 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 02:23:22,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:22,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:22,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2123 [2022-12-13 02:23:22,747 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:23:22,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:22,747 INFO L85 PathProgramCache]: Analyzing trace with hash 777970411, now seen corresponding path program 1 times [2022-12-13 02:23:22,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:22,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322082927] [2022-12-13 02:23:22,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:22,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:22,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:23:22,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:22,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322082927] [2022-12-13 02:23:22,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322082927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:22,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:22,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:22,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758703895] [2022-12-13 02:23:22,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:22,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:22,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:22,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:22,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:22,801 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:22,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:22,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:22,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:22,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:22,877 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:22,877 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:22,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:22,878 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:22,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:22,879 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:22,879 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:22,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:22,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:22,882 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:22,882 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:22,882 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:22,882 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:22,882 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:22,882 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:22,882 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:22,882 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:22,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:22,888 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:22,888 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:22,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:22,889 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:22,889 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:22,977 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:22,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:22,977 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:22,977 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 02:23:22,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:22,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:22,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2124 [2022-12-13 02:23:22,978 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:23:22,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:22,978 INFO L85 PathProgramCache]: Analyzing trace with hash 806599562, now seen corresponding path program 1 times [2022-12-13 02:23:22,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:22,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248263301] [2022-12-13 02:23:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:22,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:23,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:23:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:23,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248263301] [2022-12-13 02:23:23,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248263301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:23,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:23,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:23,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743350994] [2022-12-13 02:23:23,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:23,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:23,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:23,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:23,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:23,032 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:23,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:23,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:23,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:23,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:23,109 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:23,109 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:23,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:23,110 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:23,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:23,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:23,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:23,110 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:23,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:23,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:23,113 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:23,113 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:23,113 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:23,113 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:23,113 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:23,113 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:23,114 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:23,114 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:23,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:23,119 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:23,119 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:23,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:23,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:23,120 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:23,209 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:23,209 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:23,210 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:23,210 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 02:23:23,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:23,210 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:23,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2125 [2022-12-13 02:23:23,210 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:23:23,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:23,210 INFO L85 PathProgramCache]: Analyzing trace with hash 835228713, now seen corresponding path program 1 times [2022-12-13 02:23:23,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:23,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398852693] [2022-12-13 02:23:23,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:23,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:23,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:23:23,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:23,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398852693] [2022-12-13 02:23:23,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398852693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:23,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:23,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:23,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919517399] [2022-12-13 02:23:23,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:23,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:23,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:23,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:23,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:23,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:23,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:23,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:23,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:23,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:23,328 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:23,328 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:23,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:23,329 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:23,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:23,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:23,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:23,330 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:23,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:23,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:23,332 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:23,332 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:23,332 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:23,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:23,333 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:23,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:23,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:23,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:23,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:23,338 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:23,338 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:23,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:23,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:23,339 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:23,427 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:23,428 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:23,428 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:23,428 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 02:23:23,428 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:23,428 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:23,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2126 [2022-12-13 02:23:23,428 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:23:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:23,428 INFO L85 PathProgramCache]: Analyzing trace with hash 863857864, now seen corresponding path program 1 times [2022-12-13 02:23:23,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:23,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492320003] [2022-12-13 02:23:23,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:23,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:23,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:23:23,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:23,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492320003] [2022-12-13 02:23:23,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492320003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:23,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:23,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:23,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583959205] [2022-12-13 02:23:23,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:23,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:23,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:23,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:23,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:23,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:23,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:23,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:23,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:23,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:23,548 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:23,548 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:23,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:23,549 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:23,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:23,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:23,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:23,549 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:23,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:23,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:23,552 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:23,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:23,552 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:23,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:23,552 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:23,552 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:23,552 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:23,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:23,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:23,558 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:23,558 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:23,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:23,559 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:23,559 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:23,647 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:23,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:23,647 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:23,647 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 02:23:23,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:23,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:23,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2127 [2022-12-13 02:23:23,648 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:23:23,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:23,648 INFO L85 PathProgramCache]: Analyzing trace with hash 892487015, now seen corresponding path program 1 times [2022-12-13 02:23:23,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:23,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55593351] [2022-12-13 02:23:23,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:23,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:23,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:23:23,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:23,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55593351] [2022-12-13 02:23:23,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55593351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:23,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:23,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:23,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008804495] [2022-12-13 02:23:23,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:23,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:23,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:23,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:23,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:23,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:23,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:23,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:23,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:23,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:23,765 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:23,765 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:23,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:23,766 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:23,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:23,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:23,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:23,767 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:23,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:23,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:23,769 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:23,769 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:23,769 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:23,769 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:23,769 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:23,770 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:23,770 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:23,770 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:23,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:23,775 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:23,775 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:23,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:23,785 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:23,785 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:23,872 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:23,873 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:23:23,873 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:23,873 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 02:23:23,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:23,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:23,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2128 [2022-12-13 02:23:23,873 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:23:23,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash 921116166, now seen corresponding path program 1 times [2022-12-13 02:23:23,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:23,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419605453] [2022-12-13 02:23:23,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:23,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:23,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 02:23:23,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:23,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419605453] [2022-12-13 02:23:23,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419605453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:23,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:23,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:23,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065998046] [2022-12-13 02:23:23,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:23,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:23,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:23,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:23,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:23,942 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:23,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:23,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:23,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:23,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:24,020 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:24,021 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:24,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:24,022 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:24,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:24,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:24,022 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:24,022 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:24,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:24,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:24,025 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,025 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:24,025 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:24,025 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:24,025 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,025 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:24,025 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:24,025 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:24,031 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:24,031 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:24,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:24,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:24,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:24,119 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:24,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:24,119 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:24,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:24,119 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:24,119 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:24,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2129 [2022-12-13 02:23:24,120 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:23:24,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:24,120 INFO L85 PathProgramCache]: Analyzing trace with hash 949745317, now seen corresponding path program 1 times [2022-12-13 02:23:24,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:24,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242500444] [2022-12-13 02:23:24,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:24,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:24,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:23:24,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:24,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242500444] [2022-12-13 02:23:24,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242500444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:24,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:24,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:24,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592231604] [2022-12-13 02:23:24,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:24,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:24,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:24,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:24,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:24,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:24,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:24,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:24,238 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:24,238 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:24,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:24,239 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:24,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:24,240 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:24,240 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:24,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:24,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:24,242 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,242 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:24,243 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:24,243 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:24,243 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:24,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:24,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:24,249 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:24,249 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:24,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:24,249 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:24,249 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:24,338 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:24,338 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:24,338 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:24,338 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 02:23:24,338 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:24,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:24,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2130 [2022-12-13 02:23:24,339 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:23:24,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash 978374468, now seen corresponding path program 1 times [2022-12-13 02:23:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:24,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847004827] [2022-12-13 02:23:24,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:24,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:24,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 02:23:24,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:24,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847004827] [2022-12-13 02:23:24,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847004827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:24,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:24,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:24,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357274255] [2022-12-13 02:23:24,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:24,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:24,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:24,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:24,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:24,393 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:24,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:24,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:24,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:24,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:24,459 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:24,460 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:24,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:24,461 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:24,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:24,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:24,461 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:24,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:24,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:24,464 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,464 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:24,464 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:24,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:24,464 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:24,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:24,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:24,470 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:24,470 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:24,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:24,471 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:24,471 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:24,558 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:24,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:24,559 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:24,559 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 02:23:24,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:24,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:24,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2131 [2022-12-13 02:23:24,559 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:23:24,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:24,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1007003619, now seen corresponding path program 1 times [2022-12-13 02:23:24,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:24,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729484604] [2022-12-13 02:23:24,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:24,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:24,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:23:24,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:24,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729484604] [2022-12-13 02:23:24,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729484604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:24,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:24,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357290496] [2022-12-13 02:23:24,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:24,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:24,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:24,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:24,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:24,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:24,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:24,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:24,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:24,686 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:24,686 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:24,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:24,687 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:24,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:24,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:24,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:24,688 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:24,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:24,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:24,691 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:24,691 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:24,691 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:24,691 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,691 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:24,691 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:24,691 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:24,697 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:24,697 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:24,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:24,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:24,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:24,785 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:24,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:24,786 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:24,786 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 02:23:24,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:24,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:24,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2132 [2022-12-13 02:23:24,786 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:23:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:24,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1035632770, now seen corresponding path program 1 times [2022-12-13 02:23:24,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:24,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069001580] [2022-12-13 02:23:24,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:24,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:23:24,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:24,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069001580] [2022-12-13 02:23:24,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069001580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:24,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:24,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:24,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851281082] [2022-12-13 02:23:24,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:24,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:24,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:24,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:24,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:24,839 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:24,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:24,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:24,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:24,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:24,914 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:24,914 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:24,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:24,916 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:24,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:24,916 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:24,916 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:24,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:24,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:24,919 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:24,919 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:24,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:24,919 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:24,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:24,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:24,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:24,925 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:24,925 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:24,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:24,926 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:24,926 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:25,013 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:25,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:25,014 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:25,014 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 02:23:25,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:25,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:25,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2133 [2022-12-13 02:23:25,014 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:23:25,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:25,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1064261921, now seen corresponding path program 1 times [2022-12-13 02:23:25,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:25,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411764907] [2022-12-13 02:23:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:25,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:23:25,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:25,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411764907] [2022-12-13 02:23:25,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411764907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:25,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:25,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:25,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242710881] [2022-12-13 02:23:25,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:25,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:25,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:25,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:25,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:25,077 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:25,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:25,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:25,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:25,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:25,153 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:25,154 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:25,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:25,155 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:25,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:25,155 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:25,155 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:25,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:25,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:25,158 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:25,158 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:25,158 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:25,158 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:25,158 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:25,158 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:25,158 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:25,158 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:25,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:25,164 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:25,164 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:25,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:25,165 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:25,165 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:25,252 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:25,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:25,253 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:25,253 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 02:23:25,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:25,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:25,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2134 [2022-12-13 02:23:25,253 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:23:25,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:25,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1092891072, now seen corresponding path program 1 times [2022-12-13 02:23:25,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:25,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411450549] [2022-12-13 02:23:25,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:25,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:25,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:23:25,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:25,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411450549] [2022-12-13 02:23:25,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411450549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:25,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:25,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:25,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658386439] [2022-12-13 02:23:25,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:25,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:25,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:25,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:25,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:25,309 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:25,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:25,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:25,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:25,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:25,385 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:25,385 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:25,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:25,387 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:25,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:25,387 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:25,387 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:25,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:25,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:25,390 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:25,390 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:25,390 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:25,390 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:25,390 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:25,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:25,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:25,391 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:25,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:25,396 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:25,396 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:25,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:25,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:25,397 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:25,485 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:25,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:25,486 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:25,486 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 02:23:25,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:25,486 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:25,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2135 [2022-12-13 02:23:25,486 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:23:25,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:25,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1121520223, now seen corresponding path program 1 times [2022-12-13 02:23:25,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:25,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981999248] [2022-12-13 02:23:25,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:25,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23: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:23:25,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:25,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981999248] [2022-12-13 02:23:25,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981999248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:25,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:25,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:25,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263531959] [2022-12-13 02:23:25,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:25,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:25,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:25,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:25,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:25,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:25,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:25,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:25,619 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:25,620 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:25,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:25,621 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:25,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:25,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:25,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:25,621 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:25,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:25,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:25,624 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:25,624 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:25,625 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:25,625 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:25,625 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:25,625 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:25,625 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:25,625 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:25,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:25,632 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:25,632 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:25,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:25,633 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:25,633 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:25,722 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:25,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:23:25,722 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:25,722 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 02:23:25,722 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:25,722 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:25,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2136 [2022-12-13 02:23:25,723 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:23:25,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:25,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1150149374, now seen corresponding path program 1 times [2022-12-13 02:23:25,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:25,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815075774] [2022-12-13 02:23:25,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:25,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:25,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:23:25,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:25,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815075774] [2022-12-13 02:23:25,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815075774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:25,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:25,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:25,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425722897] [2022-12-13 02:23:25,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:25,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:25,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:25,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:25,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:25,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:25,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:25,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:25,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:25,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:25,870 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:25,870 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:25,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:25,871 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:25,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:25,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:25,872 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:25,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:25,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:25,874 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:25,875 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:25,875 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:25,875 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:25,875 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:25,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:25,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:25,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:25,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:25,881 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:25,881 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:25,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:25,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:25,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:25,970 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:25,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:25,971 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:25,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:25,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:25,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:25,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2137 [2022-12-13 02:23:25,971 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:23:25,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1178778525, now seen corresponding path program 1 times [2022-12-13 02:23:25,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:25,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985852780] [2022-12-13 02:23:25,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:25,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:26,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:23:26,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:26,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985852780] [2022-12-13 02:23:26,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985852780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:26,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:26,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:26,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145097600] [2022-12-13 02:23:26,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:26,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:26,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:26,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:26,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:26,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:26,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:26,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:26,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:26,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:26,103 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:26,103 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:26,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:26,104 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:26,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:26,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:26,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:26,105 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:26,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:26,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:26,107 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:26,107 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:26,107 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:26,107 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:26,107 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:26,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:26,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:26,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:26,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:26,113 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:26,113 INFO L131 PetriNetUnfolder]: For 435/453 co-relation queries the response was YES. [2022-12-13 02:23:26,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/453 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:26,114 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:26,114 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:26,201 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:26,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:26,202 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:26,202 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 02:23:26,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:26,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:26,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2138 [2022-12-13 02:23:26,202 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:23:26,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:26,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1207407676, now seen corresponding path program 1 times [2022-12-13 02:23:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:26,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533788262] [2022-12-13 02:23:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:26,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23: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 02:23:26,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:26,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533788262] [2022-12-13 02:23:26,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533788262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:26,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:26,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:26,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324600756] [2022-12-13 02:23:26,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:26,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:26,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:26,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:26,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:26,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:26,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:26,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:26,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:26,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:26,337 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:26,337 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:26,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:26,338 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:26,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:26,338 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:26,338 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:26,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:26,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:26,341 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:26,341 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:26,341 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:26,341 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:26,341 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:26,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:26,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:26,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:26,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:26,347 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:26,347 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:26,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:26,348 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:26,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:26,450 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:26,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 02:23:26,451 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:26,451 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 02:23:26,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:26,451 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:26,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2139 [2022-12-13 02:23:26,451 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:23:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1236036827, now seen corresponding path program 1 times [2022-12-13 02:23:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:26,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267745483] [2022-12-13 02:23:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:26,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:26,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:23:26,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:26,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267745483] [2022-12-13 02:23:26,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267745483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:26,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:26,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:26,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533767248] [2022-12-13 02:23:26,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:26,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:26,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:26,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:26,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:26,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:26,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:26,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:26,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:26,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:26,574 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:26,574 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:26,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:26,575 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:26,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:26,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:26,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:26,576 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:26,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:26,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:26,578 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:26,578 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:26,579 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:26,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:26,579 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:26,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:26,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:26,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:26,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:26,584 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:26,585 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:26,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:26,585 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:26,585 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:26,673 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:26,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:26,674 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:26,674 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 02:23:26,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:26,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:26,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2140 [2022-12-13 02:23:26,674 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:23:26,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1264665978, now seen corresponding path program 1 times [2022-12-13 02:23:26,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:26,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955329327] [2022-12-13 02:23:26,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:26,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:26,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:23:26,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:26,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955329327] [2022-12-13 02:23:26,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955329327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:26,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:26,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:26,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538275387] [2022-12-13 02:23:26,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:26,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:26,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:26,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:26,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:26,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:26,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:26,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:26,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:26,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:26,793 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:26,794 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:26,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:26,795 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:26,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:26,795 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:26,795 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:26,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:26,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:26,798 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:26,798 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:26,798 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:26,798 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:26,798 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:26,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:26,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:26,799 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:26,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:26,804 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:26,804 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:26,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:26,805 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:26,805 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:26,892 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:26,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:26,892 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:26,892 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 02:23:26,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:26,893 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:26,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2141 [2022-12-13 02:23:26,893 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:23:26,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1293295129, now seen corresponding path program 1 times [2022-12-13 02:23:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:26,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653862575] [2022-12-13 02:23:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:26,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:26,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:23:26,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:26,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653862575] [2022-12-13 02:23:26,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653862575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:26,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:26,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:26,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452055811] [2022-12-13 02:23:26,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:26,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:26,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:26,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:26,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:26,945 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:26,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:26,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:26,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:26,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:27,011 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:27,011 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:27,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:27,013 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:27,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:27,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:27,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:27,013 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:27,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:27,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:27,016 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,016 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:27,016 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:27,016 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:27,016 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,016 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:27,016 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:27,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:27,022 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:27,022 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:27,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:27,022 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:27,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:27,111 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:27,111 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:27,111 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:27,111 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 02:23:27,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:27,111 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:27,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2142 [2022-12-13 02:23:27,111 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:23:27,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:27,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1321924280, now seen corresponding path program 1 times [2022-12-13 02:23:27,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:27,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005962170] [2022-12-13 02:23:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:27,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:23:27,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:27,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005962170] [2022-12-13 02:23:27,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005962170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:27,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:27,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:27,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497299087] [2022-12-13 02:23:27,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:27,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:27,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:27,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:27,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:27,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:27,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:27,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:27,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:27,242 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:27,242 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:27,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:27,243 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:27,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:27,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:27,244 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:27,244 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:27,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:27,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:27,247 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,247 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:27,247 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:27,247 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:27,247 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,247 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:27,247 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:27,247 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:27,253 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:27,253 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:27,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:27,253 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:27,253 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:27,340 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:27,341 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:27,341 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:27,341 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 02:23:27,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:27,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:27,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2143 [2022-12-13 02:23:27,341 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:23:27,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1350553431, now seen corresponding path program 1 times [2022-12-13 02:23:27,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:27,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531497370] [2022-12-13 02:23:27,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:27,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:27,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:23:27,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:27,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531497370] [2022-12-13 02:23:27,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531497370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:27,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:27,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:27,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737615449] [2022-12-13 02:23:27,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:27,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:27,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:27,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:27,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:27,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:27,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:27,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:27,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:27,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:27,471 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:27,471 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:27,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:27,472 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:27,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:27,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:27,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:27,473 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:27,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:27,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:27,475 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,476 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:27,476 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:27,476 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:27,476 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,476 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:27,476 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:27,476 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:27,482 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:27,482 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:27,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:27,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:27,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:27,570 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:27,571 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:27,571 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:27,571 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 02:23:27,571 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:27,571 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:27,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2144 [2022-12-13 02:23:27,571 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:23:27,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:27,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1379182582, now seen corresponding path program 1 times [2022-12-13 02:23:27,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:27,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317354308] [2022-12-13 02:23:27,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:27,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:27,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:23:27,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:27,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317354308] [2022-12-13 02:23:27,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317354308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:27,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:27,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:27,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750047279] [2022-12-13 02:23:27,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:27,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:27,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:27,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:27,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:27,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:27,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:27,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:27,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:27,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:27,717 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:27,717 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:27,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:27,718 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:27,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:27,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:27,719 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:27,719 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:27,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:27,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:27,722 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:27,722 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:27,722 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:27,722 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,722 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:27,722 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:27,722 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:27,728 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:27,728 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:27,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:27,728 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:27,728 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:27,816 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:27,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:27,817 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:27,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:27,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:27,817 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:27,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2145 [2022-12-13 02:23:27,817 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:23:27,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:27,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1407811733, now seen corresponding path program 1 times [2022-12-13 02:23:27,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:27,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121259414] [2022-12-13 02:23:27,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:27,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:27,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:27,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121259414] [2022-12-13 02:23:27,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121259414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:27,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:27,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:27,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361680935] [2022-12-13 02:23:27,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:27,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:27,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:27,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:27,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:27,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:27,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:27,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:27,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:27,936 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:27,936 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:27,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:27,937 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:27,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:27,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:27,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:27,937 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:27,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:27,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:27,940 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,940 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:27,940 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:27,940 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:27,940 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,941 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:27,941 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:27,941 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:27,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:27,949 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:27,950 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:27,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:27,950 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:27,950 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:28,059 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:28,060 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:23:28,060 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:28,060 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 02:23:28,060 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:28,060 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:28,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2146 [2022-12-13 02:23:28,060 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:23:28,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:28,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1436440884, now seen corresponding path program 1 times [2022-12-13 02:23:28,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:28,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999884961] [2022-12-13 02:23:28,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:28,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:28,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:28,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999884961] [2022-12-13 02:23:28,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999884961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:28,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:28,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:28,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038442030] [2022-12-13 02:23:28,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:28,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:28,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:28,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:28,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:28,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:28,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:28,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:28,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:28,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:28,193 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:28,193 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:28,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:28,194 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:28,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:28,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:28,194 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:28,195 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:28,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:28,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:28,197 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:28,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:28,197 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:28,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:28,197 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:28,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:28,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:28,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:28,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:28,203 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:28,203 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:28,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:28,204 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:28,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:28,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:28,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:28,292 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:28,292 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 02:23:28,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:28,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:28,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2147 [2022-12-13 02:23:28,292 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:23:28,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:28,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1465070035, now seen corresponding path program 1 times [2022-12-13 02:23:28,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:28,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780322930] [2022-12-13 02:23:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:28,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:28,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:23:28,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:28,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780322930] [2022-12-13 02:23:28,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780322930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:28,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:28,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:28,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969534234] [2022-12-13 02:23:28,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:28,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:28,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:28,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:28,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:28,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:28,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:28,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:28,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:28,446 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:28,446 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:28,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:28,447 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:28,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:28,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:28,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:28,448 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:28,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:28,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:28,450 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:28,450 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:28,450 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:28,451 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:28,451 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:28,451 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:28,451 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:28,451 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:28,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:28,457 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:28,457 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:28,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:28,457 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:28,457 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:28,545 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:28,545 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:28,546 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:28,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:28,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:28,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:28,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2148 [2022-12-13 02:23:28,546 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:23:28,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1493699186, now seen corresponding path program 1 times [2022-12-13 02:23:28,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:28,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908574559] [2022-12-13 02:23:28,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:28,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:28,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 02:23:28,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:28,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908574559] [2022-12-13 02:23:28,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908574559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:28,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:28,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:28,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774857555] [2022-12-13 02:23:28,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:28,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:28,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:28,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:28,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:28,600 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:28,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:28,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:28,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:28,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:28,676 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:28,676 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:28,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:28,677 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:28,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:28,677 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:28,678 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:28,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:28,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:28,680 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:28,680 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:28,680 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:28,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:28,681 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:28,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:28,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:28,690 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:28,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:28,696 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:28,696 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:28,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:28,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:28,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:28,784 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:28,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:23:28,784 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:28,784 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 02:23:28,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:28,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:28,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2149 [2022-12-13 02:23:28,784 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:23:28,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:28,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1522328337, now seen corresponding path program 1 times [2022-12-13 02:23:28,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:28,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513802690] [2022-12-13 02:23:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:28,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23: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:23:28,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:28,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513802690] [2022-12-13 02:23:28,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513802690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:28,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:28,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:28,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643991858] [2022-12-13 02:23:28,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:28,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:28,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:28,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:28,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:28,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:28,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:28,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:28,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:28,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:28,904 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:28,905 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:28,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:28,906 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:28,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:28,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:28,906 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:28,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:28,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:28,909 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:28,909 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:28,909 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:28,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:28,909 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:28,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:28,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:28,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:28,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:28,915 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:28,915 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:28,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:28,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:28,915 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:29,004 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:29,004 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:29,005 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:29,005 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 02:23:29,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:29,005 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:29,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2150 [2022-12-13 02:23:29,005 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:23:29,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:29,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1550957488, now seen corresponding path program 1 times [2022-12-13 02:23:29,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:29,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757286749] [2022-12-13 02:23:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:29,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:29,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:23:29,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:29,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757286749] [2022-12-13 02:23:29,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757286749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:29,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:29,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:29,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741344471] [2022-12-13 02:23:29,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:29,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:29,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:29,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:29,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:29,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:29,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:29,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:29,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:29,135 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:29,136 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:29,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:29,137 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:29,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:29,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:29,137 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:29,137 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:29,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:29,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:29,140 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:29,140 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:29,140 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:29,140 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:29,140 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:29,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:29,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:29,140 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:29,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:29,146 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:29,146 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:29,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:29,147 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:29,147 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:29,233 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:29,234 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:29,234 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:29,234 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 02:23:29,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:29,234 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:29,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2151 [2022-12-13 02:23:29,234 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:23:29,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:29,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1579586639, now seen corresponding path program 1 times [2022-12-13 02:23:29,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:29,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223809725] [2022-12-13 02:23:29,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:29,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:29,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:23:29,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:29,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223809725] [2022-12-13 02:23:29,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223809725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:29,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:29,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:29,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680575585] [2022-12-13 02:23:29,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:29,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:29,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:29,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:29,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:29,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:29,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:29,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:29,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:29,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:29,355 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:29,355 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:29,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:29,356 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:29,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:29,357 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:29,357 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:29,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:29,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:29,360 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:29,360 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:29,360 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:29,360 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:29,360 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:29,360 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:29,360 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:29,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:29,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:29,366 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:29,366 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:29,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:29,366 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:29,366 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:29,454 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:29,454 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:29,454 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:29,455 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 02:23:29,455 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:29,455 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:29,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2152 [2022-12-13 02:23:29,455 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:23:29,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:29,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1608215790, now seen corresponding path program 1 times [2022-12-13 02:23:29,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:29,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671032726] [2022-12-13 02:23:29,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:29,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:29,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:23:29,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:29,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671032726] [2022-12-13 02:23:29,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671032726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:29,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:29,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:29,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048535900] [2022-12-13 02:23:29,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:29,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:29,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:29,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:29,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:29,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:29,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:29,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:29,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:29,574 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:29,574 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:29,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:29,575 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:29,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:29,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:29,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:29,576 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:29,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:29,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:29,578 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:29,578 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:29,579 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:29,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:29,579 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:29,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:29,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:29,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:29,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:29,585 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:29,585 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:29,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:29,585 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:29,585 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:29,673 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:29,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:29,673 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:29,673 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 02:23:29,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:29,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:29,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2153 [2022-12-13 02:23:29,673 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:23:29,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1636844941, now seen corresponding path program 1 times [2022-12-13 02:23:29,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:29,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664229842] [2022-12-13 02:23:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:29,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:29,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:23:29,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:29,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664229842] [2022-12-13 02:23:29,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664229842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:29,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:29,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204486529] [2022-12-13 02:23:29,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:29,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:29,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:29,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:29,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:29,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:29,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:29,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:29,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:29,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:29,827 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:29,827 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:29,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:29,828 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:29,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:29,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:29,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:29,829 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:29,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:29,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:29,831 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:29,831 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:29,832 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:29,832 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:29,832 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:29,832 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:29,832 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:29,832 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:29,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:29,837 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:29,838 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:29,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:29,838 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:29,838 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:29,926 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:29,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:29,927 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:29,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:29,927 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:29,927 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:29,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2154 [2022-12-13 02:23:29,927 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:23:29,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1665474092, now seen corresponding path program 1 times [2022-12-13 02:23:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:29,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923728753] [2022-12-13 02:23:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23: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:23:29,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:29,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923728753] [2022-12-13 02:23:29,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923728753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:29,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:29,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:29,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654847415] [2022-12-13 02:23:29,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:29,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:29,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:29,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:29,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:29,986 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:29,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:29,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:29,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:29,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:30,061 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:30,061 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:30,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:30,063 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:30,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:30,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:30,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:30,063 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:30,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:30,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:30,066 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:30,066 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:30,066 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:30,066 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:30,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:30,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:30,072 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:30,072 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:30,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:30,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:30,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:30,160 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:30,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:30,161 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:30,161 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 02:23:30,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:30,161 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:30,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2155 [2022-12-13 02:23:30,161 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:23:30,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:30,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1694103243, now seen corresponding path program 1 times [2022-12-13 02:23:30,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:30,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216567677] [2022-12-13 02:23:30,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:30,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:30,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:23:30,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:30,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216567677] [2022-12-13 02:23:30,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216567677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:30,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:30,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:30,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930036483] [2022-12-13 02:23:30,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:30,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:30,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:30,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:30,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:30,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:30,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:30,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:30,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:30,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:30,291 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:30,292 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:30,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:30,293 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:30,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:30,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:30,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:30,293 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:30,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:30,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:30,296 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,296 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:30,296 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:30,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:30,296 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,296 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:30,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:30,296 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:30,302 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:30,302 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:30,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:30,303 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:30,303 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:30,391 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:30,391 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:30,391 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:30,391 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 02:23:30,391 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:30,391 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:30,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2156 [2022-12-13 02:23:30,392 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:23:30,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:30,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1722732394, now seen corresponding path program 1 times [2022-12-13 02:23:30,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:30,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622875066] [2022-12-13 02:23:30,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:30,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:30,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:23:30,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:30,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622875066] [2022-12-13 02:23:30,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622875066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:30,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:30,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:30,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371041066] [2022-12-13 02:23:30,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:30,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:30,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:30,445 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:30,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:30,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:30,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:30,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:30,511 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:30,511 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:30,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:30,512 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:30,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:30,513 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:30,513 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:30,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:30,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:30,515 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,515 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:30,516 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:30,516 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:30,516 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:30,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:30,516 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:30,522 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:30,522 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:30,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:30,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:30,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:30,610 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:30,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:30,610 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:30,610 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 02:23:30,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:30,610 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:30,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2157 [2022-12-13 02:23:30,611 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:23:30,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:30,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1751361545, now seen corresponding path program 1 times [2022-12-13 02:23:30,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:30,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360546266] [2022-12-13 02:23:30,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:30,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:30,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:23:30,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:30,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360546266] [2022-12-13 02:23:30,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360546266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:30,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:30,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:30,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191856379] [2022-12-13 02:23:30,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:30,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:30,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:30,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:30,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:30,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:30,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:30,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:30,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:30,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:30,739 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:30,739 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:30,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:30,740 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:30,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:30,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:30,741 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:30,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:30,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:30,743 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,744 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:30,744 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:30,744 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:30,744 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:30,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:30,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:30,751 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:30,751 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:30,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:30,752 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:30,752 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:30,839 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:30,840 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:30,840 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:30,840 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 02:23:30,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:30,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:30,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2158 [2022-12-13 02:23:30,840 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:23:30,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:30,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1779990696, now seen corresponding path program 1 times [2022-12-13 02:23:30,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:30,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249502856] [2022-12-13 02:23:30,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:30,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:30,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:23:30,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:30,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249502856] [2022-12-13 02:23:30,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249502856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:30,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:30,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:30,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137281439] [2022-12-13 02:23:30,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:30,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:30,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:30,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:30,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:30,896 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:30,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:30,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:30,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:30,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:30,973 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:30,973 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:30,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:30,974 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:30,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:30,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:30,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:30,975 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:30,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:30,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:30,977 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:30,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:30,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:30,978 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:30,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:30,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:30,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:30,983 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:30,983 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:30,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:30,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:30,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:31,073 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:31,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:31,073 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:31,073 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 02:23:31,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:31,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:31,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2159 [2022-12-13 02:23:31,074 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:23:31,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:31,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1808619847, now seen corresponding path program 1 times [2022-12-13 02:23:31,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:31,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484567862] [2022-12-13 02:23:31,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:31,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:23:31,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:31,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484567862] [2022-12-13 02:23:31,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484567862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:31,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:31,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:31,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821925919] [2022-12-13 02:23:31,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:31,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:31,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:31,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:31,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:31,141 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:31,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:31,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:31,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:31,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:31,207 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:31,207 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:31,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:31,209 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:31,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:31,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:31,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:31,209 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:31,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:31,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:31,212 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:31,212 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:31,212 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:31,212 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:31,212 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:31,212 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:31,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:31,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:31,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:31,218 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:31,218 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:31,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:31,219 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:31,219 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:31,306 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:31,306 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:31,306 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:31,306 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 02:23:31,306 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:31,306 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:31,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2160 [2022-12-13 02:23:31,307 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:23:31,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:31,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1837248998, now seen corresponding path program 1 times [2022-12-13 02:23:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:31,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178948525] [2022-12-13 02:23:31,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:31,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:23:31,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:31,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178948525] [2022-12-13 02:23:31,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178948525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:31,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:31,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:31,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229483406] [2022-12-13 02:23:31,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:31,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:31,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:31,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:31,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:31,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:31,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:31,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:31,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:31,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:31,427 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:31,427 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:31,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:31,428 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:31,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:31,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:31,429 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:31,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:31,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:31,431 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:31,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:31,431 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:31,431 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:31,432 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:31,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:31,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:31,432 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:31,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:31,437 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:31,437 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:31,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:31,438 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:31,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:31,525 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:31,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:31,526 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:31,526 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 02:23:31,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:31,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:31,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2161 [2022-12-13 02:23:31,526 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:23:31,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:31,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1865878149, now seen corresponding path program 1 times [2022-12-13 02:23:31,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:31,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693890746] [2022-12-13 02:23:31,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:31,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:31,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:23:31,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:31,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693890746] [2022-12-13 02:23:31,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693890746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:31,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:31,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:31,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235787848] [2022-12-13 02:23:31,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:31,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:31,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:31,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:31,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:31,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:31,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:31,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:31,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:31,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:31,643 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:31,644 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:31,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:31,645 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:31,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:31,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:31,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:31,645 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:31,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:31,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:31,648 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:31,648 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:31,648 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:31,648 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:31,648 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:31,648 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:31,648 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:31,648 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:31,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:31,654 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:31,654 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:31,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:31,654 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:31,654 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:31,741 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:31,741 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:31,741 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:31,741 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 02:23:31,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:31,741 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:31,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2162 [2022-12-13 02:23:31,741 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:23:31,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1894507300, now seen corresponding path program 1 times [2022-12-13 02:23:31,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:31,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138110982] [2022-12-13 02:23:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:31,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:31,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:23:31,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:31,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138110982] [2022-12-13 02:23:31,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138110982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:31,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:31,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:31,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207197677] [2022-12-13 02:23:31,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:31,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:31,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:31,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:31,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:31,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:31,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:31,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:31,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:31,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:31,863 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:31,863 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:31,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:31,864 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:31,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:31,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:31,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:31,865 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:31,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:31,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:31,867 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:31,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:31,867 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:31,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:31,867 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:31,868 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:31,868 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:31,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:31,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:31,873 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:31,873 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:23:31,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:31,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:31,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:31,961 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:31,962 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:31,962 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:31,962 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 02:23:31,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:31,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:31,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2163 [2022-12-13 02:23:31,962 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:23:31,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:31,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1923136451, now seen corresponding path program 1 times [2022-12-13 02:23:31,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:31,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116785797] [2022-12-13 02:23:31,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:31,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:32,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:23:32,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:32,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116785797] [2022-12-13 02:23:32,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116785797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:32,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:32,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913121026] [2022-12-13 02:23:32,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:32,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:32,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:32,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:32,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:32,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:32,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:32,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:32,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:32,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:32,081 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:32,081 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:32,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:32,082 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:32,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:32,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:32,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:32,082 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:32,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:32,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:32,085 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:32,085 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:32,085 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:32,085 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,085 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:32,085 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:32,086 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:32,091 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:32,091 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:32,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:32,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:32,092 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:32,178 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:32,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:32,178 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:32,179 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 02:23:32,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:32,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:32,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2164 [2022-12-13 02:23:32,179 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:23:32,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:32,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1951765602, now seen corresponding path program 1 times [2022-12-13 02:23:32,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:32,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931911884] [2022-12-13 02:23:32,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:32,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:32,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:23:32,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:32,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931911884] [2022-12-13 02:23:32,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931911884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:32,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:32,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:32,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076362110] [2022-12-13 02:23:32,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:32,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:32,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:32,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:32,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:32,229 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:32,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:32,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:32,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:32,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:32,318 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:32,318 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:32,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:32,319 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:32,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:32,319 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:32,319 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:32,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:32,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:32,322 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,322 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:32,322 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:32,322 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:32,322 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,322 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:32,322 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:32,322 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:32,328 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:32,328 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:32,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:32,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:32,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:32,416 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:32,416 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:32,416 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:32,416 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 02:23:32,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:32,416 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:32,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2165 [2022-12-13 02:23:32,417 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:23:32,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1980394753, now seen corresponding path program 1 times [2022-12-13 02:23:32,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:32,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282049367] [2022-12-13 02:23:32,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:32,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:32,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:23:32,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:32,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282049367] [2022-12-13 02:23:32,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282049367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:32,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:32,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:32,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959697130] [2022-12-13 02:23:32,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:32,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:32,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:32,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:32,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:32,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:32,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:32,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:32,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:32,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:32,547 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:32,547 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:32,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:32,548 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:32,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:32,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:32,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:32,548 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:32,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:32,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:32,551 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,551 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:32,551 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:32,551 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:32,551 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,551 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:32,551 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:32,551 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:32,557 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:32,557 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:32,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:32,557 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:32,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:32,646 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:32,646 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:32,646 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:32,646 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 02:23:32,646 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:32,646 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:32,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2166 [2022-12-13 02:23:32,647 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:23:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:32,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2009023904, now seen corresponding path program 1 times [2022-12-13 02:23:32,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:32,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935273810] [2022-12-13 02:23:32,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:32,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:32,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:23:32,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:32,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935273810] [2022-12-13 02:23:32,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935273810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:32,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:32,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:32,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817254081] [2022-12-13 02:23:32,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:32,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:32,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:32,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:32,700 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:32,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:32,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:32,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:32,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:32,775 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:32,775 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:32,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:32,776 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:32,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:32,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:32,777 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:32,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:32,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:32,779 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,779 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:32,780 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:32,780 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:32,780 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:32,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:32,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:32,786 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:32,786 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:32,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:32,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:32,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:32,872 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:32,872 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:23:32,873 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:32,873 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 02:23:32,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:32,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:32,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2167 [2022-12-13 02:23:32,873 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:23:32,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:32,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2037653055, now seen corresponding path program 1 times [2022-12-13 02:23:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:32,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059101293] [2022-12-13 02:23:32,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:32,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 02:23:32,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:32,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059101293] [2022-12-13 02:23:32,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059101293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:32,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:32,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:32,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097865535] [2022-12-13 02:23:32,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:32,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:32,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:32,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:32,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:32,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:32,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:32,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:32,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:32,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:32,994 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:32,994 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:32,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:32,996 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:32,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:32,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:32,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:32,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:32,996 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:32,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:32,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:32,999 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,999 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:32,999 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:32,999 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:32,999 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,999 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:32,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:32,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:32,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:33,005 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:33,005 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:33,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:33,006 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:33,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:33,092 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:33,092 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:33,092 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:33,092 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 02:23:33,092 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:33,092 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:33,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2168 [2022-12-13 02:23:33,092 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:23:33,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:33,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2066282206, now seen corresponding path program 1 times [2022-12-13 02:23:33,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:33,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731459327] [2022-12-13 02:23:33,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:33,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:33,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:23:33,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:33,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731459327] [2022-12-13 02:23:33,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731459327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:33,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:33,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394524262] [2022-12-13 02:23:33,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:33,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:33,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:33,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:33,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:33,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:33,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:33,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:33,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:33,228 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:33,228 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:33,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:33,229 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:33,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:33,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:33,230 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:33,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:33,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:33,232 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:33,233 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:33,233 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:33,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:33,233 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:33,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:33,233 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:33,233 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:33,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:33,238 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:33,239 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:33,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:33,239 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:33,239 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:33,324 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:33,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:23:33,325 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:33,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:33,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:33,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:33,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2169 [2022-12-13 02:23:33,325 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:23:33,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:33,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2094911357, now seen corresponding path program 1 times [2022-12-13 02:23:33,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:33,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838052091] [2022-12-13 02:23:33,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:33,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:33,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:23:33,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:33,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838052091] [2022-12-13 02:23:33,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838052091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:33,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:33,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:33,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721197635] [2022-12-13 02:23:33,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:33,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:33,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:33,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:33,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:33,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:33,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:33,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:33,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:33,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:33,462 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:33,462 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:33,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:33,474 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:33,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:33,475 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:33,475 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:33,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:33,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:33,477 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:33,477 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:33,478 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:33,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:33,478 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:33,478 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:33,478 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:33,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:33,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:33,484 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:33,484 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:33,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:33,485 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:33,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:33,569 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:33,570 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:23:33,570 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:33,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:33,570 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:33,570 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:33,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2170 [2022-12-13 02:23:33,570 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:23:33,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:33,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2123540508, now seen corresponding path program 1 times [2022-12-13 02:23:33,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:33,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099066953] [2022-12-13 02:23:33,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:33,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:33,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:23:33,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:33,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099066953] [2022-12-13 02:23:33,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099066953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:33,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:33,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340344154] [2022-12-13 02:23:33,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:33,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:33,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:33,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:33,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:33,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:33,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:33,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:33,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:33,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:33,686 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:33,686 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:33,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:33,687 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:33,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:33,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:33,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:33,687 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:33,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:33,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:33,690 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:33,690 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:33,690 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:33,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:33,690 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:33,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:33,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:33,691 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:33,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:33,696 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:33,696 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:33,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:33,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:33,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:33,783 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:33,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:33,784 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:33,784 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 02:23:33,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:33,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:33,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2171 [2022-12-13 02:23:33,784 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:23:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2142797637, now seen corresponding path program 1 times [2022-12-13 02:23:33,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:33,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451474869] [2022-12-13 02:23:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:33,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:33,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:23:33,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:33,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451474869] [2022-12-13 02:23:33,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451474869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:33,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:33,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:33,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257609163] [2022-12-13 02:23:33,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:33,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:33,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:33,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:33,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:33,839 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:33,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:33,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:33,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:33,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:33,914 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:33,914 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:33,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:33,915 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:33,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:33,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:33,916 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:33,916 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:33,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:33,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:33,919 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:33,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:33,919 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:33,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:33,919 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:33,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:33,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:33,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:33,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:33,925 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:33,925 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:33,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:33,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:33,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:34,012 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:34,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:34,012 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:34,012 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 02:23:34,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:34,013 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:34,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2172 [2022-12-13 02:23:34,013 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:23:34,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:34,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2114168486, now seen corresponding path program 1 times [2022-12-13 02:23:34,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:34,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046515881] [2022-12-13 02:23:34,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:34,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:34,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 02:23:34,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:34,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046515881] [2022-12-13 02:23:34,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046515881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:34,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:34,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:34,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706470819] [2022-12-13 02:23:34,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:34,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:34,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:34,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:34,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:34,082 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:34,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:34,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:34,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:34,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:34,169 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:34,169 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:34,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:34,170 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:34,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:34,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:34,170 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:34,170 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:34,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:34,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:34,173 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:34,173 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:34,173 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:34,173 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:34,173 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:34,174 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:34,174 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:34,174 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:34,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:34,179 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:34,179 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:34,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:34,180 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:34,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:34,267 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:34,267 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:34,268 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:34,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:34,268 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:34,268 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:34,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2173 [2022-12-13 02:23:34,268 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:23:34,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:34,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2085539335, now seen corresponding path program 1 times [2022-12-13 02:23:34,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:34,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308723525] [2022-12-13 02:23:34,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:34,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:34,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:23:34,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:34,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308723525] [2022-12-13 02:23:34,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308723525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:34,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:34,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:34,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088767033] [2022-12-13 02:23:34,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:34,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:34,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:34,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:34,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:34,322 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:34,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:34,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:34,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:34,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:34,398 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:34,398 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:34,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:34,399 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:34,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:34,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:34,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:34,400 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:34,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:34,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:34,402 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:34,402 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:34,403 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:34,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:34,403 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:34,403 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:34,403 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:34,403 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:34,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:34,408 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:34,409 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:34,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:34,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:34,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:34,497 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:34,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:34,498 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:34,498 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 02:23:34,498 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:34,498 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:34,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2174 [2022-12-13 02:23:34,498 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:23:34,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:34,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2056910184, now seen corresponding path program 1 times [2022-12-13 02:23:34,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:34,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983560023] [2022-12-13 02:23:34,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:34,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:34,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:23:34,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983560023] [2022-12-13 02:23:34,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983560023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:34,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:34,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:34,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497383418] [2022-12-13 02:23:34,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:34,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:34,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:34,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:34,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:34,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:34,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:34,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:34,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:34,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:34,620 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:34,620 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:34,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:34,621 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:34,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:34,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:34,622 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:34,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:34,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:34,624 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:34,624 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:34,624 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:34,624 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:34,625 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:34,625 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:34,625 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:34,625 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:34,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:34,631 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:34,631 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:34,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:34,631 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:34,631 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:34,730 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:34,730 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:23:34,730 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:34,730 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 02:23:34,730 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:34,730 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:34,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2175 [2022-12-13 02:23:34,731 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:23:34,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:34,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2028281033, now seen corresponding path program 1 times [2022-12-13 02:23:34,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:34,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699338139] [2022-12-13 02:23:34,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:34,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:34,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:23:34,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:34,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699338139] [2022-12-13 02:23:34,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699338139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:34,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:34,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:34,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250907013] [2022-12-13 02:23:34,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:34,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:34,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:34,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:34,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:34,785 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:34,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:34,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:34,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:34,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:34,852 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:34,852 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:34,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:34,853 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:34,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:34,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:34,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:34,854 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:34,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:34,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:34,856 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:34,856 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:34,856 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:34,856 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:34,856 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:34,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:34,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:34,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:34,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:34,862 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:34,862 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:23:34,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:34,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:34,863 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:34,950 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:34,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:34,951 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:34,951 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 02:23:34,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:34,951 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:34,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2176 [2022-12-13 02:23:34,951 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:23:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1999651882, now seen corresponding path program 1 times [2022-12-13 02:23:34,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:34,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988589480] [2022-12-13 02:23:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:34,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:35,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:23:35,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:35,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988589480] [2022-12-13 02:23:35,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988589480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:35,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:35,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:35,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316814092] [2022-12-13 02:23:35,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:35,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:35,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:35,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:35,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:35,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:35,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:35,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:35,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:35,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:35,067 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:35,067 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:35,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:35,068 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:35,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:35,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:35,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:35,068 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:35,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:35,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:35,071 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,071 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:35,071 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:35,071 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:35,071 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,071 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:35,071 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:35,072 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:35,077 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:35,077 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:35,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:35,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:35,078 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:35,166 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:35,167 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:35,167 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:35,167 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 02:23:35,167 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:35,167 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:35,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2177 [2022-12-13 02:23:35,167 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:23:35,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:35,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1971022731, now seen corresponding path program 1 times [2022-12-13 02:23:35,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:35,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818820354] [2022-12-13 02:23:35,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:35,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:35,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 02:23:35,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:35,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818820354] [2022-12-13 02:23:35,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818820354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:35,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:35,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:35,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045220869] [2022-12-13 02:23:35,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:35,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:35,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:35,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:35,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:35,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:35,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:35,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:35,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:35,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:35,298 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:35,298 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:35,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:35,299 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:35,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:35,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:35,300 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:35,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:35,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:35,302 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,303 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:35,303 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:35,303 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:35,303 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,303 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:35,303 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:35,303 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:35,309 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:35,309 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:35,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:35,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:35,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:35,398 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:35,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:35,399 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:35,399 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 02:23:35,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:35,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:35,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2178 [2022-12-13 02:23:35,399 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:23:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:35,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1942393580, now seen corresponding path program 1 times [2022-12-13 02:23:35,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:35,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787744465] [2022-12-13 02:23:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:35,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:35,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:23:35,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:35,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787744465] [2022-12-13 02:23:35,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787744465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:35,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:35,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:35,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576174389] [2022-12-13 02:23:35,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:35,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:35,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:35,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:35,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:35,454 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:35,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:35,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:35,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:35,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:35,530 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:35,530 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:35,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:35,531 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:35,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:35,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:35,532 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:35,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:35,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:35,535 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:35,535 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:35,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:35,535 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,535 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:35,535 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:35,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:35,541 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:35,541 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:35,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:35,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:35,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:35,630 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:35,631 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:35,631 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:35,631 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 02:23:35,631 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:35,631 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:35,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2179 [2022-12-13 02:23:35,631 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:23:35,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:35,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1913764429, now seen corresponding path program 1 times [2022-12-13 02:23:35,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:35,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160099001] [2022-12-13 02:23:35,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:35,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:35,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:23:35,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:35,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160099001] [2022-12-13 02:23:35,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160099001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:35,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:35,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:35,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759415805] [2022-12-13 02:23:35,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:35,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:35,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:35,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:35,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:35,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:35,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:35,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:35,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:35,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:35,757 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:35,758 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:35,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:35,759 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:35,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:35,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:35,759 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:35,759 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:35,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:35,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:35,762 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,762 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:35,762 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:35,762 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:35,762 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,762 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:35,763 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:35,763 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:35,768 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:35,768 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:35,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:35,769 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:35,769 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:35,856 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:35,856 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:35,857 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:35,857 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 02:23:35,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:35,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:35,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2180 [2022-12-13 02:23:35,857 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:23:35,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:35,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1885135278, now seen corresponding path program 1 times [2022-12-13 02:23:35,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:35,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466937162] [2022-12-13 02:23:35,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:35,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:35,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:23:35,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:35,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466937162] [2022-12-13 02:23:35,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466937162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:35,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:35,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461071679] [2022-12-13 02:23:35,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:35,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:35,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:35,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:35,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:35,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:35,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:35,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:35,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:35,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:35,991 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:35,991 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:35,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:35,992 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:35,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:35,993 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:35,993 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:35,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:35,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:35,995 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,995 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:35,995 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:35,995 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:35,995 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,996 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:35,996 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:35,996 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:35,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:36,001 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:36,001 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:36,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:36,002 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:36,002 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:36,090 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:36,091 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:36,091 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:36,091 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 02:23:36,091 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:36,091 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:36,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2181 [2022-12-13 02:23:36,091 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:23:36,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:36,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1856506127, now seen corresponding path program 1 times [2022-12-13 02:23:36,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:36,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294475688] [2022-12-13 02:23:36,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:36,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:36,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:36,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294475688] [2022-12-13 02:23:36,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294475688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:36,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:36,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:36,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774361915] [2022-12-13 02:23:36,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:36,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:36,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:36,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:36,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:36,145 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:36,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:36,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:36,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:36,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:36,240 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:36,241 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:36,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:36,242 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:36,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:36,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:36,242 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:36,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:36,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:36,245 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:36,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:36,245 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:36,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:36,245 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:36,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:36,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:36,245 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:36,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:36,251 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:36,251 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:36,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:36,251 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:36,251 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:36,340 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:36,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:36,340 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:36,340 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 02:23:36,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:36,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:36,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2182 [2022-12-13 02:23:36,340 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:23:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:36,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1827876976, now seen corresponding path program 1 times [2022-12-13 02:23:36,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:36,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172145615] [2022-12-13 02:23:36,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:36,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:36,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:23:36,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:36,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172145615] [2022-12-13 02:23:36,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172145615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:36,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:36,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:36,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103064839] [2022-12-13 02:23:36,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:36,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:36,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:36,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:36,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:36,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:36,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:36,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:36,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:36,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:36,492 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:36,492 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:36,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:36,493 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:36,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:36,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:36,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:36,494 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:36,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:36,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:36,498 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:36,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:36,498 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:36,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:36,498 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:36,498 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:36,498 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:36,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:36,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:36,506 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:36,506 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:36,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:36,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:36,507 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:36,605 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:36,606 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:23:36,606 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:36,606 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 02:23:36,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:36,606 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:36,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2183 [2022-12-13 02:23:36,606 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:23:36,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:36,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1799247825, now seen corresponding path program 1 times [2022-12-13 02:23:36,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:36,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349738062] [2022-12-13 02:23:36,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:36,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:36,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:23:36,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:36,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349738062] [2022-12-13 02:23:36,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349738062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:36,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:36,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:36,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782715106] [2022-12-13 02:23:36,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:36,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:36,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:36,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:36,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:36,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:36,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:36,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:36,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:36,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:36,738 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:36,738 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:36,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:36,739 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:36,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:36,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:36,740 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:36,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:36,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:36,742 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:36,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:36,743 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:36,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:36,743 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:36,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:36,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:36,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:36,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:36,749 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:36,749 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:36,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:36,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:36,750 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:36,838 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:36,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:36,838 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:36,838 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 02:23:36,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:36,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:36,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2184 [2022-12-13 02:23:36,838 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:23:36,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:36,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1770618674, now seen corresponding path program 1 times [2022-12-13 02:23:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:36,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365177276] [2022-12-13 02:23:36,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:36,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:36,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:23:36,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:36,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365177276] [2022-12-13 02:23:36,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365177276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:36,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:36,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:36,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99932603] [2022-12-13 02:23:36,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:36,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:36,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:36,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:36,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:36,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:36,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:36,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:36,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:36,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:36,970 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:36,970 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:36,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:36,971 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:36,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:36,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:36,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:36,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:36,972 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:36,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:36,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:36,974 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:36,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:36,974 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:36,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:36,975 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:36,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:36,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:36,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:36,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:36,981 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:36,981 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:36,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:36,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:36,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:37,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:37,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:37,070 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:37,070 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 02:23:37,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:37,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:37,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2185 [2022-12-13 02:23:37,071 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:23:37,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:37,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1741989523, now seen corresponding path program 1 times [2022-12-13 02:23:37,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:37,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277827350] [2022-12-13 02:23:37,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:37,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:37,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:23:37,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:37,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277827350] [2022-12-13 02:23:37,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277827350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:37,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:37,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:37,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710591931] [2022-12-13 02:23:37,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:37,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:37,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:37,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:37,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:37,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:37,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:37,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:37,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:37,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:37,228 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:37,228 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:37,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:37,229 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:37,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:37,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:37,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:37,230 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:37,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:37,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:37,232 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:37,232 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:37,232 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:37,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:37,233 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:37,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:37,233 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:37,233 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:37,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:37,238 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:37,238 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:37,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:37,239 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:37,239 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:37,325 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:37,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:23:37,325 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:37,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:37,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:37,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:37,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2186 [2022-12-13 02:23:37,325 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:23:37,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:37,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1713360372, now seen corresponding path program 1 times [2022-12-13 02:23:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:37,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506942451] [2022-12-13 02:23:37,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:37,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:37,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:23:37,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:37,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506942451] [2022-12-13 02:23:37,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506942451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:37,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:37,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:37,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127754992] [2022-12-13 02:23:37,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:37,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:37,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:37,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:37,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:37,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:37,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:37,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:37,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:37,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:37,454 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:37,455 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:37,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:37,456 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:37,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:37,456 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:37,456 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:37,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:37,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:37,459 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:37,459 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:37,459 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:37,459 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:37,459 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:37,459 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:37,459 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:37,459 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:37,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:37,465 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:37,465 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:37,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:37,465 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:37,465 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:37,552 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:37,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:37,552 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:37,552 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 02:23:37,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:37,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:37,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2187 [2022-12-13 02:23:37,553 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:23:37,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:37,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1684731221, now seen corresponding path program 1 times [2022-12-13 02:23:37,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:37,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168679729] [2022-12-13 02:23:37,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:37,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:37,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:23:37,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:37,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168679729] [2022-12-13 02:23:37,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168679729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:37,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:37,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:37,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496405265] [2022-12-13 02:23:37,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:37,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:37,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:37,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:37,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:37,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:37,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:37,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:37,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:37,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:37,683 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:37,683 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:37,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:37,684 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:37,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:37,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:37,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:37,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:37,685 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:37,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:37,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:37,687 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:37,687 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:37,687 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:37,688 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:37,688 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:37,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:37,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:37,688 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:37,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:37,693 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:37,693 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:37,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:37,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:37,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:37,781 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:37,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:37,781 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:37,781 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 02:23:37,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:37,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:37,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2188 [2022-12-13 02:23:37,782 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:23:37,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:37,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1656102070, now seen corresponding path program 1 times [2022-12-13 02:23:37,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:37,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578621564] [2022-12-13 02:23:37,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:37,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:37,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:23:37,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:37,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578621564] [2022-12-13 02:23:37,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578621564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:37,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:37,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:37,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358431024] [2022-12-13 02:23:37,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:37,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:37,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:37,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:37,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:37,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:37,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:37,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:37,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:37,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:37,908 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:37,909 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:37,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:37,910 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:37,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:37,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:37,910 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:37,910 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:37,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:37,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:37,913 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:37,913 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:37,913 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:37,913 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:37,913 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:37,913 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:37,914 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:37,914 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:37,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:37,919 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:37,919 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:37,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:37,920 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:37,920 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:38,008 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:38,009 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:38,009 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:38,009 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 02:23:38,009 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:38,009 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:38,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2189 [2022-12-13 02:23:38,009 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:23:38,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1627472919, now seen corresponding path program 1 times [2022-12-13 02:23:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:38,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930178826] [2022-12-13 02:23:38,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:38,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:38,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:38,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930178826] [2022-12-13 02:23:38,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930178826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:38,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:38,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:38,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981566067] [2022-12-13 02:23:38,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:38,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:38,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:38,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:38,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:38,064 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:38,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:38,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:38,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:38,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:38,130 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:38,130 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:38,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:38,131 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:38,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:38,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:38,132 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:38,132 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:38,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:38,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:38,134 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:38,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:38,134 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:38,134 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:38,134 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:38,135 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:38,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:38,135 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:38,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:38,140 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:38,140 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:38,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:38,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:38,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:38,227 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:38,228 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:38,228 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:38,228 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 02:23:38,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:38,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:38,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2190 [2022-12-13 02:23:38,228 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:23:38,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:38,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1598843768, now seen corresponding path program 1 times [2022-12-13 02:23:38,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:38,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096216888] [2022-12-13 02:23:38,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:38,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:38,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:38,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096216888] [2022-12-13 02:23:38,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096216888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:38,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:38,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:38,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852936096] [2022-12-13 02:23:38,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:38,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:38,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:38,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:38,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:38,290 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:38,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:38,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:38,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:38,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:38,376 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:38,377 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:38,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:38,378 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:38,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:38,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:38,378 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:38,378 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:38,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:38,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:38,380 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:38,381 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:38,381 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:38,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:38,381 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:38,381 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:38,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:38,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:38,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:38,387 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:38,387 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:38,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:38,387 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:38,387 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:38,474 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:38,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:38,474 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:38,474 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 02:23:38,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:38,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:38,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2191 [2022-12-13 02:23:38,475 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:23:38,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1570214617, now seen corresponding path program 1 times [2022-12-13 02:23:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:38,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813576866] [2022-12-13 02:23:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:38,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:23:38,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:38,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813576866] [2022-12-13 02:23:38,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813576866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:38,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:38,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:38,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185557980] [2022-12-13 02:23:38,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:38,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:38,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:38,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:38,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:38,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:38,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:38,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:38,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:38,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:38,594 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:38,594 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:38,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:38,595 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:38,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:38,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:38,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:38,596 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:38,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:38,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:38,598 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:38,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:38,598 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:38,598 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:38,598 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:38,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:38,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:38,599 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:38,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:38,604 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:38,604 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:38,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:38,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:38,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:38,693 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:38,693 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:38,693 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:38,693 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 02:23:38,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:38,694 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:38,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2192 [2022-12-13 02:23:38,694 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:23:38,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1541585466, now seen corresponding path program 1 times [2022-12-13 02:23:38,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:38,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139753956] [2022-12-13 02:23:38,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:38,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:38,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:23:38,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:38,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139753956] [2022-12-13 02:23:38,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139753956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:38,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:38,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:38,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947197778] [2022-12-13 02:23:38,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:38,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:38,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:38,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:38,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:38,747 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:38,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:38,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:38,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:38,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:38,823 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:38,823 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:38,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:38,825 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:38,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:38,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:38,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:38,825 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:38,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:38,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:38,828 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:38,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:38,828 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:38,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:38,828 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:38,828 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:38,828 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:38,828 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:38,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:38,834 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:38,834 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:38,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:38,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:38,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:38,921 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:38,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:38,922 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:38,922 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 02:23:38,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:38,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:38,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2193 [2022-12-13 02:23:38,922 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:23:38,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1512956315, now seen corresponding path program 1 times [2022-12-13 02:23:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:38,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798312582] [2022-12-13 02:23:38,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:38,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:38,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:23:38,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:38,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798312582] [2022-12-13 02:23:38,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798312582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:38,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:38,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:38,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720619417] [2022-12-13 02:23:38,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:38,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:38,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:38,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:38,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:38,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:38,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:38,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:38,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:38,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:39,077 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:39,077 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:39,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:39,078 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:39,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:39,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:39,079 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:39,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:39,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:39,082 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:39,082 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:39,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:39,082 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:39,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:39,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:39,088 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:39,088 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:39,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:39,089 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:39,089 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:39,176 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:39,176 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:39,176 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:39,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:39,176 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:39,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:39,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2194 [2022-12-13 02:23:39,176 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:23:39,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1484327164, now seen corresponding path program 1 times [2022-12-13 02:23:39,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:39,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397632441] [2022-12-13 02:23:39,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:39,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:39,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:23:39,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:39,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397632441] [2022-12-13 02:23:39,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397632441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:39,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:39,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:39,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244726722] [2022-12-13 02:23:39,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:39,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:39,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:39,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:39,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:39,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:39,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:39,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:39,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:39,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:39,298 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:39,298 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:39,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:39,299 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:39,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:39,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:39,299 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:39,299 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:39,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:39,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:39,302 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,302 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:39,302 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:39,302 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:39,302 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,303 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:39,303 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:39,303 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:39,308 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:39,308 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:39,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:39,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:39,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:39,397 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:39,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:39,398 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:39,398 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 02:23:39,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:39,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:39,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2195 [2022-12-13 02:23:39,398 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:23:39,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1455698013, now seen corresponding path program 1 times [2022-12-13 02:23:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:39,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578269390] [2022-12-13 02:23:39,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:39,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:39,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:23:39,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:39,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578269390] [2022-12-13 02:23:39,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578269390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:39,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:39,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:39,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000114364] [2022-12-13 02:23:39,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:39,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:39,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:39,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:39,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:39,451 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:39,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:39,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:39,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:39,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:39,517 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:39,517 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:39,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:39,518 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:39,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:39,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:39,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:39,519 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:39,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:39,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:39,521 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:39,521 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:39,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:39,521 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,522 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:39,522 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:39,522 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:39,527 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:39,527 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:39,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:39,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:39,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:39,625 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:39,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:23:39,626 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:39,626 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 02:23:39,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:39,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:39,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2196 [2022-12-13 02:23:39,626 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:23:39,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:39,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1427068862, now seen corresponding path program 1 times [2022-12-13 02:23:39,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:39,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981270529] [2022-12-13 02:23:39,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:39,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:39,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:23:39,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:39,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981270529] [2022-12-13 02:23:39,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981270529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:39,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:39,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:39,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882066200] [2022-12-13 02:23:39,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:39,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:39,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:39,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:39,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:39,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:39,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:39,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:39,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:39,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:39,755 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:39,755 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:39,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:39,757 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:39,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:39,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:39,757 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:39,757 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:39,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:39,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:39,759 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:39,760 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:39,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:39,760 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:39,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:39,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:39,766 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:39,766 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:39,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:39,766 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:39,766 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:39,854 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:39,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:39,854 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:39,854 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 02:23:39,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:39,855 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:39,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2197 [2022-12-13 02:23:39,855 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:23:39,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:39,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1398439711, now seen corresponding path program 1 times [2022-12-13 02:23:39,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:39,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709041870] [2022-12-13 02:23:39,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:39,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:39,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:23:39,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:39,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709041870] [2022-12-13 02:23:39,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709041870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:39,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:39,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:39,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802569620] [2022-12-13 02:23:39,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:39,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:39,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:39,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:39,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:39,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:39,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:39,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:39,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:39,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:39,973 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:39,973 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:39,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1095 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:39,974 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:39,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:39,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:39,975 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:39,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:39,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:39,977 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:39,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:39,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:39,977 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:39,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:39,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:39,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:39,983 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:39,983 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:39,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:39,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:39,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:40,072 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:40,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:40,073 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:40,073 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 02:23:40,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:40,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:40,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2198 [2022-12-13 02:23:40,073 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:23:40,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:40,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1369810560, now seen corresponding path program 1 times [2022-12-13 02:23:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:40,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549869125] [2022-12-13 02:23:40,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:40,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:40,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:23:40,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:40,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549869125] [2022-12-13 02:23:40,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549869125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:40,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:40,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:40,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928309689] [2022-12-13 02:23:40,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:40,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:40,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:40,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:40,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:40,126 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:40,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:40,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:40,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:40,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:40,203 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:40,204 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:40,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:40,205 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:40,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:40,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:40,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:40,205 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:40,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:40,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:40,208 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:40,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:40,208 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:40,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:40,208 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:40,208 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:40,208 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:40,208 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:40,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:40,214 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:40,214 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:40,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:40,215 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:40,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:40,304 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:40,305 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:23:40,305 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:40,305 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 02:23:40,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:40,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:40,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2199 [2022-12-13 02:23:40,305 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:23:40,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:40,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1341181409, now seen corresponding path program 1 times [2022-12-13 02:23:40,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:40,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265822446] [2022-12-13 02:23:40,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:40,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:40,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:23:40,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:40,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265822446] [2022-12-13 02:23:40,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265822446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:40,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:40,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:40,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811282023] [2022-12-13 02:23:40,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:40,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:40,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:40,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:40,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:40,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:40,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:40,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:40,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:40,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:40,423 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:40,423 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:40,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:40,424 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:40,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:40,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:40,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:40,425 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:40,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:40,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:40,427 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:40,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:40,428 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:40,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:40,428 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:40,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:40,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:40,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:40,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:40,433 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:40,433 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:40,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:40,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:40,434 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:40,522 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:40,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:40,522 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:40,522 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 02:23:40,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:40,522 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:40,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2200 [2022-12-13 02:23:40,523 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:23:40,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:40,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1312552258, now seen corresponding path program 1 times [2022-12-13 02:23:40,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:40,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572727226] [2022-12-13 02:23:40,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:40,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 02:23:40,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:40,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572727226] [2022-12-13 02:23:40,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572727226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:40,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:40,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:40,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760997308] [2022-12-13 02:23:40,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:40,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:40,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:40,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:40,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:40,577 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:40,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:40,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:40,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:40,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:40,652 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:40,652 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:40,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:40,653 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:40,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:40,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:40,654 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:40,654 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:40,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:40,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:40,656 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:40,656 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:40,656 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:40,656 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:40,656 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:40,657 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:40,657 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:40,657 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:40,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:40,662 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:40,662 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:40,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:40,663 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:40,663 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:40,750 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:40,750 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:40,750 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:40,750 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 02:23:40,751 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:40,751 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:40,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2201 [2022-12-13 02:23:40,751 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:23:40,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:40,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1283923107, now seen corresponding path program 1 times [2022-12-13 02:23:40,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:40,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300097341] [2022-12-13 02:23:40,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:40,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:40,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:23:40,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:40,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300097341] [2022-12-13 02:23:40,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300097341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:40,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:40,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:40,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413777461] [2022-12-13 02:23:40,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:40,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:40,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:40,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:40,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:40,816 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:40,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:40,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:40,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:40,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:40,892 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:40,892 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:40,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:40,893 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:40,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:40,894 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:40,894 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:40,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:40,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:40,896 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:40,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:40,896 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:40,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:40,897 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:40,897 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:40,897 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:40,897 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:40,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:40,902 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:40,902 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:40,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:40,903 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:40,903 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:40,991 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:40,992 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:40,992 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:40,992 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 02:23:40,992 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:40,992 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:40,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2202 [2022-12-13 02:23:40,992 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:23:40,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:40,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1255293956, now seen corresponding path program 1 times [2022-12-13 02:23:40,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:40,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521018731] [2022-12-13 02:23:40,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:40,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:41,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:41,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521018731] [2022-12-13 02:23:41,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521018731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:41,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:41,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:41,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647581262] [2022-12-13 02:23:41,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:41,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:41,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:41,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:41,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:41,046 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:41,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:41,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:41,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:41,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:41,123 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:41,123 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:41,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:41,124 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:41,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:41,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:41,125 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:41,125 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:41,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:41,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:41,127 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:41,127 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:41,127 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:41,127 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:41,127 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:41,128 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:41,128 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:41,128 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:41,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:41,133 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:41,133 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:41,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:41,134 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:41,134 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:41,222 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:41,223 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:41,223 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:41,223 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 02:23:41,223 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:41,223 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:41,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2203 [2022-12-13 02:23:41,223 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:23:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:41,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1226664805, now seen corresponding path program 1 times [2022-12-13 02:23:41,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:41,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74269329] [2022-12-13 02:23:41,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:41,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:41,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:23:41,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:41,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74269329] [2022-12-13 02:23:41,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74269329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:41,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:41,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:41,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186060817] [2022-12-13 02:23:41,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:41,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:41,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:41,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:41,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:41,277 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:41,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:41,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:41,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:41,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:41,343 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:41,343 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:41,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:41,345 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:41,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:41,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:41,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:41,345 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:41,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:41,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:41,348 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:41,348 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:41,348 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:41,348 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:41,348 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:41,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:41,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:41,348 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:41,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:41,354 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:41,354 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:41,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:41,355 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:41,355 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:41,441 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:41,441 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:41,441 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:41,441 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 02:23:41,441 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:41,441 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:41,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2204 [2022-12-13 02:23:41,441 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:23:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1198035654, now seen corresponding path program 1 times [2022-12-13 02:23:41,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:41,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662456119] [2022-12-13 02:23:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:41,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:41,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:23:41,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:41,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662456119] [2022-12-13 02:23:41,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662456119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:41,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:41,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:41,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487658702] [2022-12-13 02:23:41,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:41,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:41,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:41,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:41,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:41,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:41,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:41,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:41,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:41,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:41,562 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:41,562 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:41,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:41,563 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:41,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:41,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:41,564 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:41,564 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:41,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:41,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:41,566 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:41,566 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:41,566 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:41,566 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:41,566 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:41,567 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:41,567 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:41,567 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:41,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:41,572 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:41,572 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:41,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:41,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:41,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:41,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:41,660 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:41,660 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:41,661 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 02:23:41,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:41,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:41,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2205 [2022-12-13 02:23:41,661 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:23:41,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:41,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1169406503, now seen corresponding path program 1 times [2022-12-13 02:23:41,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:41,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522164293] [2022-12-13 02:23:41,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:41,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:41,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:23:41,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:41,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522164293] [2022-12-13 02:23:41,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522164293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:41,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:41,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:41,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239342007] [2022-12-13 02:23:41,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:41,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:41,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:41,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:41,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:41,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:41,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:41,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:41,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:41,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:41,782 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:41,782 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:41,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:41,783 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:41,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:41,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:41,784 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:41,784 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:41,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:41,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:41,787 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:41,787 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:41,787 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:41,787 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:41,787 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:41,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:41,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:41,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:41,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:41,793 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:41,793 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:41,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:41,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:41,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:41,880 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:41,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:41,881 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:41,881 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 02:23:41,881 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:41,881 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:41,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2206 [2022-12-13 02:23:41,881 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:23:41,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:41,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1140777352, now seen corresponding path program 1 times [2022-12-13 02:23:41,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:41,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439005688] [2022-12-13 02:23:41,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:41,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:41,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:23:41,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:41,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439005688] [2022-12-13 02:23:41,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439005688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:41,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:41,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:41,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739370672] [2022-12-13 02:23:41,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:41,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:41,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:41,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:41,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:41,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:41,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:41,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:41,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:41,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:42,020 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:42,020 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:42,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:42,021 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:42,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:42,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:42,022 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:42,022 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:42,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:42,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:42,024 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,025 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:42,025 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:42,025 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:42,025 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,025 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:42,025 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:42,025 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:42,031 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:42,031 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:42,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:42,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:42,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:42,118 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:42,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:42,119 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:42,119 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 02:23:42,119 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:42,119 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:42,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2207 [2022-12-13 02:23:42,119 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:23:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:42,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1112148201, now seen corresponding path program 1 times [2022-12-13 02:23:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:42,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145772728] [2022-12-13 02:23:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:42,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:42,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:23:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:42,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145772728] [2022-12-13 02:23:42,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145772728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:42,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:42,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:42,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113476917] [2022-12-13 02:23:42,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:42,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:42,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:42,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:42,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:42,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:42,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:42,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:42,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:42,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:42,264 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:42,264 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:42,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:42,266 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:42,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:42,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:42,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:42,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:42,266 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:42,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:42,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:42,269 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,269 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:42,269 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:42,269 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:42,269 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,269 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:42,269 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:42,269 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:42,275 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:42,275 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:42,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:42,275 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:42,276 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:42,363 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:42,364 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:42,364 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:42,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:42,364 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:42,364 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:42,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2208 [2022-12-13 02:23:42,364 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:23:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:42,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1083519050, now seen corresponding path program 1 times [2022-12-13 02:23:42,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:42,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748775995] [2022-12-13 02:23:42,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:42,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:42,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 02:23:42,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:42,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748775995] [2022-12-13 02:23:42,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748775995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:42,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:42,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058650133] [2022-12-13 02:23:42,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:42,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:42,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:42,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:42,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:42,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:42,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:42,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:42,486 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:42,486 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:42,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:42,487 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:42,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:42,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:42,487 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:42,487 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:42,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:42,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:42,490 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,490 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:42,490 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:42,490 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:42,490 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,490 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:42,491 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:42,491 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:42,496 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:42,496 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:42,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:42,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:42,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:42,583 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:42,583 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:42,583 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:42,584 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 02:23:42,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:42,584 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:42,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2209 [2022-12-13 02:23:42,584 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:23:42,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1054889899, now seen corresponding path program 1 times [2022-12-13 02:23:42,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:42,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574919484] [2022-12-13 02:23:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:42,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23: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:23:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:42,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574919484] [2022-12-13 02:23:42,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574919484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:42,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:42,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:42,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685060902] [2022-12-13 02:23:42,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:42,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:42,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:42,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:42,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:42,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:42,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:42,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:42,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:42,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:42,714 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:42,715 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:42,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:42,716 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:42,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:42,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:42,716 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:42,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:42,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:42,719 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,719 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:42,719 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:42,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:42,719 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:42,720 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:42,720 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:42,725 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:42,725 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:42,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:42,726 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:42,726 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:42,814 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:42,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:42,814 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:42,814 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 02:23:42,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:42,814 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:42,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2210 [2022-12-13 02:23:42,815 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:23:42,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1026260748, now seen corresponding path program 1 times [2022-12-13 02:23:42,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:42,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505307886] [2022-12-13 02:23:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:42,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:23:42,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:42,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505307886] [2022-12-13 02:23:42,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505307886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:42,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:42,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:42,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269977033] [2022-12-13 02:23:42,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:42,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:42,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:42,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:42,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:42,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:42,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:42,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:42,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:42,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:42,933 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:42,933 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:42,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:42,934 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:42,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:42,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:42,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:42,935 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:42,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:42,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:42,937 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,937 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:42,937 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:42,938 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:42,938 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,938 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:42,938 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:42,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:42,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:42,943 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:42,944 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:42,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:42,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:42,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:43,034 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:43,035 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:23:43,035 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:43,035 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 02:23:43,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:43,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:43,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2211 [2022-12-13 02:23:43,035 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:23:43,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash -997631597, now seen corresponding path program 1 times [2022-12-13 02:23:43,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:43,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972051019] [2022-12-13 02:23:43,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:43,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:43,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:23:43,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:43,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972051019] [2022-12-13 02:23:43,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972051019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:43,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:43,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:43,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476260524] [2022-12-13 02:23:43,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:43,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:43,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:43,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:43,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:43,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:43,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:43,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:43,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:43,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:43,183 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:43,183 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:43,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:43,184 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:43,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:43,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:43,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:43,185 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:43,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:43,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:43,187 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:43,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:43,187 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:43,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:43,187 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:43,187 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:43,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:43,188 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:43,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:43,193 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:43,193 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:43,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:43,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:43,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:43,280 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:43,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:43,281 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:43,281 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 02:23:43,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:43,281 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:43,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2212 [2022-12-13 02:23:43,281 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:23:43,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:43,281 INFO L85 PathProgramCache]: Analyzing trace with hash -969002446, now seen corresponding path program 1 times [2022-12-13 02:23:43,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:43,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811957442] [2022-12-13 02:23:43,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:43,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:23:43,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:43,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811957442] [2022-12-13 02:23:43,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811957442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:43,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:43,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:43,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393724128] [2022-12-13 02:23:43,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:43,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:43,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:43,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:43,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:43,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:43,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:43,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:43,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:43,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:43,399 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:43,399 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:43,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:43,401 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:43,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:43,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:43,401 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:43,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:43,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:43,404 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:43,404 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:43,404 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:43,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:43,404 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:43,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:43,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:43,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:43,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:43,410 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:43,410 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:43,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:43,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:43,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:43,497 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:43,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:43,498 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:43,498 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 02:23:43,498 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:43,498 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:43,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2213 [2022-12-13 02:23:43,498 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:23:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash -940373295, now seen corresponding path program 1 times [2022-12-13 02:23:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:43,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155027656] [2022-12-13 02:23:43,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:43,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:23:43,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:43,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155027656] [2022-12-13 02:23:43,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155027656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:43,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:43,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:43,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029389320] [2022-12-13 02:23:43,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:43,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:43,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:43,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:43,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:43,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:43,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:43,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:43,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:43,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:43,662 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:43,663 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:43,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:43,664 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:43,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:43,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:43,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:43,664 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:43,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:43,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:43,667 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:43,667 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:43,667 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:43,667 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:43,667 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:43,668 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:43,668 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:43,668 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:43,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:43,673 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:43,673 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:43,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:43,674 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:43,674 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:43,761 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:43,761 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:43,762 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:43,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:43,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:43,762 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:43,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2214 [2022-12-13 02:23:43,762 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:23:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash -911744144, now seen corresponding path program 1 times [2022-12-13 02:23:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:43,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771613378] [2022-12-13 02:23:43,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:43,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:43,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:23:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:43,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771613378] [2022-12-13 02:23:43,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771613378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:43,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:43,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:43,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869406669] [2022-12-13 02:23:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:43,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:43,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:43,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:43,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:43,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:43,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:43,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:43,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:43,884 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:43,884 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:43,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:43,885 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:43,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:43,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:43,886 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:43,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:43,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:43,888 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:43,888 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:43,888 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:43,888 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:43,888 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:43,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:43,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:43,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:43,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:43,894 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:43,894 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:43,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:43,895 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:43,895 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:43,982 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:43,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:43,983 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:43,983 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 02:23:43,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:43,983 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:43,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2215 [2022-12-13 02:23:43,983 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:23:43,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:43,983 INFO L85 PathProgramCache]: Analyzing trace with hash -883114993, now seen corresponding path program 1 times [2022-12-13 02:23:43,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:43,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610255758] [2022-12-13 02:23:43,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:43,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:44,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:23:44,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:44,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610255758] [2022-12-13 02:23:44,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610255758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:44,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:44,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:44,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814553223] [2022-12-13 02:23:44,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:44,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:44,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:44,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:44,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:44,038 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:44,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:44,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:44,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:44,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:44,113 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:44,113 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:44,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:44,114 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:44,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:44,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:44,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:44,115 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:44,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:44,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:44,117 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:44,118 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:44,118 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:44,118 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:44,118 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:44,118 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:44,118 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:44,118 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:44,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:44,123 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:44,124 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:44,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:44,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:44,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:44,211 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:44,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:44,212 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:44,212 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 02:23:44,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:44,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:44,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2216 [2022-12-13 02:23:44,212 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:23:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:44,212 INFO L85 PathProgramCache]: Analyzing trace with hash -854485842, now seen corresponding path program 1 times [2022-12-13 02:23:44,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:44,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768398914] [2022-12-13 02:23:44,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:44,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:44,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:23:44,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:44,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768398914] [2022-12-13 02:23:44,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768398914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:44,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:44,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:44,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75411436] [2022-12-13 02:23:44,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:44,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:44,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:44,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:44,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:44,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:44,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:44,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:44,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:44,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:44,347 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:44,347 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:44,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:44,348 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:44,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:44,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:44,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:44,349 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:44,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:44,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:44,351 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:44,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:44,351 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:44,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:44,351 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:44,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:44,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:44,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:44,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:44,367 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:44,367 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:44,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:44,367 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:44,367 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:44,454 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:44,455 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:23:44,455 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:44,455 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 02:23:44,455 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:44,455 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:44,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2217 [2022-12-13 02:23:44,455 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:23:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash -825856691, now seen corresponding path program 1 times [2022-12-13 02:23:44,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:44,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552827304] [2022-12-13 02:23:44,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:44,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:23:44,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:44,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552827304] [2022-12-13 02:23:44,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552827304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:44,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:44,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:44,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132565637] [2022-12-13 02:23:44,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:44,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:44,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:44,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:44,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:44,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:44,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:44,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:44,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:44,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:44,571 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:44,571 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:44,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:44,572 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:44,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:44,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:44,573 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:44,573 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:44,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:44,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:44,575 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:44,575 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:44,575 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:44,575 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:44,575 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:44,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:44,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:44,576 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:44,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:44,581 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:44,581 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:44,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:44,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:44,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:44,668 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:44,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:44,669 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:44,669 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 02:23:44,669 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:44,669 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:44,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2218 [2022-12-13 02:23:44,669 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:23:44,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash -797227540, now seen corresponding path program 1 times [2022-12-13 02:23:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:44,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992962981] [2022-12-13 02:23:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:44,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:23:44,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:44,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992962981] [2022-12-13 02:23:44,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992962981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:44,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:44,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:44,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361130160] [2022-12-13 02:23:44,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:44,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:44,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:44,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:44,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:44,722 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:44,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:44,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:44,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:44,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:44,790 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:44,790 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:44,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:44,791 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:44,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:44,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:44,792 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:44,792 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:44,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:44,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:44,794 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:44,794 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:44,794 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:44,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:44,795 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:44,795 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:44,795 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:44,795 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:44,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:44,800 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:44,800 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:23:44,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:44,801 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:44,801 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:44,890 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:44,890 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:44,891 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:44,891 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 02:23:44,891 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:44,891 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:44,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2219 [2022-12-13 02:23:44,891 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:23:44,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:44,891 INFO L85 PathProgramCache]: Analyzing trace with hash -768598389, now seen corresponding path program 1 times [2022-12-13 02:23:44,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:44,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324205662] [2022-12-13 02:23:44,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:44,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:44,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:23:44,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:44,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324205662] [2022-12-13 02:23:44,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324205662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:44,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:44,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:44,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372085488] [2022-12-13 02:23:44,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:44,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:44,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:44,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:44,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:44,945 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:44,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:44,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:44,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:44,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:45,022 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:45,022 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:45,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:45,023 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:45,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:45,024 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:45,024 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:45,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:45,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:45,027 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,027 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:45,027 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:45,027 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:45,027 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,027 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:45,027 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:45,027 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:45,033 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:45,033 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:23:45,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:45,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:45,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:45,120 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:45,121 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:45,121 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:45,121 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 02:23:45,121 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:45,121 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:45,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2220 [2022-12-13 02:23:45,121 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:23:45,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:45,121 INFO L85 PathProgramCache]: Analyzing trace with hash -739969238, now seen corresponding path program 1 times [2022-12-13 02:23:45,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:45,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685955174] [2022-12-13 02:23:45,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:45,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:45,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:23:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:45,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685955174] [2022-12-13 02:23:45,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685955174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:45,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:45,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:45,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205524699] [2022-12-13 02:23:45,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:45,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:45,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:45,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:45,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:45,190 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:45,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:45,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:45,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:45,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:45,266 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:45,266 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:45,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:45,267 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:45,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:45,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:45,267 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:45,267 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:45,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:45,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:45,270 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:45,270 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:45,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:45,270 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,270 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:45,270 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:45,270 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:45,276 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:45,276 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:45,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:45,277 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:45,277 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:45,364 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:45,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:45,365 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:45,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:45,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:45,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:45,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2221 [2022-12-13 02:23:45,365 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:23:45,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash -711340087, now seen corresponding path program 1 times [2022-12-13 02:23:45,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:45,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151347640] [2022-12-13 02:23:45,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:45,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:45,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 02:23:45,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:45,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151347640] [2022-12-13 02:23:45,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151347640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:45,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:45,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:45,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020478040] [2022-12-13 02:23:45,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:45,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:45,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:45,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:45,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:45,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:45,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:45,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:45,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:45,497 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:45,498 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:45,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:45,499 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:45,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:45,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:45,499 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:45,499 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:45,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:45,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:45,502 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,502 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:45,502 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:45,502 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:45,502 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,502 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:45,502 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:45,502 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:45,508 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:45,508 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:45,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:45,509 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:45,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:45,596 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:45,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:45,597 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:45,597 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 02:23:45,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:45,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:45,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2222 [2022-12-13 02:23:45,597 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:23:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:45,597 INFO L85 PathProgramCache]: Analyzing trace with hash -682710936, now seen corresponding path program 1 times [2022-12-13 02:23:45,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:45,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439143767] [2022-12-13 02:23:45,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:45,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 02:23:45,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:45,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439143767] [2022-12-13 02:23:45,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439143767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:45,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:45,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:45,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257733460] [2022-12-13 02:23:45,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:45,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:45,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:45,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:45,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:45,658 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:45,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:45,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:45,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:45,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:45,723 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:45,724 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:45,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:45,725 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:45,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:45,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:45,725 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:45,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:45,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:45,728 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,728 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:45,728 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:45,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:45,728 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,728 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:45,729 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:45,729 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:45,734 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:45,734 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:45,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:45,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:45,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:45,822 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:45,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:45,823 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:45,823 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 02:23:45,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:45,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:45,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2223 [2022-12-13 02:23:45,823 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:23:45,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash -654081785, now seen corresponding path program 1 times [2022-12-13 02:23:45,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:45,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769594320] [2022-12-13 02:23:45,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:45,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:45,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:23:45,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:45,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769594320] [2022-12-13 02:23:45,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769594320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:45,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:45,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:45,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017202664] [2022-12-13 02:23:45,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:45,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:45,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:45,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:45,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:45,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:45,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:45,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:45,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:45,944 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:45,944 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:45,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:45,946 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:45,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:45,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:45,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:45,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:45,946 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:45,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:45,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:45,949 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,949 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:45,949 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:45,949 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:45,949 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,949 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:45,949 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:45,949 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:45,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:45,955 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:45,955 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:45,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:45,955 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:45,955 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:46,043 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:46,043 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:46,043 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:46,043 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 02:23:46,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:46,043 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:46,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2224 [2022-12-13 02:23:46,044 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:23:46,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:46,044 INFO L85 PathProgramCache]: Analyzing trace with hash -625452634, now seen corresponding path program 1 times [2022-12-13 02:23:46,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:46,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789192258] [2022-12-13 02:23:46,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:46,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:46,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:23:46,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:46,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789192258] [2022-12-13 02:23:46,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789192258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:46,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:46,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:46,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354979565] [2022-12-13 02:23:46,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:46,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:46,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:46,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:46,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:46,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:46,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:46,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:46,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:46,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:46,162 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:46,163 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:46,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:46,164 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:46,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:46,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:46,164 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:46,164 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:46,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:46,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:46,167 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:46,167 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:46,167 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:46,167 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:46,167 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:46,167 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:46,167 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:46,167 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:46,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:46,173 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:46,173 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:46,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:46,174 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:46,174 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:46,261 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:46,261 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:46,262 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:46,262 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 02:23:46,262 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:46,262 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:46,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2225 [2022-12-13 02:23:46,262 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:23:46,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:46,262 INFO L85 PathProgramCache]: Analyzing trace with hash -596823483, now seen corresponding path program 1 times [2022-12-13 02:23:46,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:46,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671541450] [2022-12-13 02:23:46,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:46,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:46,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:23:46,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:46,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671541450] [2022-12-13 02:23:46,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671541450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:46,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:46,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:46,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113498915] [2022-12-13 02:23:46,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:46,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:46,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:46,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:46,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:46,317 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:46,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:46,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:46,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:46,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:46,382 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:46,382 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:46,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:46,383 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:46,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:46,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:46,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:46,384 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:46,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:46,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:46,386 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:46,386 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:46,386 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:46,386 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:46,386 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:46,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:46,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:46,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:46,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:46,392 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:46,392 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:46,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:46,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:46,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:46,479 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:46,480 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:46,480 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:46,480 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 02:23:46,480 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:46,480 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:46,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2226 [2022-12-13 02:23:46,480 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:23:46,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:46,480 INFO L85 PathProgramCache]: Analyzing trace with hash -568194332, now seen corresponding path program 1 times [2022-12-13 02:23:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:46,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110434293] [2022-12-13 02:23:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:46,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:46,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:23:46,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:46,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110434293] [2022-12-13 02:23:46,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110434293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:46,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:46,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:46,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267001937] [2022-12-13 02:23:46,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:46,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:46,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:46,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:46,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:46,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:46,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:46,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:46,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:46,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:46,625 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:46,625 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:46,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:46,626 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:46,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:46,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:46,627 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:46,627 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:46,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:46,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:46,629 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:46,629 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:46,630 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:46,630 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:46,630 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:46,630 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:46,630 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:46,630 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:46,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:46,636 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:46,636 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:46,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:46,636 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:46,636 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:46,724 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:46,725 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:46,725 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:46,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:46,725 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:46,725 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:46,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2227 [2022-12-13 02:23:46,725 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:23:46,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:46,725 INFO L85 PathProgramCache]: Analyzing trace with hash -539565181, now seen corresponding path program 1 times [2022-12-13 02:23:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:46,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333298911] [2022-12-13 02:23:46,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:46,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:46,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:23:46,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:46,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333298911] [2022-12-13 02:23:46,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333298911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:46,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:46,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:46,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085092258] [2022-12-13 02:23:46,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:46,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:46,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:46,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:46,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:46,792 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:46,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:46,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:46,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:46,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:46,869 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:46,869 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:46,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:46,870 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:46,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:46,871 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:46,871 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:46,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:46,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:46,873 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:46,873 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:46,873 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:46,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:46,874 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:46,874 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:46,874 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:46,874 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:46,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:46,879 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:46,879 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:46,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:46,880 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:46,880 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:46,968 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:46,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:46,968 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:46,968 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 02:23:46,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:46,968 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:46,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2228 [2022-12-13 02:23:46,968 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:23:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash -510936030, now seen corresponding path program 1 times [2022-12-13 02:23:46,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:46,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91828493] [2022-12-13 02:23:46,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:46,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:47,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:23:47,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:47,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91828493] [2022-12-13 02:23:47,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91828493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:47,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:47,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123905590] [2022-12-13 02:23:47,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:47,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:47,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:47,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:47,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:47,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:47,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:47,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:47,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:47,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:47,098 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:47,098 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:47,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:47,099 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:47,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:47,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:47,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:47,100 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:47,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:47,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:47,102 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:47,102 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:47,103 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:47,103 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:47,103 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:47,103 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:47,103 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:47,103 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:47,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:47,109 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:47,109 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:47,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:47,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:47,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:47,197 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:47,198 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:47,198 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:47,198 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 02:23:47,198 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:47,198 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:47,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2229 [2022-12-13 02:23:47,198 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:23:47,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash -482306879, now seen corresponding path program 1 times [2022-12-13 02:23:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:47,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757050545] [2022-12-13 02:23:47,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:47,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:47,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:23:47,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:47,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757050545] [2022-12-13 02:23:47,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757050545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:47,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:47,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:47,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411060163] [2022-12-13 02:23:47,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:47,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:47,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:47,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:47,267 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:47,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:47,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:47,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:47,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:47,341 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:47,341 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:47,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:47,342 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:47,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:47,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:47,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:47,343 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:47,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:47,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:47,346 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:47,346 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:47,347 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:47,347 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:47,347 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:47,347 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:47,347 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:47,347 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:47,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:47,355 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:47,355 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:47,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:47,356 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:47,356 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:47,443 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:47,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:23:47,444 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:47,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:47,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:47,444 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:47,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2230 [2022-12-13 02:23:47,444 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:23:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:47,444 INFO L85 PathProgramCache]: Analyzing trace with hash -453677728, now seen corresponding path program 1 times [2022-12-13 02:23:47,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:47,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372956735] [2022-12-13 02:23:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:47,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:47,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:23:47,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:47,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372956735] [2022-12-13 02:23:47,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372956735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:47,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:47,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:47,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526482691] [2022-12-13 02:23:47,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:47,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:47,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:47,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:47,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:47,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:47,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:47,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:47,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:47,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:47,572 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:47,572 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:47,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:47,573 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:47,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:47,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:47,574 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:47,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:47,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:47,576 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:47,576 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:47,576 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:47,576 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:47,576 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:47,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:47,577 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:47,577 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:47,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:47,582 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:47,582 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:47,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:47,583 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:47,583 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:47,672 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:47,672 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:47,672 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:47,672 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 02:23:47,672 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:47,672 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:47,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2231 [2022-12-13 02:23:47,672 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:23:47,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash -425048577, now seen corresponding path program 1 times [2022-12-13 02:23:47,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:47,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724287252] [2022-12-13 02:23:47,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:47,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:47,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 02:23:47,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:47,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724287252] [2022-12-13 02:23:47,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724287252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:47,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:47,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052028767] [2022-12-13 02:23:47,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:47,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:47,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:47,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:47,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:47,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:47,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:47,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:47,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:47,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:47,831 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:47,831 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:47,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:47,832 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:47,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:47,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:47,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:47,833 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:47,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:47,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:47,835 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:47,835 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:47,836 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:47,836 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:47,836 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:47,836 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:47,836 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:47,836 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:47,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:47,841 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:47,842 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:47,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:47,842 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:47,842 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:47,931 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:47,931 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:47,931 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:47,931 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 02:23:47,931 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:47,931 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:47,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2232 [2022-12-13 02:23:47,931 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:23:47,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash -396419426, now seen corresponding path program 1 times [2022-12-13 02:23:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:47,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259492667] [2022-12-13 02:23:47,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:47,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:47,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:23:47,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:47,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259492667] [2022-12-13 02:23:47,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259492667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:47,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:47,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:48,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396396014] [2022-12-13 02:23:48,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:48,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:48,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:48,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:48,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:48,000 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:48,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:48,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:48,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:48,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:48,075 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:48,075 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:48,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:48,076 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:48,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:48,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:48,077 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:48,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:48,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:48,079 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:48,079 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:48,079 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:48,079 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:48,079 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:48,080 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:48,080 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:48,080 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:48,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:48,085 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:48,085 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:48,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:48,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:48,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:48,173 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:48,173 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:48,173 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:48,173 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 02:23:48,173 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:48,173 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:48,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2233 [2022-12-13 02:23:48,174 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:23:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:48,174 INFO L85 PathProgramCache]: Analyzing trace with hash -367790275, now seen corresponding path program 1 times [2022-12-13 02:23:48,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:48,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063387658] [2022-12-13 02:23:48,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:48,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:48,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:23:48,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:48,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063387658] [2022-12-13 02:23:48,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063387658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:48,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:48,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:48,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277125606] [2022-12-13 02:23:48,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:48,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:48,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:48,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:48,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:48,229 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:48,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:48,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:48,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:48,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:48,304 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:48,305 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:48,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:48,306 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:48,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:48,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:48,306 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:48,306 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:48,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:48,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:48,309 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:48,309 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:48,309 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:48,309 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:48,309 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:48,309 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:48,309 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:48,309 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:48,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:48,315 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:48,315 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:48,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:48,315 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:48,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:48,403 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:48,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:48,404 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:48,404 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 02:23:48,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:48,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:48,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2234 [2022-12-13 02:23:48,404 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:23:48,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:48,404 INFO L85 PathProgramCache]: Analyzing trace with hash -339161124, now seen corresponding path program 1 times [2022-12-13 02:23:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:48,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639955451] [2022-12-13 02:23:48,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:48,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:48,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:23:48,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:48,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639955451] [2022-12-13 02:23:48,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639955451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:48,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:48,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:48,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52507834] [2022-12-13 02:23:48,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:48,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:48,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:48,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:48,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:48,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:48,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:48,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:48,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:48,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:48,550 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:48,550 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:48,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1127 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:48,551 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:48,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:48,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:48,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:48,552 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:48,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:48,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:48,555 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:48,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:48,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:48,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:48,555 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:48,555 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:48,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:48,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:48,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:48,561 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:48,561 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:48,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:48,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:48,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:48,650 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:48,650 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:48,650 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:48,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:48,650 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:48,650 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:48,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2235 [2022-12-13 02:23:48,651 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:23:48,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:48,651 INFO L85 PathProgramCache]: Analyzing trace with hash -310531973, now seen corresponding path program 1 times [2022-12-13 02:23:48,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:48,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944604382] [2022-12-13 02:23:48,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:48,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:48,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:23:48,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:48,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944604382] [2022-12-13 02:23:48,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944604382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:48,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:48,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:48,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790350037] [2022-12-13 02:23:48,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:48,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:48,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:48,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:48,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:48,706 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:48,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:48,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:48,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:48,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:48,782 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:48,783 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:48,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:48,784 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:48,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:48,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:48,784 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:48,784 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:48,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:48,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:48,787 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:48,787 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:48,787 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:48,787 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:48,787 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:48,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:48,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:48,788 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:48,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:48,793 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:48,793 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:48,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:48,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:48,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:48,882 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:48,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:48,883 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:48,883 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 02:23:48,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:48,883 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:48,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2236 [2022-12-13 02:23:48,883 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:23:48,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:48,883 INFO L85 PathProgramCache]: Analyzing trace with hash -281902822, now seen corresponding path program 1 times [2022-12-13 02:23:48,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:48,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056067459] [2022-12-13 02:23:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:48,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:48,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:23:48,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:48,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056067459] [2022-12-13 02:23:48,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056067459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:48,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:48,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:48,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097837232] [2022-12-13 02:23:48,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:48,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:48,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:48,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:48,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:48,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:48,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:48,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:48,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:48,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:49,001 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:49,002 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:49,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:49,003 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:49,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:49,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:49,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:49,003 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:49,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:49,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:49,006 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,006 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:49,006 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:49,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:49,006 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:49,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:49,006 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:49,012 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:49,012 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:49,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:49,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:49,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:49,102 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:49,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:23:49,103 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:49,103 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 02:23:49,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:49,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:49,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2237 [2022-12-13 02:23:49,103 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:23:49,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash -253273671, now seen corresponding path program 1 times [2022-12-13 02:23:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:49,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854363110] [2022-12-13 02:23:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:49,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:49,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:23:49,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:49,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854363110] [2022-12-13 02:23:49,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854363110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:49,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:49,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203989748] [2022-12-13 02:23:49,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:49,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:49,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:49,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:49,187 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:49,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:49,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:49,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:49,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:49,271 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:49,272 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:49,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:49,273 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:49,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:49,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:49,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:49,273 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:49,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:49,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:49,276 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,276 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:49,276 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:49,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:49,276 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:49,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:49,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:49,282 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:49,282 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:49,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:49,283 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:49,283 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:49,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:49,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:49,372 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:49,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:49,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:49,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:49,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2238 [2022-12-13 02:23:49,372 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:23:49,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:49,372 INFO L85 PathProgramCache]: Analyzing trace with hash -224644520, now seen corresponding path program 1 times [2022-12-13 02:23:49,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:49,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191574320] [2022-12-13 02:23:49,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:49,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:49,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:23:49,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:49,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191574320] [2022-12-13 02:23:49,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191574320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:49,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:49,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299691212] [2022-12-13 02:23:49,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:49,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:49,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:49,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:49,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:49,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:49,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:49,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:49,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:49,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:49,491 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:49,491 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:49,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:49,492 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:49,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:49,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:49,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:49,492 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:49,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:49,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:49,495 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,495 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:49,495 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:49,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:49,495 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:49,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:49,495 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:49,501 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:49,501 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:49,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:49,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:49,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:49,589 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:49,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:49,589 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:49,589 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 02:23:49,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:49,590 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:49,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2239 [2022-12-13 02:23:49,590 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:23:49,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:49,590 INFO L85 PathProgramCache]: Analyzing trace with hash -196015369, now seen corresponding path program 1 times [2022-12-13 02:23:49,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:49,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312524663] [2022-12-13 02:23:49,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:49,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:49,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:23:49,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:49,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312524663] [2022-12-13 02:23:49,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312524663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:49,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:49,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:49,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084448330] [2022-12-13 02:23:49,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:49,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:49,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:49,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:49,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:49,644 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:49,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:49,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:49,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:49,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:49,719 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:49,720 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:49,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:49,721 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:49,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:49,721 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:49,721 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:49,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:49,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:49,724 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,724 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:49,724 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:49,724 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:49,724 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,724 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:49,724 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:49,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:49,730 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:49,730 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:49,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:49,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:49,731 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:49,818 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:49,819 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:49,819 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:49,819 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 02:23:49,819 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:49,819 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:49,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2240 [2022-12-13 02:23:49,819 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:23:49,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:49,819 INFO L85 PathProgramCache]: Analyzing trace with hash -167386218, now seen corresponding path program 1 times [2022-12-13 02:23:49,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:49,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160607105] [2022-12-13 02:23:49,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:49,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:49,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:23:49,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:49,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160607105] [2022-12-13 02:23:49,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160607105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:49,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:49,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:49,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030167277] [2022-12-13 02:23:49,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:49,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:49,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:49,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:49,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:49,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:49,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:49,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:49,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:49,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:49,948 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:49,948 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:49,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:49,949 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:49,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:49,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:49,950 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:49,950 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:49,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:49,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:49,952 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,952 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:49,952 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:49,953 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:49,953 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,953 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:49,953 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:49,953 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:49,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:49,958 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:49,958 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:23:49,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:49,959 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:49,959 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:50,046 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:50,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:50,046 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:50,046 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 02:23:50,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:50,046 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:50,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2241 [2022-12-13 02:23:50,046 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:23:50,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash -138757067, now seen corresponding path program 1 times [2022-12-13 02:23:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:50,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417678536] [2022-12-13 02:23:50,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:50,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:50,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:23:50,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:50,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417678536] [2022-12-13 02:23:50,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417678536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:50,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:50,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:50,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820541650] [2022-12-13 02:23:50,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:50,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:50,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:50,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:50,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:50,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:50,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:50,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:50,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:50,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:50,176 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:50,176 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:50,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:50,177 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:50,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:50,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:50,178 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:50,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:50,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:50,181 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:50,181 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:50,181 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:50,181 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:50,181 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:50,181 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:50,181 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:50,181 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:50,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:50,187 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:50,187 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:50,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:50,188 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:50,188 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:50,273 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:50,274 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:50,274 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:50,274 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 02:23:50,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:50,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:50,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2242 [2022-12-13 02:23:50,274 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:23:50,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:50,274 INFO L85 PathProgramCache]: Analyzing trace with hash -110127916, now seen corresponding path program 1 times [2022-12-13 02:23:50,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:50,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343280486] [2022-12-13 02:23:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:50,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:50,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:23:50,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:50,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343280486] [2022-12-13 02:23:50,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343280486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:50,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:50,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:50,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527275128] [2022-12-13 02:23:50,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:50,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:50,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:50,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:50,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:50,343 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:50,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:50,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:50,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:50,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:50,422 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:50,422 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:50,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:50,423 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:50,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:50,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:50,424 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:50,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:50,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:50,426 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:50,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:50,426 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:50,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:50,426 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:50,427 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:50,427 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:50,427 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:50,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:50,432 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:50,432 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:50,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:50,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:50,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:50,544 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:50,545 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:23:50,545 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:50,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:50,545 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:50,545 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:50,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2243 [2022-12-13 02:23:50,545 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:23:50,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:50,545 INFO L85 PathProgramCache]: Analyzing trace with hash -81498765, now seen corresponding path program 1 times [2022-12-13 02:23:50,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:50,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439410485] [2022-12-13 02:23:50,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:50,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:50,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:23:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:50,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439410485] [2022-12-13 02:23:50,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439410485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:50,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:50,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:50,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702334203] [2022-12-13 02:23:50,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:50,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:50,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:50,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:50,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:50,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:50,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:50,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:50,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:50,721 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:50,721 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:23:50,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:50,722 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:50,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:50,722 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:50,722 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:50,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:50,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:50,725 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:50,725 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:50,725 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:50,725 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:50,725 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:50,725 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:50,725 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:50,726 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:50,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:50,731 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:50,731 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:50,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:50,732 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:50,732 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:50,826 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:50,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:23:50,827 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:50,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:50,827 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:50,827 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:50,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2244 [2022-12-13 02:23:50,827 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:23:50,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:50,827 INFO L85 PathProgramCache]: Analyzing trace with hash -52869614, now seen corresponding path program 1 times [2022-12-13 02:23:50,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:50,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106132832] [2022-12-13 02:23:50,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:50,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:50,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:23:50,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:50,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106132832] [2022-12-13 02:23:50,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106132832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:50,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:50,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:50,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440689625] [2022-12-13 02:23:50,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:50,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:50,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:50,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:50,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:50,910 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:50,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:50,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:50,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:50,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:50,989 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:50,989 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:50,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:50,990 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:50,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:50,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:50,990 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:50,991 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:50,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:50,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:50,993 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:50,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:50,993 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:50,993 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:50,993 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:50,993 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:50,993 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:50,994 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:50,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:50,999 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:50,999 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:50,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:51,000 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:51,000 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:51,096 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:51,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:23:51,097 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:51,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:51,097 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:51,097 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:51,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2245 [2022-12-13 02:23:51,097 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:23:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash -24240463, now seen corresponding path program 1 times [2022-12-13 02:23:51,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:51,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555710851] [2022-12-13 02:23:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:51,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:51,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:51,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555710851] [2022-12-13 02:23:51,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555710851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:51,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:51,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:51,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13642515] [2022-12-13 02:23:51,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:51,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:51,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:51,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:51,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:51,152 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:51,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:51,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:51,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:51,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:51,252 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:51,252 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:51,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:51,255 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:51,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:51,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:51,255 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:51,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:51,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:51,258 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:51,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:51,258 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:51,258 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:51,258 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:51,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:51,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:51,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:51,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:51,265 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:51,265 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:51,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:51,265 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:51,265 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:51,359 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:51,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:23:51,360 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:51,360 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 02:23:51,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:51,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:51,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2246 [2022-12-13 02:23:51,360 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:23:51,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:51,360 INFO L85 PathProgramCache]: Analyzing trace with hash 4388688, now seen corresponding path program 1 times [2022-12-13 02:23:51,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:51,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094245865] [2022-12-13 02:23:51,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:51,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23: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:23:51,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:51,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094245865] [2022-12-13 02:23:51,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094245865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:51,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:51,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:51,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146101678] [2022-12-13 02:23:51,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:51,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:51,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:51,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:51,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:51,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:51,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:51,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:51,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:51,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:51,522 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:51,523 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:51,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:51,524 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:51,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:51,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:51,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:51,525 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:51,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:51,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:51,528 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:51,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:51,529 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:51,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:51,529 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:51,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:51,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:51,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:51,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:51,537 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:51,537 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:51,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:51,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:51,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:51,646 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:51,646 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:23:51,646 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:51,646 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 02:23:51,646 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:51,646 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:51,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2247 [2022-12-13 02:23:51,647 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:23:51,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash 33017839, now seen corresponding path program 1 times [2022-12-13 02:23:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:51,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181120330] [2022-12-13 02:23:51,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:51,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:23:51,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:51,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181120330] [2022-12-13 02:23:51,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181120330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:51,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:51,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76655244] [2022-12-13 02:23:51,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:51,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:51,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:51,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:51,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:51,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:51,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:51,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:51,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:51,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:51,825 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:51,825 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:51,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:51,826 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:51,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:51,827 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:51,827 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:51,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:51,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:51,830 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:51,830 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:51,830 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:51,831 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:51,831 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:51,831 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:51,831 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:51,831 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:51,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:51,838 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:51,839 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:51,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:51,839 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:51,839 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:51,946 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:51,946 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:23:51,946 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:51,947 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 02:23:51,947 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:51,947 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:51,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2248 [2022-12-13 02:23:51,947 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:23:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:51,947 INFO L85 PathProgramCache]: Analyzing trace with hash 61646990, now seen corresponding path program 1 times [2022-12-13 02:23:51,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:51,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521415310] [2022-12-13 02:23:51,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:51,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:52,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:23:52,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:52,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521415310] [2022-12-13 02:23:52,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521415310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:52,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:52,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:52,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337179066] [2022-12-13 02:23:52,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:52,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:52,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:52,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:52,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:52,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:52,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:52,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:52,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:52,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:52,146 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:52,146 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:52,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1109 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:52,148 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:52,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:52,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:52,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:52,149 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:52,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:52,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:52,152 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:52,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:52,152 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:52,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:52,152 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:52,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:52,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:52,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:52,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:52,160 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:52,160 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:23:52,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:52,161 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:52,161 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:52,270 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:52,270 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:23:52,270 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:52,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:52,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:52,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:52,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2249 [2022-12-13 02:23:52,271 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:23:52,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:52,271 INFO L85 PathProgramCache]: Analyzing trace with hash 90276141, now seen corresponding path program 1 times [2022-12-13 02:23:52,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:52,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895024011] [2022-12-13 02:23:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:52,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:52,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:23:52,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:52,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895024011] [2022-12-13 02:23:52,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895024011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:52,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:52,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:52,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282701637] [2022-12-13 02:23:52,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:52,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:52,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:52,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:52,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:52,338 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:52,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:52,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:52,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:52,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:52,438 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:52,438 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:52,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:52,439 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:52,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:52,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:52,440 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:52,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:52,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:52,444 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:52,444 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:52,444 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:52,444 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:52,444 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:52,444 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:52,444 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:52,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:52,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:52,452 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:52,452 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:52,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:52,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:52,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:52,546 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:52,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:23:52,547 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:52,547 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 02:23:52,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:52,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:52,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2250 [2022-12-13 02:23:52,547 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:23:52,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:52,547 INFO L85 PathProgramCache]: Analyzing trace with hash 118905292, now seen corresponding path program 1 times [2022-12-13 02:23:52,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:52,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004835185] [2022-12-13 02:23:52,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:52,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:52,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:23:52,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:52,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004835185] [2022-12-13 02:23:52,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004835185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:52,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:52,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:52,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126334849] [2022-12-13 02:23:52,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:52,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:52,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:52,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:52,602 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:52,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:52,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:52,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:52,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:52,668 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:52,669 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:52,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:52,670 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:52,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:52,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:52,670 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:52,670 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:52,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:52,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:52,673 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:52,673 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:52,673 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:52,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:52,673 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:52,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:52,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:52,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:52,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:52,679 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:52,679 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:52,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:52,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:52,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:52,768 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:52,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:52,769 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:52,769 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 02:23:52,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:52,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:52,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2251 [2022-12-13 02:23:52,769 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:23:52,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:52,770 INFO L85 PathProgramCache]: Analyzing trace with hash 147534443, now seen corresponding path program 1 times [2022-12-13 02:23:52,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:52,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596015320] [2022-12-13 02:23:52,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:52,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:23:52,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:52,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596015320] [2022-12-13 02:23:52,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596015320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:52,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:52,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:52,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469765197] [2022-12-13 02:23:52,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:52,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:52,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:52,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:52,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:52,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:52,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:52,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:52,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:52,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:52,885 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:52,886 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:52,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:52,887 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:52,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:52,887 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:52,887 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:52,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:52,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:52,890 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:52,890 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:52,890 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:52,890 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:52,890 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:52,891 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:52,891 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:52,891 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:52,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:52,896 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:52,896 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:23:52,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:52,897 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:52,897 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:52,986 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:52,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:52,986 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:52,986 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 02:23:52,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:52,986 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:52,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2252 [2022-12-13 02:23:52,987 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:23:52,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:52,987 INFO L85 PathProgramCache]: Analyzing trace with hash 176163594, now seen corresponding path program 1 times [2022-12-13 02:23:52,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:52,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240332267] [2022-12-13 02:23:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:52,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:53,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:23:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240332267] [2022-12-13 02:23:53,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240332267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:53,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:53,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217479249] [2022-12-13 02:23:53,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:53,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:53,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:53,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:53,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:53,041 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:53,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:53,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:53,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:53,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:53,107 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:53,107 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:53,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:53,108 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:53,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:53,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:53,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:53,109 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:53,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:53,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:53,111 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:53,111 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:53,112 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:53,112 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:53,112 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:53,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:53,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:53,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:53,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:53,128 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:53,128 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:53,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 465 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:53,128 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:53,128 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:53,216 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:53,217 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:23:53,217 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:53,217 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 02:23:53,217 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:53,217 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:53,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2253 [2022-12-13 02:23:53,217 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:23:53,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash 204792745, now seen corresponding path program 1 times [2022-12-13 02:23:53,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:53,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617141907] [2022-12-13 02:23:53,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:53,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:53,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:23:53,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:53,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617141907] [2022-12-13 02:23:53,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617141907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:53,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:53,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:53,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390489534] [2022-12-13 02:23:53,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:53,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:53,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:53,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:53,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:53,270 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:53,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:53,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:53,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:53,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:53,336 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:53,336 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:53,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:53,337 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:53,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:53,338 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:53,338 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:53,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:53,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:53,340 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:53,341 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:53,341 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:53,341 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:53,341 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:53,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:53,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:53,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:53,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:53,347 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:53,347 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:23:53,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:53,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:53,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:53,435 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:53,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:53,436 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:53,436 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 02:23:53,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:53,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:53,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2254 [2022-12-13 02:23:53,436 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:23:53,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:53,436 INFO L85 PathProgramCache]: Analyzing trace with hash 233421896, now seen corresponding path program 1 times [2022-12-13 02:23:53,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:53,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179686255] [2022-12-13 02:23:53,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:53,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:53,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:23:53,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:53,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179686255] [2022-12-13 02:23:53,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179686255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:53,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:53,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951004763] [2022-12-13 02:23:53,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:53,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:53,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:53,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:53,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:53,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:53,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:53,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:53,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:53,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:53,564 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:53,564 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:53,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:53,565 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:53,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:53,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:53,566 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:53,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:53,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:53,568 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:53,568 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:53,568 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:53,569 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:53,569 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:53,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:53,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:53,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:53,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:53,574 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:53,575 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:53,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:53,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:53,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:53,663 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:53,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:53,664 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:53,664 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 02:23:53,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:53,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:53,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2255 [2022-12-13 02:23:53,664 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:23:53,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:53,664 INFO L85 PathProgramCache]: Analyzing trace with hash 262051047, now seen corresponding path program 1 times [2022-12-13 02:23:53,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:53,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699662904] [2022-12-13 02:23:53,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:53,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:53,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:23:53,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:53,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699662904] [2022-12-13 02:23:53,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699662904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:53,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:53,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523452911] [2022-12-13 02:23:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:53,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:53,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:53,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:53,720 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:53,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:53,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:53,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:53,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:53,798 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:53,798 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:53,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:53,799 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:53,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:53,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:53,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:53,800 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:53,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:53,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:53,802 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:53,802 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:53,802 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:53,802 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:53,802 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:53,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:53,803 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:53,803 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:53,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:53,808 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:53,808 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:53,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:53,809 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:53,809 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:53,899 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:53,899 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:23:53,899 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:53,899 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 02:23:53,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:53,899 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:53,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2256 [2022-12-13 02:23:53,900 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:23:53,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash 290680198, now seen corresponding path program 1 times [2022-12-13 02:23:53,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:53,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380621580] [2022-12-13 02:23:53,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:53,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:53,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:53,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380621580] [2022-12-13 02:23:53,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380621580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:53,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:53,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:53,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374917338] [2022-12-13 02:23:53,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:53,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:53,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:53,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:53,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:53,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:53,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:53,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:53,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:53,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:54,059 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:54,059 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:54,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:54,061 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:54,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:54,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:54,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:54,061 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:54,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:54,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:54,065 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:54,065 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:54,065 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:54,065 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:54,065 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:54,065 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:54,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:54,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:54,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:54,073 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:54,073 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:54,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:54,074 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:54,074 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:54,179 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:54,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 02:23:54,179 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:54,179 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 02:23:54,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:54,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:54,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2257 [2022-12-13 02:23:54,180 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:23:54,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:54,180 INFO L85 PathProgramCache]: Analyzing trace with hash 319309349, now seen corresponding path program 1 times [2022-12-13 02:23:54,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:54,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892477909] [2022-12-13 02:23:54,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:54,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:54,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 02:23:54,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:54,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892477909] [2022-12-13 02:23:54,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892477909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:54,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:54,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:54,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546983912] [2022-12-13 02:23:54,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:54,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:54,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:54,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:54,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:54,235 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:54,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:54,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:54,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:54,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:54,313 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:54,313 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:54,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:54,314 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:54,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:54,315 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:54,315 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:54,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:54,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:54,317 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:54,317 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:54,318 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:54,318 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:54,318 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:54,318 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:54,318 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:54,318 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:54,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:54,323 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:54,324 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:54,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:54,324 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:54,324 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:54,414 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:54,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:54,414 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:54,414 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 02:23:54,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:54,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:54,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2258 [2022-12-13 02:23:54,415 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:23:54,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:54,415 INFO L85 PathProgramCache]: Analyzing trace with hash 347938500, now seen corresponding path program 1 times [2022-12-13 02:23:54,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:54,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99981764] [2022-12-13 02:23:54,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:54,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:54,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:23:54,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:54,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99981764] [2022-12-13 02:23:54,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99981764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:54,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:54,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:54,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904156374] [2022-12-13 02:23:54,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:54,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:54,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:54,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:54,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:54,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:54,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:54,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:54,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:54,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:54,551 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:54,551 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:54,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:54,552 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:54,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:54,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:54,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:54,553 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:54,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:54,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:54,555 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:54,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:54,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:54,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:54,555 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:54,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:54,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:54,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:54,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:54,561 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:54,561 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:54,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:54,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:54,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:54,650 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:54,650 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:54,650 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:54,650 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 02:23:54,650 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:54,650 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:54,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2259 [2022-12-13 02:23:54,650 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:23:54,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:54,651 INFO L85 PathProgramCache]: Analyzing trace with hash 376567651, now seen corresponding path program 1 times [2022-12-13 02:23:54,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:54,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918490937] [2022-12-13 02:23:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:54,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:54,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:23:54,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:54,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918490937] [2022-12-13 02:23:54,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918490937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:54,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:54,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:54,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61873421] [2022-12-13 02:23:54,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:54,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:23:54,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:54,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:23:54,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:23:54,720 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:54,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:54,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:54,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:54,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:54,795 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:54,795 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:54,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:54,796 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:54,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:54,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:54,796 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:54,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:54,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:54,799 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:54,799 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:54,799 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:54,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:54,799 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:54,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:54,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:54,799 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:54,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:54,805 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:54,805 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:54,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:54,806 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:54,806 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:54,892 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:54,893 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:54,893 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:54,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:23:54,893 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:54,893 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:54,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2260 [2022-12-13 02:23:54,893 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:23:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:54,893 INFO L85 PathProgramCache]: Analyzing trace with hash 405196802, now seen corresponding path program 1 times [2022-12-13 02:23:54,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:54,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324944871] [2022-12-13 02:23:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:54,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:54,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:23:54,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:54,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324944871] [2022-12-13 02:23:54,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324944871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:54,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:54,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:54,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065116988] [2022-12-13 02:23:54,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:54,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:54,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:54,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:54,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:54,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:54,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:54,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:54,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:54,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:55,038 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:55,039 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:55,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:55,040 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:55,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:55,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:55,040 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:55,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:55,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:55,043 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,043 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:55,043 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:55,043 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:55,043 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,043 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:55,043 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:55,043 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:55,049 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:55,049 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:55,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:55,049 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:55,049 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:55,136 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:55,137 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:55,137 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:55,137 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 02:23:55,137 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:55,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:55,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2261 [2022-12-13 02:23:55,137 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:23:55,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash 433825953, now seen corresponding path program 1 times [2022-12-13 02:23:55,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:55,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809918183] [2022-12-13 02:23:55,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:55,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:55,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:23:55,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:55,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809918183] [2022-12-13 02:23:55,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809918183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:55,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:55,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:55,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70663176] [2022-12-13 02:23:55,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:55,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:55,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:55,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:55,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:55,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:55,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:55,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:55,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:55,258 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:55,258 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:55,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:55,259 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:55,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:55,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:55,260 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:55,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:55,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:55,262 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,262 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:55,262 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:55,262 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:55,262 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:55,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:55,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:55,268 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:55,268 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:55,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:55,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:55,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:55,356 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:55,357 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:55,357 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:55,357 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 02:23:55,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:55,357 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:55,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2262 [2022-12-13 02:23:55,357 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:23:55,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash 462455104, now seen corresponding path program 1 times [2022-12-13 02:23:55,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:55,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265411392] [2022-12-13 02:23:55,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:55,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:55,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:23:55,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:55,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265411392] [2022-12-13 02:23:55,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265411392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:55,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:55,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:55,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032472249] [2022-12-13 02:23:55,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:55,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:55,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:55,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:55,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:55,412 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:55,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:55,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:55,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:55,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:55,488 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:55,488 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:55,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:55,489 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:55,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:55,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:55,490 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:55,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:55,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:55,492 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,493 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:55,493 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:55,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:55,493 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:55,493 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:55,493 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:55,499 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:55,499 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:55,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:55,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:55,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:55,586 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:55,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:55,587 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:55,587 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 02:23:55,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:55,587 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:55,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2263 [2022-12-13 02:23:55,587 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:23:55,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:55,587 INFO L85 PathProgramCache]: Analyzing trace with hash 491084255, now seen corresponding path program 1 times [2022-12-13 02:23:55,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:55,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018879118] [2022-12-13 02:23:55,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:55,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:55,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:23:55,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:55,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018879118] [2022-12-13 02:23:55,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018879118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:55,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:55,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:55,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324012343] [2022-12-13 02:23:55,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:55,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:55,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:55,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:55,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:55,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:55,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:55,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:55,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:55,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:55,722 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:55,722 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:55,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:55,723 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:55,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:55,724 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:55,724 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:55,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:55,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:55,727 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,727 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:55,727 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:55,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:55,727 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:55,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:55,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:55,733 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:55,733 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:55,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:55,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:55,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:55,821 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:55,822 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:55,822 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:55,822 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 02:23:55,822 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:55,822 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:55,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2264 [2022-12-13 02:23:55,822 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:23:55,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash 519713406, now seen corresponding path program 1 times [2022-12-13 02:23:55,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:55,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609870314] [2022-12-13 02:23:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:55,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:55,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:23:55,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:55,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609870314] [2022-12-13 02:23:55,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609870314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:55,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:55,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614066621] [2022-12-13 02:23:55,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:55,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:55,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:55,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:55,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:55,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:55,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:55,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:55,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:55,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:55,949 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:55,949 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:55,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:55,950 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:55,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:55,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:55,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:55,951 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:55,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:55,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:55,954 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:55,954 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:55,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:55,954 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:55,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:55,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:55,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:55,960 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:55,960 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:55,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:55,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:55,961 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:56,049 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:56,049 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:56,049 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:56,049 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 02:23:56,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:56,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:56,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2265 [2022-12-13 02:23:56,050 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:23:56,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash 548342557, now seen corresponding path program 1 times [2022-12-13 02:23:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:56,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456435347] [2022-12-13 02:23:56,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:56,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:56,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:23:56,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:56,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456435347] [2022-12-13 02:23:56,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456435347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:56,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:56,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:56,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365126630] [2022-12-13 02:23:56,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:56,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:56,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:56,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:56,105 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:56,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:56,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:56,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:56,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:56,171 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:56,171 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:56,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:56,172 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:56,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:56,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:56,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:56,173 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:56,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:56,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:56,175 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:56,175 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:56,175 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:56,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:56,176 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:56,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:56,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:56,176 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:56,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:56,181 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:56,181 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:56,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:56,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:56,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:56,270 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:56,270 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:56,270 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:56,271 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 02:23:56,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:56,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:56,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2266 [2022-12-13 02:23:56,271 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:23:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash 576971708, now seen corresponding path program 1 times [2022-12-13 02:23:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:56,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759965982] [2022-12-13 02:23:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:56,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:23:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:56,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759965982] [2022-12-13 02:23:56,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759965982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:56,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:56,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:56,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744552166] [2022-12-13 02:23:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:56,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:56,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:56,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:56,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:56,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:56,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:56,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:56,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:56,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:56,390 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:56,390 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:56,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:56,392 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:56,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:56,392 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:56,392 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:56,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:56,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:56,395 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:56,395 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:56,395 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:56,395 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:56,395 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:56,395 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:56,395 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:56,395 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:56,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:56,401 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:56,401 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:23:56,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:56,401 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:56,401 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:56,490 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:56,490 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:56,490 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:56,490 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 02:23:56,490 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:56,490 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:56,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2267 [2022-12-13 02:23:56,490 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:23:56,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:56,491 INFO L85 PathProgramCache]: Analyzing trace with hash 605600859, now seen corresponding path program 1 times [2022-12-13 02:23:56,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:56,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371200618] [2022-12-13 02:23:56,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:56,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:23:56,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:56,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371200618] [2022-12-13 02:23:56,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371200618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:56,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:56,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:56,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382641035] [2022-12-13 02:23:56,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:56,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:56,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:56,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:56,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:56,545 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:56,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:56,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:56,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:56,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:56,620 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:56,621 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:56,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:56,622 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:56,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:56,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:56,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:56,622 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:56,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:56,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:56,625 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:56,625 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:56,625 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:56,625 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:56,625 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:56,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:56,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:56,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:56,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:56,631 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:56,631 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:56,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:56,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:56,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:56,720 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:56,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:56,721 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:56,721 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 02:23:56,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:56,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:56,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2268 [2022-12-13 02:23:56,721 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:23:56,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:56,721 INFO L85 PathProgramCache]: Analyzing trace with hash 634230010, now seen corresponding path program 1 times [2022-12-13 02:23:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:56,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323305197] [2022-12-13 02:23:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:56,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:56,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 02:23:56,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:56,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323305197] [2022-12-13 02:23:56,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323305197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:56,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:56,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:56,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305341831] [2022-12-13 02:23:56,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:56,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:56,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:56,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:56,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:56,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:56,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:56,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:56,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:56,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:56,851 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:56,851 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:56,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:56,852 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:56,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:56,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:56,853 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:56,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:56,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:56,855 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:56,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:56,856 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:56,856 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:56,856 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:56,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:56,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:56,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:56,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:56,861 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:56,861 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:56,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:56,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:56,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:56,951 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:56,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:56,951 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:56,951 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 02:23:56,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:56,951 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:56,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2269 [2022-12-13 02:23:56,951 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:23:56,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:56,952 INFO L85 PathProgramCache]: Analyzing trace with hash 662859161, now seen corresponding path program 1 times [2022-12-13 02:23:56,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:56,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454249961] [2022-12-13 02:23:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:56,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:57,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:23:57,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:57,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454249961] [2022-12-13 02:23:57,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454249961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:57,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:57,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:57,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927409999] [2022-12-13 02:23:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:57,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:57,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:57,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:57,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:57,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:57,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:57,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:57,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:57,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:57,070 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:57,070 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:57,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:57,072 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:57,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:57,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:57,072 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:57,072 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:57,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:57,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:57,075 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:57,075 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:57,075 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:57,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:57,075 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:57,075 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:57,075 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:57,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:57,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:57,081 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:57,081 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:57,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:57,081 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:57,081 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:57,169 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:57,169 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:57,169 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:57,169 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 02:23:57,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:57,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:57,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2270 [2022-12-13 02:23:57,170 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:23:57,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:57,170 INFO L85 PathProgramCache]: Analyzing trace with hash 691488312, now seen corresponding path program 1 times [2022-12-13 02:23:57,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:57,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720650608] [2022-12-13 02:23:57,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:57,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:57,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:23:57,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:57,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720650608] [2022-12-13 02:23:57,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720650608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:57,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:57,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:57,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570100155] [2022-12-13 02:23:57,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:57,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:57,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:57,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:57,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:57,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:57,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:57,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:57,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:57,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:57,300 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:57,300 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:57,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:57,302 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:57,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:57,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:57,302 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:57,302 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:57,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:57,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:57,305 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:57,305 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:57,305 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:57,305 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:57,305 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:57,305 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:57,306 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:57,306 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:57,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:57,311 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:57,311 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:57,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:57,312 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:57,312 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:57,400 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:57,400 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:57,400 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:57,400 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 02:23:57,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:57,401 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:57,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2271 [2022-12-13 02:23:57,401 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:23:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:57,401 INFO L85 PathProgramCache]: Analyzing trace with hash 720117463, now seen corresponding path program 1 times [2022-12-13 02:23:57,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:57,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796395010] [2022-12-13 02:23:57,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:57,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:57,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 02:23:57,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:57,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796395010] [2022-12-13 02:23:57,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796395010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:57,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:57,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:57,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124354509] [2022-12-13 02:23:57,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:57,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:57,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:57,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:57,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:57,455 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:57,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:57,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:57,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:57,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:57,521 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:57,521 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:57,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:57,522 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:57,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:57,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:57,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:57,523 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:57,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:57,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:57,525 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:57,526 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:57,526 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:57,526 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:57,526 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:57,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:57,526 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:57,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:57,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:57,532 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:57,532 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:57,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:57,532 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:57,532 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:57,621 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:57,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:23:57,622 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:57,622 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 02:23:57,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:57,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:57,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2272 [2022-12-13 02:23:57,622 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:23:57,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:57,622 INFO L85 PathProgramCache]: Analyzing trace with hash 748746614, now seen corresponding path program 1 times [2022-12-13 02:23:57,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:57,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601708200] [2022-12-13 02:23:57,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:57,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:57,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:23:57,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:57,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601708200] [2022-12-13 02:23:57,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601708200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:57,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:57,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:57,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646189625] [2022-12-13 02:23:57,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:57,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:57,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:57,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:57,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:57,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:57,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:57,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:57,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:57,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:57,742 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:57,742 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:57,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:57,743 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:57,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:57,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:57,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:57,744 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:57,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:57,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:57,746 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:57,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:57,746 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:57,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:57,747 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:57,747 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:57,747 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:57,747 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:57,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:57,752 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:57,753 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:57,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:57,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:57,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:57,862 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:57,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:23:57,862 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:57,862 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 02:23:57,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:57,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:57,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2273 [2022-12-13 02:23:57,863 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:23:57,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash 777375765, now seen corresponding path program 1 times [2022-12-13 02:23:57,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:57,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133441048] [2022-12-13 02:23:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:57,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:57,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:57,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133441048] [2022-12-13 02:23:57,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133441048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:57,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:57,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:57,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096949165] [2022-12-13 02:23:57,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:57,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:57,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:57,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:57,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:57,934 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:57,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:57,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:57,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:57,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:58,007 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:58,007 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:58,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:58,009 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:58,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:58,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:58,009 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:58,009 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:58,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:58,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:58,012 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,012 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:58,012 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:58,012 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:58,012 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:58,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:58,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:58,036 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:58,036 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:23:58,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:58,037 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:58,037 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:58,155 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:58,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 02:23:58,156 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:58,156 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 02:23:58,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:58,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:58,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2274 [2022-12-13 02:23:58,156 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:23:58,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:58,156 INFO L85 PathProgramCache]: Analyzing trace with hash 806004916, now seen corresponding path program 1 times [2022-12-13 02:23:58,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:58,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311246578] [2022-12-13 02:23:58,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:58,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:58,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:23:58,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:58,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311246578] [2022-12-13 02:23:58,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311246578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:58,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:58,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:58,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461330866] [2022-12-13 02:23:58,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:58,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:58,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:58,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:58,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:58,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:58,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:58,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:58,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:58,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:58,283 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:58,283 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:58,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:58,285 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:58,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:58,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:58,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:58,286 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:58,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:58,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:58,288 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,288 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:58,288 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:58,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:58,289 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,289 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:58,289 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:58,289 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:58,295 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:58,295 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:58,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:58,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:58,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:58,390 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:58,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:23:58,390 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:58,390 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 02:23:58,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:58,390 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:58,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2275 [2022-12-13 02:23:58,390 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:23:58,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:58,391 INFO L85 PathProgramCache]: Analyzing trace with hash 834634067, now seen corresponding path program 1 times [2022-12-13 02:23:58,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:58,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213596398] [2022-12-13 02:23:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:58,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:58,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:23:58,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:58,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213596398] [2022-12-13 02:23:58,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213596398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:58,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:58,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:58,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47198348] [2022-12-13 02:23:58,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:58,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:58,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:58,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:58,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:58,450 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:58,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:58,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:58,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:58,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:58,526 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:58,526 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:58,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:58,527 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:58,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:58,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:58,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:58,528 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:58,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:58,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:58,530 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,530 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:58,530 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:58,530 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:58,530 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:58,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:58,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:58,536 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:58,536 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:23:58,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:58,537 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:58,537 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:58,624 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:58,625 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:58,625 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:58,625 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 02:23:58,625 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:58,625 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:58,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2276 [2022-12-13 02:23:58,625 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:23:58,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:58,625 INFO L85 PathProgramCache]: Analyzing trace with hash 863263218, now seen corresponding path program 1 times [2022-12-13 02:23:58,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:58,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553767223] [2022-12-13 02:23:58,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:58,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:58,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:23:58,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:58,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553767223] [2022-12-13 02:23:58,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553767223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:58,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:58,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:58,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61548298] [2022-12-13 02:23:58,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:58,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:58,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:58,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:58,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:58,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:58,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:58,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:58,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:58,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:58,755 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:58,756 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:58,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:58,757 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:58,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:58,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:58,757 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:58,757 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:58,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:58,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:58,760 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:58,760 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:58,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:58,760 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:58,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:58,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:58,766 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:58,766 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:23:58,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:58,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:58,767 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:58,855 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:58,855 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:23:58,855 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:58,855 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 02:23:58,855 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:58,855 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:58,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2277 [2022-12-13 02:23:58,855 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:23:58,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:58,856 INFO L85 PathProgramCache]: Analyzing trace with hash 891892369, now seen corresponding path program 1 times [2022-12-13 02:23:58,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:58,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879532462] [2022-12-13 02:23:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:58,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:58,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:23:58,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:58,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879532462] [2022-12-13 02:23:58,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879532462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:58,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:58,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:58,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653972967] [2022-12-13 02:23:58,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:58,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:58,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:58,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:58,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:58,910 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:58,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:58,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:58,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:58,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:58,977 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:58,977 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:23:58,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:58,978 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:58,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:58,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:58,979 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:58,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:58,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:58,981 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,981 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:58,982 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:58,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:58,982 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:58,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:58,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:58,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:58,987 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:58,988 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:23:58,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:58,988 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:58,988 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:59,075 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:59,076 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:59,076 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:59,076 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 02:23:59,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:59,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:59,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2278 [2022-12-13 02:23:59,076 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:23:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:59,077 INFO L85 PathProgramCache]: Analyzing trace with hash 920521520, now seen corresponding path program 1 times [2022-12-13 02:23:59,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:59,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083823593] [2022-12-13 02:23:59,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:59,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:59,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 02:23:59,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:59,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083823593] [2022-12-13 02:23:59,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083823593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:59,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:59,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417099303] [2022-12-13 02:23:59,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:59,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:59,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:59,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:59,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:59,131 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:59,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:59,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:59,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:59,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:59,206 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:59,206 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:59,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:59,207 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:59,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:59,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:59,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:59,208 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:59,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:59,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:59,210 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:59,210 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:59,210 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:59,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:59,210 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:59,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:59,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:59,211 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:59,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:59,216 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:59,216 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:23:59,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:59,217 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:59,217 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:59,303 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:59,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:59,303 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:59,303 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 02:23:59,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:59,303 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:59,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2279 [2022-12-13 02:23:59,303 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:23:59,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:59,304 INFO L85 PathProgramCache]: Analyzing trace with hash 949150671, now seen corresponding path program 1 times [2022-12-13 02:23:59,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:59,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128141851] [2022-12-13 02:23:59,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:59,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:59,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:23:59,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:59,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128141851] [2022-12-13 02:23:59,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128141851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:59,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:59,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331767709] [2022-12-13 02:23:59,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:59,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:59,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:59,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:59,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:59,363 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:59,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:59,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:59,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:59,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:59,437 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:59,437 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:59,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:59,438 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:59,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:59,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:59,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:59,439 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:59,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:59,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:59,441 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:59,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:59,441 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:59,441 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:59,442 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:59,442 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:59,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:59,442 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:59,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:59,447 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:59,447 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:59,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:59,448 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:59,448 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:59,534 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:59,535 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:59,535 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:59,535 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 02:23:59,535 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:59,535 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:59,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2280 [2022-12-13 02:23:59,535 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:23:59,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:59,535 INFO L85 PathProgramCache]: Analyzing trace with hash 977779822, now seen corresponding path program 1 times [2022-12-13 02:23:59,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:59,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026450462] [2022-12-13 02:23:59,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:59,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:59,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:23:59,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:59,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026450462] [2022-12-13 02:23:59,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026450462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:59,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:59,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:59,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922887886] [2022-12-13 02:23:59,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:59,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:59,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:59,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:59,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:59,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:59,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:59,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:59,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:59,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:59,656 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:59,657 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:23:59,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:59,658 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:59,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:59,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:59,658 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:59,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:59,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:59,661 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:59,661 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:59,661 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:59,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:59,661 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:59,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:59,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:59,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:59,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:59,667 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:59,667 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:59,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:59,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:59,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:59,754 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:59,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:23:59,754 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:59,754 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 02:23:59,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:59,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:59,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2281 [2022-12-13 02:23:59,755 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:23:59,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:59,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1006408973, now seen corresponding path program 1 times [2022-12-13 02:23:59,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:59,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418268930] [2022-12-13 02:23:59,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:59,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:59,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:23:59,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:59,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418268930] [2022-12-13 02:23:59,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418268930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:59,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:59,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:59,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344273899] [2022-12-13 02:23:59,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:59,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:23:59,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:59,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:23:59,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:23:59,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:23:59,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:23:59,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:59,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:23:59,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:59,874 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:23:59,874 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:23:59,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:23:59,875 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:23:59,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:23:59,875 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:23:59,876 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:23:59,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:23:59,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:59,878 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:59,878 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:23:59,878 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:23:59,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:59,878 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:59,878 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:59,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:59,879 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:23:59,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:59,884 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:23:59,884 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:23:59,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:23:59,885 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:23:59,885 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:23:59,971 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:59,972 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:23:59,972 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:23:59,972 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 02:23:59,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:59,972 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:59,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2282 [2022-12-13 02:23:59,972 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:23:59,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:59,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1035038124, now seen corresponding path program 1 times [2022-12-13 02:23:59,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:59,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502343179] [2022-12-13 02:23:59,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:00,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:24:00,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:00,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502343179] [2022-12-13 02:24:00,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502343179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:00,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:00,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:00,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016965829] [2022-12-13 02:24:00,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:00,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:00,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:00,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:00,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:00,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:00,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:00,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:00,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:00,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:00,097 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:00,097 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:00,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:00,098 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:00,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:00,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:00,099 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:00,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:00,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:00,101 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:00,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:00,102 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:00,102 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:00,102 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:00,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:00,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:00,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:00,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:00,108 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:00,108 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:00,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:00,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:00,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:00,197 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:00,197 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:00,197 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:00,197 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 02:24:00,197 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:00,197 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:00,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2283 [2022-12-13 02:24:00,197 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:24:00,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:00,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1063667275, now seen corresponding path program 1 times [2022-12-13 02:24:00,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:00,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533336748] [2022-12-13 02:24:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:00,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:00,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:24:00,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:00,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533336748] [2022-12-13 02:24:00,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533336748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:00,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:00,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:00,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867448350] [2022-12-13 02:24:00,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:00,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:00,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:00,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:00,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:00,250 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:00,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:00,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:00,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:00,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:00,321 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:00,321 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:00,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:00,322 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:00,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:00,323 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:00,323 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:00,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:00,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:00,325 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:00,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:00,326 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:00,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:00,326 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:00,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:00,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:00,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:00,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:00,332 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:00,332 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:00,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:00,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:00,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:00,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:00,419 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:00,419 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:00,419 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 02:24:00,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:00,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:00,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2284 [2022-12-13 02:24:00,419 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:24:00,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:00,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1092296426, now seen corresponding path program 1 times [2022-12-13 02:24:00,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:00,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897027478] [2022-12-13 02:24:00,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:00,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:00,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:24:00,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:00,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897027478] [2022-12-13 02:24:00,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897027478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:00,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:00,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:00,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870981385] [2022-12-13 02:24:00,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:00,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:00,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:00,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:00,488 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:00,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:00,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:00,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:00,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:00,554 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:00,554 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:00,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:00,555 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:00,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:00,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:00,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:00,556 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:00,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:00,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:00,558 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:00,559 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:00,559 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:00,559 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:00,559 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:00,559 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:00,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:00,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:00,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:00,565 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:00,565 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:00,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:00,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:00,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:00,652 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:00,652 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:00,652 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:00,652 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 02:24:00,652 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:00,652 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:00,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2285 [2022-12-13 02:24:00,653 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:24:00,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:00,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1120925577, now seen corresponding path program 1 times [2022-12-13 02:24:00,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:00,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383508836] [2022-12-13 02:24:00,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:00,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:00,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:24:00,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:00,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383508836] [2022-12-13 02:24:00,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383508836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:00,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:00,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:00,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843475110] [2022-12-13 02:24:00,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:00,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:00,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:00,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:00,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:00,706 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:00,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:00,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:00,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:00,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:00,771 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:00,772 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:00,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:00,773 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:00,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:00,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:00,773 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:00,773 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:00,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:00,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:00,776 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:00,776 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:00,776 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:00,776 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:00,776 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:00,776 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:00,776 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:00,777 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:00,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:00,782 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:00,782 INFO L131 PetriNetUnfolder]: For 435/453 co-relation queries the response was YES. [2022-12-13 02:24:00,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/453 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:00,783 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:00,783 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:00,872 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:00,872 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:00,873 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:00,873 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 02:24:00,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:00,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:00,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2286 [2022-12-13 02:24:00,873 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:24:00,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1149554728, now seen corresponding path program 1 times [2022-12-13 02:24:00,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:00,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773112453] [2022-12-13 02:24:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:00,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24: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:24:00,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:00,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773112453] [2022-12-13 02:24:00,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773112453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:00,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:00,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494444877] [2022-12-13 02:24:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:00,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:00,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:00,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:00,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:00,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:00,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:00,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:00,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:00,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:01,030 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:01,031 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:01,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:01,032 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:01,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:01,032 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:01,032 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:01,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:01,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:01,035 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:01,035 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:01,035 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:01,035 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:01,035 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:01,035 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:01,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:01,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:01,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:01,041 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:01,041 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:24:01,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:01,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:01,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:01,130 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:01,130 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:01,130 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:01,130 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 02:24:01,130 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:01,130 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:01,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2287 [2022-12-13 02:24:01,130 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:24:01,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:01,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1178183879, now seen corresponding path program 1 times [2022-12-13 02:24:01,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:01,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26305826] [2022-12-13 02:24:01,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:01,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 02:24:01,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:01,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26305826] [2022-12-13 02:24:01,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26305826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:01,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:01,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:01,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342723558] [2022-12-13 02:24:01,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:01,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:01,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:01,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:01,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:01,186 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:01,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:01,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:01,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:01,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:01,252 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:01,253 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:01,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:01,254 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:01,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:01,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:01,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:01,254 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:01,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:01,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:01,257 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:01,257 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:01,257 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:01,257 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:01,257 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:01,258 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:01,258 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:01,258 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:01,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:01,263 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:01,263 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:01,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:01,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:01,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:01,352 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:01,353 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:01,353 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:01,353 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 02:24:01,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:01,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:01,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2288 [2022-12-13 02:24:01,353 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:24:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:01,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1206813030, now seen corresponding path program 1 times [2022-12-13 02:24:01,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:01,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429693751] [2022-12-13 02:24:01,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:01,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:01,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:01,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429693751] [2022-12-13 02:24:01,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429693751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:01,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:01,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:01,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077903617] [2022-12-13 02:24:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:01,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:01,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:01,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:01,423 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:01,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:01,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:01,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:01,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:01,510 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:01,510 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:01,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:01,511 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:01,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:01,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:01,512 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:01,512 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:01,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:01,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:01,514 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:01,514 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:01,514 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:01,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:01,514 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:01,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:01,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:01,515 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:01,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:01,520 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:01,520 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:01,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:01,521 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:01,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:01,610 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:01,611 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:24:01,611 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:01,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:01,611 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:01,611 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:01,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2289 [2022-12-13 02:24:01,611 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:24:01,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1235442181, now seen corresponding path program 1 times [2022-12-13 02:24:01,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:01,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651526665] [2022-12-13 02:24:01,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:01,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:01,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:24:01,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:01,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651526665] [2022-12-13 02:24:01,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651526665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:01,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:01,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:01,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429556311] [2022-12-13 02:24:01,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:01,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:01,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:01,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:01,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:01,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:01,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:01,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:01,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:01,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:01,799 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:01,799 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:01,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:01,801 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:01,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:01,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:01,803 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:01,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:01,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:01,807 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:01,807 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:01,807 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:01,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:01,807 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:01,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:01,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:01,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:01,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:01,814 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:01,814 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:01,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:01,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:01,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:01,912 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:01,913 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:24:01,913 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:01,913 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 02:24:01,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:01,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:01,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2290 [2022-12-13 02:24:01,913 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:24:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1264071332, now seen corresponding path program 1 times [2022-12-13 02:24:01,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:01,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720165753] [2022-12-13 02:24:01,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:01,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:01,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:24:01,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:01,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720165753] [2022-12-13 02:24:01,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720165753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:01,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:01,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:01,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060904549] [2022-12-13 02:24:01,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:01,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:01,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:01,965 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:01,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:01,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:01,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:01,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:02,032 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:02,032 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:02,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:02,033 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:02,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:02,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:02,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:02,033 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:02,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:02,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:02,036 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,036 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:02,036 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:02,036 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:02,036 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,036 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:02,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:02,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:02,042 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:02,042 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:02,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:02,043 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:02,043 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:02,131 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:02,132 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:02,132 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:02,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 02:24:02,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:02,132 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:02,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2291 [2022-12-13 02:24:02,132 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:24:02,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:02,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1292700483, now seen corresponding path program 1 times [2022-12-13 02:24:02,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:02,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490782236] [2022-12-13 02:24:02,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:02,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:02,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:24:02,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:02,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490782236] [2022-12-13 02:24:02,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490782236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:02,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:02,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:02,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234365981] [2022-12-13 02:24:02,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:02,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:02,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:02,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:02,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:02,187 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:02,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:02,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:02,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:02,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:02,253 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:02,253 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:02,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:02,254 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:02,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:02,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:02,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:02,255 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:02,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:02,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:02,257 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,257 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:02,257 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:02,258 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:02,258 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,258 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:02,258 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:02,258 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:02,263 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:02,263 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:02,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:02,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:02,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:02,352 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:02,352 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:02,352 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:02,352 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 02:24:02,352 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:02,352 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:02,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2292 [2022-12-13 02:24:02,352 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:24:02,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1321329634, now seen corresponding path program 1 times [2022-12-13 02:24:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:02,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386258291] [2022-12-13 02:24:02,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:02,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:02,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:24:02,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:02,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386258291] [2022-12-13 02:24:02,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386258291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:02,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:02,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:02,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641360086] [2022-12-13 02:24:02,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:02,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:02,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:02,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:02,422 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:02,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:02,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:02,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:02,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:02,498 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:02,498 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:02,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:02,499 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:02,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:02,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:02,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:02,500 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:02,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:02,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:02,502 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,502 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:02,502 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:02,502 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:02,503 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,503 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:02,503 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:02,503 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:02,508 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:02,508 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:02,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:02,509 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:02,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:02,596 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:02,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:02,597 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:02,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:02,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:02,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:02,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2293 [2022-12-13 02:24:02,597 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:24:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1349958785, now seen corresponding path program 1 times [2022-12-13 02:24:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:02,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052527019] [2022-12-13 02:24:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:02,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:02,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:24:02,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:02,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052527019] [2022-12-13 02:24:02,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052527019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:02,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:02,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:02,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47326770] [2022-12-13 02:24:02,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:02,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:02,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:02,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:02,650 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:02,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:02,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:02,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:02,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:02,715 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:02,715 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:02,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:02,716 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:02,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:02,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:02,717 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:02,717 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:02,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:02,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:02,719 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,719 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:02,719 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:02,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:02,719 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,720 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:02,720 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:02,720 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:02,725 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:02,725 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:02,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:02,726 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:02,726 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:02,815 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:02,816 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:24:02,816 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:02,816 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 02:24:02,816 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:02,816 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:02,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2294 [2022-12-13 02:24:02,816 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:24:02,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1378587936, now seen corresponding path program 1 times [2022-12-13 02:24:02,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:02,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874964612] [2022-12-13 02:24:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:02,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 02:24:02,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:02,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874964612] [2022-12-13 02:24:02,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874964612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:02,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:02,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:02,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335245351] [2022-12-13 02:24:02,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:02,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:02,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:02,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:02,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:02,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:02,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:02,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:02,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:02,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:02,947 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:02,947 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:02,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:02,948 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:02,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:02,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:02,949 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:02,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:02,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:02,951 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,951 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:02,951 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:02,951 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:02,951 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,952 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:02,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:02,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:02,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:02,957 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:02,957 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:24:02,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:02,958 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:02,958 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:03,046 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:03,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:03,046 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:03,047 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 02:24:03,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:03,047 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:03,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2295 [2022-12-13 02:24:03,047 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:24:03,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:03,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1407217087, now seen corresponding path program 1 times [2022-12-13 02:24:03,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:03,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463180480] [2022-12-13 02:24:03,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:03,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:03,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:24:03,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:03,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463180480] [2022-12-13 02:24:03,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463180480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:03,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:03,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:03,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291438775] [2022-12-13 02:24:03,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:03,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:03,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:03,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:03,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:03,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:03,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:03,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:03,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:03,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:03,183 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:03,183 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:03,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:03,184 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:03,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:03,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:03,185 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:03,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:03,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:03,187 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:03,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:03,187 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:03,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:03,188 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:03,188 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:03,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:03,188 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:03,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:03,193 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:03,193 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:03,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:03,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:03,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:03,280 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:03,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:03,281 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:03,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:03,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:03,281 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:03,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2296 [2022-12-13 02:24:03,281 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:24:03,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:03,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1435846238, now seen corresponding path program 1 times [2022-12-13 02:24:03,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:03,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405475561] [2022-12-13 02:24:03,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:03,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:03,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:24:03,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:03,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405475561] [2022-12-13 02:24:03,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405475561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:03,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:03,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349398429] [2022-12-13 02:24:03,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:03,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:03,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:03,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:03,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:03,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:03,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:03,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:03,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:03,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:03,407 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:03,408 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:03,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:03,409 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:03,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:03,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:03,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:03,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:03,409 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:03,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:03,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:03,412 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:03,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:03,412 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:03,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:03,412 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:03,412 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:03,412 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:03,412 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:03,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:03,418 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:03,418 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:03,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:03,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:03,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:03,507 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:03,507 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:03,508 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:03,508 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 02:24:03,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:03,508 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:03,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2297 [2022-12-13 02:24:03,508 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:24:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1464475389, now seen corresponding path program 1 times [2022-12-13 02:24:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:03,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776771135] [2022-12-13 02:24:03,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:03,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:03,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:24:03,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:03,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776771135] [2022-12-13 02:24:03,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776771135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:03,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:03,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:03,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402481665] [2022-12-13 02:24:03,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:03,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:03,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:03,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:03,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:03,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:03,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:03,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:03,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:03,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:03,637 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:03,637 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:03,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:03,638 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:03,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:03,639 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:03,639 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:03,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:03,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:03,642 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:03,642 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:03,642 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:03,642 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:03,642 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:03,642 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:03,642 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:03,642 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:03,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:03,648 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:03,648 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:03,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:03,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:03,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:03,737 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:03,738 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:03,738 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:03,738 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 02:24:03,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:03,738 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:03,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2298 [2022-12-13 02:24:03,738 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:24:03,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:03,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1493104540, now seen corresponding path program 1 times [2022-12-13 02:24:03,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:03,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834352406] [2022-12-13 02:24:03,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:03,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:03,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:24:03,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:03,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834352406] [2022-12-13 02:24:03,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834352406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:03,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:03,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057413428] [2022-12-13 02:24:03,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:03,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:03,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:03,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:03,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:03,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:03,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:03,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:03,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:03,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:03,870 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:03,870 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:03,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:03,871 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:03,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:03,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:03,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:03,872 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:03,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:03,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:03,874 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:03,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:03,875 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:03,875 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:03,875 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:03,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:03,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:03,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:03,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:03,881 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:03,881 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:03,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:03,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:03,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:03,970 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:03,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:03,970 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:03,970 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 02:24:03,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:03,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:03,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2299 [2022-12-13 02:24:03,971 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:24:03,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:03,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1521733691, now seen corresponding path program 1 times [2022-12-13 02:24:03,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:03,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444838678] [2022-12-13 02:24:03,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:03,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:04,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:24:04,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:04,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444838678] [2022-12-13 02:24:04,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444838678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:04,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:04,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:04,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995290810] [2022-12-13 02:24:04,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:04,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:04,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:04,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:04,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:04,040 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:04,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:04,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:04,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:04,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:04,126 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:04,126 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:04,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:04,127 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:04,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:04,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:04,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:04,128 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:04,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:04,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:04,130 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:04,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:04,130 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:04,130 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:04,130 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:04,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:04,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:04,131 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:04,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:04,136 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:04,136 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:04,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:04,137 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:04,137 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:04,225 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:04,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:04,225 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:04,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:04,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:04,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:04,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2300 [2022-12-13 02:24:04,226 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:24:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1550362842, now seen corresponding path program 1 times [2022-12-13 02:24:04,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:04,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696176360] [2022-12-13 02:24:04,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:04,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:04,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:24:04,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:04,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696176360] [2022-12-13 02:24:04,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696176360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:04,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:04,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:04,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700650596] [2022-12-13 02:24:04,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:04,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:04,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:04,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:04,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:04,278 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:04,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:04,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:04,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:04,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:04,354 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:04,354 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:04,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1095 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:04,355 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:04,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:04,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:04,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:04,356 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:04,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:04,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:04,358 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:04,358 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:04,358 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:04,358 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:04,359 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:04,359 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:04,359 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:04,359 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:04,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:04,364 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:04,364 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:04,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:04,365 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:04,365 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:04,453 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:04,454 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:04,454 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:04,454 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 02:24:04,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:04,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:04,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2301 [2022-12-13 02:24:04,454 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:24:04,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:04,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1578991993, now seen corresponding path program 1 times [2022-12-13 02:24:04,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:04,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038060732] [2022-12-13 02:24:04,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:04,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:04,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:24:04,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038060732] [2022-12-13 02:24:04,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038060732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:04,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:04,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725872281] [2022-12-13 02:24:04,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:04,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:04,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:04,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:04,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:04,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:04,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:04,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:04,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:04,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:04,585 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:04,585 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:04,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:04,586 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:04,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:04,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:04,587 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:04,587 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:04,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:04,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:04,590 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:04,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:04,590 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:04,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:04,590 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:04,590 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:04,590 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:04,590 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:04,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:04,596 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:04,596 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:04,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:04,596 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:04,596 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:04,688 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:04,689 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:24:04,689 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:04,689 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 02:24:04,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:04,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:04,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2302 [2022-12-13 02:24:04,689 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:24:04,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1607621144, now seen corresponding path program 1 times [2022-12-13 02:24:04,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:04,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988609141] [2022-12-13 02:24:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:04,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:04,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:24:04,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:04,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988609141] [2022-12-13 02:24:04,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988609141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:04,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:04,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:04,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424223909] [2022-12-13 02:24:04,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:04,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:04,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:04,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:04,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:04,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:04,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:04,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:04,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:04,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:04,820 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:04,820 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:04,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:04,821 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:04,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:04,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:04,822 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:04,822 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:04,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:04,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:04,824 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:04,824 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:04,824 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:04,824 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:04,824 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:04,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:04,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:04,825 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:04,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:04,830 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:04,830 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:04,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:04,831 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:04,831 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:04,919 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:04,920 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:04,920 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:04,920 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 02:24:04,920 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:04,920 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:04,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2303 [2022-12-13 02:24:04,920 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:24:04,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:04,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1636250295, now seen corresponding path program 1 times [2022-12-13 02:24:04,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:04,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639189897] [2022-12-13 02:24:04,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:04,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:04,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:24:04,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:04,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639189897] [2022-12-13 02:24:04,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639189897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:04,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:04,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:04,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647076813] [2022-12-13 02:24:04,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:04,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:04,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:04,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:04,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:04,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:04,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:04,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:04,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:05,042 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:05,042 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:05,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:05,044 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:05,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:05,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:05,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:05,044 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:05,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:05,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:05,047 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,047 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:05,047 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:05,047 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:05,047 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:05,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:05,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:05,053 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:05,053 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:05,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:05,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:05,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:05,142 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:05,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:05,142 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:05,142 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 02:24:05,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:05,142 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:05,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2304 [2022-12-13 02:24:05,142 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:24:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:05,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1664879446, now seen corresponding path program 1 times [2022-12-13 02:24:05,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:05,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854792130] [2022-12-13 02:24:05,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:05,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:05,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:24:05,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:05,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854792130] [2022-12-13 02:24:05,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854792130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:05,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:05,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:05,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436315948] [2022-12-13 02:24:05,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:05,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:05,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:05,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:05,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:05,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:05,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:05,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:05,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:05,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:05,287 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:05,287 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:05,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:05,288 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:05,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:05,289 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:05,289 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:05,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:05,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:05,291 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,291 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:05,292 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:05,292 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:05,292 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,292 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:05,292 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:05,292 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:05,298 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:05,298 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:05,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:05,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:05,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:05,396 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:05,397 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:24:05,397 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:05,397 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 02:24:05,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:05,397 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:05,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2305 [2022-12-13 02:24:05,397 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:24:05,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:05,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1693508597, now seen corresponding path program 1 times [2022-12-13 02:24:05,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:05,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543217436] [2022-12-13 02:24:05,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:05,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:05,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:24:05,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:05,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543217436] [2022-12-13 02:24:05,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543217436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:05,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:05,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:05,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673930572] [2022-12-13 02:24:05,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:05,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:05,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:05,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:05,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:05,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:05,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:05,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:05,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:05,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:05,531 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:05,532 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:05,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:05,533 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:05,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:05,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:05,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:05,533 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:05,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:05,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:05,536 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:05,536 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:05,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:05,536 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:05,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:05,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:05,542 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:05,542 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:24:05,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:05,543 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:05,543 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:05,630 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:05,631 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:05,631 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:05,631 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 02:24:05,631 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:05,631 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:05,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2306 [2022-12-13 02:24:05,631 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:24:05,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:05,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1722137748, now seen corresponding path program 1 times [2022-12-13 02:24:05,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:05,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705789350] [2022-12-13 02:24:05,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:05,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:05,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:24:05,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:05,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705789350] [2022-12-13 02:24:05,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705789350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:05,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:05,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315223069] [2022-12-13 02:24:05,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:05,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:05,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:05,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:05,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:05,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:05,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:05,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:05,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:05,747 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:05,747 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:05,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:05,748 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:05,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:05,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:05,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:05,749 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:05,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:05,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:05,752 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,752 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:05,752 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:05,752 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:05,752 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,752 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:05,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:05,752 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:05,758 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:05,758 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:05,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:05,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:05,758 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:05,845 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:05,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:05,846 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:05,846 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 02:24:05,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:05,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:05,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2307 [2022-12-13 02:24:05,846 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:24:05,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:05,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1750766899, now seen corresponding path program 1 times [2022-12-13 02:24:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:05,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670737555] [2022-12-13 02:24:05,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:05,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:05,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:24:05,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:05,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670737555] [2022-12-13 02:24:05,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670737555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:05,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:05,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:05,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109873167] [2022-12-13 02:24:05,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:05,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:05,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:05,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:05,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:05,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:05,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:05,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:05,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:05,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:05,982 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:05,982 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:05,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:05,983 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:05,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:05,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:05,984 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:05,984 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:05,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:05,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:05,986 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,987 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:05,987 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:05,987 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:05,987 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,987 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:05,987 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:05,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:05,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:05,993 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:05,993 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:05,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:05,993 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:05,994 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:06,097 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:06,098 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 02:24:06,098 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:06,098 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 02:24:06,098 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:06,098 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:06,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2308 [2022-12-13 02:24:06,098 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:24:06,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:06,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1779396050, now seen corresponding path program 1 times [2022-12-13 02:24:06,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:06,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113532374] [2022-12-13 02:24:06,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:06,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:06,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:06,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113532374] [2022-12-13 02:24:06,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113532374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:06,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:06,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:06,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408723797] [2022-12-13 02:24:06,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:06,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:06,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:06,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:06,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:06,169 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:06,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:06,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:06,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:06,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:06,245 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:06,245 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:06,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:06,246 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:06,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:06,247 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:06,247 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:06,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:06,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:06,249 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:06,249 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:06,250 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:06,250 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:06,250 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:06,250 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:06,250 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:06,250 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:06,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:06,256 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:06,256 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:06,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:06,256 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:06,256 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:06,344 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:06,344 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:06,345 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:06,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:06,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:06,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:06,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2309 [2022-12-13 02:24:06,345 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:24:06,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1808025201, now seen corresponding path program 1 times [2022-12-13 02:24:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:06,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682875288] [2022-12-13 02:24:06,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:06,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:24:06,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:06,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682875288] [2022-12-13 02:24:06,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682875288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:06,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:06,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:06,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242744143] [2022-12-13 02:24:06,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:06,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:06,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:06,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:06,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:06,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:06,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:06,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:06,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:06,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:06,498 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:06,498 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:06,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:06,500 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:06,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:06,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:06,500 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:06,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:06,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:06,504 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:06,504 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:06,504 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:06,504 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:06,504 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:06,504 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:06,504 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:06,505 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:06,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:06,512 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:06,512 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:06,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:06,513 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:06,513 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:06,622 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:06,623 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:24:06,623 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:06,623 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 02:24:06,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:06,623 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:06,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2310 [2022-12-13 02:24:06,623 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:24:06,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:06,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1836654352, now seen corresponding path program 1 times [2022-12-13 02:24:06,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:06,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768809329] [2022-12-13 02:24:06,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:06,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:06,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 02:24:06,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:06,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768809329] [2022-12-13 02:24:06,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768809329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:06,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:06,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:06,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365108665] [2022-12-13 02:24:06,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:06,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:06,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:06,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:06,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:06,708 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:06,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:06,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:06,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:06,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:06,809 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:06,809 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:06,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:06,810 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:06,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:06,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:06,811 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:06,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:06,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:06,815 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:06,815 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:06,815 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:06,815 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:06,815 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:06,815 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:06,815 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:06,815 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:06,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:06,823 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:06,823 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:06,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:06,824 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:06,824 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:06,933 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:06,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:24:06,934 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:06,934 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 02:24:06,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:06,934 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:06,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2311 [2022-12-13 02:24:06,934 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:24:06,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:06,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1865283503, now seen corresponding path program 1 times [2022-12-13 02:24:06,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:06,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570277087] [2022-12-13 02:24:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:06,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:07,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 02:24:07,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:07,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570277087] [2022-12-13 02:24:07,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570277087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:07,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:07,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:07,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779013628] [2022-12-13 02:24:07,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:07,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:07,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:07,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:07,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:07,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:07,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:07,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:07,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:07,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:07,109 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:07,109 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:07,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:07,111 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:07,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:07,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:07,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:07,111 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:07,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:07,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:07,115 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:07,115 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:07,115 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:07,115 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:07,115 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:07,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:07,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:07,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:07,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:07,123 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:07,124 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:07,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:07,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:07,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:07,232 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:07,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:24:07,233 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:07,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:07,233 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:07,233 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:07,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2312 [2022-12-13 02:24:07,233 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:24:07,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:07,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1893912654, now seen corresponding path program 1 times [2022-12-13 02:24:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:07,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602657370] [2022-12-13 02:24:07,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:07,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:07,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 02:24:07,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:07,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602657370] [2022-12-13 02:24:07,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602657370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:07,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:07,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:07,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183264118] [2022-12-13 02:24:07,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:07,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:07,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:07,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:07,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:07,303 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:07,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:07,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:07,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:07,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:07,390 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:07,390 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:07,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:07,391 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:07,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:07,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:07,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:07,392 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:07,392 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:07,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:07,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:07,395 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:07,395 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:07,395 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:07,395 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:07,395 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:07,395 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:07,395 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:07,395 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:07,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:07,401 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:07,401 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:07,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:07,401 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:07,401 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:07,491 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:07,491 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:07,492 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:07,492 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 02:24:07,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:07,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:07,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2313 [2022-12-13 02:24:07,492 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:24:07,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:07,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1922541805, now seen corresponding path program 1 times [2022-12-13 02:24:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:07,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83996182] [2022-12-13 02:24:07,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:07,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:24:07,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:07,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83996182] [2022-12-13 02:24:07,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83996182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:07,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:07,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:07,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046231951] [2022-12-13 02:24:07,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:07,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:07,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:07,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:07,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:07,546 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:07,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:07,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:07,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:07,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:07,621 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:07,621 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:07,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:07,622 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:07,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:07,623 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:07,623 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:07,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:07,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:07,626 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:07,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:07,626 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:07,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:07,626 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:07,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:07,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:07,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:07,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:07,632 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:07,632 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:07,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:07,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:07,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:07,720 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:07,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:07,721 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:07,721 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 02:24:07,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:07,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:07,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2314 [2022-12-13 02:24:07,721 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:24:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1951170956, now seen corresponding path program 1 times [2022-12-13 02:24:07,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:07,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099250898] [2022-12-13 02:24:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:07,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:24:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:07,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099250898] [2022-12-13 02:24:07,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099250898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:07,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:07,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:07,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526112365] [2022-12-13 02:24:07,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:07,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:07,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:07,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:07,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:07,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:07,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:07,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:07,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:07,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:07,843 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:07,843 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:07,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:07,844 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:07,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:07,845 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:07,845 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:07,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:07,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:07,848 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:07,848 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:07,848 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:07,848 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:07,848 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:07,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:07,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:07,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:07,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:07,854 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:07,854 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:07,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:07,854 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:07,854 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:07,942 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:07,943 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:07,943 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:07,943 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 02:24:07,943 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:07,943 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:07,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2315 [2022-12-13 02:24:07,943 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:24:07,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1979800107, now seen corresponding path program 1 times [2022-12-13 02:24:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:07,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733098634] [2022-12-13 02:24:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:07,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:08,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:24:08,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:08,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733098634] [2022-12-13 02:24:08,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733098634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:08,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:08,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:08,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202452405] [2022-12-13 02:24:08,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:08,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:08,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:08,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:08,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:08,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:08,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:08,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:08,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:08,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:08,075 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:08,075 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:08,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:08,076 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:08,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:08,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:08,077 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:08,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:08,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:08,079 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:08,080 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:08,080 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:08,080 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,080 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:08,080 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:08,080 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:08,086 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:08,086 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:08,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:08,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:08,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:08,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:08,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:24:08,178 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:08,178 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 02:24:08,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:08,178 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:08,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2316 [2022-12-13 02:24:08,178 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:24:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:08,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2008429258, now seen corresponding path program 1 times [2022-12-13 02:24:08,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:08,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987371958] [2022-12-13 02:24:08,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:08,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:08,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:24:08,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:08,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987371958] [2022-12-13 02:24:08,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987371958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:08,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:08,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:08,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594401803] [2022-12-13 02:24:08,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:08,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:08,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:08,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:08,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:08,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:08,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:08,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:08,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:08,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:08,299 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:08,299 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:08,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:08,300 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:08,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:08,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:08,301 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:08,301 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:08,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:08,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:08,303 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,303 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:08,303 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:08,304 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:08,304 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,304 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:08,304 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:08,304 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:08,309 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:08,310 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:08,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:08,310 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:08,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:08,397 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:08,397 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:08,397 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:08,397 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 02:24:08,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:08,397 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:08,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2317 [2022-12-13 02:24:08,398 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:24:08,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:08,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2037058409, now seen corresponding path program 1 times [2022-12-13 02:24:08,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:08,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448238511] [2022-12-13 02:24:08,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:08,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:08,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:24:08,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:08,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448238511] [2022-12-13 02:24:08,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448238511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:08,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:08,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527713760] [2022-12-13 02:24:08,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:08,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:08,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:08,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:08,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:08,450 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:08,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:08,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:08,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:08,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:08,536 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:08,536 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:08,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:08,538 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:08,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:08,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:08,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:08,538 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:08,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:08,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:08,541 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,541 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:08,541 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:08,541 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:08,541 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,541 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:08,541 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:08,541 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:08,547 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:08,547 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:08,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:08,548 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:08,548 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:08,636 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:08,636 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:08,636 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:08,636 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 02:24:08,636 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:08,636 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:08,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2318 [2022-12-13 02:24:08,636 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:24:08,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:08,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2065687560, now seen corresponding path program 1 times [2022-12-13 02:24:08,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:08,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526409691] [2022-12-13 02:24:08,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:08,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:08,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:24:08,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:08,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526409691] [2022-12-13 02:24:08,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526409691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:08,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:08,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:08,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147914295] [2022-12-13 02:24:08,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:08,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:08,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:08,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:08,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:08,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:08,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:08,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:08,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:08,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:08,754 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:08,754 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:08,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:08,755 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:08,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:08,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:08,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:08,756 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:08,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:08,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:08,759 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:08,759 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:08,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:08,759 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,759 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:08,759 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:08,759 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:08,765 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:08,765 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:08,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:08,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:08,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:08,853 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:08,853 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:08,854 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:08,854 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 02:24:08,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:08,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:08,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2319 [2022-12-13 02:24:08,854 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:24:08,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:08,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2094316711, now seen corresponding path program 1 times [2022-12-13 02:24:08,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:08,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179113517] [2022-12-13 02:24:08,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:08,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:08,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:24:08,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:08,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179113517] [2022-12-13 02:24:08,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179113517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:08,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:08,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:08,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680330761] [2022-12-13 02:24:08,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:08,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:08,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:08,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:08,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:08,910 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:08,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:08,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:08,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:08,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:08,977 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:08,977 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:08,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:08,978 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:08,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:08,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:08,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:08,979 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:08,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:08,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:08,982 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,982 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:08,982 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:08,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:08,982 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:08,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:08,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:08,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:08,988 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:08,988 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:08,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:08,989 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:08,989 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:09,077 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:09,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:09,078 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:09,078 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 02:24:09,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:09,078 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:09,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2320 [2022-12-13 02:24:09,078 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:24:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2122945862, now seen corresponding path program 1 times [2022-12-13 02:24:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:09,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779454432] [2022-12-13 02:24:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:09,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:24:09,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:09,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779454432] [2022-12-13 02:24:09,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779454432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:09,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:09,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:09,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194717599] [2022-12-13 02:24:09,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:09,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:09,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:09,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:09,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:09,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:09,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:09,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:09,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:09,213 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:09,213 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:09,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1107 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:09,214 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:09,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:09,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:09,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:09,215 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:09,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:09,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:09,217 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:09,217 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:09,218 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:09,218 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:09,218 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:09,218 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:09,218 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:09,218 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:09,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:09,223 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:09,224 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:24:09,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:09,224 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:09,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:09,312 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:09,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:09,313 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:09,313 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 02:24:09,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:09,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:09,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2321 [2022-12-13 02:24:09,313 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:24:09,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:09,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2143392283, now seen corresponding path program 1 times [2022-12-13 02:24:09,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:09,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29705201] [2022-12-13 02:24:09,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:09,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24: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 02:24:09,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:09,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29705201] [2022-12-13 02:24:09,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29705201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:09,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:09,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:09,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449973289] [2022-12-13 02:24:09,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:09,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:09,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:09,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:09,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:09,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:09,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:09,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:09,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:09,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:09,453 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:09,454 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:09,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:09,455 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:09,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:09,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:09,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:09,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:09,455 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:09,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:09,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:09,458 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:09,458 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:09,458 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:09,458 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:09,458 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:09,458 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:09,458 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:09,458 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:09,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:09,464 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:09,464 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:09,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:09,465 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:09,465 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:09,553 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:09,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:09,553 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:09,554 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 02:24:09,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:09,554 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:09,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2322 [2022-12-13 02:24:09,554 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:24:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2114763132, now seen corresponding path program 1 times [2022-12-13 02:24:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:09,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724409940] [2022-12-13 02:24:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:09,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 02:24:09,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:09,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724409940] [2022-12-13 02:24:09,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724409940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:09,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:09,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:09,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585973633] [2022-12-13 02:24:09,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:09,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:09,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:09,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:09,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:09,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:09,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:09,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:09,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:09,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:09,687 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:09,687 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:09,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:09,688 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:09,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:09,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:09,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:09,689 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:09,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:09,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:09,691 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:09,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:09,691 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:09,691 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:09,692 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:09,692 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:09,692 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:09,692 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:09,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:09,697 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:09,697 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:09,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:09,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:09,698 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:09,785 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:09,785 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:09,785 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:09,785 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 02:24:09,785 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:09,785 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:09,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2323 [2022-12-13 02:24:09,785 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:24:09,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2086133981, now seen corresponding path program 1 times [2022-12-13 02:24:09,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:09,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332908032] [2022-12-13 02:24:09,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:09,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:09,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:09,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:09,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332908032] [2022-12-13 02:24:09,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332908032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:09,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:09,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:09,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685025370] [2022-12-13 02:24:09,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:09,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:09,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:09,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:09,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:09,872 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:09,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:09,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:09,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:09,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:09,958 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:09,958 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:09,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:09,959 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:09,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:09,960 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:09,960 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:09,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:09,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:09,962 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:09,962 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:09,963 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:09,963 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:09,963 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:09,963 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:09,963 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:09,963 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:09,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:09,968 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:09,968 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:09,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:09,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:09,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:10,062 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:10,062 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:24:10,062 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:10,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:10,062 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:10,063 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:10,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2324 [2022-12-13 02:24:10,063 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:24:10,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:10,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2057504830, now seen corresponding path program 1 times [2022-12-13 02:24:10,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:10,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144334217] [2022-12-13 02:24:10,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:10,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:10,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:24:10,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:10,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144334217] [2022-12-13 02:24:10,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144334217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:10,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:10,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:10,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937438670] [2022-12-13 02:24:10,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:10,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:10,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:10,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:10,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:10,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:10,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:10,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:10,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:10,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:10,192 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:10,192 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:10,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:10,193 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:10,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:10,194 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:10,194 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:10,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:10,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:10,196 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:10,196 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:10,196 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:10,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:10,196 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:10,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:10,197 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:10,197 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:10,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:10,203 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:10,203 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:10,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:10,204 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:10,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:10,304 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:10,304 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:24:10,304 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:10,304 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 02:24:10,304 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:10,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:10,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2325 [2022-12-13 02:24:10,305 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:24:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:10,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2028875679, now seen corresponding path program 1 times [2022-12-13 02:24:10,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:10,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393448039] [2022-12-13 02:24:10,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:10,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:10,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:24:10,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:10,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393448039] [2022-12-13 02:24:10,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393448039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:10,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:10,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:10,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809941017] [2022-12-13 02:24:10,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:10,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:10,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:10,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:10,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:10,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:10,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:10,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:10,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:10,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:10,448 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:10,448 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:10,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:10,449 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:10,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:10,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:10,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:10,449 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:10,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:10,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:10,452 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:10,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:10,452 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:10,452 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:10,452 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:10,452 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:10,452 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:10,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:10,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:10,458 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:10,458 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:10,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:10,459 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:10,459 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:10,547 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:10,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:10,548 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:10,548 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 02:24:10,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:10,548 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:10,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2326 [2022-12-13 02:24:10,548 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:24:10,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:10,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2000246528, now seen corresponding path program 1 times [2022-12-13 02:24:10,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:10,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529193650] [2022-12-13 02:24:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:10,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:10,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:24:10,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:10,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529193650] [2022-12-13 02:24:10,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529193650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:10,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:10,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:10,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436163303] [2022-12-13 02:24:10,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:10,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:10,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:10,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:10,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:10,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:10,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:10,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:10,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:10,671 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:10,671 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:10,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:10,672 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:10,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:10,673 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:10,673 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:10,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:10,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:10,675 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:10,676 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:10,676 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:10,676 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:10,676 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:10,676 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:10,676 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:10,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:10,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:10,682 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:10,682 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:10,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:10,682 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:10,682 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:10,770 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:10,770 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:10,771 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:10,771 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 02:24:10,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:10,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:10,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2327 [2022-12-13 02:24:10,771 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:24:10,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:10,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1971617377, now seen corresponding path program 1 times [2022-12-13 02:24:10,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:10,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8644232] [2022-12-13 02:24:10,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24: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:24:10,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:10,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8644232] [2022-12-13 02:24:10,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8644232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:10,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:10,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:10,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418602628] [2022-12-13 02:24:10,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:10,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:10,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:10,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:10,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:10,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:10,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:10,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:10,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:10,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:10,917 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:10,917 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:10,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:10,918 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:10,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:10,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:10,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:10,919 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:10,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:10,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:10,921 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:10,921 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:10,921 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:10,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:10,921 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:10,922 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:10,922 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:10,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:10,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:10,928 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:10,928 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:10,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:10,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:10,928 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:11,017 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:11,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:11,017 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:11,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:11,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:11,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:11,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2328 [2022-12-13 02:24:11,017 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:24:11,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:11,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1942988226, now seen corresponding path program 1 times [2022-12-13 02:24:11,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:11,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364595668] [2022-12-13 02:24:11,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:11,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:11,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:24:11,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:11,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364595668] [2022-12-13 02:24:11,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364595668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:11,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:11,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:11,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143478861] [2022-12-13 02:24:11,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:11,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:11,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:11,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:11,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:11,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:11,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:11,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:11,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:11,141 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:11,142 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:11,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:11,143 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:11,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:11,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:11,143 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:11,143 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:11,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:11,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:11,146 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:11,146 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:11,146 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:11,146 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:11,146 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:11,146 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:11,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:11,147 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:11,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:11,152 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:11,152 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:11,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:11,153 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:11,153 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:11,240 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:11,241 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:11,241 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:11,241 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 02:24:11,241 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:11,241 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:11,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2329 [2022-12-13 02:24:11,241 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:24:11,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1914359075, now seen corresponding path program 1 times [2022-12-13 02:24:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:11,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287864522] [2022-12-13 02:24:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:11,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:11,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:24:11,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:11,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287864522] [2022-12-13 02:24:11,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287864522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:11,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:11,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:11,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782726508] [2022-12-13 02:24:11,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:11,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:11,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:11,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:11,297 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:11,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:11,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:11,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:11,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:11,364 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:11,364 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:11,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:11,365 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:11,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:11,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:11,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:11,366 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:11,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:11,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:11,368 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:11,368 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:11,368 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:11,369 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:11,369 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:11,369 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:11,369 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:11,369 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:11,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:11,375 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:11,375 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:11,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:11,375 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:11,375 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:11,465 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:11,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:11,465 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:11,465 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 02:24:11,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:11,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:11,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2330 [2022-12-13 02:24:11,465 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:24:11,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:11,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1885729924, now seen corresponding path program 1 times [2022-12-13 02:24:11,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:11,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642496962] [2022-12-13 02:24:11,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:11,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:11,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:24:11,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:11,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642496962] [2022-12-13 02:24:11,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642496962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:11,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:11,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:11,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937777223] [2022-12-13 02:24:11,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:11,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:11,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:11,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:11,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:11,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:11,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:11,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:11,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:11,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:11,606 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:11,607 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:11,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:11,608 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:11,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:11,608 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:11,608 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:11,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:11,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:11,611 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:11,611 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:11,611 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:11,611 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:11,611 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:11,611 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:11,611 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:11,611 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:11,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:11,617 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:11,617 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:11,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:11,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:11,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:11,706 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:11,706 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:11,706 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:11,706 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 02:24:11,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:11,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:11,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2331 [2022-12-13 02:24:11,707 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:24:11,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:11,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1857100773, now seen corresponding path program 1 times [2022-12-13 02:24:11,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:11,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251233350] [2022-12-13 02:24:11,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:11,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:11,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:24:11,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:11,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251233350] [2022-12-13 02:24:11,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251233350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:11,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:11,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:11,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71881265] [2022-12-13 02:24:11,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:11,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:11,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:11,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:11,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:11,761 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:11,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:11,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:11,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:11,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:11,835 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:11,836 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:11,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:11,837 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:11,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:11,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:11,837 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:11,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:11,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:11,840 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:11,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:11,840 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:11,840 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:11,840 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:11,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:11,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:11,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:11,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:11,846 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:11,846 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:11,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:11,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:11,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:11,936 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:11,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:11,936 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:11,936 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 02:24:11,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:11,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:11,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2332 [2022-12-13 02:24:11,937 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:24:11,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1828471622, now seen corresponding path program 1 times [2022-12-13 02:24:11,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:11,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483845592] [2022-12-13 02:24:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:11,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:11,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:24:11,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:11,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483845592] [2022-12-13 02:24:11,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483845592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:11,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:11,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662632626] [2022-12-13 02:24:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:11,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:11,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:11,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:11,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:11,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:11,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:11,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:11,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:12,057 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:12,057 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:12,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:12,059 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:12,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:12,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:12,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:12,059 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:12,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:12,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:12,062 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:12,062 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:12,062 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:12,062 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:12,062 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:12,062 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:12,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:12,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:12,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:12,068 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:12,068 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:12,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:12,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:12,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:12,158 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:12,159 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:24:12,159 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:12,159 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 02:24:12,159 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:12,159 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:12,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2333 [2022-12-13 02:24:12,159 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:24:12,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1799842471, now seen corresponding path program 1 times [2022-12-13 02:24:12,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:12,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219174415] [2022-12-13 02:24:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:12,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:24:12,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:12,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219174415] [2022-12-13 02:24:12,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219174415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:12,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:12,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180462795] [2022-12-13 02:24:12,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:12,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:12,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:12,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:12,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:12,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:12,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:12,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:12,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:12,290 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:12,290 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:12,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:12,291 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:12,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:12,292 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:12,292 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:12,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:12,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:12,295 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:12,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:12,295 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:12,295 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:12,295 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:12,295 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:12,295 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:12,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:12,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:12,301 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:12,301 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:12,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:12,302 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:12,302 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:12,389 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:12,389 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:12,389 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:12,389 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 02:24:12,389 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:12,389 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:12,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2334 [2022-12-13 02:24:12,390 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:24:12,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:12,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1771213320, now seen corresponding path program 1 times [2022-12-13 02:24:12,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:12,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377862455] [2022-12-13 02:24:12,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:12,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:12,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377862455] [2022-12-13 02:24:12,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377862455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:12,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:12,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:12,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794591298] [2022-12-13 02:24:12,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:12,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:12,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:12,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:12,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:12,460 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:12,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:12,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:12,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:12,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:12,538 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:12,539 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:12,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:12,540 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:12,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:12,540 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:12,540 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:12,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:12,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:12,543 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:12,543 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:12,543 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:12,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:12,543 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:12,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:12,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:12,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:12,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:12,549 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:12,549 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:12,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:12,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:12,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:12,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:12,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:12,639 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:12,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:12,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:12,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:12,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2335 [2022-12-13 02:24:12,639 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:24:12,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:12,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1742584169, now seen corresponding path program 1 times [2022-12-13 02:24:12,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:12,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558860809] [2022-12-13 02:24:12,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:12,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:24:12,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:12,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558860809] [2022-12-13 02:24:12,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558860809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:12,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:12,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:12,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751141248] [2022-12-13 02:24:12,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:12,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:12,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:12,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:12,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:12,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:12,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:12,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:12,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:12,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:12,769 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:12,769 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:12,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:12,771 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:12,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:12,771 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:12,771 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:12,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:12,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:12,786 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:12,786 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:12,786 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:12,786 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:12,786 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:12,786 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:12,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:12,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:12,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:12,792 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:12,792 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:12,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:12,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:12,793 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:12,881 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:12,881 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:12,881 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:12,881 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 02:24:12,881 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:12,881 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:12,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2336 [2022-12-13 02:24:12,882 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:24:12,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1713955018, now seen corresponding path program 1 times [2022-12-13 02:24:12,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:12,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877314237] [2022-12-13 02:24:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:12,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:12,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:24:12,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:12,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877314237] [2022-12-13 02:24:12,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877314237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:12,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:12,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:12,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357189713] [2022-12-13 02:24:12,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:12,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:12,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:12,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:12,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:12,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:12,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:12,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:12,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:12,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:13,001 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:13,001 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:13,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:13,002 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:13,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:13,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:13,002 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:13,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:13,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:13,005 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:13,005 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:13,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:13,005 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:13,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:13,006 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:13,011 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:13,011 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:13,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:13,012 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:13,012 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:13,099 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:13,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:13,100 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:13,100 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 02:24:13,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:13,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:13,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2337 [2022-12-13 02:24:13,100 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:24:13,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:13,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1685325867, now seen corresponding path program 1 times [2022-12-13 02:24:13,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:13,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618936020] [2022-12-13 02:24:13,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:13,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:13,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:24:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:13,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618936020] [2022-12-13 02:24:13,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618936020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:13,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:13,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:13,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342772137] [2022-12-13 02:24:13,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:13,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:13,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:13,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:13,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:13,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:13,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:13,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:13,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:13,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:13,227 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:13,227 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:13,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:13,228 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:13,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:13,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:13,229 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:13,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:13,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:13,232 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,232 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:13,232 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:13,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:13,232 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:13,232 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:13,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:13,238 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:13,238 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:13,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:13,239 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:13,239 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:13,326 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:13,327 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:13,327 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:13,327 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 02:24:13,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:13,327 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:13,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2338 [2022-12-13 02:24:13,327 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:24:13,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1656696716, now seen corresponding path program 1 times [2022-12-13 02:24:13,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:13,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490086710] [2022-12-13 02:24:13,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:13,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:13,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:24:13,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:13,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490086710] [2022-12-13 02:24:13,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490086710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:13,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:13,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:13,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235432363] [2022-12-13 02:24:13,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:13,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:13,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:13,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:13,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:13,397 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:13,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:13,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:13,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:13,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:13,474 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:13,474 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:13,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:13,475 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:13,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:13,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:13,476 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:13,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:13,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:13,478 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,478 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:13,478 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:13,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:13,478 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,479 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:13,479 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:13,479 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:13,484 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:13,485 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:13,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:13,485 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:13,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:13,575 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:13,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:24:13,576 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:13,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:13,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:13,576 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:13,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2339 [2022-12-13 02:24:13,576 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:24:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1628067565, now seen corresponding path program 1 times [2022-12-13 02:24:13,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:13,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036120299] [2022-12-13 02:24:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:13,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:13,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:24:13,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:13,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036120299] [2022-12-13 02:24:13,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036120299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:13,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:13,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:13,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445921358] [2022-12-13 02:24:13,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:13,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:13,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:13,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:13,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:13,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:13,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:13,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:13,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:13,717 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:13,717 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:13,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:13,718 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:13,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:13,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:13,719 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:13,719 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:13,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:13,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:13,721 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:13,722 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:13,722 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:13,722 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,722 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:13,722 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:13,722 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:13,728 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:13,728 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:13,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:13,728 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:13,728 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:13,816 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:13,816 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:13,816 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:13,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:13,816 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:13,816 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:13,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2340 [2022-12-13 02:24:13,816 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:24:13,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:13,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1599438414, now seen corresponding path program 1 times [2022-12-13 02:24:13,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:13,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660205973] [2022-12-13 02:24:13,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:13,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:13,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:13,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660205973] [2022-12-13 02:24:13,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660205973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:13,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:13,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:13,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322307098] [2022-12-13 02:24:13,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:13,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:13,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:13,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:13,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:13,872 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:13,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:13,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:13,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:13,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:13,938 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:13,938 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:13,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:13,939 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:13,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:13,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:13,940 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:13,940 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:13,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:13,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:13,943 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,943 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:13,943 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:13,943 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:13,943 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,943 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:13,943 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:13,943 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:13,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:13,960 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:13,960 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:13,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:13,961 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:13,961 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:14,049 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:14,050 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:24:14,050 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:14,050 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 02:24:14,050 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:14,050 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:14,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2341 [2022-12-13 02:24:14,050 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:24:14,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1570809263, now seen corresponding path program 1 times [2022-12-13 02:24:14,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:14,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125240493] [2022-12-13 02:24:14,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:14,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:14,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:24:14,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:14,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125240493] [2022-12-13 02:24:14,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125240493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:14,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:14,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:14,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188310687] [2022-12-13 02:24:14,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:14,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:14,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:14,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:14,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:14,105 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:14,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:14,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:14,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:14,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:14,171 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:14,171 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:14,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:14,172 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:14,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:14,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:14,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:14,173 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:14,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:14,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:14,176 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:14,176 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:14,176 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:14,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:14,176 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:14,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:14,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:14,176 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:14,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:14,182 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:14,182 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:14,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:14,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:14,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:14,270 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:14,271 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:14,271 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:14,271 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 02:24:14,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:14,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:14,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2342 [2022-12-13 02:24:14,271 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:24:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1542180112, now seen corresponding path program 1 times [2022-12-13 02:24:14,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:14,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357490868] [2022-12-13 02:24:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:14,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:14,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:24:14,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:14,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357490868] [2022-12-13 02:24:14,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357490868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:14,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:14,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562863280] [2022-12-13 02:24:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:14,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:14,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:14,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:14,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:14,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:14,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:14,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:14,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:14,393 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:14,393 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:14,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:14,394 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:14,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:14,394 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:14,394 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:14,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:14,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:14,397 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:14,397 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:14,397 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:14,397 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:14,397 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:14,397 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:14,397 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:14,398 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:14,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:14,403 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:14,403 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:14,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:14,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:14,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:14,492 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:14,492 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:14,492 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:14,492 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 02:24:14,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:14,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:14,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2343 [2022-12-13 02:24:14,493 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:24:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:14,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1513550961, now seen corresponding path program 1 times [2022-12-13 02:24:14,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:14,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172449423] [2022-12-13 02:24:14,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:14,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:14,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:24:14,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:14,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172449423] [2022-12-13 02:24:14,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172449423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:14,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:14,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:14,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612872177] [2022-12-13 02:24:14,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:14,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:14,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:14,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:14,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:14,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:14,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:14,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:14,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:14,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:14,631 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:14,631 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:14,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:14,632 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:14,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:14,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:14,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:14,632 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:14,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:14,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:14,635 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:14,635 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:14,635 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:14,635 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:14,635 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:14,635 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:14,635 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:14,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:14,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:14,641 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:14,641 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:24:14,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:14,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:14,642 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:14,729 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:14,729 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:14,729 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:14,729 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 02:24:14,729 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:14,729 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:14,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2344 [2022-12-13 02:24:14,729 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:24:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1484921810, now seen corresponding path program 1 times [2022-12-13 02:24:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:14,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760044417] [2022-12-13 02:24:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:14,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:14,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:24:14,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:14,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760044417] [2022-12-13 02:24:14,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760044417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:14,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:14,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:14,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369104290] [2022-12-13 02:24:14,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:14,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:14,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:14,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:14,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:14,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:14,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:14,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:14,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:14,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:14,857 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:14,857 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:14,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:14,858 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:14,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:14,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:14,859 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:14,859 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:14,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:14,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:14,861 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:14,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:14,861 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:14,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:14,862 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:14,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:14,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:14,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:14,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:14,867 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:14,868 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:14,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:14,868 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:14,868 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:14,957 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:14,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:14,957 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:14,957 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 02:24:14,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:14,957 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:14,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2345 [2022-12-13 02:24:14,958 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:24:14,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:14,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1456292659, now seen corresponding path program 1 times [2022-12-13 02:24:14,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:14,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501108126] [2022-12-13 02:24:14,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:14,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:15,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:24:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:15,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501108126] [2022-12-13 02:24:15,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501108126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:15,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:15,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:15,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045718927] [2022-12-13 02:24:15,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:15,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:15,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:15,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:15,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:15,013 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:15,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:15,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:15,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:15,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:15,079 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:15,079 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:15,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:15,080 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:15,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:15,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:15,081 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:15,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:15,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:15,083 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,083 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:15,084 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:15,084 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:15,084 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,084 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:15,084 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:15,084 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:15,090 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:15,090 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:15,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:15,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:15,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:15,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:15,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:15,177 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:15,177 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 02:24:15,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:15,177 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:15,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2346 [2022-12-13 02:24:15,178 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:24:15,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1427663508, now seen corresponding path program 1 times [2022-12-13 02:24:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:15,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720964747] [2022-12-13 02:24:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:15,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:24:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:15,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720964747] [2022-12-13 02:24:15,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720964747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:15,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:15,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668411114] [2022-12-13 02:24:15,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:15,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:15,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:15,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:15,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:15,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:15,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:15,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:15,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:15,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:15,304 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:15,305 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:15,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:15,306 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:15,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:15,306 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:15,306 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:15,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:15,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:15,309 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,309 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:15,309 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:15,309 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:15,309 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,309 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:15,309 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:15,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:15,315 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:15,315 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:15,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:15,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:15,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:15,403 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:15,403 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:15,403 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:15,404 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 02:24:15,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:15,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:15,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2347 [2022-12-13 02:24:15,404 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:24:15,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:15,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1399034357, now seen corresponding path program 1 times [2022-12-13 02:24:15,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:15,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553769097] [2022-12-13 02:24:15,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:15,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:15,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:24:15,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:15,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553769097] [2022-12-13 02:24:15,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553769097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:15,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:15,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55610875] [2022-12-13 02:24:15,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:15,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:15,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:15,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:15,457 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:15,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:15,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:15,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:15,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:15,524 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:15,524 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:15,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:15,525 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:15,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:15,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:15,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:15,526 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:15,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:15,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:15,528 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:15,529 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:15,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:15,529 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:15,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:15,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:15,534 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:15,535 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:15,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:15,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:15,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:15,623 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:15,623 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:15,623 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:15,623 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 02:24:15,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:15,623 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:15,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2348 [2022-12-13 02:24:15,624 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:24:15,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:15,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1370405206, now seen corresponding path program 1 times [2022-12-13 02:24:15,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:15,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349458881] [2022-12-13 02:24:15,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:15,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:15,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:24:15,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:15,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349458881] [2022-12-13 02:24:15,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349458881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:15,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:15,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:15,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642447513] [2022-12-13 02:24:15,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:15,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:15,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:15,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:15,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:15,679 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:15,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:15,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:15,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:15,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:15,748 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:15,749 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:15,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:15,750 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:15,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:15,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:15,750 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:15,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:15,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:15,753 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:15,753 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:15,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:15,753 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:15,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:15,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:15,759 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:15,759 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:15,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:15,760 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:15,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:15,847 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:15,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:15,847 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:15,847 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 02:24:15,847 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:15,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:15,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2349 [2022-12-13 02:24:15,848 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:24:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:15,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1341776055, now seen corresponding path program 1 times [2022-12-13 02:24:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:15,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018539732] [2022-12-13 02:24:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24: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:24:15,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:15,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018539732] [2022-12-13 02:24:15,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018539732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:15,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:15,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:15,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324309488] [2022-12-13 02:24:15,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:15,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:15,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:15,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:15,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:15,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:15,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:15,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:15,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:15,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:15,969 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:15,969 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:15,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:15,970 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:15,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:15,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:15,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:15,971 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:15,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:15,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:15,973 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,973 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:15,974 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:15,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:15,974 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,974 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:15,974 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:15,974 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:15,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:15,979 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:15,980 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:15,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:15,980 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:15,980 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:16,072 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:16,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:24:16,073 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:16,073 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 02:24:16,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:16,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:16,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2350 [2022-12-13 02:24:16,073 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:24:16,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:16,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1313146904, now seen corresponding path program 1 times [2022-12-13 02:24:16,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:16,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029527124] [2022-12-13 02:24:16,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:16,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:16,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 02:24:16,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:16,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029527124] [2022-12-13 02:24:16,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029527124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:16,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:16,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:16,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098134612] [2022-12-13 02:24:16,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:16,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:16,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:16,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:16,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:16,128 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:16,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:16,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:16,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:16,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:16,195 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:16,195 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:16,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:16,196 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:16,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:16,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:16,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:16,196 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:16,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:16,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:16,199 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:16,199 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:16,199 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:16,199 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:16,199 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:16,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:16,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:16,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:16,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:16,205 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:16,205 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:16,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:16,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:16,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:16,294 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:16,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:16,294 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:16,294 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 02:24:16,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:16,294 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:16,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2351 [2022-12-13 02:24:16,295 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:24:16,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1284517753, now seen corresponding path program 1 times [2022-12-13 02:24:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:16,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686336249] [2022-12-13 02:24:16,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:16,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:16,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:24:16,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:16,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686336249] [2022-12-13 02:24:16,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686336249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:16,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:16,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:16,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023031668] [2022-12-13 02:24:16,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:16,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:16,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:16,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:16,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:16,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:16,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:16,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:16,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:16,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:16,437 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:16,437 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:16,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:16,438 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:16,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:16,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:16,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:16,439 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:16,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:16,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:16,441 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:16,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:16,441 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:16,441 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:16,441 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:16,441 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:16,441 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:16,442 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:16,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:16,447 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:16,447 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:24:16,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:16,447 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:16,448 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:16,535 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:16,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:16,536 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:16,536 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 02:24:16,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:16,536 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:16,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2352 [2022-12-13 02:24:16,536 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:24:16,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1255888602, now seen corresponding path program 1 times [2022-12-13 02:24:16,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:16,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595436185] [2022-12-13 02:24:16,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:16,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:16,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:24:16,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:16,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595436185] [2022-12-13 02:24:16,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595436185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:16,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:16,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:16,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091629739] [2022-12-13 02:24:16,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:16,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:16,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:16,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:16,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:16,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:16,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:16,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:16,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:16,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:16,662 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:16,662 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:16,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:16,663 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:16,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:16,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:16,664 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:16,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:16,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:16,666 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:16,666 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:16,666 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:16,666 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:16,666 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:16,667 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:16,667 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:16,667 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:16,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:16,672 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:16,672 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:24:16,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:16,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:16,673 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:16,762 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:16,763 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:24:16,763 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:16,763 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 02:24:16,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:16,763 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:16,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2353 [2022-12-13 02:24:16,763 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:24:16,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:16,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1227259451, now seen corresponding path program 1 times [2022-12-13 02:24:16,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:16,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581631267] [2022-12-13 02:24:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:16,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:16,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:24:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:16,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581631267] [2022-12-13 02:24:16,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581631267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:16,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:16,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631290929] [2022-12-13 02:24:16,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:16,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:16,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:16,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:16,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:16,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:16,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:16,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:16,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:16,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:16,894 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:16,894 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:16,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:16,896 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:16,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:16,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:16,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:16,896 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:16,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:16,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:16,899 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:16,899 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:16,899 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:16,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:16,899 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:16,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:16,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:16,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:16,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:16,905 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:16,905 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:16,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:16,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:16,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:16,993 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:16,993 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:16,993 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:16,993 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 02:24:16,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:16,993 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:16,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2354 [2022-12-13 02:24:16,993 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:24:16,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1198630300, now seen corresponding path program 1 times [2022-12-13 02:24:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:16,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443701937] [2022-12-13 02:24:16,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:16,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:17,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:24:17,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:17,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443701937] [2022-12-13 02:24:17,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443701937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:17,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:17,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:17,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892707970] [2022-12-13 02:24:17,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:17,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:17,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:17,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:17,047 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:17,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:17,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:17,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:17,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:17,121 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:17,121 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:17,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:17,122 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:17,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:17,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:17,123 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:17,123 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:17,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:17,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:17,125 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:17,125 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:17,125 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:17,126 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:17,126 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:17,126 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:17,126 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:17,126 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:17,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:17,131 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:17,131 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:17,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:17,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:17,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:17,220 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:17,220 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:17,220 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:17,220 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 02:24:17,220 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:17,220 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:17,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2355 [2022-12-13 02:24:17,220 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:24:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1170001149, now seen corresponding path program 1 times [2022-12-13 02:24:17,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:17,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812672120] [2022-12-13 02:24:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24: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:24:17,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:17,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812672120] [2022-12-13 02:24:17,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812672120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:17,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:17,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:17,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072707880] [2022-12-13 02:24:17,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:17,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:17,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:17,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:17,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:17,275 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:17,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:17,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:17,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:17,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:17,341 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:17,342 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:17,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:17,343 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:17,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:17,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:17,343 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:17,343 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:17,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:17,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:17,346 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:17,346 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:17,346 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:17,346 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:17,346 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:17,346 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:17,346 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:17,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:17,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:17,352 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:17,352 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:17,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:17,352 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:17,352 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:17,441 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:17,441 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:17,441 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:17,441 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 02:24:17,441 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:17,441 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:17,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2356 [2022-12-13 02:24:17,441 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:24:17,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:17,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1141371998, now seen corresponding path program 1 times [2022-12-13 02:24:17,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:17,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454053689] [2022-12-13 02:24:17,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:17,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:17,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:24:17,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:17,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454053689] [2022-12-13 02:24:17,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454053689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:17,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:17,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:17,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080115471] [2022-12-13 02:24:17,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:17,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:17,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:17,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:17,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:17,495 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:17,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:17,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:17,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:17,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:17,570 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:17,570 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:17,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:17,571 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:17,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:17,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:17,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:17,572 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:17,572 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:17,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:17,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:17,574 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:17,574 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:17,574 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:17,574 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:17,575 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:17,575 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:17,575 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:17,575 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:17,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:17,580 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:17,580 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:17,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:17,581 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:17,581 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:17,670 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:17,670 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:17,670 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:17,670 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 02:24:17,670 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:17,671 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:17,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2357 [2022-12-13 02:24:17,671 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:24:17,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:17,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1112742847, now seen corresponding path program 1 times [2022-12-13 02:24:17,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:17,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455798292] [2022-12-13 02:24:17,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:17,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:17,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 02:24:17,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:17,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455798292] [2022-12-13 02:24:17,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455798292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:17,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:17,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071976885] [2022-12-13 02:24:17,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:17,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:17,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:17,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:17,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:17,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:17,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:17,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:17,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:17,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:17,798 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:17,799 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:17,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:17,800 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:17,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:17,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:17,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:17,800 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:17,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:17,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:17,802 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:17,802 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:17,803 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:17,803 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:17,803 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:17,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:17,803 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:17,803 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:17,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:17,808 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:17,808 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:24:17,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:17,809 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:17,809 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:17,896 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:17,897 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:17,897 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:17,897 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 02:24:17,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:17,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:17,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2358 [2022-12-13 02:24:17,897 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:24:17,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1084113696, now seen corresponding path program 1 times [2022-12-13 02:24:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:17,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116300537] [2022-12-13 02:24:17,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:17,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:17,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:24:17,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:17,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116300537] [2022-12-13 02:24:17,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116300537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:17,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:17,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:17,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715752286] [2022-12-13 02:24:17,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:17,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:17,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:17,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:17,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:17,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:17,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:17,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:17,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:17,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:18,013 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:18,014 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:18,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:18,014 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:18,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:18,015 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:18,015 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:18,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:18,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:18,017 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,017 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:18,018 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:18,018 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:18,018 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,018 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:18,018 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:18,018 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:18,023 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:18,023 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:18,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:18,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:18,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:18,111 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:18,112 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:18,112 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:18,112 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 02:24:18,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:18,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:18,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2359 [2022-12-13 02:24:18,112 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:24:18,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:18,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1055484545, now seen corresponding path program 1 times [2022-12-13 02:24:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:18,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272935668] [2022-12-13 02:24:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:18,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:18,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:24:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:18,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272935668] [2022-12-13 02:24:18,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272935668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:18,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:18,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:18,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093491764] [2022-12-13 02:24:18,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:18,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:18,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:18,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:18,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:18,164 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:18,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:18,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:18,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:18,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:18,241 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:18,242 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:18,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:18,243 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:18,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:18,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:18,243 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:18,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:18,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:18,246 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,246 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:18,246 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:18,246 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:18,246 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,246 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:18,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:18,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:18,252 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:18,252 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:18,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:18,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:18,253 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:18,340 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:18,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:18,340 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:18,340 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 02:24:18,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:18,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:18,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2360 [2022-12-13 02:24:18,340 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:24:18,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:18,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1026855394, now seen corresponding path program 1 times [2022-12-13 02:24:18,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:18,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215068367] [2022-12-13 02:24:18,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:18,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 02:24:18,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:18,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215068367] [2022-12-13 02:24:18,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215068367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:18,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:18,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:18,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020978994] [2022-12-13 02:24:18,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:18,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:18,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:18,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:18,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:18,393 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:18,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:18,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:18,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:18,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:18,469 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:18,469 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:18,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:18,470 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:18,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:18,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:18,471 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:18,471 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:18,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:18,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:18,473 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,473 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:18,473 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:18,473 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:18,473 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,474 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:18,474 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:18,474 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:18,479 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:18,479 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:18,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:18,480 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:18,480 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:18,567 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:18,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:18,567 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:18,567 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 02:24:18,567 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:18,567 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:18,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2361 [2022-12-13 02:24:18,567 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:24:18,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:18,568 INFO L85 PathProgramCache]: Analyzing trace with hash -998226243, now seen corresponding path program 1 times [2022-12-13 02:24:18,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:18,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787356070] [2022-12-13 02:24:18,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:18,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:18,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:24:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:18,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787356070] [2022-12-13 02:24:18,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787356070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:18,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:18,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:18,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858666145] [2022-12-13 02:24:18,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:18,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:18,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:18,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:18,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:18,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:18,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:18,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:18,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:18,688 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:18,688 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:18,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:18,700 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:18,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:18,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:18,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:18,701 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:18,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:18,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:18,703 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:18,703 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:18,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:18,703 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:18,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:18,703 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:18,709 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:18,709 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:24:18,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:18,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:18,710 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:18,798 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:18,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:18,799 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:18,799 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 02:24:18,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:18,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:18,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2362 [2022-12-13 02:24:18,799 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:24:18,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:18,799 INFO L85 PathProgramCache]: Analyzing trace with hash -969597092, now seen corresponding path program 1 times [2022-12-13 02:24:18,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:18,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302737966] [2022-12-13 02:24:18,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:18,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:18,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:24:18,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:18,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302737966] [2022-12-13 02:24:18,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302737966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:18,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:18,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:18,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557590637] [2022-12-13 02:24:18,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:18,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:18,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:18,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:18,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:18,853 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:18,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:18,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:18,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:18,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:18,919 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:18,919 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:18,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:18,920 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:18,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:18,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:18,921 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:18,921 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:18,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:18,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:18,923 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,923 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:18,924 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:18,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:18,924 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,924 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:18,924 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:18,924 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:18,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:18,929 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:18,930 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:18,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:18,930 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:18,930 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:19,016 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:19,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:19,017 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:19,017 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 02:24:19,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:19,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:19,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2363 [2022-12-13 02:24:19,017 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:24:19,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash -940967941, now seen corresponding path program 1 times [2022-12-13 02:24:19,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:19,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447156711] [2022-12-13 02:24:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:19,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:24:19,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:19,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447156711] [2022-12-13 02:24:19,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447156711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:19,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:19,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:19,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127726840] [2022-12-13 02:24:19,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:19,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:19,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:19,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:19,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:19,087 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:19,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:19,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:19,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:19,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:19,165 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:19,165 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:19,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:19,166 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:19,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:19,166 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:19,166 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:19,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:19,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:19,169 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:19,169 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:19,169 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:19,169 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:19,169 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:19,169 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:19,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:19,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:19,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:19,175 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:19,175 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:19,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:19,175 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:19,176 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:19,262 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:19,263 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:19,263 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:19,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:19,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:19,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:19,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2364 [2022-12-13 02:24:19,263 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:24:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:19,263 INFO L85 PathProgramCache]: Analyzing trace with hash -912338790, now seen corresponding path program 1 times [2022-12-13 02:24:19,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:19,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705896659] [2022-12-13 02:24:19,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:19,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:19,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:24:19,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:19,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705896659] [2022-12-13 02:24:19,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705896659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:19,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:19,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:19,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585423901] [2022-12-13 02:24:19,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:19,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:19,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:19,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:19,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:19,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:19,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:19,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:19,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:19,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:19,391 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:19,392 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:19,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:19,393 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:19,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:19,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:19,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:19,393 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:19,393 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:19,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:19,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:19,396 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:19,396 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:19,396 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:19,396 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:19,396 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:19,396 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:19,396 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:19,396 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:19,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:19,402 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:19,402 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:19,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:19,402 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:19,403 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:19,489 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:19,490 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:19,490 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:19,490 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 02:24:19,490 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:19,490 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:19,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2365 [2022-12-13 02:24:19,490 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:24:19,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:19,490 INFO L85 PathProgramCache]: Analyzing trace with hash -883709639, now seen corresponding path program 1 times [2022-12-13 02:24:19,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:19,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092864484] [2022-12-13 02:24:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:19,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:24:19,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:19,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092864484] [2022-12-13 02:24:19,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092864484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:19,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:19,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938798643] [2022-12-13 02:24:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:19,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:19,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:19,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:19,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:19,545 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:19,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:19,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:19,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:19,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:19,622 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:19,623 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:19,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:19,624 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:19,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:19,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:19,624 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:19,624 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:19,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:19,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:19,627 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:19,627 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:19,627 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:19,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:19,627 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:19,627 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:19,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:19,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:19,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:19,633 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:19,633 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:19,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:19,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:19,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:19,723 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:19,723 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:19,723 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:19,723 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 02:24:19,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:19,723 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:19,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2366 [2022-12-13 02:24:19,723 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:24:19,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:19,724 INFO L85 PathProgramCache]: Analyzing trace with hash -855080488, now seen corresponding path program 1 times [2022-12-13 02:24:19,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:19,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841911797] [2022-12-13 02:24:19,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:19,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:24:19,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:19,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841911797] [2022-12-13 02:24:19,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841911797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:19,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:19,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:19,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226130616] [2022-12-13 02:24:19,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:19,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:19,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:19,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:19,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:19,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:19,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:19,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:19,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:19,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:19,845 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:19,845 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:19,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:19,846 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:19,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:19,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:19,846 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:19,846 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:19,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:19,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:19,849 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:19,849 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:19,849 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:19,849 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:19,849 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:19,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:19,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:19,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:19,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:19,865 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:19,865 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:19,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:19,866 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:19,866 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:19,954 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:19,954 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:24:19,954 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:19,954 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 02:24:19,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:19,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:19,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2367 [2022-12-13 02:24:19,955 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:24:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash -826451337, now seen corresponding path program 1 times [2022-12-13 02:24:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:19,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848943734] [2022-12-13 02:24:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:19,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:20,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:24:20,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:20,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848943734] [2022-12-13 02:24:20,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848943734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:20,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:20,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:20,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109241880] [2022-12-13 02:24:20,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:20,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:20,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:20,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:20,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:20,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:20,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:20,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:20,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:20,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:20,085 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:20,085 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:20,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:20,086 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:20,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:20,087 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:20,087 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:20,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:20,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:20,090 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:20,090 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:20,090 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:20,090 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:20,090 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:20,090 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:20,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:20,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:20,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:20,096 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:20,096 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:20,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:20,096 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:20,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:20,183 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:20,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:20,184 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:20,184 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 02:24:20,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:20,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:20,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2368 [2022-12-13 02:24:20,184 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:24:20,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:20,184 INFO L85 PathProgramCache]: Analyzing trace with hash -797822186, now seen corresponding path program 1 times [2022-12-13 02:24:20,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:20,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064131495] [2022-12-13 02:24:20,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:20,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:20,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:24:20,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:20,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064131495] [2022-12-13 02:24:20,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064131495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:20,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:20,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:20,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709127836] [2022-12-13 02:24:20,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:20,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:20,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:20,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:20,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:20,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:20,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:20,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:20,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:20,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:20,306 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:20,306 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:20,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:20,307 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:20,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:20,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:20,308 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:20,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:20,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:20,310 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:20,310 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:20,310 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:20,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:20,311 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:20,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:20,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:20,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:20,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:20,316 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:20,317 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:24:20,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:20,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:20,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:20,404 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:20,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:20,404 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:20,404 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 02:24:20,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:20,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:20,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2369 [2022-12-13 02:24:20,405 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:24:20,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:20,405 INFO L85 PathProgramCache]: Analyzing trace with hash -769193035, now seen corresponding path program 1 times [2022-12-13 02:24:20,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:20,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901376097] [2022-12-13 02:24:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:20,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:20,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:20,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901376097] [2022-12-13 02:24:20,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901376097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:20,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:20,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:20,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794002307] [2022-12-13 02:24:20,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:20,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:20,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:20,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:20,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:20,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:20,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:20,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:20,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:20,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:20,523 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:20,524 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:20,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:20,525 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:20,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:20,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:20,525 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:20,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:20,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:20,528 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:20,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:20,528 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:20,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:20,528 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:20,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:20,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:20,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:20,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:20,534 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:20,534 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:20,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:20,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:20,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:20,622 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:20,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:20,622 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:20,622 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 02:24:20,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:20,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:20,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2370 [2022-12-13 02:24:20,623 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:24:20,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:20,623 INFO L85 PathProgramCache]: Analyzing trace with hash -740563884, now seen corresponding path program 1 times [2022-12-13 02:24:20,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:20,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977320111] [2022-12-13 02:24:20,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:20,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:20,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:24:20,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:20,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977320111] [2022-12-13 02:24:20,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977320111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:20,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:20,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:20,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334236397] [2022-12-13 02:24:20,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:20,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:20,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:20,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:20,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:20,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:20,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:20,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:20,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:20,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:20,751 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:20,751 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:20,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:20,752 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:20,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:20,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:20,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:20,753 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:20,753 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:20,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:20,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:20,756 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:20,756 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:20,756 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:20,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:20,756 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:20,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:20,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:20,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:20,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:20,762 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:20,762 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:20,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:20,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:20,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:20,855 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:20,855 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:24:20,855 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:20,856 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 02:24:20,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:20,856 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:20,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2371 [2022-12-13 02:24:20,856 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:24:20,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:20,856 INFO L85 PathProgramCache]: Analyzing trace with hash -711934733, now seen corresponding path program 1 times [2022-12-13 02:24:20,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:20,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344217180] [2022-12-13 02:24:20,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:20,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:20,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:24:20,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:20,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344217180] [2022-12-13 02:24:20,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344217180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:20,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:20,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:20,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196585995] [2022-12-13 02:24:20,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:20,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:20,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:20,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:20,933 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:20,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:20,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:20,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:20,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:21,016 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:21,017 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:21,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:21,018 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:21,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:21,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:21,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:21,018 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:21,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:21,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:21,021 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:21,021 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:21,021 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:21,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:21,021 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:21,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:21,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:21,022 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:21,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:21,027 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:21,027 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:24:21,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:21,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:21,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:21,131 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:21,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 02:24:21,131 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:21,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:21,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:21,131 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:21,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2372 [2022-12-13 02:24:21,131 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:24:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:21,132 INFO L85 PathProgramCache]: Analyzing trace with hash -683305582, now seen corresponding path program 1 times [2022-12-13 02:24:21,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:21,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356397507] [2022-12-13 02:24:21,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:21,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:21,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:24:21,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:21,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356397507] [2022-12-13 02:24:21,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356397507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:21,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:21,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:21,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23628172] [2022-12-13 02:24:21,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:21,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:21,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:21,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:21,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:21,187 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:21,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:21,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:21,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:21,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:21,276 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:21,276 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:21,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:21,277 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:21,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:21,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:21,277 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:21,277 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:21,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:21,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:21,280 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:21,280 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:21,280 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:21,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:21,280 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:21,281 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:21,281 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:21,281 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:21,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:21,286 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:21,286 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:21,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:21,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:21,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:21,378 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:21,379 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:24:21,379 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:21,379 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 02:24:21,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:21,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:21,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2373 [2022-12-13 02:24:21,379 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:24:21,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:21,379 INFO L85 PathProgramCache]: Analyzing trace with hash -654676431, now seen corresponding path program 1 times [2022-12-13 02:24:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:21,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418818237] [2022-12-13 02:24:21,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:21,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:21,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:24:21,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:21,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418818237] [2022-12-13 02:24:21,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418818237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:21,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:21,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044186012] [2022-12-13 02:24:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:21,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:21,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:21,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:21,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:21,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:21,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:21,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:21,551 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:21,552 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:21,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:21,553 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:21,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:21,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:21,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:21,554 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:21,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:21,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:21,557 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:21,557 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:21,558 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:21,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:21,558 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:21,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:21,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:21,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:21,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:21,566 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:21,566 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:24:21,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:21,567 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:21,567 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:21,675 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:21,675 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:24:21,676 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:21,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:21,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:21,676 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:21,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2374 [2022-12-13 02:24:21,676 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:24:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:21,676 INFO L85 PathProgramCache]: Analyzing trace with hash -626047280, now seen corresponding path program 1 times [2022-12-13 02:24:21,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:21,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135086753] [2022-12-13 02:24:21,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:21,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:24:21,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:21,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135086753] [2022-12-13 02:24:21,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135086753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:21,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:21,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401115378] [2022-12-13 02:24:21,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:21,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:21,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:21,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:21,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:21,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:21,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:21,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:21,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:21,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:21,832 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:21,833 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:21,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:21,834 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:21,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:21,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:21,835 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:21,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:21,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:21,839 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:21,839 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:21,839 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:21,839 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:21,839 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:21,839 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:21,839 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:21,840 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:21,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:21,847 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:21,847 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:21,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:21,848 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:21,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:21,951 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:21,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 02:24:21,951 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:21,951 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 02:24:21,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:21,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:21,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2375 [2022-12-13 02:24:21,952 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:24:21,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:21,952 INFO L85 PathProgramCache]: Analyzing trace with hash -597418129, now seen corresponding path program 1 times [2022-12-13 02:24:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:21,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478738506] [2022-12-13 02:24:21,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:21,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:22,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:24:22,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:22,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478738506] [2022-12-13 02:24:22,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478738506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:22,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:22,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:22,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478130938] [2022-12-13 02:24:22,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:22,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:22,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:22,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:22,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:22,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:22,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:22,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:22,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:22,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:22,070 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:22,070 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:22,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:22,071 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:22,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:22,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:22,072 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:22,072 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:22,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:22,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:22,074 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,075 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:22,075 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:22,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:22,075 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,075 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:22,075 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:22,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:22,081 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:22,081 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:24:22,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:22,081 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:22,081 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:22,168 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:22,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:22,168 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:22,168 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 02:24:22,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:22,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:22,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2376 [2022-12-13 02:24:22,169 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:24:22,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:22,169 INFO L85 PathProgramCache]: Analyzing trace with hash -568788978, now seen corresponding path program 1 times [2022-12-13 02:24:22,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:22,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559012228] [2022-12-13 02:24:22,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:22,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:22,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:24:22,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:22,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559012228] [2022-12-13 02:24:22,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559012228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:22,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:22,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:22,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920168317] [2022-12-13 02:24:22,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:22,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:22,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:22,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:22,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:22,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:22,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:22,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:22,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:22,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:22,298 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:22,298 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:22,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1107 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:22,299 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:22,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:22,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:22,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:22,300 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:22,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:22,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:22,302 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,302 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:22,302 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:22,302 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:22,303 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,303 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:22,303 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:22,303 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:22,308 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:22,308 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:24:22,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:22,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:22,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:22,395 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:22,396 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:22,396 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:22,396 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 02:24:22,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:22,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:22,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2377 [2022-12-13 02:24:22,396 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:24:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash -540159827, now seen corresponding path program 1 times [2022-12-13 02:24:22,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:22,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416438165] [2022-12-13 02:24:22,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:22,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:22,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 02:24:22,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:22,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416438165] [2022-12-13 02:24:22,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416438165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:22,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:22,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:22,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674255551] [2022-12-13 02:24:22,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:22,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:22,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:22,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:22,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:22,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:22,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:22,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:22,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:22,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:22,520 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:22,521 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:22,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:22,522 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:22,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:22,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:22,522 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:22,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:22,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:22,525 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,525 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:22,525 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:22,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:22,525 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:22,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:22,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:22,531 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:22,531 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:22,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:22,531 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:22,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:22,616 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:22,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:24:22,617 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:22,617 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 02:24:22,617 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:22,617 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:22,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2378 [2022-12-13 02:24:22,617 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:24:22,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:22,617 INFO L85 PathProgramCache]: Analyzing trace with hash -511530676, now seen corresponding path program 1 times [2022-12-13 02:24:22,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:22,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553728079] [2022-12-13 02:24:22,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:22,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:22,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:24:22,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:22,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553728079] [2022-12-13 02:24:22,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553728079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:22,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:22,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:22,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222108395] [2022-12-13 02:24:22,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:22,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:22,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:22,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:22,669 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:22,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:22,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:22,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:22,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:22,744 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:22,744 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:22,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:22,746 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:22,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:22,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:22,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:22,746 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:22,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:22,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:22,749 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,749 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:22,749 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:22,749 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:22,749 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,749 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:22,749 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:22,749 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:22,755 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:22,755 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:22,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:22,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:22,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:22,842 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:22,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:22,842 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:22,842 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 02:24:22,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:22,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:22,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2379 [2022-12-13 02:24:22,843 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:24:22,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:22,843 INFO L85 PathProgramCache]: Analyzing trace with hash -482901525, now seen corresponding path program 1 times [2022-12-13 02:24:22,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:22,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448285422] [2022-12-13 02:24:22,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:22,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:22,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:24:22,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:22,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448285422] [2022-12-13 02:24:22,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448285422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:22,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:22,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:22,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832929054] [2022-12-13 02:24:22,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:22,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:22,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:22,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:22,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:22,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:22,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:22,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:22,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:22,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:22,963 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:22,963 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:22,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:22,964 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:22,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:22,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:22,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:22,965 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:22,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:22,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:22,968 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,968 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:22,968 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:22,968 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:22,968 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,968 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:22,968 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:22,968 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:22,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:22,974 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:22,974 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:24:22,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:22,974 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:22,974 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:23,060 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:23,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:23,061 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:23,061 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 02:24:23,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:23,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:23,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2380 [2022-12-13 02:24:23,061 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:24:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:23,061 INFO L85 PathProgramCache]: Analyzing trace with hash -454272374, now seen corresponding path program 1 times [2022-12-13 02:24:23,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:23,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889473566] [2022-12-13 02:24:23,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:23,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:23,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:24:23,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:23,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889473566] [2022-12-13 02:24:23,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889473566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:23,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:23,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:23,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570437056] [2022-12-13 02:24:23,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:23,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:23,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:23,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:23,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:23,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:23,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:23,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:23,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:23,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:23,192 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:23,193 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:23,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:23,194 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:23,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:23,194 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:23,194 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:23,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:23,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:23,197 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:23,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:23,197 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:23,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:23,197 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:23,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:23,197 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:23,197 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:23,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:23,203 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:23,203 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:23,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:23,203 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:23,203 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:23,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:23,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:23,291 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:23,291 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 02:24:23,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:23,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:23,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2381 [2022-12-13 02:24:23,291 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:24:23,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash -425643223, now seen corresponding path program 1 times [2022-12-13 02:24:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:23,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494855785] [2022-12-13 02:24:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:23,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:23,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:24:23,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:23,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494855785] [2022-12-13 02:24:23,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494855785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:23,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:23,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:23,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700571846] [2022-12-13 02:24:23,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:23,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:23,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:23,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:23,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:23,346 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:23,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:23,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:23,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:23,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:23,423 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:23,423 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:23,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:23,424 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:23,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:23,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:23,425 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:23,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:23,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:23,427 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:23,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:23,428 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:23,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:23,428 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:23,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:23,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:23,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:23,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:23,433 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:23,434 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:24:23,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:23,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:23,434 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:23,522 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:23,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:23,522 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:23,523 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 02:24:23,523 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:23,523 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:23,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2382 [2022-12-13 02:24:23,523 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:24:23,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:23,523 INFO L85 PathProgramCache]: Analyzing trace with hash -397014072, now seen corresponding path program 1 times [2022-12-13 02:24:23,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:23,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957273352] [2022-12-13 02:24:23,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:23,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:23,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:24:23,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:23,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957273352] [2022-12-13 02:24:23,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957273352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:23,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:23,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:23,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466730888] [2022-12-13 02:24:23,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:23,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:23,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:23,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:23,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:23,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:23,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:23,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:23,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:23,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:23,658 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:23,659 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:23,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:23,660 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:23,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:23,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:23,660 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:23,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:23,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:23,663 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:23,663 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:23,663 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:23,663 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:23,663 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:23,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:23,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:23,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:23,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:23,669 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:23,669 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:24:23,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:23,669 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:23,669 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:23,758 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:23,758 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:23,758 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:23,758 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 02:24:23,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:23,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:23,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2383 [2022-12-13 02:24:23,758 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:24:23,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:23,759 INFO L85 PathProgramCache]: Analyzing trace with hash -368384921, now seen corresponding path program 1 times [2022-12-13 02:24:23,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:23,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767783937] [2022-12-13 02:24:23,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:23,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:23,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:24:23,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:23,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767783937] [2022-12-13 02:24:23,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767783937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:23,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:23,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:23,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78803825] [2022-12-13 02:24:23,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:23,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:23,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:23,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:23,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:23,814 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:23,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:23,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:23,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:23,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:23,880 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:23,881 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:23,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:23,882 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:23,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:23,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:23,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:23,882 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:23,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:23,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:23,885 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:23,885 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:23,885 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:23,885 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:23,885 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:23,885 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:23,885 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:23,885 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:23,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:23,891 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:23,891 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:23,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:23,892 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:23,892 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:23,978 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:23,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:23,979 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:23,979 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 02:24:23,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:23,979 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:23,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2384 [2022-12-13 02:24:23,979 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:24:23,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:23,979 INFO L85 PathProgramCache]: Analyzing trace with hash -339755770, now seen corresponding path program 1 times [2022-12-13 02:24:23,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:23,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462184449] [2022-12-13 02:24:23,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:23,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:24,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:24:24,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:24,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462184449] [2022-12-13 02:24:24,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462184449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:24,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:24,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:24,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363527151] [2022-12-13 02:24:24,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:24,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:24,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:24,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:24,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:24,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:24,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:24,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:24,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:24,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:24,107 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:24,107 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:24,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:24,108 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:24,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:24,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:24,109 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:24,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:24,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:24,112 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:24,112 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:24,112 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:24,112 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:24,112 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:24,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:24,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:24,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:24,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:24,118 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:24,118 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:24,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:24,118 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:24,118 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:24,207 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:24,207 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:24,207 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:24,208 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 02:24:24,208 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:24,208 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:24,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2385 [2022-12-13 02:24:24,208 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:24:24,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:24,208 INFO L85 PathProgramCache]: Analyzing trace with hash -311126619, now seen corresponding path program 1 times [2022-12-13 02:24:24,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:24,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706955879] [2022-12-13 02:24:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:24,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:24,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:24:24,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:24,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706955879] [2022-12-13 02:24:24,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706955879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:24,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:24,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:24,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204103859] [2022-12-13 02:24:24,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:24,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:24,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:24,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:24,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:24,263 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:24,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:24,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:24,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:24,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:24,339 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:24,339 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:24,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:24,340 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:24,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:24,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:24,341 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:24,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:24,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:24,343 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:24,344 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:24,344 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:24,344 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:24,344 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:24,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:24,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:24,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:24,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:24,350 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:24,350 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:24,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:24,350 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:24,350 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:24,437 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:24,438 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:24,438 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:24,438 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 02:24:24,438 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:24,438 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:24,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2386 [2022-12-13 02:24:24,438 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:24:24,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash -282497468, now seen corresponding path program 1 times [2022-12-13 02:24:24,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:24,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641799822] [2022-12-13 02:24:24,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:24,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:24,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:24:24,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:24,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641799822] [2022-12-13 02:24:24,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641799822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:24,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:24,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:24,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115833155] [2022-12-13 02:24:24,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:24,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:24,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:24,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:24,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:24,510 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:24,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:24,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:24,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:24,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:24,585 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:24,585 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:24,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:24,586 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:24,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:24,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:24,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:24,587 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:24,587 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:24,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:24,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:24,590 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:24,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:24,590 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:24,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:24,590 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:24,590 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:24,590 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:24,590 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:24,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:24,596 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:24,596 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:24,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:24,597 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:24,597 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:24,684 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:24,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:24,684 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:24,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:24,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:24,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:24,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2387 [2022-12-13 02:24:24,684 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:24:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash -253868317, now seen corresponding path program 1 times [2022-12-13 02:24:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:24,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123004818] [2022-12-13 02:24:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:24,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:24:24,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:24,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123004818] [2022-12-13 02:24:24,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123004818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:24,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:24,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:24,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006888957] [2022-12-13 02:24:24,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:24,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:24,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:24,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:24,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:24,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:24,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:24,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:24,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:24,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:24,829 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:24,829 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:24,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:24,830 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:24,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:24,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:24,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:24,831 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:24,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:24,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:24,833 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:24,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:24,834 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:24,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:24,834 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:24,834 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:24,834 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:24,834 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:24,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:24,840 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:24,840 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:24,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:24,840 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:24,840 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:24,926 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:24,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:24,927 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:24,927 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 02:24:24,927 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:24,927 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:24,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2388 [2022-12-13 02:24:24,927 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:24:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash -225239166, now seen corresponding path program 1 times [2022-12-13 02:24:24,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:24,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465629497] [2022-12-13 02:24:24,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:24,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:24,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:24:24,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:24,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465629497] [2022-12-13 02:24:24,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465629497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:24,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:24,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:24,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690250804] [2022-12-13 02:24:24,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:24,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:24,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:24,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:24,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:24,995 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:24,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:24,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:24,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:24,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:25,080 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:25,080 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:25,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:25,081 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:25,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:25,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:25,082 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:25,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:25,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:25,085 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:25,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:25,085 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:25,085 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:25,085 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:25,086 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:25,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:25,086 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:25,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:25,093 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:25,093 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:25,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:25,094 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:25,094 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:25,186 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:25,187 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:24:25,187 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:25,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:25,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:25,187 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:25,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2389 [2022-12-13 02:24:25,187 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:24:25,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash -196610015, now seen corresponding path program 1 times [2022-12-13 02:24:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:25,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260307131] [2022-12-13 02:24:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:25,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:25,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 02:24:25,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:25,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260307131] [2022-12-13 02:24:25,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260307131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:25,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:25,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:25,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196806910] [2022-12-13 02:24:25,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:25,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:25,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:25,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:25,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:25,243 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:25,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:25,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:25,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:25,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:25,308 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:25,308 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:25,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:25,309 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:25,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:25,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:25,310 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:25,310 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:25,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:25,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:25,312 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:25,312 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:25,313 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:25,313 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:25,313 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:25,313 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:25,313 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:25,313 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:25,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:25,318 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:25,318 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:25,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:25,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:25,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:25,407 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:25,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:25,408 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:25,408 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 02:24:25,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:25,408 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:25,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2390 [2022-12-13 02:24:25,408 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:24:25,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:25,408 INFO L85 PathProgramCache]: Analyzing trace with hash -167980864, now seen corresponding path program 1 times [2022-12-13 02:24:25,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:25,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222600702] [2022-12-13 02:24:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:25,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:25,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:24:25,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:25,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222600702] [2022-12-13 02:24:25,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222600702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:25,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:25,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:25,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938917383] [2022-12-13 02:24:25,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:25,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:25,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:25,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:25,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:25,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:25,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:25,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:25,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:25,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:25,540 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:25,540 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:25,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:25,541 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:25,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:25,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:25,542 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:25,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:25,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:25,544 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:25,544 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:25,545 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:25,545 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:25,545 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:25,545 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:25,545 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:25,545 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:25,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:25,551 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:25,551 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:25,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:25,551 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:25,551 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:25,640 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:25,640 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:25,640 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:25,640 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 02:24:25,640 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:25,640 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:25,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2391 [2022-12-13 02:24:25,640 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:24:25,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:25,641 INFO L85 PathProgramCache]: Analyzing trace with hash -139351713, now seen corresponding path program 1 times [2022-12-13 02:24:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:25,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205257413] [2022-12-13 02:24:25,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:25,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:24:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:25,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205257413] [2022-12-13 02:24:25,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205257413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:25,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:25,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80933793] [2022-12-13 02:24:25,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:25,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:25,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:25,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:25,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:25,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:25,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:25,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:25,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:25,763 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:25,763 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:25,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:25,764 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:25,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:25,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:25,764 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:25,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:25,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:25,767 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:25,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:25,767 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:25,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:25,767 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:25,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:25,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:25,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:25,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:25,773 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:25,773 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:25,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:25,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:25,774 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:25,861 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:25,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:25,862 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:25,862 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 02:24:25,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:25,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:25,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2392 [2022-12-13 02:24:25,862 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:24:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:25,862 INFO L85 PathProgramCache]: Analyzing trace with hash -110722562, now seen corresponding path program 1 times [2022-12-13 02:24:25,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:25,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718432368] [2022-12-13 02:24:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:25,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:25,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:24:25,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:25,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718432368] [2022-12-13 02:24:25,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718432368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:25,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:25,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:25,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423899993] [2022-12-13 02:24:25,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:25,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:25,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:25,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:25,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:25,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:25,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:25,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:25,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:25,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:26,004 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:26,004 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:26,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:26,005 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:26,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:26,005 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:26,006 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:26,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:26,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:26,008 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,008 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:26,008 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:26,008 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:26,008 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,008 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:26,009 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:26,009 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:26,014 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:26,014 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:26,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:26,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:26,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:26,103 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:26,104 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:26,104 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:26,104 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 02:24:26,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:26,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:26,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2393 [2022-12-13 02:24:26,104 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:24:26,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:26,104 INFO L85 PathProgramCache]: Analyzing trace with hash -82093411, now seen corresponding path program 1 times [2022-12-13 02:24:26,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:26,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641376279] [2022-12-13 02:24:26,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:26,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:26,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:24:26,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:26,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641376279] [2022-12-13 02:24:26,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641376279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:26,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:26,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:26,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663991730] [2022-12-13 02:24:26,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:26,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:26,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:26,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:26,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:26,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:26,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:26,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:26,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:26,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:26,226 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:26,227 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:26,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:26,228 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:26,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:26,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:26,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:26,228 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:26,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:26,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:26,231 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:26,231 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:26,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:26,231 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,231 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:26,231 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:26,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:26,238 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:26,238 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:24:26,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:26,239 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:26,239 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:26,326 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:26,327 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:26,327 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:26,327 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 02:24:26,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:26,327 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:26,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2394 [2022-12-13 02:24:26,327 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:24:26,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash -53464260, now seen corresponding path program 1 times [2022-12-13 02:24:26,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:26,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339628833] [2022-12-13 02:24:26,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:26,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:26,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:24:26,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:26,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339628833] [2022-12-13 02:24:26,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339628833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:26,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:26,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:26,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548159189] [2022-12-13 02:24:26,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:26,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:26,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:26,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:26,381 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:26,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:26,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:26,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:26,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:26,448 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:26,448 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:26,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:26,449 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:26,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:26,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:26,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:26,450 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:26,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:26,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:26,452 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:26,452 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:26,452 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:26,453 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:26,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:26,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:26,458 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:26,459 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:26,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:26,459 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:26,459 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:26,548 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:26,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:26,548 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:26,549 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 02:24:26,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:26,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:26,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2395 [2022-12-13 02:24:26,549 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:24:26,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:26,549 INFO L85 PathProgramCache]: Analyzing trace with hash -24835109, now seen corresponding path program 1 times [2022-12-13 02:24:26,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:26,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53598791] [2022-12-13 02:24:26,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:26,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:26,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:24:26,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:26,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53598791] [2022-12-13 02:24:26,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53598791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:26,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:26,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:26,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894586690] [2022-12-13 02:24:26,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:26,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:26,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:26,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:26,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:26,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:26,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:26,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:26,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:26,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:26,681 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:26,681 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:26,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:26,682 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:26,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:26,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:26,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:26,682 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:26,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:26,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:26,685 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,685 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:26,685 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:26,685 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:26,685 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,686 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:26,686 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:26,686 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:26,691 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:26,691 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:26,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:26,692 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:26,692 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:26,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:26,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:26,780 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:26,780 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 02:24:26,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:26,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:26,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2396 [2022-12-13 02:24:26,781 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:24:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash 3794042, now seen corresponding path program 1 times [2022-12-13 02:24:26,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:26,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671582260] [2022-12-13 02:24:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:26,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:26,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:24:26,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:26,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671582260] [2022-12-13 02:24:26,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671582260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:26,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:26,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:26,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989824788] [2022-12-13 02:24:26,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:26,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:26,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:26,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:26,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:26,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:26,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:26,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:26,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:26,901 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:26,901 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:26,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:26,902 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:26,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:26,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:26,903 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:26,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:26,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:26,905 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,906 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:26,906 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:26,906 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:26,906 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,906 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:26,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:26,906 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:26,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:26,912 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:26,912 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:26,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:26,912 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:26,913 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:27,000 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:27,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:27,001 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:27,001 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 02:24:27,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:27,001 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:27,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2397 [2022-12-13 02:24:27,001 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:24:27,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash 32423193, now seen corresponding path program 1 times [2022-12-13 02:24:27,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:27,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265202271] [2022-12-13 02:24:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:27,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:24:27,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:27,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265202271] [2022-12-13 02:24:27,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265202271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:27,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:27,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:27,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161587969] [2022-12-13 02:24:27,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:27,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:27,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:27,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:27,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:27,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:27,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:27,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:27,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:27,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:27,179 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:27,180 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:27,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:27,181 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:27,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:27,181 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:27,181 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:27,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:27,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:27,184 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:27,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:27,184 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:27,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:27,184 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:27,184 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:27,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:27,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:27,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:27,190 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:27,190 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:27,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:27,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:27,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:27,279 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:27,279 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:27,279 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:27,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:27,279 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:27,279 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:27,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2398 [2022-12-13 02:24:27,279 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:24:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash 61052344, now seen corresponding path program 1 times [2022-12-13 02:24:27,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:27,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513233981] [2022-12-13 02:24:27,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:27,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:27,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:24:27,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:27,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513233981] [2022-12-13 02:24:27,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513233981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:27,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:27,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:27,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099752536] [2022-12-13 02:24:27,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:27,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:27,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:27,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:27,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:27,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:27,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:27,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:27,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:27,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:27,401 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:27,401 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:27,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:27,402 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:27,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:27,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:27,403 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:27,403 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:27,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:27,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:27,405 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:27,406 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:27,406 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:27,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:27,406 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:27,406 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:27,406 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:27,406 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:27,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:27,412 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:27,412 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:27,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:27,412 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:27,412 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:27,499 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:27,500 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:27,500 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:27,500 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 02:24:27,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:27,500 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:27,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2399 [2022-12-13 02:24:27,500 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:24:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:27,500 INFO L85 PathProgramCache]: Analyzing trace with hash 89681495, now seen corresponding path program 1 times [2022-12-13 02:24:27,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:27,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892414832] [2022-12-13 02:24:27,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:27,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:27,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:24:27,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:27,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892414832] [2022-12-13 02:24:27,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892414832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:27,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:27,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:27,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221174811] [2022-12-13 02:24:27,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:27,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:27,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:27,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:27,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:27,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:27,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:27,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:27,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:27,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:27,622 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:27,622 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:27,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:27,623 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:27,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:27,623 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:27,624 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:27,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:27,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:27,626 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:27,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:27,626 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:27,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:27,627 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:27,627 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:27,627 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:27,627 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:27,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:27,632 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:27,632 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:27,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:27,633 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:27,633 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:27,719 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:27,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:27,720 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:27,720 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 02:24:27,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:27,720 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:27,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2400 [2022-12-13 02:24:27,720 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:24:27,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash 118310646, now seen corresponding path program 1 times [2022-12-13 02:24:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:27,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495818658] [2022-12-13 02:24:27,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:27,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:27,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:24:27,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:27,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495818658] [2022-12-13 02:24:27,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495818658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:27,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:27,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:27,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758215115] [2022-12-13 02:24:27,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:27,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:27,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:27,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:27,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:27,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:27,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:27,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:27,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:27,839 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:27,839 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:27,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:27,840 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:27,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:27,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:27,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:27,841 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:27,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:27,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:27,843 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:27,843 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:27,843 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:27,844 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:27,844 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:27,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:27,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:27,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:27,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:27,849 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:27,850 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:27,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:27,850 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:27,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:27,937 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:27,937 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:27,937 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:27,937 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 02:24:27,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:27,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:27,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2401 [2022-12-13 02:24:27,938 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:24:27,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:27,938 INFO L85 PathProgramCache]: Analyzing trace with hash 146939797, now seen corresponding path program 1 times [2022-12-13 02:24:27,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:27,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101110454] [2022-12-13 02:24:27,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:27,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:27,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:24:27,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:27,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101110454] [2022-12-13 02:24:27,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101110454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:27,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:27,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:27,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519600556] [2022-12-13 02:24:27,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:27,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:27,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:27,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:27,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:27,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:27,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:28,056 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:28,056 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:28,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:28,058 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:28,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:28,058 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:28,058 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:28,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:28,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:28,061 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,061 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:28,061 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:28,061 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:28,061 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,061 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:28,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:28,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:28,067 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:28,067 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:28,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:28,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:28,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:28,157 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:28,157 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:28,158 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:28,158 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 02:24:28,158 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:28,158 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:28,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2402 [2022-12-13 02:24:28,158 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:24:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:28,158 INFO L85 PathProgramCache]: Analyzing trace with hash 175568948, now seen corresponding path program 1 times [2022-12-13 02:24:28,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:28,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383067164] [2022-12-13 02:24:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:28,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:28,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:24:28,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:28,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383067164] [2022-12-13 02:24:28,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383067164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:28,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:28,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:28,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107346930] [2022-12-13 02:24:28,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:28,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:28,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:28,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:28,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:28,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:28,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:28,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:28,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:28,298 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:28,298 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:28,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:28,299 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:28,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:28,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:28,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:28,300 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:28,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:28,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:28,302 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,302 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:28,302 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:28,302 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:28,302 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,303 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:28,303 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:28,303 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:28,308 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:28,308 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:28,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:28,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:28,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:28,395 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:28,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:28,395 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:28,395 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 02:24:28,395 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:28,395 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:28,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2403 [2022-12-13 02:24:28,395 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:24:28,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash 204198099, now seen corresponding path program 1 times [2022-12-13 02:24:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:28,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884890831] [2022-12-13 02:24:28,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:28,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:28,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:24:28,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:28,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884890831] [2022-12-13 02:24:28,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884890831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:28,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:28,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:28,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903314621] [2022-12-13 02:24:28,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:28,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:28,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:28,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:28,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:28,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:28,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:28,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:28,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:28,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:28,524 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:28,524 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:28,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:28,526 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:28,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:28,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:28,526 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:28,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:28,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:28,529 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:28,529 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:28,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:28,529 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:28,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:28,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:28,535 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:28,535 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:28,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:28,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:28,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:28,622 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:28,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:28,622 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:28,622 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 02:24:28,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:28,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:28,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2404 [2022-12-13 02:24:28,623 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:24:28,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:28,623 INFO L85 PathProgramCache]: Analyzing trace with hash 232827250, now seen corresponding path program 1 times [2022-12-13 02:24:28,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:28,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740827935] [2022-12-13 02:24:28,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:28,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:28,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:24:28,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:28,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740827935] [2022-12-13 02:24:28,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740827935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:28,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:28,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233920838] [2022-12-13 02:24:28,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:28,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:28,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:28,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:28,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:28,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:28,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:28,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:28,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:28,748 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:28,748 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:28,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:28,749 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:28,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:28,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:28,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:28,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:28,750 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:28,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:28,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:28,752 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,752 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:28,752 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:28,752 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:28,752 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:28,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:28,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:28,758 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:28,758 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:28,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:28,759 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:28,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:28,844 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:28,844 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:24:28,844 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:28,844 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 02:24:28,844 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:28,844 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:28,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2405 [2022-12-13 02:24:28,845 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:24:28,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:28,845 INFO L85 PathProgramCache]: Analyzing trace with hash 261456401, now seen corresponding path program 1 times [2022-12-13 02:24:28,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:28,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018443116] [2022-12-13 02:24:28,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:28,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:28,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:28,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018443116] [2022-12-13 02:24:28,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018443116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:28,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:28,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:28,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326174882] [2022-12-13 02:24:28,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:28,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:28,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:28,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:28,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:28,915 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:28,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:28,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:28,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:28,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:28,991 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:28,991 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:28,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:28,992 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:28,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:28,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:28,992 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:28,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:28,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:28,995 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,995 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:28,995 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:28,995 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:28,995 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:28,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:28,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:28,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:29,001 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:29,001 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:29,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:29,002 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:29,002 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:29,087 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:29,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:24:29,087 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:29,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:29,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:29,087 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:29,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2406 [2022-12-13 02:24:29,088 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:24:29,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:29,088 INFO L85 PathProgramCache]: Analyzing trace with hash 290085552, now seen corresponding path program 1 times [2022-12-13 02:24:29,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:29,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160509686] [2022-12-13 02:24:29,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:29,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:29,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:24:29,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:29,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160509686] [2022-12-13 02:24:29,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160509686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:29,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:29,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:29,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956832019] [2022-12-13 02:24:29,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:29,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:29,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:29,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:29,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:29,140 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:29,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:29,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:29,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:29,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:29,205 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:29,205 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:29,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:29,206 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:29,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:29,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:29,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:29,207 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:29,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:29,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:29,209 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:29,209 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:29,210 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:29,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:29,210 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:29,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:29,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:29,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:29,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:29,216 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:29,216 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:29,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:29,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:29,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:29,303 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:29,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:29,303 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:29,303 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 02:24:29,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:29,303 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:29,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2407 [2022-12-13 02:24:29,304 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:24:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash 318714703, now seen corresponding path program 1 times [2022-12-13 02:24:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:29,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970455230] [2022-12-13 02:24:29,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:29,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:24:29,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:29,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970455230] [2022-12-13 02:24:29,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970455230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:29,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:29,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:29,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809234534] [2022-12-13 02:24:29,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:29,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:29,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:29,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:29,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:29,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:29,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:29,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:29,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:29,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:29,422 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:29,422 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:29,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:29,423 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:29,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:29,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:29,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:29,424 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:29,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:29,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:29,426 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:29,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:29,426 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:29,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:29,427 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:29,427 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:29,427 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:29,427 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:29,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:29,442 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:29,443 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:29,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:29,443 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:29,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:29,530 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:29,530 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:24:29,530 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:29,530 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 02:24:29,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:29,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:29,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2408 [2022-12-13 02:24:29,530 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:24:29,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:29,531 INFO L85 PathProgramCache]: Analyzing trace with hash 347343854, now seen corresponding path program 1 times [2022-12-13 02:24:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:29,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663690686] [2022-12-13 02:24:29,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:29,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 02:24:29,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:29,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663690686] [2022-12-13 02:24:29,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663690686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:29,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:29,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:29,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820487848] [2022-12-13 02:24:29,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:29,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:29,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:29,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:29,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:29,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:29,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:29,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:29,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:29,650 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:29,650 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:29,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:29,651 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:29,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:29,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:29,652 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:29,652 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:29,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:29,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:29,655 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:29,655 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:29,655 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:29,655 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:29,655 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:29,655 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:29,655 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:29,655 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:29,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:29,661 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:29,661 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:29,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:29,662 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:29,662 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:29,747 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:29,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:24:29,747 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:29,747 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 02:24:29,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:29,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:29,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2409 [2022-12-13 02:24:29,748 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:24:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:29,748 INFO L85 PathProgramCache]: Analyzing trace with hash 375973005, now seen corresponding path program 1 times [2022-12-13 02:24:29,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:29,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513546577] [2022-12-13 02:24:29,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:29,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:24:29,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:29,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513546577] [2022-12-13 02:24:29,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513546577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:29,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:29,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:29,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824873109] [2022-12-13 02:24:29,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:29,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:29,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:29,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:29,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:29,798 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:29,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:29,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:29,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:29,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:29,863 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:29,863 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:29,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:29,864 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:29,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:29,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:29,865 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:29,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:29,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:29,867 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:29,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:29,867 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:29,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:29,867 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:29,868 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:29,868 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:29,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:29,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:29,873 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:29,873 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:29,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:29,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:29,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:29,960 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:29,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:29,961 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:29,961 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 02:24:29,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:29,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:29,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2410 [2022-12-13 02:24:29,961 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:24:29,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash 404602156, now seen corresponding path program 1 times [2022-12-13 02:24:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:29,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867710733] [2022-12-13 02:24:29,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:30,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:24:30,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:30,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867710733] [2022-12-13 02:24:30,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867710733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:30,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:30,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:30,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948883138] [2022-12-13 02:24:30,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:30,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:30,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:30,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:30,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:30,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:30,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:30,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:30,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:30,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:30,088 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:30,088 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:30,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:30,090 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:30,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:30,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:30,090 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:30,090 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:30,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:30,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:30,093 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:30,093 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:30,093 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:30,093 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,093 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:30,093 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:30,094 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:30,099 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:30,099 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:30,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:30,100 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:30,100 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:30,187 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:30,187 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:30,187 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:30,187 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 02:24:30,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:30,187 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:30,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2411 [2022-12-13 02:24:30,188 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:24:30,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:30,188 INFO L85 PathProgramCache]: Analyzing trace with hash 433231307, now seen corresponding path program 1 times [2022-12-13 02:24:30,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:30,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332180437] [2022-12-13 02:24:30,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:30,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:30,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:24:30,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:30,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332180437] [2022-12-13 02:24:30,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332180437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:30,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:30,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:30,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940316856] [2022-12-13 02:24:30,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:30,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:30,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:30,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:30,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:30,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:30,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:30,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:30,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:30,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:30,314 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:30,314 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:30,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:30,316 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:30,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:30,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:30,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:30,316 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:30,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:30,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:30,319 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,319 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:30,319 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:30,319 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:30,319 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,320 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:30,320 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:30,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:30,326 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:30,326 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:30,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:30,326 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:30,326 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:30,413 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:30,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:30,414 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:30,414 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 02:24:30,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:30,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:30,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2412 [2022-12-13 02:24:30,414 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:24:30,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:30,414 INFO L85 PathProgramCache]: Analyzing trace with hash 461860458, now seen corresponding path program 1 times [2022-12-13 02:24:30,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:30,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478051890] [2022-12-13 02:24:30,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:30,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:30,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:24:30,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:30,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478051890] [2022-12-13 02:24:30,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478051890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:30,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:30,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:30,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699462550] [2022-12-13 02:24:30,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:30,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:30,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:30,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:30,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:30,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:30,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:30,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:30,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:30,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:30,538 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:30,538 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:30,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:30,539 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:30,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:30,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:30,540 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:30,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:30,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:30,542 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:30,542 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:30,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:30,542 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:30,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:30,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:30,548 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:30,548 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:24:30,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:30,549 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:30,549 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:30,635 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:30,635 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:30,635 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:30,635 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 02:24:30,636 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:30,636 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:30,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2413 [2022-12-13 02:24:30,636 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:24:30,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:30,636 INFO L85 PathProgramCache]: Analyzing trace with hash 490489609, now seen corresponding path program 1 times [2022-12-13 02:24:30,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:30,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422910085] [2022-12-13 02:24:30,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:30,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:30,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:24:30,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:30,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422910085] [2022-12-13 02:24:30,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422910085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:30,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:30,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:30,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913845251] [2022-12-13 02:24:30,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:30,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:30,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:30,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:30,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:30,700 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:30,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:30,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:30,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:30,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:30,766 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:30,766 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:30,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:30,767 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:30,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:30,768 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:30,768 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:30,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:30,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:30,770 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,770 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:30,771 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:30,771 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:30,771 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,771 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:30,771 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:30,771 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:30,776 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:30,777 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:30,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:30,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:30,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:30,865 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:30,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:30,865 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:30,865 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 02:24:30,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:30,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:30,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2414 [2022-12-13 02:24:30,865 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:24:30,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:30,866 INFO L85 PathProgramCache]: Analyzing trace with hash 519118760, now seen corresponding path program 1 times [2022-12-13 02:24:30,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:30,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657219877] [2022-12-13 02:24:30,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:30,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:30,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:24:30,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:30,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657219877] [2022-12-13 02:24:30,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657219877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:30,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:30,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:30,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417873996] [2022-12-13 02:24:30,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:30,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:30,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:30,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:30,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:30,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:30,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:30,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:30,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:30,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:30,985 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:30,985 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:30,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:30,986 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:30,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:30,987 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:30,987 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:30,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:30,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:30,989 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,989 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:30,990 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:30,990 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:30,990 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,990 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:30,990 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:30,990 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:30,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:30,996 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:30,996 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:30,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:30,996 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:30,996 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:31,083 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:31,083 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:31,084 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:31,084 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 02:24:31,084 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:31,084 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:31,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2415 [2022-12-13 02:24:31,084 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:24:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:31,084 INFO L85 PathProgramCache]: Analyzing trace with hash 547747911, now seen corresponding path program 1 times [2022-12-13 02:24:31,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:31,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339212918] [2022-12-13 02:24:31,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:31,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:31,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:31,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339212918] [2022-12-13 02:24:31,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339212918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:31,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:31,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:31,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451469663] [2022-12-13 02:24:31,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:31,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:31,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:31,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:31,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:31,138 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:31,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:31,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:31,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:31,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:31,204 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:31,204 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:31,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:31,206 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:31,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:31,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:31,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:31,206 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:31,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:31,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:31,209 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:31,209 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:31,209 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:31,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:31,209 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:31,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:31,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:31,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:31,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:31,215 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:31,215 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:31,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:31,215 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:31,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:31,304 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:31,305 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:31,305 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:31,305 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 02:24:31,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:31,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:31,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2416 [2022-12-13 02:24:31,305 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:24:31,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:31,305 INFO L85 PathProgramCache]: Analyzing trace with hash 576377062, now seen corresponding path program 1 times [2022-12-13 02:24:31,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:31,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409665] [2022-12-13 02:24:31,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:31,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:31,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:24:31,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:31,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409665] [2022-12-13 02:24:31,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:31,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:31,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:31,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814617126] [2022-12-13 02:24:31,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:31,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:31,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:31,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:31,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:31,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:31,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:31,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:31,422 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:31,423 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:31,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:31,424 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:31,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:31,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:31,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:31,424 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:31,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:31,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:31,427 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:31,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:31,427 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:31,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:31,427 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:31,427 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:31,427 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:31,427 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:31,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:31,433 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:31,433 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:31,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:31,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:31,434 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:31,522 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:31,523 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:31,523 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:31,523 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 02:24:31,523 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:31,523 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:31,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2417 [2022-12-13 02:24:31,523 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:24:31,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:31,523 INFO L85 PathProgramCache]: Analyzing trace with hash 605006213, now seen corresponding path program 1 times [2022-12-13 02:24:31,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:31,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508933917] [2022-12-13 02:24:31,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:31,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:31,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:24:31,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:31,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508933917] [2022-12-13 02:24:31,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508933917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:31,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:31,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:31,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002429113] [2022-12-13 02:24:31,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:31,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:31,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:31,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:31,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:31,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:31,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:31,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:31,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:31,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:31,645 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:31,646 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:31,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:31,647 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:31,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:31,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:31,647 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:31,647 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:31,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:31,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:31,652 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:31,652 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:31,653 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:31,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:31,653 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:31,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:31,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:31,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:31,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:31,659 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:31,659 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:31,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:31,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:31,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:31,749 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:31,750 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:24:31,750 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:31,750 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 02:24:31,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:31,750 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:31,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2418 [2022-12-13 02:24:31,750 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:24:31,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:31,750 INFO L85 PathProgramCache]: Analyzing trace with hash 633635364, now seen corresponding path program 1 times [2022-12-13 02:24:31,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:31,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306040628] [2022-12-13 02:24:31,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:31,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:31,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:24:31,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:31,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306040628] [2022-12-13 02:24:31,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306040628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:31,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:31,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:31,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138539006] [2022-12-13 02:24:31,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:31,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:31,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:31,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:31,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:31,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:31,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:31,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:31,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:31,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:31,912 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:31,912 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:31,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:31,913 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:31,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:31,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:31,914 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:31,914 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:31,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:31,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:31,916 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:31,916 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:31,917 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:31,917 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:31,917 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:31,917 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:31,917 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:31,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:31,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:31,923 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:31,923 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:31,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:31,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:31,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:32,011 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:32,011 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:32,011 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:32,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:32,011 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:32,011 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:32,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2419 [2022-12-13 02:24:32,012 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:24:32,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:32,012 INFO L85 PathProgramCache]: Analyzing trace with hash 662264515, now seen corresponding path program 1 times [2022-12-13 02:24:32,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:32,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668960515] [2022-12-13 02:24:32,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:32,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:32,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:24:32,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:32,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668960515] [2022-12-13 02:24:32,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668960515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:32,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:32,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:32,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428647736] [2022-12-13 02:24:32,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:32,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:32,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:32,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:32,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:32,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:32,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:32,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:32,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:32,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:32,144 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:32,145 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:32,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:32,146 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:32,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:32,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:32,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:32,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:32,147 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:32,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:32,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:32,149 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:32,149 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:32,149 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:32,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:32,150 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:32,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:32,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:32,150 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:32,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:32,155 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:32,155 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:32,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:32,156 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:32,156 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:32,245 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:32,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:32,245 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:32,245 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 02:24:32,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:32,245 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:32,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2420 [2022-12-13 02:24:32,245 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:24:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:32,246 INFO L85 PathProgramCache]: Analyzing trace with hash 690893666, now seen corresponding path program 1 times [2022-12-13 02:24:32,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:32,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915143952] [2022-12-13 02:24:32,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:32,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:32,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:24:32,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:32,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915143952] [2022-12-13 02:24:32,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915143952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:32,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:32,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:32,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024302189] [2022-12-13 02:24:32,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:32,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:32,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:32,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:32,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:32,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:32,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:32,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:32,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:32,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:32,402 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:32,402 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:32,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:32,403 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:32,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:32,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:32,404 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:32,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:32,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:32,407 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:32,407 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:32,407 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:32,407 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:32,407 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:32,407 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:32,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:32,407 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:32,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:32,413 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:32,413 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:32,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:32,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:32,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:32,502 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:32,503 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:32,503 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:32,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:32,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:32,503 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:32,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2421 [2022-12-13 02:24:32,503 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:24:32,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:32,503 INFO L85 PathProgramCache]: Analyzing trace with hash 719522817, now seen corresponding path program 1 times [2022-12-13 02:24:32,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:32,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973835210] [2022-12-13 02:24:32,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:32,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:32,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:24:32,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:32,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973835210] [2022-12-13 02:24:32,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973835210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:32,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:32,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:32,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854103825] [2022-12-13 02:24:32,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:32,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:32,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:32,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:32,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:32,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:32,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:32,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:32,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:32,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:32,624 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:32,624 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:32,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:32,625 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:32,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:32,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:32,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:32,626 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:32,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:32,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:32,628 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:32,628 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:32,628 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:32,628 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:32,629 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:32,629 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:32,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:32,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:32,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:32,634 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:32,635 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:32,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:32,635 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:32,635 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:32,723 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:32,724 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:32,724 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:32,724 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 02:24:32,724 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:32,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:32,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2422 [2022-12-13 02:24:32,724 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:24:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:32,724 INFO L85 PathProgramCache]: Analyzing trace with hash 748151968, now seen corresponding path program 1 times [2022-12-13 02:24:32,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:32,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042906826] [2022-12-13 02:24:32,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:32,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:32,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:24:32,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:32,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042906826] [2022-12-13 02:24:32,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042906826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:32,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:32,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:32,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475122189] [2022-12-13 02:24:32,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:32,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:32,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:32,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:32,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:32,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:32,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:32,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:32,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:32,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:32,854 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:32,854 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:32,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:32,855 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:32,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:32,855 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:32,855 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:32,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:32,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:32,858 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:32,858 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:32,858 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:32,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:32,858 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:32,858 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:32,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:32,858 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:32,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:32,864 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:32,864 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:32,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:32,865 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:32,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:32,951 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:32,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:32,952 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:32,952 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 02:24:32,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:32,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:32,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2423 [2022-12-13 02:24:32,952 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:24:32,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:32,952 INFO L85 PathProgramCache]: Analyzing trace with hash 776781119, now seen corresponding path program 1 times [2022-12-13 02:24:32,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:32,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956263874] [2022-12-13 02:24:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:32,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:33,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:24:33,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:33,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956263874] [2022-12-13 02:24:33,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956263874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:33,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:33,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:33,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185048319] [2022-12-13 02:24:33,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:33,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:33,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:33,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:33,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:33,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:33,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:33,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:33,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:33,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:33,087 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:33,087 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:33,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:33,088 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:33,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:33,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:33,089 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:33,089 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:33,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:33,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:33,091 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:33,091 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:33,092 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:33,092 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:33,092 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:33,092 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:33,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:33,092 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:33,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:33,097 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:33,097 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:33,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:33,098 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:33,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:33,185 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:33,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:33,185 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:33,185 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 02:24:33,186 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:33,186 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:33,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2424 [2022-12-13 02:24:33,186 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:24:33,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:33,186 INFO L85 PathProgramCache]: Analyzing trace with hash 805410270, now seen corresponding path program 1 times [2022-12-13 02:24:33,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:33,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912314099] [2022-12-13 02:24:33,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:33,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:33,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:24:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:33,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912314099] [2022-12-13 02:24:33,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912314099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:33,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:33,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:33,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116678605] [2022-12-13 02:24:33,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:33,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:33,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:33,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:33,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:33,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:33,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:33,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:33,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:33,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:33,312 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:33,312 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:33,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:33,313 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:33,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:33,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:33,314 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:33,314 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:33,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:33,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:33,316 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:33,316 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:33,317 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:33,317 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:33,317 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:33,317 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:33,317 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:33,317 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:33,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:33,322 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:33,323 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:33,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:33,323 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:33,323 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:33,411 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:33,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:33,412 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:33,412 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 02:24:33,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:33,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:33,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2425 [2022-12-13 02:24:33,412 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:24:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:33,412 INFO L85 PathProgramCache]: Analyzing trace with hash 834039421, now seen corresponding path program 1 times [2022-12-13 02:24:33,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:33,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576994946] [2022-12-13 02:24:33,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:33,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:33,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:24:33,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:33,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576994946] [2022-12-13 02:24:33,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576994946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:33,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:33,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:33,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697623965] [2022-12-13 02:24:33,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:33,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:33,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:33,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:33,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:33,482 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:33,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:33,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:33,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:33,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:33,559 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:33,560 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:33,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:33,561 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:33,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:33,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:33,561 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:33,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:33,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:33,564 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:33,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:33,564 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:33,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:33,564 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:33,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:33,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:33,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:33,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:33,570 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:33,570 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:33,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:33,570 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:33,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:33,658 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:33,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:33,659 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:33,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:33,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:33,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:33,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2426 [2022-12-13 02:24:33,659 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:24:33,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:33,659 INFO L85 PathProgramCache]: Analyzing trace with hash 862668572, now seen corresponding path program 1 times [2022-12-13 02:24:33,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:33,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115848852] [2022-12-13 02:24:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:33,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:33,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:24:33,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:33,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115848852] [2022-12-13 02:24:33,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115848852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:33,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:33,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:33,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602734583] [2022-12-13 02:24:33,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:33,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:33,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:33,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:33,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:33,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:33,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:33,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:33,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:33,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:33,789 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:33,789 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:33,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:33,790 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:33,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:33,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:33,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:33,791 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:33,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:33,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:33,793 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:33,793 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:33,794 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:33,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:33,794 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:33,794 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:33,794 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:33,794 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:33,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:33,800 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:33,800 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:33,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:33,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:33,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:33,889 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:33,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:33,889 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:33,889 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 02:24:33,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:33,889 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:33,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2427 [2022-12-13 02:24:33,890 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:24:33,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash 891297723, now seen corresponding path program 1 times [2022-12-13 02:24:33,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:33,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218964141] [2022-12-13 02:24:33,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:33,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:33,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:33,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218964141] [2022-12-13 02:24:33,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218964141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:33,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:33,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:33,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458830369] [2022-12-13 02:24:33,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:33,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:33,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:33,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:33,944 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:33,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:33,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:33,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:33,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:34,014 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:34,014 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:34,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:34,015 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:34,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:34,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:34,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:34,016 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:34,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:34,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:34,018 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,018 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:34,018 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:34,018 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:34,019 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,019 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:34,019 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:34,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:34,025 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:34,025 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:34,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:34,025 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:34,025 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:34,111 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:34,112 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:34,112 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:34,112 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 02:24:34,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:34,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:34,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2428 [2022-12-13 02:24:34,112 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:24:34,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:34,112 INFO L85 PathProgramCache]: Analyzing trace with hash 919926874, now seen corresponding path program 1 times [2022-12-13 02:24:34,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:34,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539304773] [2022-12-13 02:24:34,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:34,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:34,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:24:34,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:34,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539304773] [2022-12-13 02:24:34,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539304773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:34,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:34,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:34,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287104252] [2022-12-13 02:24:34,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:34,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:34,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:34,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:34,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:34,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:34,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:34,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:34,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:34,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:34,245 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:34,246 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:34,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:34,247 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:34,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:34,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:34,247 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:34,247 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:34,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:34,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:34,250 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,250 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:34,250 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:34,250 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:34,250 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,250 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:34,250 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:34,251 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:34,256 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:34,256 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:24:34,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:34,257 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:34,257 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:34,343 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:34,344 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:34,344 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:34,344 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 02:24:34,344 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:34,344 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:34,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2429 [2022-12-13 02:24:34,344 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:24:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:34,344 INFO L85 PathProgramCache]: Analyzing trace with hash 948556025, now seen corresponding path program 1 times [2022-12-13 02:24:34,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:34,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420179593] [2022-12-13 02:24:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:34,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:34,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:24:34,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:34,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420179593] [2022-12-13 02:24:34,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420179593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:34,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:34,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225980539] [2022-12-13 02:24:34,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:34,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:34,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:34,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:34,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:34,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:34,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:34,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:34,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:34,476 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:34,476 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:34,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:34,477 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:34,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:34,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:34,477 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:34,477 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:34,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:34,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:34,480 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,480 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:34,480 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:34,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:34,480 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,480 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:34,481 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:34,481 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:34,486 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:34,486 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:34,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:34,487 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:34,487 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:34,574 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:34,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:34,575 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:34,575 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 02:24:34,575 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:34,575 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:34,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2430 [2022-12-13 02:24:34,575 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:24:34,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash 977185176, now seen corresponding path program 1 times [2022-12-13 02:24:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:34,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881806663] [2022-12-13 02:24:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:34,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:34,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:24:34,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:34,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881806663] [2022-12-13 02:24:34,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881806663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:34,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:34,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:34,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410058824] [2022-12-13 02:24:34,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:34,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:34,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:34,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:34,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:34,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:34,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:34,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:34,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:34,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:34,704 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:34,704 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:34,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:34,705 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:34,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:34,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:34,706 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:34,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:34,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:34,709 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,709 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:34,709 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:34,709 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:34,709 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:34,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:34,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:34,715 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:34,715 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:34,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:34,716 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:34,716 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:34,803 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:34,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:34,804 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:34,804 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 02:24:34,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:34,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:34,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2431 [2022-12-13 02:24:34,804 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:24:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1005814327, now seen corresponding path program 1 times [2022-12-13 02:24:34,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:34,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537518526] [2022-12-13 02:24:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:34,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:24:34,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:34,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537518526] [2022-12-13 02:24:34,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537518526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:34,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:34,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203244030] [2022-12-13 02:24:34,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:34,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:34,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:34,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:34,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:34,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:34,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:34,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:34,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:34,932 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:34,933 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:34,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:34,934 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:34,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:34,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:34,934 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:34,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:34,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:34,937 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,937 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:34,937 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:34,937 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:34,937 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,937 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:34,938 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:34,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:34,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:34,943 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:34,943 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:34,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:34,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:34,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:35,032 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:35,032 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:35,032 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:35,033 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 02:24:35,033 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:35,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:35,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2432 [2022-12-13 02:24:35,033 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:24:35,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:35,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1034443478, now seen corresponding path program 1 times [2022-12-13 02:24:35,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:35,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284067459] [2022-12-13 02:24:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:35,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:35,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:24:35,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:35,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284067459] [2022-12-13 02:24:35,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284067459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:35,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:35,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:35,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321166493] [2022-12-13 02:24:35,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:35,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:35,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:35,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:35,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:35,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:35,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:35,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:35,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:35,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:35,159 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:35,160 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:35,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1097 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:35,161 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:35,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:35,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:35,161 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:35,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:35,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:35,164 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:35,164 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:35,164 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:35,164 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:35,164 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:35,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:35,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:35,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:35,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:35,170 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:35,170 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:35,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:35,171 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:35,171 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:35,259 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:35,259 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:35,260 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:35,260 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 02:24:35,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:35,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:35,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2433 [2022-12-13 02:24:35,260 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:24:35,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1063072629, now seen corresponding path program 1 times [2022-12-13 02:24:35,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:35,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59404654] [2022-12-13 02:24:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:35,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:24:35,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:35,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59404654] [2022-12-13 02:24:35,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59404654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:35,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:35,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:35,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155666428] [2022-12-13 02:24:35,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:35,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:35,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:35,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:35,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:35,315 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:35,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:35,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:35,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:35,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:35,403 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:35,404 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:35,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:35,405 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:35,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:35,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:35,405 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:35,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:35,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:35,408 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:35,408 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:35,408 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:35,408 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:35,408 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:35,408 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:35,408 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:35,408 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:35,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:35,414 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:35,414 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:24:35,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:35,415 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:35,415 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:35,502 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:35,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:35,503 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:35,503 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 02:24:35,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:35,503 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:35,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2434 [2022-12-13 02:24:35,503 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:24:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1091701780, now seen corresponding path program 1 times [2022-12-13 02:24:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:35,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588230904] [2022-12-13 02:24:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:35,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:24:35,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:35,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588230904] [2022-12-13 02:24:35,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588230904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:35,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:35,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:35,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747172255] [2022-12-13 02:24:35,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:35,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:35,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:35,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:35,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:35,561 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:35,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:35,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:35,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:35,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:35,637 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:35,637 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:35,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:35,638 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:35,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:35,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:35,639 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:35,639 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:35,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:35,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:35,641 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:35,642 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:35,642 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:35,642 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:35,642 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:35,642 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:35,642 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:35,642 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:35,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:35,648 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:35,648 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:35,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:35,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:35,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:35,740 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:35,741 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:24:35,741 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:35,741 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 02:24:35,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:35,741 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:35,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2435 [2022-12-13 02:24:35,741 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:24:35,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:35,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1120330931, now seen corresponding path program 1 times [2022-12-13 02:24:35,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:35,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978670707] [2022-12-13 02:24:35,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:35,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:35,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:24:35,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:35,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978670707] [2022-12-13 02:24:35,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978670707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:35,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:35,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:35,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593379457] [2022-12-13 02:24:35,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:35,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:35,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:35,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:35,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:35,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:35,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:35,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:35,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:35,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:35,906 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:35,906 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:35,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:35,907 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:35,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:35,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:35,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:35,908 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:35,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:35,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:35,910 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:35,910 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:35,910 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:35,911 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:35,911 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:35,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:35,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:35,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:35,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:35,916 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:35,916 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:35,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:35,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:35,917 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:36,005 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:36,006 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:36,006 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:36,006 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 02:24:36,006 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:36,006 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:36,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2436 [2022-12-13 02:24:36,006 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:24:36,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:36,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1148960082, now seen corresponding path program 1 times [2022-12-13 02:24:36,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:36,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671151780] [2022-12-13 02:24:36,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:36,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:36,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:24:36,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:36,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671151780] [2022-12-13 02:24:36,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671151780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:36,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:36,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:36,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565890991] [2022-12-13 02:24:36,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:36,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:36,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:36,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:36,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:36,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:36,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:36,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:36,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:36,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:36,166 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:36,167 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:36,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:36,168 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:36,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:36,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:36,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:36,168 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:36,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:36,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:36,171 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:36,171 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:36,171 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:36,171 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:36,171 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:36,172 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:36,172 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:36,172 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:36,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:36,177 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:36,177 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:36,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:36,178 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:36,178 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:36,265 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:36,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:36,266 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:36,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:36,266 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:36,266 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:36,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2437 [2022-12-13 02:24:36,266 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:24:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1177589233, now seen corresponding path program 1 times [2022-12-13 02:24:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:36,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841610418] [2022-12-13 02:24:36,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:36,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:36,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:24:36,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:36,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841610418] [2022-12-13 02:24:36,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841610418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:36,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:36,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:36,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457722370] [2022-12-13 02:24:36,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:36,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:36,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:36,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:36,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:36,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:36,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:36,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:36,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:36,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:36,413 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:36,414 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:36,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:36,415 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:36,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:36,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:36,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:36,416 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:36,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:36,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:36,419 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:36,419 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:36,419 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:36,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:36,419 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:36,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:36,420 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:36,420 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:36,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:36,427 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:36,427 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:36,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:36,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:36,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:36,533 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:36,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 02:24:36,533 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:36,533 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 02:24:36,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:36,534 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:36,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2438 [2022-12-13 02:24:36,534 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:24:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1206218384, now seen corresponding path program 1 times [2022-12-13 02:24:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:36,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105822727] [2022-12-13 02:24:36,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:36,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:36,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:24:36,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:36,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105822727] [2022-12-13 02:24:36,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105822727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:36,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:36,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:36,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605372290] [2022-12-13 02:24:36,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:36,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:36,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:36,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:36,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:36,604 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:36,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:36,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:36,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:36,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:36,712 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:36,713 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:36,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:36,714 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:36,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:36,715 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:36,715 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:36,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:36,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:36,718 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:36,718 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:36,718 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:36,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:36,719 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:36,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:36,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:36,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:36,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:36,726 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:36,727 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:36,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:36,727 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:36,728 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:36,835 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:36,835 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:24:36,836 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:36,836 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 02:24:36,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:36,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:36,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2439 [2022-12-13 02:24:36,836 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:24:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1234847535, now seen corresponding path program 1 times [2022-12-13 02:24:36,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:36,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027746932] [2022-12-13 02:24:36,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:36,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:36,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:24:36,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:36,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027746932] [2022-12-13 02:24:36,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027746932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:36,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:36,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:36,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815639783] [2022-12-13 02:24:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:36,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:36,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:36,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:36,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:36,925 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:36,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:36,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:36,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:36,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:37,025 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:37,025 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:37,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:37,026 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:37,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:37,027 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:37,027 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:37,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:37,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:37,031 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:37,031 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:37,031 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:37,031 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:37,031 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:37,031 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:37,031 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:37,032 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:37,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:37,039 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:37,039 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:37,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:37,040 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:37,040 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:37,149 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:37,150 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:24:37,150 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:37,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:37,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:37,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:37,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2440 [2022-12-13 02:24:37,150 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:24:37,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1263476686, now seen corresponding path program 1 times [2022-12-13 02:24:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:37,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306138804] [2022-12-13 02:24:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:37,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:24:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:37,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306138804] [2022-12-13 02:24:37,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306138804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:37,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:37,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:37,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343336322] [2022-12-13 02:24:37,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:37,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:37,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:37,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:37,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:37,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:37,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:37,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:37,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:37,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:37,339 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:37,340 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:37,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:37,341 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:37,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:37,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:37,342 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:37,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:37,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:37,345 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:37,345 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:37,346 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:37,346 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:37,346 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:37,346 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:37,346 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:37,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:37,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:37,354 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:37,354 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:37,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:37,355 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:37,355 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:37,463 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:37,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:24:37,463 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:37,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:37,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:37,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:37,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2441 [2022-12-13 02:24:37,464 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:24:37,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1292105837, now seen corresponding path program 1 times [2022-12-13 02:24:37,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:37,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719502187] [2022-12-13 02:24:37,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:37,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:37,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:24:37,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:37,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719502187] [2022-12-13 02:24:37,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719502187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:37,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:37,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:37,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636877940] [2022-12-13 02:24:37,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:37,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:37,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:37,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:37,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:37,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:37,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:37,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:37,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:37,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:37,598 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:37,599 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:37,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:37,600 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:37,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:37,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:37,600 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:37,600 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:37,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:37,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:37,603 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:37,603 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:37,603 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:37,603 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:37,603 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:37,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:37,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:37,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:37,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:37,609 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:37,609 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:37,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:37,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:37,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:37,696 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:37,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:37,697 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:37,697 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 02:24:37,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:37,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:37,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2442 [2022-12-13 02:24:37,697 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:24:37,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:37,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1320734988, now seen corresponding path program 1 times [2022-12-13 02:24:37,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:37,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882170183] [2022-12-13 02:24:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:37,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:37,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:24:37,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:37,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882170183] [2022-12-13 02:24:37,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882170183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:37,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:37,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:37,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033642405] [2022-12-13 02:24:37,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:37,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:37,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:37,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:37,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:37,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:37,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:37,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:37,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:37,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:37,829 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:37,829 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:37,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:37,830 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:37,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:37,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:37,830 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:37,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:37,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:37,833 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:37,833 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:37,833 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:37,833 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:37,833 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:37,833 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:37,833 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:37,834 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:37,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:37,839 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:37,839 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:37,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:37,840 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:37,840 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:37,927 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:37,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:37,927 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:37,927 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 02:24:37,927 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:37,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:37,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2443 [2022-12-13 02:24:37,928 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:24:37,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:37,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1349364139, now seen corresponding path program 1 times [2022-12-13 02:24:37,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:37,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840667385] [2022-12-13 02:24:37,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:37,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:37,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:24:37,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:37,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840667385] [2022-12-13 02:24:37,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840667385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:37,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:37,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:37,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691555148] [2022-12-13 02:24:37,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:37,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:37,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:37,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:37,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:37,984 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:37,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:37,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:37,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:37,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:38,061 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:38,062 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:38,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:38,063 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:38,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:38,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:38,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:38,063 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:38,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:38,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:38,066 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:38,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:38,066 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:38,066 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:38,066 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:38,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:38,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:38,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:38,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:38,072 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:38,072 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:38,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:38,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:38,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:38,161 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:38,162 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:38,162 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:38,162 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 02:24:38,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:38,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:38,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2444 [2022-12-13 02:24:38,162 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:24:38,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:38,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1377993290, now seen corresponding path program 1 times [2022-12-13 02:24:38,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:38,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204088937] [2022-12-13 02:24:38,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:38,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:38,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:24:38,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:38,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204088937] [2022-12-13 02:24:38,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204088937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:38,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:38,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:38,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541423558] [2022-12-13 02:24:38,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:38,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:38,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:38,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:38,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:38,218 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:38,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:38,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:38,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:38,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:38,295 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:38,296 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:38,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:38,297 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:38,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:38,297 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:38,297 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:38,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:38,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:38,300 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:38,300 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:38,300 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:38,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:38,300 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:38,300 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:38,300 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:38,300 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:38,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:38,306 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:38,306 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:38,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:38,307 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:38,307 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:38,395 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:38,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:38,395 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:38,395 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 02:24:38,395 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:38,395 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:38,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2445 [2022-12-13 02:24:38,396 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:24:38,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:38,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1406622441, now seen corresponding path program 1 times [2022-12-13 02:24:38,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:38,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382361579] [2022-12-13 02:24:38,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:38,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24: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:24:38,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:38,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382361579] [2022-12-13 02:24:38,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382361579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:38,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:38,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:38,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214841050] [2022-12-13 02:24:38,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:38,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:38,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:38,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:38,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:38,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:38,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:38,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:38,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:38,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:38,553 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:38,553 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:38,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:38,554 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:38,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:38,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:38,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:38,555 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:38,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:38,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:38,557 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:38,557 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:38,558 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:38,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:38,558 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:38,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:38,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:38,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:38,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:38,564 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:38,564 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:38,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:38,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:38,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:38,652 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:38,652 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:38,652 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:38,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:38,652 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:38,652 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:38,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2446 [2022-12-13 02:24:38,653 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:24:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1435251592, now seen corresponding path program 1 times [2022-12-13 02:24:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:38,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761001541] [2022-12-13 02:24:38,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:38,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:38,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:24:38,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:38,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761001541] [2022-12-13 02:24:38,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761001541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:38,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:38,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:38,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347715926] [2022-12-13 02:24:38,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:38,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:38,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:38,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:38,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:38,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:38,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:38,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:38,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:38,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:38,784 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:38,784 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:38,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:38,785 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:38,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:38,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:38,785 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:38,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:38,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:38,788 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:38,788 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:38,788 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:38,788 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:38,788 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:38,788 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:38,789 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:38,789 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:38,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:38,794 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:38,794 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:24:38,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:38,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:38,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:38,883 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:38,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:38,883 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:38,883 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 02:24:38,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:38,884 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:38,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2447 [2022-12-13 02:24:38,884 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:24:38,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:38,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1463880743, now seen corresponding path program 1 times [2022-12-13 02:24:38,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:38,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595974938] [2022-12-13 02:24:38,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:38,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24: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 02:24:38,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:38,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595974938] [2022-12-13 02:24:38,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595974938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:38,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:38,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:38,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563659415] [2022-12-13 02:24:38,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:38,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:38,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:38,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:38,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:38,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:38,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:38,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:38,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:39,002 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:39,002 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:39,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:39,004 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:39,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:39,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:39,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:39,004 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:39,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:39,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:39,007 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,007 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:39,007 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:39,007 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:39,007 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,007 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:39,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:39,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:39,013 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:39,013 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:24:39,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:39,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:39,014 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:39,102 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:39,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:39,103 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:39,103 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 02:24:39,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:39,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:39,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2448 [2022-12-13 02:24:39,103 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:24:39,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1492509894, now seen corresponding path program 1 times [2022-12-13 02:24:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:39,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361970595] [2022-12-13 02:24:39,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:39,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:39,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:24:39,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:39,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361970595] [2022-12-13 02:24:39,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361970595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:39,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:39,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:39,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130828467] [2022-12-13 02:24:39,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:39,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:39,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:39,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:39,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:39,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:39,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:39,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:39,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:39,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:39,262 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:39,262 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:39,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:39,263 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:39,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:39,263 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:39,264 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:39,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:39,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:39,266 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,266 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:39,266 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:39,266 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:39,266 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,266 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:39,267 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:39,267 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:39,272 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:39,272 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:39,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:39,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:39,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:39,361 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:39,362 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:39,362 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:39,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:39,362 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:39,362 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:39,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2449 [2022-12-13 02:24:39,362 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:24:39,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:39,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1521139045, now seen corresponding path program 1 times [2022-12-13 02:24:39,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:39,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003000524] [2022-12-13 02:24:39,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:39,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:39,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:24:39,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:39,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003000524] [2022-12-13 02:24:39,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003000524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:39,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:39,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:39,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909894324] [2022-12-13 02:24:39,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:39,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:39,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:39,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:39,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:39,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:39,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:39,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:39,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:39,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:39,479 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:39,479 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:39,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:39,480 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:39,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:39,481 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:39,481 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:39,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:39,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:39,483 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,483 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:39,484 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:39,484 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:39,484 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,484 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:39,484 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:39,484 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:39,489 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:39,490 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:39,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:39,490 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:39,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:39,577 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:39,578 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:39,578 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:39,578 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 02:24:39,578 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:39,578 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:39,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2450 [2022-12-13 02:24:39,578 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:24:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:39,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1549768196, now seen corresponding path program 1 times [2022-12-13 02:24:39,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:39,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627816297] [2022-12-13 02:24:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:39,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:39,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:24:39,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:39,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627816297] [2022-12-13 02:24:39,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627816297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:39,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:39,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:39,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073243106] [2022-12-13 02:24:39,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:39,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:39,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:39,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:39,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:39,648 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:39,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:39,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:39,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:39,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:39,722 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:39,722 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:39,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:39,723 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:39,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:39,724 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:39,724 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:39,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:39,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:39,726 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,726 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:39,727 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:39,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:39,727 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:39,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:39,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:39,732 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:39,733 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:39,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:39,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:39,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:39,819 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:39,820 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:39,820 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:39,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:39,820 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:39,820 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:39,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2451 [2022-12-13 02:24:39,820 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:24:39,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:39,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1578397347, now seen corresponding path program 1 times [2022-12-13 02:24:39,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:39,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225250040] [2022-12-13 02:24:39,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:39,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24: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 02:24:39,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:39,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225250040] [2022-12-13 02:24:39,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225250040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:39,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:39,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398732228] [2022-12-13 02:24:39,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:39,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:39,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:39,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:39,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:39,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:39,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:39,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:39,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:39,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:39,950 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:39,950 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:39,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:39,951 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:39,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:39,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:39,952 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:39,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:39,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:39,954 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,955 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:39,955 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:39,955 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:39,955 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:39,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:39,955 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:39,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:39,961 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:39,961 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:39,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:39,961 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:39,962 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:40,048 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:40,048 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:40,048 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:40,048 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 02:24:40,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:40,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:40,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2452 [2022-12-13 02:24:40,048 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:24:40,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1607026498, now seen corresponding path program 1 times [2022-12-13 02:24:40,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:40,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22674356] [2022-12-13 02:24:40,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:40,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24: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:24:40,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:40,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22674356] [2022-12-13 02:24:40,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22674356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:40,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:40,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:40,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716502325] [2022-12-13 02:24:40,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:40,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:40,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:40,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:40,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:40,104 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:40,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:40,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:40,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:40,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:40,170 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:40,170 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:40,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:40,171 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:40,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:40,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:40,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:40,172 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:40,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:40,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:40,175 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:40,175 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:40,175 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:40,175 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:40,175 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:40,175 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:40,175 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:40,175 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:40,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:40,181 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:40,181 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:40,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:40,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:40,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:40,269 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:40,269 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:40,269 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:40,269 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 02:24:40,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:40,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:40,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2453 [2022-12-13 02:24:40,270 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:24:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:40,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1635655649, now seen corresponding path program 1 times [2022-12-13 02:24:40,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:40,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074036647] [2022-12-13 02:24:40,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:40,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:40,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:24:40,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:40,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074036647] [2022-12-13 02:24:40,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074036647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:40,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:40,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:40,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154403246] [2022-12-13 02:24:40,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:40,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:40,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:40,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:40,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:40,324 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:40,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:40,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:40,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:40,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:40,408 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:40,408 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:40,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:40,409 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:40,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:40,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:40,410 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:40,410 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:40,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:40,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:40,412 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:40,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:40,412 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:40,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:40,412 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:40,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:40,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:40,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:40,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:40,418 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:40,418 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:40,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:40,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:40,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:40,509 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:40,510 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:24:40,510 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:40,510 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 02:24:40,510 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:40,510 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:40,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2454 [2022-12-13 02:24:40,510 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:24:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:40,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1664284800, now seen corresponding path program 1 times [2022-12-13 02:24:40,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:40,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956973242] [2022-12-13 02:24:40,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:40,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:40,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:24:40,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:40,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956973242] [2022-12-13 02:24:40,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956973242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:40,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:40,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:40,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831501553] [2022-12-13 02:24:40,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:40,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:40,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:40,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:40,564 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:40,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:40,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:40,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:40,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:40,629 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:40,629 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:40,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:40,630 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:40,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:40,631 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:40,631 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:40,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:40,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:40,633 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:40,633 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:40,634 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:40,634 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:40,634 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:40,634 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:40,634 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:40,634 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:40,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:40,640 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:40,640 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:40,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:40,641 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:40,641 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:40,728 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:40,728 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:40,728 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:40,728 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 02:24:40,728 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:40,728 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:40,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2455 [2022-12-13 02:24:40,728 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:24:40,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1692913951, now seen corresponding path program 1 times [2022-12-13 02:24:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:40,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865344322] [2022-12-13 02:24:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:40,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:24:40,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:40,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865344322] [2022-12-13 02:24:40,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865344322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:40,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:40,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:40,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459591459] [2022-12-13 02:24:40,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:40,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:40,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:40,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:40,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:40,784 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:40,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:40,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:40,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:40,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:40,850 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:40,850 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:40,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:40,851 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:40,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:40,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:40,852 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:40,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:40,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:40,854 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:40,854 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:40,855 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:40,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:40,855 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:40,855 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:40,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:40,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:40,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:40,860 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:40,861 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:24:40,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:40,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:40,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:40,948 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:40,949 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:40,949 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:40,949 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 02:24:40,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:40,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:40,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2456 [2022-12-13 02:24:40,949 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:24:40,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:40,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1721543102, now seen corresponding path program 1 times [2022-12-13 02:24:40,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:40,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259927615] [2022-12-13 02:24:40,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:40,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:41,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:24:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:41,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259927615] [2022-12-13 02:24:41,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259927615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:41,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:41,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:41,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407728483] [2022-12-13 02:24:41,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:41,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:41,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:41,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:41,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:41,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:41,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:41,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:41,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:41,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:41,069 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:41,069 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:41,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:41,070 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:41,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:41,070 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:41,071 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:41,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:41,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:41,073 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:41,073 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:41,073 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:41,073 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:41,073 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:41,073 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:41,073 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:41,074 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:41,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:41,079 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:41,079 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:24:41,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:41,080 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:41,080 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:41,168 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:41,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:41,168 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:41,168 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 02:24:41,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:41,168 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:41,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2457 [2022-12-13 02:24:41,168 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:24:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:41,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1750172253, now seen corresponding path program 1 times [2022-12-13 02:24:41,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:41,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223992302] [2022-12-13 02:24:41,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:41,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:41,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 02:24:41,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:41,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223992302] [2022-12-13 02:24:41,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223992302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:41,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:41,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:41,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125183979] [2022-12-13 02:24:41,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:41,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:41,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:41,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:41,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:41,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:41,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:41,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:41,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:41,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:41,298 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:41,298 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:41,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:41,299 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:41,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:41,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:41,300 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:41,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:41,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:41,302 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:41,302 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:41,302 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:41,302 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:41,302 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:41,303 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:41,303 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:41,303 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:41,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:41,308 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:41,308 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:41,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:41,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:41,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:41,396 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:41,397 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:41,397 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:41,397 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 02:24:41,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:41,397 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:41,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2458 [2022-12-13 02:24:41,397 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:24:41,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1778801404, now seen corresponding path program 1 times [2022-12-13 02:24:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:41,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524933893] [2022-12-13 02:24:41,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:41,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:24:41,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:41,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524933893] [2022-12-13 02:24:41,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524933893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:41,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:41,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:41,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264732172] [2022-12-13 02:24:41,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:41,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:41,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:41,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:41,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:41,470 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:41,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:41,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:41,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:41,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:41,556 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:41,556 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:41,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:41,568 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:41,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:41,569 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:41,569 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:41,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:41,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:41,571 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:41,571 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:41,571 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:41,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:41,572 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:41,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:41,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:41,572 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:41,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:41,577 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:41,578 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:41,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:41,578 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:41,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:41,666 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:41,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:41,667 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:41,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:41,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:41,667 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:41,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2459 [2022-12-13 02:24:41,667 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:24:41,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1807430555, now seen corresponding path program 1 times [2022-12-13 02:24:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:41,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914533387] [2022-12-13 02:24:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:41,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:41,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:24:41,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:41,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914533387] [2022-12-13 02:24:41,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914533387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:41,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:41,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:41,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794777703] [2022-12-13 02:24:41,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:41,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:41,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:41,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:41,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:41,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:41,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:41,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:41,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:41,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:41,798 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:41,799 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:41,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:41,800 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:41,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:41,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:41,800 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:41,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:41,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:41,803 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:41,803 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:41,803 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:41,803 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:41,803 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:41,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:41,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:41,804 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:41,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:41,809 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:41,809 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:41,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:41,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:41,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:41,899 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:41,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:24:41,900 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:41,900 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 02:24:41,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:41,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:41,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2460 [2022-12-13 02:24:41,900 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:24:41,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:41,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1836059706, now seen corresponding path program 1 times [2022-12-13 02:24:41,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:41,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327947466] [2022-12-13 02:24:41,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:41,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:41,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 02:24:41,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:41,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327947466] [2022-12-13 02:24:41,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327947466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:41,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:41,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:41,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804948806] [2022-12-13 02:24:41,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:41,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:41,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:41,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:41,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:41,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:41,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:41,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:41,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:41,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:42,032 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:42,032 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:42,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:42,033 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:42,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:42,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:42,034 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:42,034 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:42,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:42,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:42,036 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,036 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:42,037 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:42,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:42,037 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,037 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:42,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:42,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:42,043 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:42,043 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:42,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:42,043 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:42,043 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:42,131 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:42,132 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:42,132 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:42,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 02:24:42,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:42,132 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:42,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2461 [2022-12-13 02:24:42,132 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:24:42,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:42,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1864688857, now seen corresponding path program 1 times [2022-12-13 02:24:42,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:42,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142563234] [2022-12-13 02:24:42,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:42,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:42,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:24:42,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:42,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142563234] [2022-12-13 02:24:42,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142563234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:42,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:42,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:42,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587858888] [2022-12-13 02:24:42,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:42,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:42,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:42,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:42,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:42,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:42,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:42,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:42,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:42,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:42,289 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:42,289 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:42,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:42,290 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:42,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:42,291 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:42,291 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:42,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:42,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:42,293 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,293 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:42,293 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:42,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:42,293 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,294 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:42,294 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:42,294 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:42,299 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:42,299 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:42,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:42,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:42,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:42,388 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:42,389 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:42,389 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:42,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:42,389 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:42,389 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:42,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2462 [2022-12-13 02:24:42,389 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:24:42,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1893318008, now seen corresponding path program 1 times [2022-12-13 02:24:42,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:42,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805993433] [2022-12-13 02:24:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:42,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:24:42,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:42,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805993433] [2022-12-13 02:24:42,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805993433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:42,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:42,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:42,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577682197] [2022-12-13 02:24:42,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:42,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:42,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:42,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:42,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:42,443 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:42,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:42,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:42,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:42,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:42,518 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:42,518 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:42,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:42,519 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:42,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:42,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:42,520 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:42,520 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:42,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:42,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:42,522 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,522 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:42,522 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:42,522 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:42,522 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,523 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:42,523 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:42,523 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:42,528 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:42,528 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:42,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:42,529 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:42,529 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:42,616 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:42,616 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:42,616 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:42,616 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 02:24:42,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:42,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:42,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2463 [2022-12-13 02:24:42,616 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:24:42,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:42,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1921947159, now seen corresponding path program 1 times [2022-12-13 02:24:42,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:42,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165482981] [2022-12-13 02:24:42,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:42,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:24:42,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:42,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165482981] [2022-12-13 02:24:42,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165482981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:42,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:42,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:42,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223192604] [2022-12-13 02:24:42,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:42,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:42,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:42,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:42,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:42,669 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:42,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:42,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:42,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:42,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:42,736 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:42,736 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:42,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:42,737 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:42,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:42,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:42,738 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:42,738 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:42,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:42,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:42,740 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,740 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:42,741 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:42,741 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:42,741 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,741 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:42,741 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:42,741 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:42,756 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:42,757 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:42,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:42,757 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:42,757 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:42,846 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:42,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:24:42,846 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:42,846 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 02:24:42,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:42,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:42,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2464 [2022-12-13 02:24:42,846 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:24:42,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1950576310, now seen corresponding path program 1 times [2022-12-13 02:24:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:42,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555841311] [2022-12-13 02:24:42,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:42,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:24:42,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:42,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555841311] [2022-12-13 02:24:42,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555841311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:42,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:42,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:42,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296188515] [2022-12-13 02:24:42,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:42,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:42,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:42,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:42,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:42,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:42,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:42,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:42,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:42,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:42,966 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:42,967 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:42,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:42,968 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:42,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:42,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:42,968 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:42,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:42,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:42,971 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:42,971 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:42,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:42,971 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:42,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:42,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:42,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:42,977 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:42,977 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:24:42,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:42,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:42,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:43,065 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:43,066 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:43,066 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:43,066 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 02:24:43,066 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:43,066 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:43,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2465 [2022-12-13 02:24:43,066 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:24:43,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1979205461, now seen corresponding path program 1 times [2022-12-13 02:24:43,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:43,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242172881] [2022-12-13 02:24:43,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:43,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:43,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:24:43,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:43,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242172881] [2022-12-13 02:24:43,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242172881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:43,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:43,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:43,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144740068] [2022-12-13 02:24:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:43,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:43,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:43,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:43,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:43,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:43,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:43,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:43,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:43,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:43,194 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:43,194 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:43,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:43,195 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:43,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:43,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:43,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:43,196 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:43,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:43,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:43,198 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:43,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:43,198 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:43,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:43,198 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:43,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:43,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:43,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:43,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:43,204 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:43,204 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:24:43,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:43,205 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:43,205 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:43,292 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:43,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:43,292 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:43,292 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 02:24:43,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:43,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:43,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2466 [2022-12-13 02:24:43,293 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:24:43,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:43,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2007834612, now seen corresponding path program 1 times [2022-12-13 02:24:43,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:43,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400355710] [2022-12-13 02:24:43,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:43,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:43,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:24:43,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:43,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400355710] [2022-12-13 02:24:43,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400355710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:43,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:43,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:43,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642634518] [2022-12-13 02:24:43,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:43,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:43,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:43,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:43,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:43,348 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:43,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:43,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:43,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:43,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:43,424 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:43,424 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:43,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:43,425 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:43,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:43,426 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:43,426 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:43,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:43,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:43,428 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:43,428 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:43,429 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:43,429 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:43,429 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:43,429 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:43,429 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:43,429 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:43,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:43,434 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:43,434 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:24:43,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:43,435 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:43,435 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:43,525 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:43,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:24:43,526 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:43,526 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 02:24:43,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:43,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:43,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2467 [2022-12-13 02:24:43,526 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:24:43,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2036463763, now seen corresponding path program 1 times [2022-12-13 02:24:43,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:43,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557825121] [2022-12-13 02:24:43,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:43,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:24:43,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:43,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557825121] [2022-12-13 02:24:43,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557825121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:43,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:43,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:43,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928923114] [2022-12-13 02:24:43,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:43,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:43,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:43,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:43,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:43,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:43,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:43,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:43,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:43,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:43,657 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:43,657 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:43,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:43,658 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:43,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:43,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:43,658 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:43,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:43,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:43,661 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:43,661 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:43,661 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:43,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:43,661 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:43,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:43,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:43,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:43,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:43,667 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:43,667 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:43,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:43,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:43,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:43,754 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:43,755 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:43,755 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:43,755 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 02:24:43,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:43,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:43,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2468 [2022-12-13 02:24:43,755 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:24:43,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:43,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2065092914, now seen corresponding path program 1 times [2022-12-13 02:24:43,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:43,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788359366] [2022-12-13 02:24:43,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:43,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:43,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:43,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788359366] [2022-12-13 02:24:43,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788359366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:43,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:43,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:43,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715430550] [2022-12-13 02:24:43,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:43,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:43,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:43,809 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:43,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:43,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:43,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:43,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:43,875 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:43,875 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:43,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:43,876 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:43,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:43,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:43,877 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:43,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:43,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:43,879 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:43,879 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:43,879 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:43,879 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:43,879 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:43,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:43,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:43,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:43,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:43,885 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:43,885 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:43,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:43,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:43,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:43,973 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:43,974 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:43,974 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:43,974 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 02:24:43,974 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:43,974 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:43,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2469 [2022-12-13 02:24:43,974 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:24:43,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:43,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2093722065, now seen corresponding path program 1 times [2022-12-13 02:24:43,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:43,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318896447] [2022-12-13 02:24:43,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:44,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:24:44,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:44,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318896447] [2022-12-13 02:24:44,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318896447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:44,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:44,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:44,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820257291] [2022-12-13 02:24:44,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:44,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:44,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:44,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:44,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:44,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:44,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:44,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:44,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:44,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:44,110 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:44,110 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:44,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:44,111 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:44,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:44,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:44,111 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:44,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:44,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:44,114 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:44,114 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:44,114 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:44,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:44,114 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:44,114 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:44,114 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:44,114 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:44,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:44,120 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:44,120 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:44,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:44,121 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:44,121 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:44,208 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:44,209 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:44,209 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:44,209 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 02:24:44,209 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:44,209 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:44,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2470 [2022-12-13 02:24:44,209 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:24:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2122351216, now seen corresponding path program 1 times [2022-12-13 02:24:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:44,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583439843] [2022-12-13 02:24:44,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:44,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:44,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:24:44,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:44,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583439843] [2022-12-13 02:24:44,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583439843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:44,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:44,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:44,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645104270] [2022-12-13 02:24:44,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:44,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:44,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:44,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:44,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:44,279 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:44,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:44,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:44,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:44,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:44,353 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:44,354 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:44,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:44,355 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:44,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:44,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:44,355 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:44,355 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:44,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:44,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:44,358 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:44,358 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:44,358 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:44,358 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:44,358 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:44,358 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:44,358 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:44,358 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:44,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:44,364 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:44,364 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:44,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:44,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:44,365 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:44,451 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:44,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:44,451 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:44,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:44,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:44,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:44,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2471 [2022-12-13 02:24:44,452 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:24:44,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:44,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2143986929, now seen corresponding path program 1 times [2022-12-13 02:24:44,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:44,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563566173] [2022-12-13 02:24:44,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:44,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:44,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:24:44,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:44,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563566173] [2022-12-13 02:24:44,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563566173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:44,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:44,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:44,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737993368] [2022-12-13 02:24:44,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:44,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:44,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:44,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:44,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:44,505 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:44,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:44,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:44,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:44,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:44,571 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:44,571 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:44,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:44,572 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:44,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:44,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:44,573 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:44,573 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:44,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:44,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:44,576 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:44,576 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:44,576 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:44,576 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:44,576 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:44,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:44,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:44,576 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:44,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:44,582 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:44,582 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:44,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:44,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:44,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:44,668 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:44,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:44,669 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:44,669 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 02:24:44,669 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:44,669 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:44,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2472 [2022-12-13 02:24:44,669 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:24:44,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2115357778, now seen corresponding path program 1 times [2022-12-13 02:24:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:44,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291811706] [2022-12-13 02:24:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:44,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:24:44,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:44,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291811706] [2022-12-13 02:24:44,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291811706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:44,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:44,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:44,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866474373] [2022-12-13 02:24:44,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:44,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:44,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:44,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:44,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:44,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:44,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:44,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:44,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:44,799 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:44,800 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:44,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:44,801 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:44,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:44,801 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:44,801 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:44,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:44,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:44,804 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:44,804 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:44,804 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:44,804 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:44,804 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:44,804 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:44,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:44,804 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:44,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:44,810 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:44,810 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:44,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:44,811 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:44,811 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:44,897 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:44,898 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:44,898 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:44,898 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 02:24:44,898 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:44,898 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:44,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2473 [2022-12-13 02:24:44,898 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:24:44,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2086728627, now seen corresponding path program 1 times [2022-12-13 02:24:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:44,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220156775] [2022-12-13 02:24:44,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:44,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:44,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:24:44,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:44,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220156775] [2022-12-13 02:24:44,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220156775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:44,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:44,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:44,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384980631] [2022-12-13 02:24:44,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:44,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:44,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:44,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:44,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:44,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:44,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:44,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:44,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:44,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:45,044 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:45,045 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:45,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1093 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:45,046 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:45,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:45,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:45,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:45,046 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:45,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:45,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:45,049 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,049 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:45,049 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:45,049 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:45,049 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:45,049 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:45,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:45,055 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:45,055 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:45,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:45,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:45,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:45,142 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:45,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:45,143 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:45,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:45,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:45,143 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:45,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2474 [2022-12-13 02:24:45,143 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:24:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2058099476, now seen corresponding path program 1 times [2022-12-13 02:24:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:45,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301472143] [2022-12-13 02:24:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:45,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:45,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:24:45,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:45,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301472143] [2022-12-13 02:24:45,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301472143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:45,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:45,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:45,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504461427] [2022-12-13 02:24:45,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:45,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:45,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:45,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:45,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:45,203 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:45,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:45,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:45,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:45,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:45,269 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:45,269 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:45,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1107 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:45,270 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:45,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:45,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:45,271 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:45,271 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:45,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:45,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:45,273 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,273 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:45,273 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:45,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:45,273 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,274 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:45,274 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:45,274 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:45,279 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:45,279 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:24:45,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:45,280 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:45,280 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:45,367 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:45,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:45,367 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:45,367 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 02:24:45,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:45,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:45,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2475 [2022-12-13 02:24:45,368 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:24:45,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:45,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2029470325, now seen corresponding path program 1 times [2022-12-13 02:24:45,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:45,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465730912] [2022-12-13 02:24:45,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:45,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:45,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:45,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465730912] [2022-12-13 02:24:45,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465730912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:45,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:45,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:45,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522314049] [2022-12-13 02:24:45,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:45,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:45,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:45,421 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:45,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:45,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:45,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:45,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:45,489 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:45,489 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:45,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:45,490 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:45,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:45,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:45,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:45,491 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:45,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:45,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:45,493 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,493 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:45,493 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:45,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:45,494 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,494 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:45,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:45,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:45,499 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:45,500 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:45,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:45,500 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:45,500 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:45,601 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:45,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 02:24:45,602 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:45,602 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 02:24:45,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:45,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:45,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2476 [2022-12-13 02:24:45,602 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:24:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2000841174, now seen corresponding path program 1 times [2022-12-13 02:24:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:45,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271479956] [2022-12-13 02:24:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:45,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:45,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:24:45,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:45,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271479956] [2022-12-13 02:24:45,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271479956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:45,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:45,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:45,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223682436] [2022-12-13 02:24:45,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:45,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:45,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:45,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:45,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:45,669 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:45,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:45,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:45,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:45,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:45,746 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:45,746 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:45,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:45,747 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:45,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:45,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:45,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:45,748 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:45,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:45,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:45,750 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:45,750 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:45,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:45,750 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,751 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:45,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:45,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:45,757 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:45,757 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:45,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:45,757 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:45,757 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:45,845 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:45,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:45,846 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:45,846 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 02:24:45,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:45,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:45,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2477 [2022-12-13 02:24:45,846 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:24:45,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:45,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1972212023, now seen corresponding path program 1 times [2022-12-13 02:24:45,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:45,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670030077] [2022-12-13 02:24:45,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:45,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:45,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:24:45,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:45,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670030077] [2022-12-13 02:24:45,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670030077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:45,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:45,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068661116] [2022-12-13 02:24:45,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:45,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:45,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:45,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:45,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:45,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:45,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:45,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:45,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:45,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:45,991 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:45,991 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:45,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:45,992 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:45,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:45,993 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:45,993 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:45,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:45,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:45,995 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,996 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:45,996 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:45,996 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:45,996 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,996 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:45,996 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:45,996 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:45,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:46,002 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:46,002 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:46,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:46,002 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:46,002 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:46,089 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:46,090 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:46,090 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:46,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:46,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:46,090 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:46,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2478 [2022-12-13 02:24:46,090 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:24:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:46,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1943582872, now seen corresponding path program 1 times [2022-12-13 02:24:46,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:46,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968590140] [2022-12-13 02:24:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:46,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:24:46,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:46,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968590140] [2022-12-13 02:24:46,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968590140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:46,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:46,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194036630] [2022-12-13 02:24:46,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:46,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:46,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:46,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:46,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:46,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:46,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:46,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:46,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:46,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:46,219 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:46,220 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:46,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:46,221 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:46,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:46,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:46,221 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:46,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:46,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:46,224 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:46,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:46,224 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:46,224 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:46,224 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:46,224 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:46,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:46,225 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:46,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:46,230 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:46,230 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:46,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:46,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:46,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:46,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:46,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:46,320 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:46,320 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 02:24:46,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:46,320 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:46,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2479 [2022-12-13 02:24:46,320 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:24:46,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:46,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1914953721, now seen corresponding path program 1 times [2022-12-13 02:24:46,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:46,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208490157] [2022-12-13 02:24:46,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:46,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:46,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:24:46,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:46,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208490157] [2022-12-13 02:24:46,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208490157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:46,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:46,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:46,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999652947] [2022-12-13 02:24:46,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:46,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:46,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:46,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:46,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:46,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:46,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:46,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:46,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:46,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:46,448 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:46,449 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:46,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:46,450 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:46,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:46,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:46,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:46,450 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:46,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:46,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:46,453 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:46,453 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:46,453 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:46,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:46,453 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:46,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:46,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:46,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:46,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:46,459 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:46,459 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:46,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:46,459 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:46,459 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:46,545 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:46,546 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:46,546 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:46,546 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 02:24:46,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:46,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:46,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2480 [2022-12-13 02:24:46,546 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:24:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:46,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1886324570, now seen corresponding path program 1 times [2022-12-13 02:24:46,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:46,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138748023] [2022-12-13 02:24:46,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:46,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:46,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:24:46,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:46,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138748023] [2022-12-13 02:24:46,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138748023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:46,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:46,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:46,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897348413] [2022-12-13 02:24:46,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:46,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:46,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:46,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:46,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:46,602 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:46,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:46,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:46,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:46,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:46,669 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:46,670 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:46,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:46,671 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:46,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:46,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:46,671 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:46,671 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:46,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:46,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:46,674 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:46,674 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:46,674 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:46,674 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:46,674 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:46,674 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:46,674 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:46,674 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:46,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:46,680 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:46,680 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:46,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:46,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:46,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:46,768 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:46,768 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:46,768 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:46,768 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 02:24:46,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:46,768 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:46,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2481 [2022-12-13 02:24:46,768 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:24:46,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:46,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1857695419, now seen corresponding path program 1 times [2022-12-13 02:24:46,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:46,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036878030] [2022-12-13 02:24:46,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:46,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:46,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 02:24:46,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:46,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036878030] [2022-12-13 02:24:46,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036878030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:46,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:46,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:46,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445856050] [2022-12-13 02:24:46,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:46,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:46,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:46,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:46,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:46,821 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:46,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:46,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:46,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:46,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:46,885 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:46,885 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:46,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:46,886 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:46,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:46,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:46,887 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:46,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:46,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:46,889 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:46,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:46,889 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:46,889 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:46,889 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:46,890 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:46,890 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:46,890 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:46,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:46,895 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:46,895 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:46,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:46,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:46,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:46,981 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:46,982 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:46,982 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:46,982 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 02:24:46,982 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:46,982 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:46,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2482 [2022-12-13 02:24:46,982 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:24:46,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1829066268, now seen corresponding path program 1 times [2022-12-13 02:24:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:46,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308879689] [2022-12-13 02:24:46,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:46,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:47,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:24:47,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:47,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308879689] [2022-12-13 02:24:47,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308879689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:47,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:47,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:47,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949456656] [2022-12-13 02:24:47,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:47,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:47,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:47,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:47,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:47,036 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:47,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:47,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:47,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:47,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:47,112 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:47,112 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:47,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:47,113 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:47,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:47,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:47,114 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:47,114 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:47,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:47,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:47,116 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:47,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:47,116 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:47,117 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:47,117 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:47,117 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:47,117 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:47,117 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:47,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:47,122 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:47,123 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:47,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:47,123 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:47,123 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:47,209 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:47,209 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:24:47,209 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:47,209 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 02:24:47,209 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:47,209 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:47,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2483 [2022-12-13 02:24:47,210 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:24:47,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:47,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1800437117, now seen corresponding path program 1 times [2022-12-13 02:24:47,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:47,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049544282] [2022-12-13 02:24:47,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:47,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:47,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:24:47,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:47,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049544282] [2022-12-13 02:24:47,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049544282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:47,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:47,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608205162] [2022-12-13 02:24:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:47,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:47,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:47,264 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:47,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:47,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:47,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:47,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:47,329 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:47,329 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:47,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:47,330 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:47,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:47,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:47,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:47,330 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:47,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:47,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:47,333 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:47,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:47,333 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:47,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:47,333 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:47,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:47,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:47,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:47,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:47,339 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:47,339 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:47,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:47,340 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:47,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:47,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:47,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:47,427 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:47,427 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 02:24:47,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:47,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:47,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2484 [2022-12-13 02:24:47,427 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:24:47,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:47,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1771807966, now seen corresponding path program 1 times [2022-12-13 02:24:47,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:47,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375475193] [2022-12-13 02:24:47,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:47,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:47,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:24:47,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:47,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375475193] [2022-12-13 02:24:47,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375475193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:47,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:47,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:47,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939160409] [2022-12-13 02:24:47,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:47,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:47,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:47,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:47,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:47,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:47,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:47,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:47,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:47,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:47,562 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:47,562 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:47,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:47,563 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:47,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:47,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:47,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:47,563 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:47,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:47,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:47,566 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:47,566 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:47,566 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:47,566 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:47,566 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:47,567 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:47,567 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:47,567 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:47,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:47,572 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:47,572 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:47,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:47,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:47,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:47,659 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:47,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:47,659 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:47,659 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 02:24:47,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:47,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:47,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2485 [2022-12-13 02:24:47,660 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:24:47,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1743178815, now seen corresponding path program 1 times [2022-12-13 02:24:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:47,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114884674] [2022-12-13 02:24:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:47,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:47,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:24:47,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:47,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114884674] [2022-12-13 02:24:47,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114884674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:47,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:47,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:47,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505416170] [2022-12-13 02:24:47,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:47,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:47,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:47,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:47,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:47,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:47,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:47,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:47,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:47,780 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:47,780 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:47,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:47,781 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:47,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:47,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:47,782 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:47,782 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:47,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:47,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:47,784 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:47,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:47,784 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:47,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:47,785 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:47,785 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:47,785 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:47,785 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:47,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:47,790 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:47,790 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:47,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:47,791 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:47,791 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:47,877 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:47,878 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:47,878 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:47,878 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 02:24:47,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:47,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:47,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2486 [2022-12-13 02:24:47,878 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:24:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:47,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1714549664, now seen corresponding path program 1 times [2022-12-13 02:24:47,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:47,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345995114] [2022-12-13 02:24:47,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:47,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:47,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:24:47,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:47,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345995114] [2022-12-13 02:24:47,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345995114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:47,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:47,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:47,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126929036] [2022-12-13 02:24:47,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:47,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:47,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:47,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:47,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:47,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:47,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:47,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:47,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:47,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:48,007 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:48,007 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:48,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:48,008 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:48,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:48,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:48,009 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:48,009 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:48,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:48,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:48,012 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,012 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:48,012 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:48,012 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:48,012 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:48,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:48,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:48,018 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:48,018 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:48,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:48,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:48,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:48,104 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:48,104 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:24:48,104 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:48,104 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 02:24:48,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:48,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:48,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2487 [2022-12-13 02:24:48,105 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:24:48,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1685920513, now seen corresponding path program 1 times [2022-12-13 02:24:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:48,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385658873] [2022-12-13 02:24:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:48,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:48,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385658873] [2022-12-13 02:24:48,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385658873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:48,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:48,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:48,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104283306] [2022-12-13 02:24:48,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:48,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:48,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:48,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:48,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:48,158 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:48,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:48,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:48,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:48,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:48,223 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:48,224 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:48,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:48,225 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:48,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:48,225 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:48,225 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:48,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:48,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:48,228 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,228 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:48,228 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:48,228 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:48,228 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,228 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:48,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:48,228 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:48,234 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:48,234 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:48,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:48,235 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:48,235 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:48,321 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:48,322 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:48,322 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:48,322 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 02:24:48,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:48,322 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:48,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2488 [2022-12-13 02:24:48,322 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:24:48,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:48,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1657291362, now seen corresponding path program 1 times [2022-12-13 02:24:48,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:48,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978740603] [2022-12-13 02:24:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:48,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:48,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:24:48,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:48,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978740603] [2022-12-13 02:24:48,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978740603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:48,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:48,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:48,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812103904] [2022-12-13 02:24:48,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:48,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:48,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:48,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:48,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:48,378 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:48,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:48,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:48,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:48,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:48,454 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:48,454 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:48,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:48,455 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:48,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:48,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:48,456 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:48,456 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:48,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:48,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:48,459 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,459 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:48,459 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:48,459 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:48,459 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,459 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:48,459 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:48,459 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:48,465 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:48,465 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:48,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:48,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:48,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:48,553 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:48,554 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:48,554 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:48,554 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 02:24:48,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:48,554 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:48,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2489 [2022-12-13 02:24:48,554 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:24:48,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:48,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1628662211, now seen corresponding path program 1 times [2022-12-13 02:24:48,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:48,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440484894] [2022-12-13 02:24:48,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:48,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:48,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:24:48,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:48,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440484894] [2022-12-13 02:24:48,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440484894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:48,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:48,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:48,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125831615] [2022-12-13 02:24:48,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:48,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:48,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:48,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:48,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:48,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:48,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:48,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:48,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:48,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:48,689 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:48,690 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:24:48,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:48,691 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:48,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:48,691 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:48,691 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:48,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:48,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:48,694 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,694 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:48,694 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:48,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:48,694 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,694 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:48,694 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:48,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:48,700 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:48,700 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:48,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:48,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:48,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:48,788 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:48,789 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:48,789 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:48,789 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 02:24:48,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:48,789 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:48,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2490 [2022-12-13 02:24:48,789 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:24:48,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:48,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1600033060, now seen corresponding path program 1 times [2022-12-13 02:24:48,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:48,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320431795] [2022-12-13 02:24:48,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:48,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:48,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:24:48,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:48,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320431795] [2022-12-13 02:24:48,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320431795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:48,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:48,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:48,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809760743] [2022-12-13 02:24:48,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:48,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:48,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:48,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:48,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:48,846 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:48,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:48,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:48,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:48,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:48,923 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:48,923 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:48,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:48,925 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:48,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:48,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:48,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:48,925 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:48,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:48,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:48,928 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,928 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:48,928 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:48,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:48,928 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,928 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:48,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:48,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:48,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:48,934 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:48,934 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:48,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:48,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:48,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:49,024 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:49,024 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:49,024 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:49,024 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 02:24:49,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:49,024 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:49,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2491 [2022-12-13 02:24:49,024 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:24:49,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:49,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1571403909, now seen corresponding path program 1 times [2022-12-13 02:24:49,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:49,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040413334] [2022-12-13 02:24:49,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:49,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:49,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:24:49,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:49,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040413334] [2022-12-13 02:24:49,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040413334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:49,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:49,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:49,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608320007] [2022-12-13 02:24:49,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:49,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:49,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:49,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:49,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:49,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:49,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:49,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:49,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:49,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:49,153 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:49,153 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:49,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:49,154 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:49,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:49,155 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:49,155 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:49,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:49,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:49,157 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:49,157 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:49,158 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:49,158 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:49,158 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:49,158 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:49,158 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:49,158 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:49,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:49,164 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:49,164 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:49,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:49,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:49,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:49,253 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:49,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:49,254 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:49,254 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 02:24:49,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:49,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:49,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2492 [2022-12-13 02:24:49,254 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:24:49,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:49,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1542774758, now seen corresponding path program 1 times [2022-12-13 02:24:49,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:49,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176351281] [2022-12-13 02:24:49,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:49,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:49,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:24:49,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:49,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176351281] [2022-12-13 02:24:49,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176351281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:49,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:49,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:49,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375185278] [2022-12-13 02:24:49,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:49,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:49,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:49,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:49,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:49,310 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:49,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:49,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:49,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:49,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:49,378 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:49,378 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:49,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:49,380 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:49,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:49,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:49,380 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:49,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:49,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:49,383 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:49,383 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:49,383 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:49,383 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:49,383 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:49,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:49,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:49,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:49,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:49,389 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:49,389 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:49,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:49,390 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:49,390 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:49,478 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:49,478 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:49,478 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:49,479 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 02:24:49,479 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:49,479 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:49,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2493 [2022-12-13 02:24:49,479 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:24:49,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:49,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1514145607, now seen corresponding path program 1 times [2022-12-13 02:24:49,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:49,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436174130] [2022-12-13 02:24:49,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:49,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24: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:24:49,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:49,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436174130] [2022-12-13 02:24:49,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436174130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:49,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:49,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:49,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027600219] [2022-12-13 02:24:49,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:49,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:49,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:49,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:49,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:49,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:49,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:49,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:49,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:49,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:49,627 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:49,627 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:49,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:49,628 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:49,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:49,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:49,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:49,629 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:49,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:49,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:49,631 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:49,631 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:49,632 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:49,632 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:49,632 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:49,632 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:49,632 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:49,632 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:49,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:49,638 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:49,638 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:49,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:49,638 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:49,638 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:49,727 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:49,727 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:49,727 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:49,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:49,727 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:49,727 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:49,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2494 [2022-12-13 02:24:49,728 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:24:49,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:49,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1485516456, now seen corresponding path program 1 times [2022-12-13 02:24:49,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:49,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334072428] [2022-12-13 02:24:49,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:49,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:49,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:24:49,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:49,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334072428] [2022-12-13 02:24:49,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334072428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:49,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:49,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:49,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417657337] [2022-12-13 02:24:49,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:49,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:49,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:49,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:49,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:49,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:49,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:49,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:49,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:49,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:49,855 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:49,856 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:49,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:49,857 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:49,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:49,857 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:49,857 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:49,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:49,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:49,860 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:49,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:49,860 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:49,860 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:49,860 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:49,860 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:49,860 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:49,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:49,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:49,866 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:49,866 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:49,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:49,867 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:49,867 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:49,955 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:49,956 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:49,956 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:49,956 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 02:24:49,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:49,956 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:49,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2495 [2022-12-13 02:24:49,956 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:24:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1456887305, now seen corresponding path program 1 times [2022-12-13 02:24:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:49,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092900969] [2022-12-13 02:24:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:50,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:24:50,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:50,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092900969] [2022-12-13 02:24:50,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092900969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:50,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:50,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:50,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29402607] [2022-12-13 02:24:50,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:50,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:50,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:50,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:50,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:50,069 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:50,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:50,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:50,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:50,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:50,177 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:50,178 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:50,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:50,179 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:50,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:50,179 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:50,179 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:50,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:50,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:50,182 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:50,182 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:50,182 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:50,182 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:50,182 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:50,182 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:50,182 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:50,182 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:50,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:50,188 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:50,188 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:50,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:50,189 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:50,189 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:50,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:50,277 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:50,277 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:50,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:50,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:50,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:50,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2496 [2022-12-13 02:24:50,278 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:24:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1428258154, now seen corresponding path program 1 times [2022-12-13 02:24:50,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:50,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49810710] [2022-12-13 02:24:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:50,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:50,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:24:50,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:50,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49810710] [2022-12-13 02:24:50,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49810710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:50,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:50,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:50,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707021080] [2022-12-13 02:24:50,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:50,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:50,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:50,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:50,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:50,329 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:50,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:50,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:50,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:50,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:50,396 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:50,396 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:50,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:50,398 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:50,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:50,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:50,398 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:50,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:50,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:50,401 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:50,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:50,401 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:50,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:50,402 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:50,402 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:50,402 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:50,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:50,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:50,408 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:50,408 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:50,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:50,408 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:50,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:50,497 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:50,497 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:50,497 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:50,497 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 02:24:50,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:50,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:50,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2497 [2022-12-13 02:24:50,497 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:24:50,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1399629003, now seen corresponding path program 1 times [2022-12-13 02:24:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:50,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146439336] [2022-12-13 02:24:50,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:50,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 02:24:50,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:50,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146439336] [2022-12-13 02:24:50,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146439336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:50,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:50,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:50,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887436453] [2022-12-13 02:24:50,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:50,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:50,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:50,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:50,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:50,567 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:50,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:50,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:50,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:50,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:50,644 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:50,644 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:50,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:50,645 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:50,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:50,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:50,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:50,645 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:50,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:50,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:50,648 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:50,648 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:50,648 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:50,649 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:50,649 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:50,649 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:50,649 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:50,649 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:50,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:50,655 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:50,655 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:24:50,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:50,655 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:50,655 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:50,743 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:50,743 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:50,743 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:50,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:50,743 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:50,743 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:50,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2498 [2022-12-13 02:24:50,743 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:24:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1370999852, now seen corresponding path program 1 times [2022-12-13 02:24:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:50,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656357062] [2022-12-13 02:24:50,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:50,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:50,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:24:50,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:50,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656357062] [2022-12-13 02:24:50,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656357062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:50,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:50,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158099560] [2022-12-13 02:24:50,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:50,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:50,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:50,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:50,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:50,814 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:50,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:50,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:50,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:50,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:50,890 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:50,890 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:50,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:50,892 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:50,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:50,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:50,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:50,892 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:50,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:50,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:50,895 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:50,895 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:50,895 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:50,895 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:50,895 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:50,895 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:50,895 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:50,895 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:50,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:50,901 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:50,901 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:50,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:50,902 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:50,902 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:50,995 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:50,995 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:24:50,995 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:50,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:50,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:50,996 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:50,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2499 [2022-12-13 02:24:50,996 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:24:50,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1342370701, now seen corresponding path program 1 times [2022-12-13 02:24:50,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:50,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107792191] [2022-12-13 02:24:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:51,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:24:51,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:51,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107792191] [2022-12-13 02:24:51,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107792191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:51,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:51,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:51,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532165528] [2022-12-13 02:24:51,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:51,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:51,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:51,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:51,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:51,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:51,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:51,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:51,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:51,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:51,146 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:51,147 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:51,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:51,148 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:51,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:51,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:51,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:51,148 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:51,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:51,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:51,151 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:51,151 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:51,151 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:51,151 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:51,151 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:51,151 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:51,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:51,152 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:51,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:51,157 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:51,157 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:51,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:51,158 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:51,158 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:51,246 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:51,246 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:51,246 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:51,246 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 02:24:51,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:51,247 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:51,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2500 [2022-12-13 02:24:51,247 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:24:51,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1313741550, now seen corresponding path program 1 times [2022-12-13 02:24:51,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:51,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977246982] [2022-12-13 02:24:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:51,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:24:51,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:51,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977246982] [2022-12-13 02:24:51,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977246982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:51,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:51,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:51,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838059554] [2022-12-13 02:24:51,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:51,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:51,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:51,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:51,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:51,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:51,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:51,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:51,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:51,393 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:51,393 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:51,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:51,394 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:51,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:51,394 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:51,394 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:51,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:51,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:51,397 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:51,397 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:51,397 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:51,397 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:51,397 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:51,397 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:51,397 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:51,397 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:51,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:51,403 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:51,403 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:51,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:51,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:51,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:51,491 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:51,491 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:51,491 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:51,492 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 02:24:51,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:51,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:51,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2501 [2022-12-13 02:24:51,492 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:24:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1285112399, now seen corresponding path program 1 times [2022-12-13 02:24:51,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:51,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021063677] [2022-12-13 02:24:51,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:51,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:51,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 02:24:51,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:51,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021063677] [2022-12-13 02:24:51,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021063677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:51,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:51,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854161000] [2022-12-13 02:24:51,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:51,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:51,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:51,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:51,548 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:51,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:51,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:51,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:51,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:51,623 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:51,623 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:51,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:51,624 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:51,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:51,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:51,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:51,625 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:51,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:51,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:51,627 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:51,627 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:51,628 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:51,628 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:51,628 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:51,628 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:51,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:51,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:51,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:51,634 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:51,634 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:51,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:51,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:51,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:51,722 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:51,723 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:51,723 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:51,723 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 02:24:51,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:51,723 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:51,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2502 [2022-12-13 02:24:51,723 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:24:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1256483248, now seen corresponding path program 1 times [2022-12-13 02:24:51,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:51,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495762748] [2022-12-13 02:24:51,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:51,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:51,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:24:51,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:51,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495762748] [2022-12-13 02:24:51,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495762748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:51,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:51,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:51,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986531859] [2022-12-13 02:24:51,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:51,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:51,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:51,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:51,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:51,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:51,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:51,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:51,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:51,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:51,846 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:51,847 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:51,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:51,848 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:51,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:51,848 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:51,848 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:51,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:51,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:51,851 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:51,851 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:51,851 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:51,851 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:51,851 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:51,851 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:51,851 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:51,852 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:51,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:51,857 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:51,857 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:51,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:51,858 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:51,858 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:51,945 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:51,945 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:51,946 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:51,946 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 02:24:51,946 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:51,946 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:51,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2503 [2022-12-13 02:24:51,946 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:24:51,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:51,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1227854097, now seen corresponding path program 1 times [2022-12-13 02:24:51,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:51,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980026887] [2022-12-13 02:24:51,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:51,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:51,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:24:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:51,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980026887] [2022-12-13 02:24:51,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980026887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:51,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:51,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:51,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313373720] [2022-12-13 02:24:51,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:51,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:51,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:51,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:51,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:51,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:51,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:51,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:51,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:51,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:52,075 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:52,075 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:52,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:52,076 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:52,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:52,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:52,076 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:52,076 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:52,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:52,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:52,079 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,079 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:52,079 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:52,079 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:52,079 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,080 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:52,080 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:52,080 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:52,085 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:52,085 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:52,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:52,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:52,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:52,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:52,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:24:52,177 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:52,177 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 02:24:52,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:52,177 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:52,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2504 [2022-12-13 02:24:52,177 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:24:52,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1199224946, now seen corresponding path program 1 times [2022-12-13 02:24:52,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:52,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577832529] [2022-12-13 02:24:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:52,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:24:52,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:52,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577832529] [2022-12-13 02:24:52,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577832529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:52,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:52,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:52,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981367365] [2022-12-13 02:24:52,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:52,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:52,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:52,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:52,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:52,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:52,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:52,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:52,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:52,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:52,308 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:52,309 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:52,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:52,310 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:52,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:52,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:52,310 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:52,310 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:52,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:52,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:52,313 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,313 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:52,313 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:52,313 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:52,313 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,313 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:52,313 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:52,313 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:52,319 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:52,319 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:52,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:52,320 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:52,320 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:52,411 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:52,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:24:52,411 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:52,411 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 02:24:52,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:52,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:52,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2505 [2022-12-13 02:24:52,411 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:24:52,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1170595795, now seen corresponding path program 1 times [2022-12-13 02:24:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:52,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805026222] [2022-12-13 02:24:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:52,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:52,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:24:52,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:52,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805026222] [2022-12-13 02:24:52,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805026222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:52,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:52,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:52,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069854982] [2022-12-13 02:24:52,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:52,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:52,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:52,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:52,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:52,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:52,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:52,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:52,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:52,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:52,531 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:52,531 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:52,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:52,532 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:52,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:52,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:52,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:52,533 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:52,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:52,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:52,535 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:52,536 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:52,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:52,536 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:52,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:52,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:52,541 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:52,542 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:52,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:52,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:52,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:52,631 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:52,632 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:52,632 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:52,632 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 02:24:52,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:52,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:52,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2506 [2022-12-13 02:24:52,632 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:24:52,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:52,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1141966644, now seen corresponding path program 1 times [2022-12-13 02:24:52,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:52,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164041139] [2022-12-13 02:24:52,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:52,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:52,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:24:52,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:52,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164041139] [2022-12-13 02:24:52,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164041139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:52,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:52,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:52,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153774698] [2022-12-13 02:24:52,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:52,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:52,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:52,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:52,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:52,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:52,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:52,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:52,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:52,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:52,764 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:52,764 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:52,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:52,765 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:52,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:52,765 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:52,766 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:52,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:52,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:52,768 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,768 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:52,768 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:52,769 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:52,769 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:52,769 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:52,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:52,774 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:52,774 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:52,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:52,775 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:52,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:52,863 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:52,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:52,864 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:52,864 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 02:24:52,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:52,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:52,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2507 [2022-12-13 02:24:52,864 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:24:52,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:52,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1113337493, now seen corresponding path program 1 times [2022-12-13 02:24:52,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:52,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5826328] [2022-12-13 02:24:52,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:52,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:52,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:24:52,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:52,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5826328] [2022-12-13 02:24:52,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5826328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:52,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:52,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:52,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137012195] [2022-12-13 02:24:52,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:52,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:52,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:52,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:52,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:52,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:52,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:52,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:52,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:52,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:52,990 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:52,991 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:52,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:52,992 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:52,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:52,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:52,992 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:52,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:52,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:52,995 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,995 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:52,995 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:52,995 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:52,995 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:52,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:52,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:52,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:53,001 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:53,001 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:53,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 465 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:53,002 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:53,002 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:53,089 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:53,090 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:53,090 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:53,090 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 02:24:53,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:53,090 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:53,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2508 [2022-12-13 02:24:53,090 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:24:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:53,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1084708342, now seen corresponding path program 1 times [2022-12-13 02:24:53,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:53,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199066812] [2022-12-13 02:24:53,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:53,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:53,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:24:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:53,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199066812] [2022-12-13 02:24:53,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199066812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:53,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:53,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:53,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450871023] [2022-12-13 02:24:53,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:53,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:53,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:53,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:53,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:53,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:53,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:53,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:53,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:53,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:53,211 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:53,211 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:53,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:53,212 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:53,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:53,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:53,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:53,213 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:53,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:53,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:53,215 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:53,215 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:53,216 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:53,216 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:53,216 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:53,216 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:53,216 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:53,216 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:53,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:53,221 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:53,222 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:53,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:53,222 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:53,222 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:53,310 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:53,311 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:53,311 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:53,311 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 02:24:53,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:53,311 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:53,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2509 [2022-12-13 02:24:53,311 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:24:53,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:53,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1056079191, now seen corresponding path program 1 times [2022-12-13 02:24:53,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:53,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359838220] [2022-12-13 02:24:53,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:53,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:53,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:24:53,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:53,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359838220] [2022-12-13 02:24:53,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359838220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:53,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:53,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:53,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504975119] [2022-12-13 02:24:53,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:53,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:53,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:53,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:53,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:53,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:53,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:53,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:53,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:53,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:53,442 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:53,443 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:53,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:53,444 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:53,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:53,444 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:53,444 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:53,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:53,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:53,447 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:53,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:53,447 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:53,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:53,447 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:53,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:53,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:53,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:53,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:53,453 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:53,453 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:53,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:53,454 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:53,454 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:53,542 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:53,543 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:53,543 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:53,543 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 02:24:53,543 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:53,543 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:53,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2510 [2022-12-13 02:24:53,543 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:24:53,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1027450040, now seen corresponding path program 1 times [2022-12-13 02:24:53,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:53,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080944725] [2022-12-13 02:24:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:53,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:53,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:24:53,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:53,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080944725] [2022-12-13 02:24:53,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080944725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:53,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:53,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:53,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141355768] [2022-12-13 02:24:53,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:53,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:53,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:53,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:53,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:53,614 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:53,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:53,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:53,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:53,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:53,682 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:53,682 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:53,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:53,683 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:53,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:53,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:53,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:53,684 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:53,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:53,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:53,686 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:53,686 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:53,686 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:53,686 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:53,686 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:53,687 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:53,687 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:53,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:53,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:53,692 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:53,692 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:53,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:53,693 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:53,693 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:53,781 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:53,782 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:53,782 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:53,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:53,782 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:53,782 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:53,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2511 [2022-12-13 02:24:53,782 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:24:53,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash -998820889, now seen corresponding path program 1 times [2022-12-13 02:24:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:53,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762110278] [2022-12-13 02:24:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:53,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:24:53,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:53,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762110278] [2022-12-13 02:24:53,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762110278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:53,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:53,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:53,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497607465] [2022-12-13 02:24:53,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:53,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:53,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:53,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:53,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:53,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:53,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:53,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:53,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:53,901 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:53,902 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:53,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:53,903 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:53,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:53,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:53,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:53,903 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:53,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:53,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:53,906 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:53,906 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:53,906 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:53,906 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:53,906 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:53,906 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:53,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:53,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:53,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:53,912 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:53,912 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:53,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:53,913 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:53,913 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:54,001 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:54,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:54,001 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:54,001 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 02:24:54,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:54,001 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:54,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2512 [2022-12-13 02:24:54,001 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:24:54,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash -970191738, now seen corresponding path program 1 times [2022-12-13 02:24:54,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:54,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928338255] [2022-12-13 02:24:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:54,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:54,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:24:54,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:54,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928338255] [2022-12-13 02:24:54,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928338255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:54,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:54,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:54,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707059919] [2022-12-13 02:24:54,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:54,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:54,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:54,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:54,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:54,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:54,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:54,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:54,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:54,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:54,133 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:54,133 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:54,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:54,134 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:54,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:54,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:54,135 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:54,135 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:54,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:54,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:54,137 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:54,138 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:54,138 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:54,138 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:54,138 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:54,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:54,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:54,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:54,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:54,144 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:54,144 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:54,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:54,144 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:54,144 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:54,236 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:54,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:24:54,236 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:54,237 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 02:24:54,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:54,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:54,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2513 [2022-12-13 02:24:54,237 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:24:54,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:54,237 INFO L85 PathProgramCache]: Analyzing trace with hash -941562587, now seen corresponding path program 1 times [2022-12-13 02:24:54,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:54,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848407523] [2022-12-13 02:24:54,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:54,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:54,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:24:54,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:54,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848407523] [2022-12-13 02:24:54,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848407523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:54,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:54,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:54,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042570278] [2022-12-13 02:24:54,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:54,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:54,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:54,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:54,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:54,288 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:54,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:54,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:54,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:54,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:54,365 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:54,366 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:54,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:54,367 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:54,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:54,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:54,367 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:54,367 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:54,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:54,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:54,370 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:54,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:54,370 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:54,370 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:54,370 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:54,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:54,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:54,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:54,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:54,376 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:54,376 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:54,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:54,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:54,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:54,465 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:54,466 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:54,466 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:54,466 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 02:24:54,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:54,466 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:54,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2514 [2022-12-13 02:24:54,466 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:24:54,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:54,466 INFO L85 PathProgramCache]: Analyzing trace with hash -912933436, now seen corresponding path program 1 times [2022-12-13 02:24:54,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:54,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995211086] [2022-12-13 02:24:54,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:54,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:54,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:24:54,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:54,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995211086] [2022-12-13 02:24:54,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995211086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:54,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:54,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:54,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627247692] [2022-12-13 02:24:54,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:54,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:54,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:54,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:54,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:54,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:54,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:54,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:54,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:54,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:54,634 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:54,634 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:54,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:54,635 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:54,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:54,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:54,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:54,636 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:54,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:54,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:54,638 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:54,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:54,638 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:54,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:54,638 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:54,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:54,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:54,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:54,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:54,644 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:54,644 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:54,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:54,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:54,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:54,734 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:54,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:24:54,735 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:54,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:54,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:54,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:54,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2515 [2022-12-13 02:24:54,735 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:24:54,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash -884304285, now seen corresponding path program 1 times [2022-12-13 02:24:54,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:54,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000468530] [2022-12-13 02:24:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:54,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:24:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:54,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000468530] [2022-12-13 02:24:54,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000468530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:54,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:54,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:54,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098253069] [2022-12-13 02:24:54,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:54,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:54,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:54,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:54,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:54,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:54,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:54,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:54,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:54,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:54,857 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:54,858 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:54,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:54,859 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:54,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:54,859 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:54,859 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:54,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:54,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:54,862 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:54,862 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:54,862 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:54,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:54,862 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:54,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:54,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:54,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:54,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:54,868 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:54,868 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:54,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:54,868 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:54,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:54,957 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:54,958 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:54,958 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:54,958 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 02:24:54,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:54,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:54,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2516 [2022-12-13 02:24:54,958 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:24:54,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:54,958 INFO L85 PathProgramCache]: Analyzing trace with hash -855675134, now seen corresponding path program 1 times [2022-12-13 02:24:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:54,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520255332] [2022-12-13 02:24:54,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:55,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:24:55,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:55,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520255332] [2022-12-13 02:24:55,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520255332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:55,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:55,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:55,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617004026] [2022-12-13 02:24:55,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:55,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:55,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:55,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:55,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:55,013 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:55,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:55,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:55,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:55,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:55,081 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:55,081 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:55,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:55,082 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:55,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:55,083 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:55,083 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:55,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:55,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:55,085 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:55,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:55,086 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:55,086 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:55,086 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:55,086 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:55,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:55,086 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:55,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:55,091 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:55,092 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:55,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:55,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:55,092 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:55,181 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:55,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:55,181 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:55,181 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 02:24:55,181 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:55,181 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:55,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2517 [2022-12-13 02:24:55,182 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:24:55,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash -827045983, now seen corresponding path program 1 times [2022-12-13 02:24:55,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:55,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546920315] [2022-12-13 02:24:55,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:55,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:55,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:24:55,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:55,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546920315] [2022-12-13 02:24:55,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546920315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:55,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:55,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631392831] [2022-12-13 02:24:55,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:55,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:55,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:55,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:55,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:55,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:55,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:55,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:55,329 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:55,329 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:55,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:55,331 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:55,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:55,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:55,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:55,331 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:55,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:55,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:55,334 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:55,334 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:55,334 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:55,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:55,334 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:55,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:55,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:55,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:55,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:55,340 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:55,340 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:55,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:55,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:55,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:55,427 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:55,428 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:55,428 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:55,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:55,428 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:55,428 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:55,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2518 [2022-12-13 02:24:55,428 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:24:55,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:55,428 INFO L85 PathProgramCache]: Analyzing trace with hash -798416832, now seen corresponding path program 1 times [2022-12-13 02:24:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:55,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100353212] [2022-12-13 02:24:55,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:55,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:24:55,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:55,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100353212] [2022-12-13 02:24:55,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100353212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:55,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:55,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:55,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616157266] [2022-12-13 02:24:55,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:55,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:55,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:55,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:55,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:55,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:55,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:55,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:55,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:55,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:55,559 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:55,559 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:55,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:55,560 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:55,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:55,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:55,561 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:55,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:55,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:55,563 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:55,563 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:55,564 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:55,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:55,564 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:55,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:55,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:55,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:55,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:55,570 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:55,570 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:55,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:55,570 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:55,570 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:55,659 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:55,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:55,659 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:55,659 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 02:24:55,660 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:55,660 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:55,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2519 [2022-12-13 02:24:55,660 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:24:55,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:55,660 INFO L85 PathProgramCache]: Analyzing trace with hash -769787681, now seen corresponding path program 1 times [2022-12-13 02:24:55,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:55,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264649288] [2022-12-13 02:24:55,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:55,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24: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:24:55,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:55,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264649288] [2022-12-13 02:24:55,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264649288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:55,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:55,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:55,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508336898] [2022-12-13 02:24:55,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:55,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:55,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:55,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:55,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:55,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:55,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:55,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:55,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:55,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:55,806 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:55,806 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:55,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:55,807 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:55,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:55,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:55,808 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:55,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:55,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:55,810 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:55,810 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:55,810 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:55,810 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:55,810 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:55,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:55,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:55,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:55,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:55,816 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:55,816 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:24:55,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:55,817 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:55,817 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:55,903 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:55,904 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:55,904 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:55,904 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 02:24:55,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:55,904 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:55,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2520 [2022-12-13 02:24:55,904 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:24:55,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:55,904 INFO L85 PathProgramCache]: Analyzing trace with hash -741158530, now seen corresponding path program 1 times [2022-12-13 02:24:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:55,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352690079] [2022-12-13 02:24:55,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:55,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:55,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:24:55,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:55,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352690079] [2022-12-13 02:24:55,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352690079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:55,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:55,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:55,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751278411] [2022-12-13 02:24:55,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:55,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:55,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:55,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:55,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:55,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:55,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:55,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:55,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:55,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:56,032 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:56,033 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:56,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:56,034 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:56,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:56,034 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:56,034 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:56,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:56,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:56,037 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,037 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:56,037 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:56,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:56,037 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,038 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:56,038 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:56,038 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:56,044 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:56,044 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:56,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:56,045 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:56,045 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:56,135 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:56,135 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:24:56,136 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:56,136 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 02:24:56,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:56,136 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:56,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2521 [2022-12-13 02:24:56,136 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:24:56,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:56,136 INFO L85 PathProgramCache]: Analyzing trace with hash -712529379, now seen corresponding path program 1 times [2022-12-13 02:24:56,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:56,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796145703] [2022-12-13 02:24:56,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:56,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:56,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:24:56,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:56,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796145703] [2022-12-13 02:24:56,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796145703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:56,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:56,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:56,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496186129] [2022-12-13 02:24:56,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:56,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:56,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:56,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:56,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:56,194 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:56,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:56,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:56,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:56,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:56,260 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:56,260 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:56,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:56,261 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:56,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:56,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:56,261 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:56,262 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:56,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:56,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:56,264 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,264 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:56,264 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:56,264 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:56,264 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,264 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:56,265 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:56,265 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:56,270 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:56,270 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:56,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:56,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:56,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:56,358 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:56,359 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:56,359 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:56,359 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 02:24:56,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:56,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:56,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2522 [2022-12-13 02:24:56,359 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:24:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash -683900228, now seen corresponding path program 1 times [2022-12-13 02:24:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:56,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378409120] [2022-12-13 02:24:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:56,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:56,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:24:56,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:56,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378409120] [2022-12-13 02:24:56,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378409120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:56,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:56,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:56,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553607703] [2022-12-13 02:24:56,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:56,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:56,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:56,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:56,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:56,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:56,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:56,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:56,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:56,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:56,515 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:56,515 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:56,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:56,516 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:56,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:56,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:56,517 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:56,517 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:56,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:56,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:56,519 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,520 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:56,520 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:56,520 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:56,520 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,520 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:56,520 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:56,520 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:56,526 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:56,526 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:56,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:56,526 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:56,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:56,613 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:56,613 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:56,613 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:56,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:56,613 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:56,613 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:56,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2523 [2022-12-13 02:24:56,614 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:24:56,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:56,614 INFO L85 PathProgramCache]: Analyzing trace with hash -655271077, now seen corresponding path program 1 times [2022-12-13 02:24:56,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:56,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020090845] [2022-12-13 02:24:56,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:56,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:56,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:24:56,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:56,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020090845] [2022-12-13 02:24:56,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020090845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:56,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:56,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563141751] [2022-12-13 02:24:56,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:56,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:56,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:56,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:56,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:56,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:56,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:56,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:56,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:56,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:56,734 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:56,734 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:56,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:56,735 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:56,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:56,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:56,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:56,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:56,736 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:56,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:56,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:56,738 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,738 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:56,739 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:56,739 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:56,739 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:56,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:56,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:56,745 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:56,745 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:24:56,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:56,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:56,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:56,833 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:56,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:56,834 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:56,834 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 02:24:56,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:56,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:56,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2524 [2022-12-13 02:24:56,834 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:24:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:56,834 INFO L85 PathProgramCache]: Analyzing trace with hash -626641926, now seen corresponding path program 1 times [2022-12-13 02:24:56,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:56,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420837480] [2022-12-13 02:24:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:56,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:56,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:24:56,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:56,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420837480] [2022-12-13 02:24:56,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420837480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:56,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:56,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:56,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897288543] [2022-12-13 02:24:56,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:56,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:56,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:56,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:56,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:56,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:56,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:56,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:56,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:56,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:56,962 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:56,962 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:56,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:56,963 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:56,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:56,964 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:56,964 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:56,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:56,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:56,967 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,967 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:56,967 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:56,967 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:56,967 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,976 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:56,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:56,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:56,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:56,982 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:56,982 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:56,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:56,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:56,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:57,071 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:57,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:24:57,071 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:57,071 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 02:24:57,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:57,072 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:57,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2525 [2022-12-13 02:24:57,072 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:24:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash -598012775, now seen corresponding path program 1 times [2022-12-13 02:24:57,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:57,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949611739] [2022-12-13 02:24:57,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:57,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:57,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:24:57,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:57,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949611739] [2022-12-13 02:24:57,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949611739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:57,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:57,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:57,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064223290] [2022-12-13 02:24:57,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:57,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:57,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:57,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:57,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:57,125 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:57,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:57,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:57,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:57,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:57,200 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:57,200 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:57,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:57,202 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:57,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:57,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:57,202 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:57,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:57,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:57,205 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:57,205 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:57,205 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:57,205 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:57,205 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:57,205 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:57,205 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:57,205 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:57,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:57,211 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:57,211 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:57,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:57,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:57,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:57,298 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:57,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:57,299 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:57,299 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 02:24:57,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:57,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:57,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2526 [2022-12-13 02:24:57,299 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:24:57,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:57,299 INFO L85 PathProgramCache]: Analyzing trace with hash -569383624, now seen corresponding path program 1 times [2022-12-13 02:24:57,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:57,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476424018] [2022-12-13 02:24:57,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:57,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:57,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:24:57,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:57,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476424018] [2022-12-13 02:24:57,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476424018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:57,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:57,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:57,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75569653] [2022-12-13 02:24:57,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:57,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:57,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:57,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:57,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:57,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:57,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:57,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:57,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:57,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:57,427 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:57,427 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:57,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:57,428 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:57,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:57,428 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:57,428 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:57,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:57,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:57,431 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:57,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:57,431 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:57,431 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:57,431 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:57,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:57,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:57,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:57,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:57,437 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:57,437 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:57,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:57,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:57,437 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:57,525 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:57,525 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:57,526 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:57,526 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 02:24:57,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:57,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:57,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2527 [2022-12-13 02:24:57,526 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:24:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash -540754473, now seen corresponding path program 1 times [2022-12-13 02:24:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:57,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215291400] [2022-12-13 02:24:57,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:57,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:57,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 02:24:57,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:57,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215291400] [2022-12-13 02:24:57,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215291400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:57,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:57,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:57,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309345961] [2022-12-13 02:24:57,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:57,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:57,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:57,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:57,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:57,597 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:57,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:57,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:57,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:57,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:57,671 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:57,672 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:57,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:57,673 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:57,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:57,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:57,673 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:57,673 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:57,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:57,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:57,676 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:57,676 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:57,676 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:57,676 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:57,676 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:57,676 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:57,676 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:57,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:57,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:57,682 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:57,682 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:57,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:57,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:57,683 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:57,770 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:57,771 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:57,771 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:57,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:57,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:57,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:57,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2528 [2022-12-13 02:24:57,771 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:24:57,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:57,771 INFO L85 PathProgramCache]: Analyzing trace with hash -512125322, now seen corresponding path program 1 times [2022-12-13 02:24:57,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:57,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108016786] [2022-12-13 02:24:57,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:57,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:57,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:57,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108016786] [2022-12-13 02:24:57,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108016786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:57,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:57,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:57,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817582245] [2022-12-13 02:24:57,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:57,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:57,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:57,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:57,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:57,826 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:57,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:57,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:57,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:57,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:57,891 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:57,891 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:57,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:57,892 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:57,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:57,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:57,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:57,893 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:57,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:57,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:57,895 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:57,895 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:57,896 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:57,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:57,896 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:57,896 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:57,896 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:57,896 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:57,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:57,901 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:57,901 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:24:57,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:57,902 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:57,902 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:57,989 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:57,989 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:24:57,990 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:57,990 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 02:24:57,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:57,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:57,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2529 [2022-12-13 02:24:57,990 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:24:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash -483496171, now seen corresponding path program 1 times [2022-12-13 02:24:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:57,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741825521] [2022-12-13 02:24:57,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:57,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:58,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:24:58,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:58,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741825521] [2022-12-13 02:24:58,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741825521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:58,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:58,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:58,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533261521] [2022-12-13 02:24:58,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:58,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:58,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:58,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:58,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:58,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:58,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:58,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:58,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:58,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:58,110 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:58,110 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:24:58,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1126 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:58,111 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:58,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:58,112 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:58,112 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:58,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:58,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:58,114 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:58,114 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:58,114 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:58,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:58,115 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:58,115 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:58,115 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:58,115 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:58,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:58,130 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:58,131 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:24:58,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:58,131 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:58,131 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:58,218 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:58,218 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:24:58,218 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:58,218 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 02:24:58,218 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:58,218 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:58,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2530 [2022-12-13 02:24:58,219 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:24:58,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash -454867020, now seen corresponding path program 1 times [2022-12-13 02:24:58,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:58,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872394030] [2022-12-13 02:24:58,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:58,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:58,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:24:58,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:58,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872394030] [2022-12-13 02:24:58,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872394030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:58,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:58,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:58,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410407714] [2022-12-13 02:24:58,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:58,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:58,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:58,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:58,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:58,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:58,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:58,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:58,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:58,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:58,340 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:58,340 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:58,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:58,341 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:58,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:58,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:58,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:58,341 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:58,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:58,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:58,344 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:58,344 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:58,344 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:58,344 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:58,344 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:58,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:58,345 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:58,345 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:58,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:58,350 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:58,350 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:58,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:58,351 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:58,351 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:58,438 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:58,439 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:58,439 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:58,439 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 02:24:58,439 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:58,439 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:58,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2531 [2022-12-13 02:24:58,439 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:24:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:58,439 INFO L85 PathProgramCache]: Analyzing trace with hash -426237869, now seen corresponding path program 1 times [2022-12-13 02:24:58,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:58,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573995457] [2022-12-13 02:24:58,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:58,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:58,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:24:58,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:58,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573995457] [2022-12-13 02:24:58,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573995457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:58,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:58,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:24:58,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096147148] [2022-12-13 02:24:58,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:58,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:24:58,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:58,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:24:58,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:24:58,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:58,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:58,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:58,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:58,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:58,583 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:58,584 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:58,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:58,585 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:58,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:58,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:58,585 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:58,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:58,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:58,588 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:58,588 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:58,588 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:58,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:58,588 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:58,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:58,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:58,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:58,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:58,594 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:58,594 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:24:58,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:58,594 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:58,595 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:58,682 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:58,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:58,683 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:58,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:24:58,683 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:58,683 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:58,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2532 [2022-12-13 02:24:58,683 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:24:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash -397608718, now seen corresponding path program 1 times [2022-12-13 02:24:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:58,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124623505] [2022-12-13 02:24:58,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:58,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:58,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:24:58,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:58,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124623505] [2022-12-13 02:24:58,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124623505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:58,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:58,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:58,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237456511] [2022-12-13 02:24:58,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:58,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:58,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:58,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:58,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:58,736 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:58,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:58,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:58,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:58,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:58,801 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:58,801 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:58,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:58,803 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:58,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:58,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:58,803 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:58,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:58,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:58,806 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:58,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:58,806 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:58,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:58,806 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:58,806 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:58,806 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:58,806 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:58,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:58,812 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:58,812 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:24:58,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:58,813 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:58,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:58,900 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:58,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:24:58,900 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:58,900 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 02:24:58,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:58,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:58,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2533 [2022-12-13 02:24:58,901 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:24:58,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:58,901 INFO L85 PathProgramCache]: Analyzing trace with hash -368979567, now seen corresponding path program 1 times [2022-12-13 02:24:58,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:58,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106903892] [2022-12-13 02:24:58,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:58,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:58,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:24:58,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:58,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106903892] [2022-12-13 02:24:58,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106903892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:58,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:58,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:58,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685897075] [2022-12-13 02:24:58,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:58,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:58,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:58,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:58,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:58,956 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:58,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:58,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:58,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:58,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:59,031 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:59,032 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:59,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:59,033 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:59,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:59,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:59,033 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:59,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:59,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:59,036 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,036 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:59,036 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:59,036 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:59,036 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,037 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:59,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:59,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:59,042 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:59,042 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:59,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:59,043 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:59,043 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:59,131 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:59,132 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:24:59,132 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:59,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 02:24:59,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:59,132 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:59,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2534 [2022-12-13 02:24:59,132 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:24:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash -340350416, now seen corresponding path program 1 times [2022-12-13 02:24:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:59,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426262177] [2022-12-13 02:24:59,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:59,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:59,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 02:24:59,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:59,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426262177] [2022-12-13 02:24:59,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426262177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:59,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:59,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:59,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249841144] [2022-12-13 02:24:59,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:59,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:59,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:59,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:59,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:59,186 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:59,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:59,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:59,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:59,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:59,251 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:59,252 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:59,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:59,253 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:59,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:59,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:59,253 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:59,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:59,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:59,256 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,256 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:59,256 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:59,256 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:59,256 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:59,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:59,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:59,262 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:59,262 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:59,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:59,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:59,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:59,361 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:59,362 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:24:59,362 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:59,362 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 02:24:59,362 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:59,362 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:59,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2535 [2022-12-13 02:24:59,362 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:24:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:59,362 INFO L85 PathProgramCache]: Analyzing trace with hash -311721265, now seen corresponding path program 1 times [2022-12-13 02:24:59,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:59,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058966353] [2022-12-13 02:24:59,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:59,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:59,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:24:59,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:59,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058966353] [2022-12-13 02:24:59,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058966353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:59,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:59,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:59,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336214860] [2022-12-13 02:24:59,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:59,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:59,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:59,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:59,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:59,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:59,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:59,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:59,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:59,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:59,494 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:59,494 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:24:59,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:59,495 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:59,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:59,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:59,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:59,496 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:59,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:59,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:59,498 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:59,498 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:59,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:59,498 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:59,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:59,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:59,504 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:59,504 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:24:59,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:59,505 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:59,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:59,599 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:59,600 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:24:59,600 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:59,600 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 02:24:59,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:59,600 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:59,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2536 [2022-12-13 02:24:59,600 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:24:59,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash -283092114, now seen corresponding path program 1 times [2022-12-13 02:24:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:59,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321954580] [2022-12-13 02:24:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:59,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:59,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:24:59,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:59,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321954580] [2022-12-13 02:24:59,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321954580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:59,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:59,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709517349] [2022-12-13 02:24:59,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:59,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:59,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:59,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:59,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:59,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:59,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:59,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:59,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:59,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:59,719 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:59,719 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:59,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:59,720 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:59,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:59,721 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:59,721 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:59,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:59,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:59,724 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,724 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:59,724 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:59,724 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:59,724 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,724 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:59,724 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:59,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:59,730 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:59,730 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:24:59,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:59,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:59,730 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:24:59,818 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:24:59,819 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:24:59,819 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:24:59,819 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 02:24:59,819 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:59,819 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:59,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2537 [2022-12-13 02:24:59,819 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:24:59,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash -254462963, now seen corresponding path program 1 times [2022-12-13 02:24:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:59,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515721451] [2022-12-13 02:24:59,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:59,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:24:59,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:59,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515721451] [2022-12-13 02:24:59,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515721451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:24:59,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:24:59,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:24:59,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845382686] [2022-12-13 02:24:59,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:24:59,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:24:59,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:59,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:24:59,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:24:59,871 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:24:59,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:24:59,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:59,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:24:59,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:59,937 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:24:59,938 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:24:59,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:24:59,939 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:24:59,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:24:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:24:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:24:59,939 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:24:59,939 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:24:59,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:24:59,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:59,942 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,942 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:24:59,942 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:24:59,942 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:59,943 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,943 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:59,943 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:59,943 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:24:59,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:59,949 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:24:59,949 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:24:59,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:24:59,950 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:24:59,950 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:00,037 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:00,038 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:00,038 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:00,038 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 02:25:00,038 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:00,038 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:00,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2538 [2022-12-13 02:25:00,038 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:25:00,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:00,038 INFO L85 PathProgramCache]: Analyzing trace with hash -225833812, now seen corresponding path program 1 times [2022-12-13 02:25:00,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:00,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246945895] [2022-12-13 02:25:00,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:00,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:00,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:25:00,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:00,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246945895] [2022-12-13 02:25:00,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246945895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:00,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:00,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:00,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611862615] [2022-12-13 02:25:00,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:00,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:00,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:00,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:00,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:00,092 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:00,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:00,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:00,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:00,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:00,159 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:00,159 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:00,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:00,160 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:00,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:00,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:00,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:00,161 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:00,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:00,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:00,163 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:00,163 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:00,163 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:00,164 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:00,164 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:00,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:00,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:00,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:00,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:00,169 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:00,169 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:00,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:00,170 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:00,170 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:00,259 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:00,259 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:00,259 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:00,259 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 02:25:00,259 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:00,259 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:00,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2539 [2022-12-13 02:25:00,260 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:25:00,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:00,260 INFO L85 PathProgramCache]: Analyzing trace with hash -197204661, now seen corresponding path program 1 times [2022-12-13 02:25:00,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:00,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676729476] [2022-12-13 02:25:00,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:00,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:00,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:25:00,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:00,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676729476] [2022-12-13 02:25:00,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676729476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:00,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:00,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:00,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060403861] [2022-12-13 02:25:00,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:00,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:00,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:00,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:00,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:00,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:00,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:00,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:00,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:00,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:00,417 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:00,417 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:00,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:00,418 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:00,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:00,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:00,419 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:00,419 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:00,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:00,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:00,422 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:00,422 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:00,422 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:00,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:00,422 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:00,422 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:00,422 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:00,422 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:00,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:00,428 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:00,428 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:00,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:00,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:00,429 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:00,529 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:00,530 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:25:00,530 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:00,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:00,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:00,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:00,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2540 [2022-12-13 02:25:00,530 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:25:00,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash -168575510, now seen corresponding path program 1 times [2022-12-13 02:25:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:00,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510487716] [2022-12-13 02:25:00,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:00,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25: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:25:00,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:00,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510487716] [2022-12-13 02:25:00,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510487716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:00,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:00,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:00,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243953900] [2022-12-13 02:25:00,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:00,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:00,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:00,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:00,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:00,601 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:00,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:00,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:00,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:00,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:00,679 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:00,679 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:00,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:00,680 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:00,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:00,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:00,681 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:00,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:00,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:00,683 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:00,684 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:00,684 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:00,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:00,684 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:00,684 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:00,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:00,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:00,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:00,690 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:00,690 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:00,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:00,690 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:00,690 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:00,778 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:00,779 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:00,779 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:00,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:00,779 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:00,779 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:00,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2541 [2022-12-13 02:25:00,779 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:25:00,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:00,780 INFO L85 PathProgramCache]: Analyzing trace with hash -139946359, now seen corresponding path program 1 times [2022-12-13 02:25:00,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:00,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156298960] [2022-12-13 02:25:00,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:00,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:00,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:25:00,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:00,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156298960] [2022-12-13 02:25:00,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156298960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:00,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:00,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:00,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295685870] [2022-12-13 02:25:00,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:00,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:00,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:00,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:00,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:00,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:00,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:00,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:00,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:00,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:00,934 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:00,934 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:00,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:00,935 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:00,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:00,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:00,936 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:00,936 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:00,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:00,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:00,938 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:00,939 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:00,939 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:00,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:00,939 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:00,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:00,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:00,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:00,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:00,945 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:00,945 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:25:00,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:00,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:00,945 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:01,033 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:01,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:01,033 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:01,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:01,033 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:01,034 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:01,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2542 [2022-12-13 02:25:01,034 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:25:01,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:01,034 INFO L85 PathProgramCache]: Analyzing trace with hash -111317208, now seen corresponding path program 1 times [2022-12-13 02:25:01,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:01,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388511500] [2022-12-13 02:25:01,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:01,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:01,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:25:01,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:01,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388511500] [2022-12-13 02:25:01,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388511500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:01,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:01,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:01,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736572854] [2022-12-13 02:25:01,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:01,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:01,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:01,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:01,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:01,104 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:01,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:01,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:01,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:01,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:01,179 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:01,179 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:25:01,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:01,180 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:01,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:01,180 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:01,180 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:01,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:01,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:01,183 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:01,183 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:01,183 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:01,183 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:01,183 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:01,183 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:01,183 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:01,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:01,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:01,189 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:01,189 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:01,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:01,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:01,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:01,276 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:01,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:01,276 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:01,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:01,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:01,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:01,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2543 [2022-12-13 02:25:01,276 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:25:01,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash -82688057, now seen corresponding path program 1 times [2022-12-13 02:25:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:01,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276227343] [2022-12-13 02:25:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:01,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:25:01,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:01,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276227343] [2022-12-13 02:25:01,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276227343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:01,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:01,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:01,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718201261] [2022-12-13 02:25:01,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:01,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:01,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:01,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:01,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:01,329 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:01,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:01,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:01,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:01,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:01,396 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:01,396 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:01,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:01,397 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:01,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:01,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:01,398 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:01,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:01,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:01,400 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:01,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:01,401 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:01,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:01,401 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:01,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:01,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:01,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:01,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:01,406 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:01,406 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:01,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:01,407 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:01,407 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:01,495 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:01,495 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:01,495 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:01,496 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 02:25:01,496 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:01,496 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:01,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2544 [2022-12-13 02:25:01,496 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:25:01,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:01,496 INFO L85 PathProgramCache]: Analyzing trace with hash -54058906, now seen corresponding path program 1 times [2022-12-13 02:25:01,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:01,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754378123] [2022-12-13 02:25:01,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:01,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:01,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:25:01,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:01,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754378123] [2022-12-13 02:25:01,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754378123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:01,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:01,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:01,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865399117] [2022-12-13 02:25:01,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:01,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:01,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:01,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:01,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:01,568 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:01,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:01,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:01,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:01,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:01,655 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:01,655 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:01,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:01,656 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:01,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:01,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:01,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:01,659 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:01,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:01,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:01,663 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:01,663 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:01,663 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:01,663 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:01,663 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:01,664 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:01,664 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:01,664 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:01,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:01,671 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:01,671 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:01,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:01,672 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:01,672 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:01,769 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:01,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:25:01,769 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:01,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:01,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:01,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:01,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2545 [2022-12-13 02:25:01,770 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:25:01,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:01,770 INFO L85 PathProgramCache]: Analyzing trace with hash -25429755, now seen corresponding path program 1 times [2022-12-13 02:25:01,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:01,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413923055] [2022-12-13 02:25:01,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:01,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:01,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413923055] [2022-12-13 02:25:01,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413923055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:01,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:01,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:01,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687367554] [2022-12-13 02:25:01,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:01,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:01,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:01,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:01,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:01,826 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:01,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:01,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:01,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:01,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:01,892 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:01,892 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:01,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:01,893 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:01,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:01,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:01,894 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:01,894 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:01,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:01,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:01,896 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:01,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:01,896 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:01,897 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:01,897 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:01,897 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:01,897 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:01,897 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:01,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:01,902 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:01,902 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:01,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:01,903 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:01,903 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:01,990 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:01,991 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:01,991 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:01,991 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 02:25:01,991 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:01,991 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:01,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2546 [2022-12-13 02:25:01,991 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:25:01,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:01,991 INFO L85 PathProgramCache]: Analyzing trace with hash 3199396, now seen corresponding path program 1 times [2022-12-13 02:25:01,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:01,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059273141] [2022-12-13 02:25:01,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:02,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:25:02,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:02,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059273141] [2022-12-13 02:25:02,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059273141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:02,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:02,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:02,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072499437] [2022-12-13 02:25:02,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:02,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:02,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:02,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:02,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:02,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:02,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:02,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:02,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:02,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:02,130 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:02,130 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:02,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:02,131 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:02,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:02,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:02,132 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:02,132 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:02,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:02,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:02,134 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:02,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:02,135 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:02,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:02,135 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:02,135 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:02,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:02,135 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:02,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:02,140 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:02,141 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:02,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:02,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:02,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:02,229 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:02,230 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:02,230 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:02,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:02,230 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:02,230 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:02,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2547 [2022-12-13 02:25:02,230 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:25:02,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:02,230 INFO L85 PathProgramCache]: Analyzing trace with hash 31828547, now seen corresponding path program 1 times [2022-12-13 02:25:02,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:02,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178124317] [2022-12-13 02:25:02,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:02,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:02,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:25:02,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:02,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178124317] [2022-12-13 02:25:02,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178124317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:02,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:02,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:02,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504878783] [2022-12-13 02:25:02,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:02,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:02,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:02,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:02,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:02,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:02,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:02,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:02,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:02,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:02,347 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:02,348 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:02,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:02,349 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:02,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:02,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:02,349 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:02,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:02,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:02,352 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:02,352 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:02,352 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:02,352 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:02,352 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:02,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:02,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:02,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:02,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:02,358 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:02,358 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:02,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:02,358 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:02,358 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:02,444 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:02,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:25:02,444 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:02,444 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 02:25:02,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:02,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:02,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2548 [2022-12-13 02:25:02,445 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:25:02,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:02,445 INFO L85 PathProgramCache]: Analyzing trace with hash 60457698, now seen corresponding path program 1 times [2022-12-13 02:25:02,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:02,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436196556] [2022-12-13 02:25:02,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:02,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:02,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:25:02,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:02,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436196556] [2022-12-13 02:25:02,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436196556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:02,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:02,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:02,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736863301] [2022-12-13 02:25:02,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:02,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:02,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:02,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:02,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:02,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:02,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:02,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:02,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:02,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:02,575 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:02,575 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:02,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:02,576 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:02,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:02,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:02,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:02,576 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:02,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:02,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:02,579 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:02,579 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:02,579 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:02,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:02,579 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:02,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:02,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:02,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:02,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:02,585 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:02,585 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:02,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:02,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:02,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:02,672 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:02,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:02,673 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:02,673 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 02:25:02,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:02,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:02,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2549 [2022-12-13 02:25:02,673 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:25:02,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:02,673 INFO L85 PathProgramCache]: Analyzing trace with hash 89086849, now seen corresponding path program 1 times [2022-12-13 02:25:02,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:02,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305996053] [2022-12-13 02:25:02,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:02,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:02,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:25:02,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:02,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305996053] [2022-12-13 02:25:02,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305996053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:02,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:02,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:02,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717682446] [2022-12-13 02:25:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:02,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:02,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:02,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:02,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:02,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:02,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:02,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:02,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:02,793 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:02,793 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:02,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:02,805 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:02,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:02,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:02,805 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:02,805 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:02,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:02,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:02,808 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:02,808 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:02,808 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:02,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:02,808 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:02,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:02,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:02,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:02,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:02,814 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:02,814 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:02,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:02,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:02,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:02,901 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:02,901 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:02,901 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:02,901 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 02:25:02,901 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:02,902 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:02,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2550 [2022-12-13 02:25:02,902 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:25:02,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash 117716000, now seen corresponding path program 1 times [2022-12-13 02:25:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:02,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429602965] [2022-12-13 02:25:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:02,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:02,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:25:02,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:02,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429602965] [2022-12-13 02:25:02,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429602965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:02,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:02,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:02,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769000081] [2022-12-13 02:25:02,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:02,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:02,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:02,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:02,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:02,957 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:02,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:02,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:02,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:02,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:03,023 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:03,023 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:03,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:03,024 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:03,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:03,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:03,025 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:03,025 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:03,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:03,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:03,027 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,028 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:03,028 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:03,028 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:03,028 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:03,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:03,028 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:03,034 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:03,034 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:03,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:03,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:03,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:03,120 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:03,121 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:03,121 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:03,121 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 02:25:03,121 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:03,121 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:03,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2551 [2022-12-13 02:25:03,121 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:25:03,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:03,121 INFO L85 PathProgramCache]: Analyzing trace with hash 146345151, now seen corresponding path program 1 times [2022-12-13 02:25:03,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:03,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666777437] [2022-12-13 02:25:03,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:03,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:03,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:25:03,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:03,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666777437] [2022-12-13 02:25:03,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666777437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:03,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:03,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:03,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787409549] [2022-12-13 02:25:03,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:03,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:03,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:03,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:03,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:03,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:03,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:03,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:03,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:03,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:03,259 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:03,260 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:03,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:03,261 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:03,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:03,261 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:03,261 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:03,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:03,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:03,264 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,264 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:03,264 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:03,264 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:03,264 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,264 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:03,264 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:03,264 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:03,270 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:03,270 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:03,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:03,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:03,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:03,357 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:03,358 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:03,358 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:03,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:03,358 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:03,358 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:03,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2552 [2022-12-13 02:25:03,358 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:25:03,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:03,358 INFO L85 PathProgramCache]: Analyzing trace with hash 174974302, now seen corresponding path program 1 times [2022-12-13 02:25:03,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:03,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443191076] [2022-12-13 02:25:03,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:03,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:03,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:25:03,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:03,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443191076] [2022-12-13 02:25:03,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443191076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:03,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:03,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:03,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524371638] [2022-12-13 02:25:03,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:03,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:03,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:03,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:03,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:03,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:03,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:03,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:03,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:03,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:03,502 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:03,502 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:03,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:03,503 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:03,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:03,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:03,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:03,504 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:03,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:03,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:03,506 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,506 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:03,506 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:03,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:03,507 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,507 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:03,507 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:03,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:03,512 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:03,513 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:03,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:03,513 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:03,513 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:03,599 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:03,600 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:03,600 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:03,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:03,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:03,600 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:03,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2553 [2022-12-13 02:25:03,600 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:25:03,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:03,600 INFO L85 PathProgramCache]: Analyzing trace with hash 203603453, now seen corresponding path program 1 times [2022-12-13 02:25:03,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:03,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459038791] [2022-12-13 02:25:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:03,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:03,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:25:03,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:03,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459038791] [2022-12-13 02:25:03,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459038791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:03,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:03,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:03,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808119747] [2022-12-13 02:25:03,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:03,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:03,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:03,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:03,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:03,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:03,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:03,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:03,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:03,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:03,722 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:03,722 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:03,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:03,723 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:03,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:03,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:03,724 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:03,724 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:03,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:03,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:03,726 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,726 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:03,727 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:03,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:03,727 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:03,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:03,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:03,733 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:03,733 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:03,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:03,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:03,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:03,820 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:03,820 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:03,820 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:03,821 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 02:25:03,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:03,821 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:03,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2554 [2022-12-13 02:25:03,821 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:25:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash 232232604, now seen corresponding path program 1 times [2022-12-13 02:25:03,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:03,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419471890] [2022-12-13 02:25:03,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:03,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:03,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 02:25:03,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:03,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419471890] [2022-12-13 02:25:03,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419471890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:03,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:03,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144499748] [2022-12-13 02:25:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:03,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:03,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:03,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:03,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:03,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:03,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:03,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:03,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:03,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:03,952 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:03,952 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:03,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:03,953 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:03,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:03,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:03,953 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:03,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:03,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:03,956 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,956 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:03,956 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:03,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:03,956 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,956 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:03,956 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:03,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:03,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:03,962 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:03,962 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:03,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:03,963 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:03,963 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:04,051 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:04,051 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:04,051 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:04,051 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 02:25:04,052 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:04,052 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:04,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2555 [2022-12-13 02:25:04,052 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:25:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash 260861755, now seen corresponding path program 1 times [2022-12-13 02:25:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:04,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778229016] [2022-12-13 02:25:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:04,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:04,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:25:04,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:04,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778229016] [2022-12-13 02:25:04,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778229016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:04,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:04,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:04,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289659831] [2022-12-13 02:25:04,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:04,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:04,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:04,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:04,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:04,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:04,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:04,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:04,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:04,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:04,182 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:04,182 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:04,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:04,184 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:04,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:04,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:04,184 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:04,184 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:04,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:04,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:04,187 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:04,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:04,187 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:04,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:04,187 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:04,187 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:04,187 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:04,187 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:04,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:04,193 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:04,193 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:04,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:04,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:04,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:04,281 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:04,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:04,282 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:04,282 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 02:25:04,282 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:04,282 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:04,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2556 [2022-12-13 02:25:04,282 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:25:04,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:04,282 INFO L85 PathProgramCache]: Analyzing trace with hash 289490906, now seen corresponding path program 1 times [2022-12-13 02:25:04,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:04,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447599300] [2022-12-13 02:25:04,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:04,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:04,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:25:04,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:04,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447599300] [2022-12-13 02:25:04,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447599300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:04,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:04,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:04,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325604047] [2022-12-13 02:25:04,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:04,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:04,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:04,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:04,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:04,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:04,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:04,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:04,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:04,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:04,403 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:04,403 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:04,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:04,405 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:04,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:04,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:04,405 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:04,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:04,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:04,408 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:04,408 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:04,408 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:04,408 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:04,408 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:04,408 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:04,408 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:04,409 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:04,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:04,414 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:04,414 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:04,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:04,415 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:04,415 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:04,502 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:04,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:04,502 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:04,502 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 02:25:04,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:04,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:04,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2557 [2022-12-13 02:25:04,503 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:25:04,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:04,503 INFO L85 PathProgramCache]: Analyzing trace with hash 318120057, now seen corresponding path program 1 times [2022-12-13 02:25:04,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:04,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498948464] [2022-12-13 02:25:04,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:04,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:04,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:25:04,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:04,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498948464] [2022-12-13 02:25:04,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498948464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:04,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:04,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:04,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749343404] [2022-12-13 02:25:04,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:04,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:04,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:04,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:04,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:04,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:04,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:04,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:04,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:04,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:04,634 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:04,634 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:04,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:04,635 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:04,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:04,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:04,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:04,636 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:04,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:04,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:04,638 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:04,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:04,638 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:04,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:04,639 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:04,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:04,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:04,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:04,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:04,644 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:04,645 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:04,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:04,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:04,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:04,733 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:04,733 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:04,733 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:04,733 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 02:25:04,733 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:04,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:04,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2558 [2022-12-13 02:25:04,733 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:25:04,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:04,734 INFO L85 PathProgramCache]: Analyzing trace with hash 346749208, now seen corresponding path program 1 times [2022-12-13 02:25:04,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:04,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348263480] [2022-12-13 02:25:04,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:04,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:04,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 02:25:04,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:04,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348263480] [2022-12-13 02:25:04,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348263480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:04,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:04,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:04,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502071433] [2022-12-13 02:25:04,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:04,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:04,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:04,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:04,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:04,793 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:04,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:04,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:04,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:04,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:04,859 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:04,859 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:04,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:04,860 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:04,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:04,861 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:04,861 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:04,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:04,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:04,863 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:04,863 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:04,863 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:04,863 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:04,863 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:04,864 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:04,864 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:04,864 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:04,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:04,869 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:04,869 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:04,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:04,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:04,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:04,956 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:04,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:04,957 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:04,957 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 02:25:04,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:04,957 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:04,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2559 [2022-12-13 02:25:04,957 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:25:04,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:04,957 INFO L85 PathProgramCache]: Analyzing trace with hash 375378359, now seen corresponding path program 1 times [2022-12-13 02:25:04,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:04,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753426518] [2022-12-13 02:25:04,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:04,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:05,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:25:05,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:05,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753426518] [2022-12-13 02:25:05,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753426518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:05,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:05,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:05,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728137857] [2022-12-13 02:25:05,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:05,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:05,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:05,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:05,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:05,014 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:05,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:05,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:05,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:05,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:05,081 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:05,081 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:05,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:05,082 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:05,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:05,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:05,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:05,082 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:05,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:05,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:05,085 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:05,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:05,085 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:05,085 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:05,085 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:05,085 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:05,085 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:05,085 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:05,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:05,102 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:05,102 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:25:05,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:05,103 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:05,103 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:05,189 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:05,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:25:05,190 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:05,190 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 02:25:05,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:05,190 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:05,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2560 [2022-12-13 02:25:05,190 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:25:05,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:05,190 INFO L85 PathProgramCache]: Analyzing trace with hash 404007510, now seen corresponding path program 1 times [2022-12-13 02:25:05,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:05,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004331674] [2022-12-13 02:25:05,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:05,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:05,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:25:05,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:05,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004331674] [2022-12-13 02:25:05,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004331674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:05,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:05,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:05,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998572138] [2022-12-13 02:25:05,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:05,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:05,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:05,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:05,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:05,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:05,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:05,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:05,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:05,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:05,322 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:05,322 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:05,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:05,323 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:05,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:05,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:05,324 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:05,324 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:05,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:05,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:05,326 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:05,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:05,327 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:05,327 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:05,327 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:05,327 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:05,327 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:05,327 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:05,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:05,333 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:05,333 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:05,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:05,334 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:05,334 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:05,431 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:05,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:25:05,432 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:05,432 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 02:25:05,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:05,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:05,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2561 [2022-12-13 02:25:05,432 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:25:05,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:05,432 INFO L85 PathProgramCache]: Analyzing trace with hash 432636661, now seen corresponding path program 1 times [2022-12-13 02:25:05,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:05,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387614311] [2022-12-13 02:25:05,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:05,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:05,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:25:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:05,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387614311] [2022-12-13 02:25:05,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387614311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:05,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:05,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:05,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836869519] [2022-12-13 02:25:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:05,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:05,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:05,503 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:05,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:05,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:05,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:05,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:05,589 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:05,589 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:05,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:05,590 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:05,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:05,591 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:05,591 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:05,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:05,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:05,594 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:05,594 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:05,594 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:05,594 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:05,594 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:05,594 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:05,594 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:05,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:05,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:05,600 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:05,600 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:25:05,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:05,600 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:05,601 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:05,687 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:05,687 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:05,687 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:05,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:05,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:05,687 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:05,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2562 [2022-12-13 02:25:05,688 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:25:05,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:05,688 INFO L85 PathProgramCache]: Analyzing trace with hash 461265812, now seen corresponding path program 1 times [2022-12-13 02:25:05,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:05,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952362441] [2022-12-13 02:25:05,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:05,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:05,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:25:05,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:05,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952362441] [2022-12-13 02:25:05,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952362441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:05,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:05,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:05,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621801313] [2022-12-13 02:25:05,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:05,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:05,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:05,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:05,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:05,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:05,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:05,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:05,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:05,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:05,824 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:05,824 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:25:05,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:05,826 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:05,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:05,826 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:05,826 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:05,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:05,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:05,829 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:05,829 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:05,829 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:05,829 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:05,829 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:05,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:05,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:05,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:05,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:05,835 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:05,835 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:25:05,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:05,836 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:05,836 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:05,926 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:05,926 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:05,926 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:05,926 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 02:25:05,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:05,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:05,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2563 [2022-12-13 02:25:05,927 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:25:05,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:05,927 INFO L85 PathProgramCache]: Analyzing trace with hash 489894963, now seen corresponding path program 1 times [2022-12-13 02:25:05,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:05,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892055230] [2022-12-13 02:25:05,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:05,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:05,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:25:05,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:05,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892055230] [2022-12-13 02:25:05,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892055230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:05,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:05,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:05,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864158301] [2022-12-13 02:25:05,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:05,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:05,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:05,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:05,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:05,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:05,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:05,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:05,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:05,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:06,055 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:06,055 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:06,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:06,056 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:06,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:06,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:06,057 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:06,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:06,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:06,059 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:06,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:06,060 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:06,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:06,060 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:06,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:06,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:06,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:06,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:06,066 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:06,066 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:06,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:06,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:06,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:06,166 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:06,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:25:06,166 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:06,166 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 02:25:06,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:06,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:06,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2564 [2022-12-13 02:25:06,167 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:25:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:06,167 INFO L85 PathProgramCache]: Analyzing trace with hash 518524114, now seen corresponding path program 1 times [2022-12-13 02:25:06,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:06,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718675461] [2022-12-13 02:25:06,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:06,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:06,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:25:06,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:06,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718675461] [2022-12-13 02:25:06,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718675461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:06,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:06,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:06,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697985031] [2022-12-13 02:25:06,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:06,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:06,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:06,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:06,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:06,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:06,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:06,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:06,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:06,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:06,302 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:06,302 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:06,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:06,303 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:06,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:06,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:06,304 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:06,304 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:06,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:06,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:06,307 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:06,307 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:06,307 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:06,307 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:06,307 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:06,307 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:06,307 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:06,307 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:06,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:06,313 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:06,313 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:06,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:06,313 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:06,313 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:06,410 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:06,410 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:25:06,411 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:06,411 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 02:25:06,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:06,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:06,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2565 [2022-12-13 02:25:06,411 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:25:06,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:06,411 INFO L85 PathProgramCache]: Analyzing trace with hash 547153265, now seen corresponding path program 1 times [2022-12-13 02:25:06,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:06,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902797121] [2022-12-13 02:25:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:06,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:06,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:25:06,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:06,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902797121] [2022-12-13 02:25:06,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902797121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:06,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:06,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:06,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512916017] [2022-12-13 02:25:06,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:06,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:06,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:06,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:06,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:06,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:06,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:06,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:06,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:06,532 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:06,532 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:06,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:06,534 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:06,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:06,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:06,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:06,534 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:06,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:06,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:06,537 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:06,537 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:06,537 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:06,537 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:06,537 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:06,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:06,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:06,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:06,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:06,543 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:06,543 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:25:06,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:06,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:06,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:06,661 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:06,662 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:25:06,662 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:06,662 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 02:25:06,662 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:06,662 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:06,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2566 [2022-12-13 02:25:06,662 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:25:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:06,662 INFO L85 PathProgramCache]: Analyzing trace with hash 575782416, now seen corresponding path program 1 times [2022-12-13 02:25:06,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:06,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405793348] [2022-12-13 02:25:06,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:06,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:25:06,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:06,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405793348] [2022-12-13 02:25:06,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405793348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:06,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:06,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:06,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26799028] [2022-12-13 02:25:06,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:06,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:06,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:06,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:06,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:06,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:06,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:06,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:06,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:06,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:06,782 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:06,782 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:06,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:06,783 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:06,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:06,784 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:06,784 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:06,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:06,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:06,787 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:06,787 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:06,787 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:06,787 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:06,787 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:06,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:06,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:06,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:06,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:06,793 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:06,793 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:06,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:06,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:06,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:06,880 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:06,881 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:06,881 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:06,881 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 02:25:06,881 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:06,881 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:06,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2567 [2022-12-13 02:25:06,881 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:25:06,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:06,881 INFO L85 PathProgramCache]: Analyzing trace with hash 604411567, now seen corresponding path program 1 times [2022-12-13 02:25:06,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:06,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976018674] [2022-12-13 02:25:06,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:06,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:06,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:25:06,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:06,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976018674] [2022-12-13 02:25:06,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976018674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:06,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:06,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290517477] [2022-12-13 02:25:06,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:06,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:06,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:06,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:06,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:06,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:06,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:06,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:06,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:07,001 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:07,001 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:07,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:07,002 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:07,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:07,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:07,003 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:07,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:07,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:07,005 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:07,005 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:07,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:07,006 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:07,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:07,006 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:07,011 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:07,012 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:07,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:07,012 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:07,012 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:07,099 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:07,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:07,100 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:07,100 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 02:25:07,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:07,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:07,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2568 [2022-12-13 02:25:07,100 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:25:07,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:07,100 INFO L85 PathProgramCache]: Analyzing trace with hash 633040718, now seen corresponding path program 1 times [2022-12-13 02:25:07,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:07,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157179088] [2022-12-13 02:25:07,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:07,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:07,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:07,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157179088] [2022-12-13 02:25:07,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157179088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:07,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:07,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:07,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982538347] [2022-12-13 02:25:07,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:07,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:07,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:07,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:07,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:07,152 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:07,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:07,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:07,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:07,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:07,228 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:07,229 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:07,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:07,230 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:07,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:07,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:07,230 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:07,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:07,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:07,233 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,233 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:07,233 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:07,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:07,233 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:07,233 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:07,233 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:07,239 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:07,239 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:07,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:07,240 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:07,240 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:07,328 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:07,328 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:07,328 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:07,328 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 02:25:07,328 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:07,328 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:07,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2569 [2022-12-13 02:25:07,329 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:25:07,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:07,329 INFO L85 PathProgramCache]: Analyzing trace with hash 661669869, now seen corresponding path program 1 times [2022-12-13 02:25:07,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:07,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718534680] [2022-12-13 02:25:07,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:07,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:07,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:25:07,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:07,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718534680] [2022-12-13 02:25:07,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718534680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:07,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:07,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:07,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980899642] [2022-12-13 02:25:07,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:07,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:07,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:07,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:07,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:07,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:07,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:07,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:07,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:07,451 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:07,452 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:07,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:07,453 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:07,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:07,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:07,453 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:07,453 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:07,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:07,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:07,456 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,456 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:07,456 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:07,456 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:07,456 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,456 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:07,456 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:07,456 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:07,462 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:07,462 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:07,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:07,463 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:07,463 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:07,551 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:07,551 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:07,552 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:07,552 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 02:25:07,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:07,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:07,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2570 [2022-12-13 02:25:07,552 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:25:07,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:07,552 INFO L85 PathProgramCache]: Analyzing trace with hash 690299020, now seen corresponding path program 1 times [2022-12-13 02:25:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:07,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094739487] [2022-12-13 02:25:07,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:07,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:07,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:25:07,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:07,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094739487] [2022-12-13 02:25:07,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094739487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:07,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:07,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:07,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146972722] [2022-12-13 02:25:07,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:07,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:07,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:07,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:07,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:07,614 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:07,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:07,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:07,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:07,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:07,690 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:07,690 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:07,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:07,691 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:07,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:07,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:07,692 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:07,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:07,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:07,695 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,695 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:07,695 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:07,695 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:07,695 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:07,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:07,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:07,701 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:07,701 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:07,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:07,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:07,702 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:07,789 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:07,790 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:07,790 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:07,790 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 02:25:07,790 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:07,790 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:07,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2571 [2022-12-13 02:25:07,790 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:25:07,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:07,790 INFO L85 PathProgramCache]: Analyzing trace with hash 718928171, now seen corresponding path program 1 times [2022-12-13 02:25:07,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:07,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088178376] [2022-12-13 02:25:07,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:07,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:07,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:25:07,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:07,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088178376] [2022-12-13 02:25:07,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088178376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:07,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:07,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:07,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781560165] [2022-12-13 02:25:07,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:07,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:07,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:07,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:07,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:07,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:07,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:07,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:07,914 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:07,914 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:07,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:07,915 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:07,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:07,916 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:07,916 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:07,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:07,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:07,918 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,918 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:07,918 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:07,918 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:07,918 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:07,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:07,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:07,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:07,924 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:07,924 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:07,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:07,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:07,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:08,011 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:08,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:08,012 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:08,012 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 02:25:08,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:08,012 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:08,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2572 [2022-12-13 02:25:08,012 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:25:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:08,013 INFO L85 PathProgramCache]: Analyzing trace with hash 747557322, now seen corresponding path program 1 times [2022-12-13 02:25:08,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:08,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666242912] [2022-12-13 02:25:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:08,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:08,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:25:08,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:08,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666242912] [2022-12-13 02:25:08,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666242912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:08,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:08,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:08,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822538661] [2022-12-13 02:25:08,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:08,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:08,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:08,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:08,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:08,069 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:08,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:08,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:08,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:08,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:08,144 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:08,145 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:08,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:08,146 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:08,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:08,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:08,146 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:08,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:08,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:08,149 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:08,149 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:08,149 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:08,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:08,149 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:08,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:08,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:08,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:08,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:08,155 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:08,155 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:08,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:08,156 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:08,156 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:08,243 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:08,244 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:08,244 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:08,244 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 02:25:08,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:08,244 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:08,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2573 [2022-12-13 02:25:08,244 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:25:08,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash 776186473, now seen corresponding path program 1 times [2022-12-13 02:25:08,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:08,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549162732] [2022-12-13 02:25:08,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:08,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:25:08,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:08,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549162732] [2022-12-13 02:25:08,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549162732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:08,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:08,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:08,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179534957] [2022-12-13 02:25:08,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:08,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:08,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:08,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:08,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:08,310 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:08,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:08,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:08,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:08,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:08,387 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:08,387 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:08,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:08,388 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:08,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:08,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:08,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:08,388 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:08,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:08,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:08,391 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:08,391 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:08,391 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:08,391 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:08,391 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:08,392 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:08,392 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:08,392 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:08,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:08,397 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:08,397 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:08,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:08,398 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:08,398 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:08,486 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:08,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:08,486 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:08,486 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 02:25:08,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:08,486 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:08,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2574 [2022-12-13 02:25:08,487 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:25:08,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:08,487 INFO L85 PathProgramCache]: Analyzing trace with hash 804815624, now seen corresponding path program 1 times [2022-12-13 02:25:08,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:08,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060393145] [2022-12-13 02:25:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:08,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:08,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:25:08,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:08,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060393145] [2022-12-13 02:25:08,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060393145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:08,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:08,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:08,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383788603] [2022-12-13 02:25:08,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:08,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:08,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:08,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:08,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:08,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:08,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:08,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:08,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:08,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:08,635 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:08,635 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:08,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:08,636 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:08,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:08,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:08,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:08,637 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:08,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:08,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:08,639 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:08,639 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:08,639 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:08,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:08,640 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:08,640 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:08,640 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:08,640 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:08,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:08,645 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:08,645 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:08,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:08,646 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:08,646 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:08,734 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:08,734 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:08,734 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:08,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:08,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:08,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:08,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2575 [2022-12-13 02:25:08,735 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:25:08,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 833444775, now seen corresponding path program 1 times [2022-12-13 02:25:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:08,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036491667] [2022-12-13 02:25:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:08,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:25:08,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:08,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036491667] [2022-12-13 02:25:08,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036491667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:08,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:08,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:08,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875630472] [2022-12-13 02:25:08,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:08,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:08,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:08,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:08,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:08,801 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:08,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:08,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:08,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:08,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:08,866 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:08,867 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:08,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:08,868 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:08,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:08,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:08,868 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:08,868 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:08,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:08,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:08,871 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:08,871 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:08,871 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:08,871 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:08,871 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:08,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:08,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:08,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:08,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:08,877 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:08,877 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:08,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:08,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:08,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:08,965 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:08,965 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:08,966 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:08,966 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 02:25:08,966 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:08,966 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:08,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2576 [2022-12-13 02:25:08,966 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:25:08,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:08,966 INFO L85 PathProgramCache]: Analyzing trace with hash 862073926, now seen corresponding path program 1 times [2022-12-13 02:25:08,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:08,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387234498] [2022-12-13 02:25:08,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:08,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:09,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:25:09,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:09,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387234498] [2022-12-13 02:25:09,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387234498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:09,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:09,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:09,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601901932] [2022-12-13 02:25:09,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:09,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:09,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:09,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:09,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:09,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:09,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:09,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:09,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:09,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:09,100 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:09,100 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:09,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:09,101 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:09,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:09,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:09,102 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:09,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:09,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:09,104 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:09,104 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:09,104 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:09,104 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:09,104 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:09,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:09,105 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:09,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:09,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:09,110 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:09,111 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:09,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:09,111 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:09,111 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:09,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:09,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:09,200 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:09,200 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 02:25:09,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:09,201 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:09,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2577 [2022-12-13 02:25:09,201 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:25:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:09,201 INFO L85 PathProgramCache]: Analyzing trace with hash 890703077, now seen corresponding path program 1 times [2022-12-13 02:25:09,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:09,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591411648] [2022-12-13 02:25:09,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:09,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:09,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:25:09,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:09,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591411648] [2022-12-13 02:25:09,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591411648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:09,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:09,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120556776] [2022-12-13 02:25:09,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:09,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:09,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:09,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:09,255 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:09,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:09,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:09,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:09,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:09,329 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:09,329 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:09,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:09,330 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:09,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:09,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:09,331 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:09,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:09,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:09,333 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:09,334 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:09,334 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:09,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:09,334 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:09,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:09,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:09,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:09,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:09,340 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:09,340 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:09,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:09,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:09,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:09,428 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:09,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:09,429 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:09,429 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 02:25:09,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:09,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:09,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2578 [2022-12-13 02:25:09,429 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:25:09,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:09,429 INFO L85 PathProgramCache]: Analyzing trace with hash 919332228, now seen corresponding path program 1 times [2022-12-13 02:25:09,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:09,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375088031] [2022-12-13 02:25:09,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:09,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:09,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:09,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375088031] [2022-12-13 02:25:09,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375088031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:09,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:09,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:09,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183436981] [2022-12-13 02:25:09,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:09,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:09,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:09,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:09,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:09,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:09,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:09,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:09,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:09,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:09,564 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:09,564 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:09,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:09,565 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:09,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:09,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:09,565 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:09,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:09,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:09,568 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:09,568 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:09,568 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:09,568 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:09,568 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:09,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:09,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:09,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:09,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:09,574 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:09,574 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:09,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:09,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:09,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:09,664 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:09,665 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:09,665 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:09,665 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 02:25:09,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:09,665 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:09,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2579 [2022-12-13 02:25:09,665 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:25:09,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash 947961379, now seen corresponding path program 1 times [2022-12-13 02:25:09,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:09,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879716286] [2022-12-13 02:25:09,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:09,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:09,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:25:09,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:09,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879716286] [2022-12-13 02:25:09,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879716286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:09,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:09,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:09,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203540299] [2022-12-13 02:25:09,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:09,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:09,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:09,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:09,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:09,722 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:09,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:09,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:09,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:09,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:09,791 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:09,791 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:09,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:09,792 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:09,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:09,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:09,792 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:09,793 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:09,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:09,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:09,795 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:09,795 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:09,795 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:09,795 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:09,795 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:09,795 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:09,796 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:09,796 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:09,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:09,801 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:09,801 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:09,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:09,802 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:09,802 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:09,894 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:09,895 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:25:09,895 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:09,895 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 02:25:09,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:09,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:09,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2580 [2022-12-13 02:25:09,895 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:25:09,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:09,895 INFO L85 PathProgramCache]: Analyzing trace with hash 976590530, now seen corresponding path program 1 times [2022-12-13 02:25:09,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:09,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971931703] [2022-12-13 02:25:09,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:09,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:09,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:25:09,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:09,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971931703] [2022-12-13 02:25:09,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971931703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:09,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:09,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:09,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813397218] [2022-12-13 02:25:09,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:09,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:09,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:09,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:09,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:09,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:09,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:09,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:09,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:09,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:10,044 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:10,044 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:10,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:10,045 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:10,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:10,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:10,046 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:10,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:10,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:10,048 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:10,048 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:10,048 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:10,048 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:10,049 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:10,049 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:10,054 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:10,054 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:10,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:10,055 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:10,055 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:10,142 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:10,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:10,143 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:10,143 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 02:25:10,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:10,143 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:10,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2581 [2022-12-13 02:25:10,143 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:25:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:10,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1005219681, now seen corresponding path program 1 times [2022-12-13 02:25:10,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:10,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504304741] [2022-12-13 02:25:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:10,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:10,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:25:10,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:10,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504304741] [2022-12-13 02:25:10,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504304741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:10,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:10,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594168858] [2022-12-13 02:25:10,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:10,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:10,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:10,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:10,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:10,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:10,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:10,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:10,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:10,277 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:10,277 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:10,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:10,278 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:10,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:10,279 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:10,279 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:10,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:10,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:10,281 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:10,282 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:10,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:10,282 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:10,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:10,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:10,287 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:10,288 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:10,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:10,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:10,288 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:10,376 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:10,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:10,377 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:10,377 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 02:25:10,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:10,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:10,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2582 [2022-12-13 02:25:10,377 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:25:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:10,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1033848832, now seen corresponding path program 1 times [2022-12-13 02:25:10,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:10,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562780705] [2022-12-13 02:25:10,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:10,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:10,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:25:10,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:10,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562780705] [2022-12-13 02:25:10,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562780705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:10,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:10,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:10,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653582635] [2022-12-13 02:25:10,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:10,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:10,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:10,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:10,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:10,451 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:10,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:10,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:10,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:10,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:10,520 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:10,520 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:10,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:10,521 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:10,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:10,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:10,522 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:10,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:10,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:10,525 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,525 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:10,525 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:10,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:10,525 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:10,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:10,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:10,531 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:10,531 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:10,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:10,532 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:10,532 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:10,619 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:10,620 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:10,620 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:10,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:10,620 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:10,620 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:10,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2583 [2022-12-13 02:25:10,620 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:25:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1062477983, now seen corresponding path program 1 times [2022-12-13 02:25:10,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:10,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632225925] [2022-12-13 02:25:10,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:10,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25: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:25:10,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:10,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632225925] [2022-12-13 02:25:10,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632225925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:10,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:10,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:10,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138085646] [2022-12-13 02:25:10,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:10,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:10,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:10,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:10,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:10,677 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:10,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:10,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:10,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:10,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:10,743 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:10,744 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:10,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:10,745 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:10,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:10,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:10,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:10,745 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:10,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:10,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:10,747 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,748 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:10,748 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:10,748 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:10,748 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:10,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:10,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:10,754 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:10,754 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:25:10,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:10,754 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:10,754 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:10,843 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:10,843 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:10,843 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:10,843 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 02:25:10,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:10,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:10,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2584 [2022-12-13 02:25:10,843 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:25:10,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:10,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1091107134, now seen corresponding path program 1 times [2022-12-13 02:25:10,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:10,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36896828] [2022-12-13 02:25:10,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:10,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:10,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:25:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:10,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36896828] [2022-12-13 02:25:10,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36896828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:10,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:10,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:10,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117649358] [2022-12-13 02:25:10,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:10,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:10,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:10,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:10,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:10,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:10,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:10,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:10,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:10,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:10,971 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:10,971 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:10,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:10,972 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:10,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:10,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:10,973 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:10,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:10,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:10,975 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,975 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:10,976 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:10,976 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:10,976 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,976 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:10,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:10,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:10,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:10,981 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:10,982 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:10,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:10,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:10,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:11,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:11,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:11,071 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:11,071 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 02:25:11,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:11,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:11,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2585 [2022-12-13 02:25:11,071 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:25:11,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:11,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1119736285, now seen corresponding path program 1 times [2022-12-13 02:25:11,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:11,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203184438] [2022-12-13 02:25:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:11,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:11,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:25:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:11,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203184438] [2022-12-13 02:25:11,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203184438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:11,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:11,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:11,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147099667] [2022-12-13 02:25:11,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:11,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:11,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:11,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:11,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:11,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:11,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:11,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:11,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:11,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:11,215 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:11,215 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:11,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:11,216 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:11,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:11,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:11,217 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:11,217 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:11,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:11,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:11,219 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:11,219 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:11,219 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:11,219 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:11,219 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:11,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:11,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:11,220 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:11,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:11,225 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:11,225 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:11,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:11,226 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:11,226 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:11,313 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:11,314 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:11,314 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:11,314 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 02:25:11,314 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:11,314 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:11,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2586 [2022-12-13 02:25:11,314 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:25:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1148365436, now seen corresponding path program 1 times [2022-12-13 02:25:11,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:11,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133063181] [2022-12-13 02:25:11,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:11,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:11,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:25:11,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:11,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133063181] [2022-12-13 02:25:11,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133063181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:11,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:11,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:11,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475189765] [2022-12-13 02:25:11,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:11,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:11,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:11,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:11,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:11,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:11,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:11,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:11,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:11,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:11,460 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:11,461 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:11,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:11,462 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:11,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:11,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:11,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:11,462 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:11,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:11,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:11,465 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:11,465 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:11,465 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:11,465 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:11,465 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:11,465 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:11,466 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:11,466 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:11,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:11,471 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:11,471 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:11,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:11,472 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:11,472 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:11,560 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:11,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:11,561 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:11,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:11,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:11,561 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:11,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2587 [2022-12-13 02:25:11,561 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:25:11,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1176994587, now seen corresponding path program 1 times [2022-12-13 02:25:11,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:11,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018217529] [2022-12-13 02:25:11,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:11,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:11,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:25:11,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:11,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018217529] [2022-12-13 02:25:11,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018217529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:11,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:11,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746596027] [2022-12-13 02:25:11,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:11,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:11,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:11,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:11,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:11,612 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:11,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:11,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:11,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:11,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:11,679 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:11,679 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:11,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:11,680 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:11,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:11,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:11,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:11,681 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:11,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:11,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:11,683 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:11,683 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:11,683 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:11,683 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:11,683 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:11,684 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:11,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:11,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:11,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:11,689 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:11,689 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:11,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:11,690 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:11,690 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:11,777 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:11,778 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:11,778 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:11,778 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 02:25:11,778 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:11,778 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:11,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2588 [2022-12-13 02:25:11,778 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:25:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:11,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1205623738, now seen corresponding path program 1 times [2022-12-13 02:25:11,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:11,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499680813] [2022-12-13 02:25:11,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:11,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:11,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:25:11,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:11,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499680813] [2022-12-13 02:25:11,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499680813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:11,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:11,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:11,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203963747] [2022-12-13 02:25:11,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:11,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:11,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:11,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:11,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:11,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:11,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:11,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:11,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:11,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:11,917 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:11,917 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:11,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:11,918 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:11,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:11,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:11,918 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:11,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:11,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:11,921 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:11,921 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:11,921 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:11,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:11,921 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:11,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:11,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:11,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:11,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:11,927 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:11,927 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:11,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:11,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:11,928 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:12,015 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:12,016 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:12,016 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:12,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:12,016 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:12,016 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:12,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2589 [2022-12-13 02:25:12,016 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:25:12,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1234252889, now seen corresponding path program 1 times [2022-12-13 02:25:12,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:12,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055778745] [2022-12-13 02:25:12,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:12,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:12,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:25:12,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:12,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055778745] [2022-12-13 02:25:12,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055778745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:12,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:12,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:12,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612651071] [2022-12-13 02:25:12,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:12,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:12,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:12,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:12,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:12,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:12,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:12,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:12,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:12,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:12,137 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:12,137 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:12,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:12,138 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:12,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:12,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:12,139 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:12,139 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:12,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:12,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:12,141 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:12,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:12,141 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:12,141 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:12,141 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:12,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:12,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:12,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:12,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:12,147 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:12,147 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:12,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:12,148 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:12,148 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:12,236 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:12,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:12,237 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:12,237 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 02:25:12,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:12,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:12,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2590 [2022-12-13 02:25:12,237 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:25:12,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1262882040, now seen corresponding path program 1 times [2022-12-13 02:25:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:12,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767818474] [2022-12-13 02:25:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:12,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:12,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:25:12,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:12,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767818474] [2022-12-13 02:25:12,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767818474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:12,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:12,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:12,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108725734] [2022-12-13 02:25:12,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:12,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:12,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:12,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:12,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:12,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:12,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:12,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:12,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:12,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:12,378 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:12,378 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:12,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:12,379 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:12,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:12,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:12,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:12,379 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:12,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:12,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:12,382 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:12,382 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:12,382 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:12,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:12,382 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:12,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:12,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:12,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:12,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:12,388 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:12,388 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:12,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:12,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:12,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:12,476 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:12,477 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:12,477 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:12,477 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 02:25:12,477 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:12,477 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:12,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2591 [2022-12-13 02:25:12,477 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:25:12,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1291511191, now seen corresponding path program 1 times [2022-12-13 02:25:12,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:12,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226126308] [2022-12-13 02:25:12,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:12,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:12,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:25:12,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:12,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226126308] [2022-12-13 02:25:12,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226126308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:12,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:12,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:12,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767606122] [2022-12-13 02:25:12,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:12,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:12,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:12,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:12,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:12,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:12,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:12,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:12,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:12,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:12,601 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:12,601 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:12,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:12,602 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:12,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:12,603 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:12,603 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:12,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:12,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:12,605 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:12,605 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:12,605 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:12,605 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:12,605 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:12,606 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:12,606 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:12,606 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:12,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:12,611 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:12,611 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:12,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:12,612 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:12,612 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:12,702 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:12,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:12,702 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:12,703 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 02:25:12,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:12,703 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:12,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2592 [2022-12-13 02:25:12,703 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:25:12,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:12,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1320140342, now seen corresponding path program 1 times [2022-12-13 02:25:12,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:12,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706939397] [2022-12-13 02:25:12,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:12,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:12,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:25:12,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:12,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706939397] [2022-12-13 02:25:12,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706939397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:12,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:12,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:12,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237811197] [2022-12-13 02:25:12,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:12,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:12,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:12,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:12,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:12,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:12,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:12,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:12,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:12,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:12,834 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:12,834 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:12,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:12,835 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:12,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:12,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:12,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:12,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:12,836 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:12,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:12,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:12,839 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:12,839 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:12,839 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:12,839 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:12,839 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:12,839 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:12,839 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:12,839 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:12,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:12,845 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:12,845 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:12,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:12,845 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:12,845 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:12,935 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:12,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:12,936 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:12,936 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 02:25:12,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:12,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:12,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2593 [2022-12-13 02:25:12,936 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:25:12,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:12,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1348769493, now seen corresponding path program 1 times [2022-12-13 02:25:12,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:12,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570819748] [2022-12-13 02:25:12,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:12,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25: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 02:25:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:12,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570819748] [2022-12-13 02:25:12,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570819748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:12,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:12,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:12,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563416489] [2022-12-13 02:25:12,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:12,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:12,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:12,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:12,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:12,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:12,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:12,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:12,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:13,070 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:13,070 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:13,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:13,071 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:13,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:13,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:13,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:13,072 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:13,072 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:13,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:13,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:13,075 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:13,075 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:13,075 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:13,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:13,075 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:13,075 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:13,075 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:13,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:13,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:13,081 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:13,081 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:13,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:13,082 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:13,082 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:13,171 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:13,171 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:13,171 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:13,171 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 02:25:13,171 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:13,171 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:13,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2594 [2022-12-13 02:25:13,171 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:25:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:13,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1377398644, now seen corresponding path program 1 times [2022-12-13 02:25:13,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:13,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278780249] [2022-12-13 02:25:13,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:13,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:13,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:25:13,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:13,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278780249] [2022-12-13 02:25:13,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278780249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:13,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:13,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:13,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886975234] [2022-12-13 02:25:13,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:13,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:13,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:13,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:13,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:13,242 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:13,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:13,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:13,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:13,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:13,329 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:13,329 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:13,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:13,330 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:13,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:13,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:13,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:13,331 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:13,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:13,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:13,333 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:13,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:13,333 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:13,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:13,333 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:13,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:13,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:13,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:13,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:13,339 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:13,339 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:13,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:13,340 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:13,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:13,430 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:13,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:25:13,431 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:13,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:13,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:13,431 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:13,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2595 [2022-12-13 02:25:13,431 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:25:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1406027795, now seen corresponding path program 1 times [2022-12-13 02:25:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:13,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592258631] [2022-12-13 02:25:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:13,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:25:13,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:13,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592258631] [2022-12-13 02:25:13,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592258631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:13,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:13,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:13,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529394585] [2022-12-13 02:25:13,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:13,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:13,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:13,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:13,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:13,498 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:13,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:13,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:13,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:13,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:13,583 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:13,584 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:13,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:13,585 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:13,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:13,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:13,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:13,585 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:13,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:13,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:13,588 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:13,588 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:13,588 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:13,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:13,588 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:13,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:13,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:13,589 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:13,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:13,594 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:13,594 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:13,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:13,595 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:13,595 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:13,685 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:13,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:13,685 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:13,685 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 02:25:13,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:13,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:13,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2596 [2022-12-13 02:25:13,686 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:25:13,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1434656946, now seen corresponding path program 1 times [2022-12-13 02:25:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:13,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231096742] [2022-12-13 02:25:13,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:13,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:25:13,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:13,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231096742] [2022-12-13 02:25:13,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231096742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:13,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:13,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:13,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804849466] [2022-12-13 02:25:13,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:13,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:13,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:13,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:13,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:13,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:13,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:13,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:13,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:13,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:13,805 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:13,805 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:13,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:13,806 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:13,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:13,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:13,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:13,807 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:13,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:13,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:13,809 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:13,809 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:13,809 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:13,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:13,809 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:13,810 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:13,810 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:13,810 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:13,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:13,815 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:13,815 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:13,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:13,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:13,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:13,903 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:13,904 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:13,904 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:13,904 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 02:25:13,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:13,904 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:13,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2597 [2022-12-13 02:25:13,904 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:25:13,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:13,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1463286097, now seen corresponding path program 1 times [2022-12-13 02:25:13,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:13,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215397544] [2022-12-13 02:25:13,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:13,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:13,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:13,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215397544] [2022-12-13 02:25:13,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215397544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:13,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:13,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:13,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500771327] [2022-12-13 02:25:13,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:13,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:13,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:13,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:13,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:13,960 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:13,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:13,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:13,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:13,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:14,037 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:14,038 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:14,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:14,039 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:14,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:14,039 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:14,039 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:14,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:14,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:14,042 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:14,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:14,042 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:14,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:14,042 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:14,042 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:14,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:14,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:14,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:14,048 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:14,048 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:25:14,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:14,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:14,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:14,145 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:14,146 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:25:14,146 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:14,146 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 02:25:14,146 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:14,146 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:14,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2598 [2022-12-13 02:25:14,146 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:25:14,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:14,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1491915248, now seen corresponding path program 1 times [2022-12-13 02:25:14,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:14,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854287799] [2022-12-13 02:25:14,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:14,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:14,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:25:14,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:14,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854287799] [2022-12-13 02:25:14,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854287799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:14,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:14,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:14,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506209259] [2022-12-13 02:25:14,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:14,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:14,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:14,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:14,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:14,218 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:14,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:14,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:14,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:14,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:14,303 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:14,303 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:14,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:14,305 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:14,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:14,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:14,305 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:14,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:14,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:14,309 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:14,309 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:14,309 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:14,309 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:14,309 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:14,310 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:14,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:14,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:14,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:14,318 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:14,318 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:14,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:14,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:14,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:14,425 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:14,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:25:14,426 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:14,426 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 02:25:14,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:14,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:14,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2599 [2022-12-13 02:25:14,426 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:25:14,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:14,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1520544399, now seen corresponding path program 1 times [2022-12-13 02:25:14,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:14,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714166962] [2022-12-13 02:25:14,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:14,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:14,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:25:14,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:14,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714166962] [2022-12-13 02:25:14,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714166962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:14,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:14,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113996382] [2022-12-13 02:25:14,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:14,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:14,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:14,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:14,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:14,482 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:14,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:14,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:14,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:14,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:14,558 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:14,558 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:14,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:14,559 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:14,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:14,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:14,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:14,560 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:14,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:14,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:14,563 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:14,563 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:14,563 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:14,563 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:14,563 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:14,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:14,563 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:14,563 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:14,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:14,569 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:14,569 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:14,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:14,570 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:14,570 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:14,658 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:14,658 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:14,658 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:14,658 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 02:25:14,658 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:14,658 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:14,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2600 [2022-12-13 02:25:14,659 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:25:14,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:14,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1549173550, now seen corresponding path program 1 times [2022-12-13 02:25:14,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:14,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482068429] [2022-12-13 02:25:14,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:14,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:14,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:25:14,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:14,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482068429] [2022-12-13 02:25:14,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482068429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:14,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:14,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:14,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438934250] [2022-12-13 02:25:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:14,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:14,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:14,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:14,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:14,730 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:14,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:14,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:14,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:14,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:14,795 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:14,795 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:14,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1126 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:14,796 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:14,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:14,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:14,797 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:14,797 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:14,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:14,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:14,799 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:14,799 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:14,799 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:14,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:14,799 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:14,800 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:14,800 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:14,800 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:14,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:14,805 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:14,805 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:14,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:14,806 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:14,806 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:14,891 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:14,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:14,892 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:14,892 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 02:25:14,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:14,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:14,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2601 [2022-12-13 02:25:14,892 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:25:14,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1577802701, now seen corresponding path program 1 times [2022-12-13 02:25:14,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:14,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246700981] [2022-12-13 02:25:14,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:14,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:14,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:25:14,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:14,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246700981] [2022-12-13 02:25:14,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246700981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:14,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:14,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398688529] [2022-12-13 02:25:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:14,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:14,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:14,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:14,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:14,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:14,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:14,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:14,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:14,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:15,014 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:15,015 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:15,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:15,016 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:15,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:15,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:15,016 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:15,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:15,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:15,019 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,019 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:15,019 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:15,019 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:15,019 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,019 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:15,019 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:15,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:15,025 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:15,025 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:15,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:15,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:15,026 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:15,114 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:15,115 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:15,115 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:15,115 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 02:25:15,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:15,115 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:15,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2602 [2022-12-13 02:25:15,115 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:25:15,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:15,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1606431852, now seen corresponding path program 1 times [2022-12-13 02:25:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:15,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642282875] [2022-12-13 02:25:15,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:15,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25: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:25:15,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:15,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642282875] [2022-12-13 02:25:15,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642282875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:15,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:15,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:15,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150395951] [2022-12-13 02:25:15,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:15,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:15,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:15,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:15,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:15,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:15,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:15,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:15,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:15,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:15,240 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:15,240 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:15,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:15,241 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:15,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:15,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:15,242 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:15,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:15,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:15,245 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:15,245 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:15,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:15,245 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:15,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:15,245 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:15,251 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:15,251 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:15,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:15,251 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:15,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:15,339 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:15,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:15,340 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:15,340 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 02:25:15,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:15,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:15,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2603 [2022-12-13 02:25:15,340 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:25:15,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:15,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1635061003, now seen corresponding path program 1 times [2022-12-13 02:25:15,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:15,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396195435] [2022-12-13 02:25:15,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:15,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:15,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396195435] [2022-12-13 02:25:15,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396195435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:15,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:15,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704492422] [2022-12-13 02:25:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:15,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:15,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:15,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:15,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:15,399 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:15,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:15,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:15,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:15,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:15,465 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:15,465 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:15,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:15,467 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:15,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:15,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:15,467 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:15,467 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:15,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:15,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:15,470 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,470 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:15,470 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:15,470 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:15,470 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,470 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:15,470 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:15,470 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:15,476 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:15,476 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:15,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:15,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:15,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:15,564 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:15,564 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:15,564 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:15,564 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 02:25:15,564 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:15,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:15,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2604 [2022-12-13 02:25:15,565 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:25:15,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1663690154, now seen corresponding path program 1 times [2022-12-13 02:25:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:15,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743010407] [2022-12-13 02:25:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:15,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:15,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:25:15,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:15,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743010407] [2022-12-13 02:25:15,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743010407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:15,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:15,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:15,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288084278] [2022-12-13 02:25:15,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:15,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:15,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:15,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:15,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:15,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:15,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:15,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:15,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:15,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:15,695 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:15,696 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:15,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:15,697 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:15,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:15,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:15,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:15,697 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:15,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:15,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:15,700 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,700 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:15,700 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:15,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:15,700 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:15,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:15,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:15,706 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:15,706 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:15,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:15,707 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:15,707 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:15,794 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:15,794 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:15,794 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:15,794 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 02:25:15,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:15,794 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:15,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2605 [2022-12-13 02:25:15,795 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:25:15,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:15,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1692319305, now seen corresponding path program 1 times [2022-12-13 02:25:15,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:15,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836143925] [2022-12-13 02:25:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:15,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:15,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 02:25:15,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:15,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836143925] [2022-12-13 02:25:15,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836143925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:15,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:15,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:15,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267592552] [2022-12-13 02:25:15,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:15,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:15,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:15,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:15,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:15,880 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:15,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:15,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:15,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:15,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:15,961 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:15,961 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:15,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:15,962 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:15,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:15,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:15,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:15,963 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:15,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:15,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:15,965 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,965 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:15,965 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:15,965 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:15,966 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,966 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:15,966 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:15,966 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:15,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:15,971 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:15,971 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:15,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:15,972 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:15,972 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:16,059 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:16,060 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:16,060 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:16,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:16,060 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:16,060 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:16,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2606 [2022-12-13 02:25:16,060 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:25:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:16,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1720948456, now seen corresponding path program 1 times [2022-12-13 02:25:16,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:16,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499376390] [2022-12-13 02:25:16,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:16,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:16,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 02:25:16,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:16,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499376390] [2022-12-13 02:25:16,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499376390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:16,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:16,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976816270] [2022-12-13 02:25:16,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:16,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:16,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:16,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:16,131 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:16,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:16,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:16,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:16,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:16,208 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:16,208 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:16,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:16,209 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:16,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:16,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:16,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:16,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:16,210 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:16,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:16,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:16,212 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:16,212 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:16,212 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:16,212 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:16,213 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:16,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:16,213 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:16,213 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:16,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:16,218 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:16,219 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:16,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:16,219 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:16,219 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:16,306 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:16,306 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:16,306 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:16,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:16,306 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:16,306 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:16,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2607 [2022-12-13 02:25:16,307 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:25:16,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:16,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1749577607, now seen corresponding path program 1 times [2022-12-13 02:25:16,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:16,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705011464] [2022-12-13 02:25:16,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:16,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:16,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:25:16,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:16,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705011464] [2022-12-13 02:25:16,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705011464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:16,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:16,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:16,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913573289] [2022-12-13 02:25:16,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:16,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:16,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:16,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:16,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:16,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:16,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:16,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:16,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:16,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:16,425 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:16,425 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:16,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:16,426 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:16,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:16,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:16,426 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:16,426 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:16,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:16,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:16,429 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:16,429 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:16,429 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:16,429 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:16,429 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:16,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:16,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:16,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:16,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:16,435 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:16,435 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:16,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:16,436 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:16,436 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:16,532 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:16,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:25:16,533 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:16,533 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 02:25:16,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:16,533 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:16,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2608 [2022-12-13 02:25:16,533 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:25:16,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:16,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1778206758, now seen corresponding path program 1 times [2022-12-13 02:25:16,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:16,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877296044] [2022-12-13 02:25:16,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:16,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:16,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:25:16,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:16,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877296044] [2022-12-13 02:25:16,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877296044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:16,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:16,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:16,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542481523] [2022-12-13 02:25:16,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:16,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:16,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:16,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:16,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:16,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:16,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:16,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:16,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:16,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:16,666 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:16,666 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:16,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:16,668 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:16,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:16,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:16,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:16,668 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:16,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:16,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:16,671 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:16,671 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:16,671 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:16,671 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:16,671 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:16,671 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:16,671 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:16,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:16,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:16,677 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:16,677 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:16,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:16,678 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:16,678 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:16,770 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:16,771 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 02:25:16,771 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:16,771 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 02:25:16,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:16,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:16,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2609 [2022-12-13 02:25:16,771 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:25:16,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1806835909, now seen corresponding path program 1 times [2022-12-13 02:25:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:16,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908200015] [2022-12-13 02:25:16,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:16,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:16,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:25:16,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:16,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908200015] [2022-12-13 02:25:16,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908200015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:16,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:16,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:16,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277525117] [2022-12-13 02:25:16,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:16,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:16,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:16,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:16,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:16,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:16,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:16,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:16,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:16,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:16,899 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:16,899 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:16,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:16,900 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:16,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:16,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:16,901 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:16,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:16,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:16,903 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:16,903 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:16,904 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:16,904 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:16,904 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:16,904 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:16,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:16,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:16,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:16,909 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:16,910 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:16,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:16,910 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:16,910 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:16,998 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:16,998 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:16,998 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:16,998 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 02:25:16,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:16,998 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:16,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2610 [2022-12-13 02:25:16,999 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:25:16,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:16,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1835465060, now seen corresponding path program 1 times [2022-12-13 02:25:16,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:16,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243107517] [2022-12-13 02:25:16,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:16,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:17,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:25:17,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:17,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243107517] [2022-12-13 02:25:17,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243107517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:17,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:17,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:17,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141409568] [2022-12-13 02:25:17,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:17,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:17,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:17,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:17,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:17,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:17,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:17,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:17,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:17,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:17,135 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:17,135 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:17,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:17,136 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:17,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:17,137 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:17,137 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:17,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:17,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:17,139 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:17,139 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:17,139 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:17,139 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:17,139 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:17,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:17,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:17,140 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:17,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:17,145 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:17,145 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:17,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:17,146 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:17,146 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:17,248 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:17,249 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 02:25:17,249 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:17,249 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 02:25:17,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:17,249 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:17,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2611 [2022-12-13 02:25:17,250 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:25:17,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:17,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1864094211, now seen corresponding path program 1 times [2022-12-13 02:25:17,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:17,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839274255] [2022-12-13 02:25:17,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:17,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:17,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:25:17,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:17,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839274255] [2022-12-13 02:25:17,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839274255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:17,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:17,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:17,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734752064] [2022-12-13 02:25:17,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:17,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:17,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:17,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:17,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:17,309 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:17,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:17,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:17,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:17,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:17,375 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:17,375 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:17,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:17,376 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:17,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:17,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:17,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:17,377 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:17,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:17,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:17,379 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:17,379 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:17,380 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:17,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:17,380 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:17,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:17,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:17,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:17,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:17,385 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:17,385 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:17,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:17,386 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:17,386 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:17,475 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:17,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:17,475 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:17,475 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 02:25:17,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:17,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:17,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2612 [2022-12-13 02:25:17,475 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:25:17,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1892723362, now seen corresponding path program 1 times [2022-12-13 02:25:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:17,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820385975] [2022-12-13 02:25:17,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:17,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:25:17,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:17,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820385975] [2022-12-13 02:25:17,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820385975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:17,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:17,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:17,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574926072] [2022-12-13 02:25:17,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:17,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:17,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:17,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:17,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:17,530 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:17,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:17,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:17,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:17,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:17,606 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:17,606 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:17,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:17,607 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:17,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:17,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:17,608 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:17,608 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:17,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:17,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:17,610 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:17,610 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:17,610 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:17,610 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:17,610 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:17,611 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:17,611 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:17,611 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:17,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:17,616 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:17,616 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:17,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:17,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:17,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:17,705 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:17,706 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:17,706 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:17,706 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 02:25:17,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:17,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:17,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2613 [2022-12-13 02:25:17,706 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:25:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1921352513, now seen corresponding path program 1 times [2022-12-13 02:25:17,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:17,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038298699] [2022-12-13 02:25:17,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:17,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:17,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:25:17,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:17,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038298699] [2022-12-13 02:25:17,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038298699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:17,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:17,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:17,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083050544] [2022-12-13 02:25:17,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:17,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:17,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:17,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:17,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:17,784 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:17,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:17,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:17,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:17,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:17,869 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:17,869 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:17,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:17,870 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:17,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:17,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:17,871 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:17,871 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:17,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:17,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:17,873 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:17,873 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:17,873 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:17,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:17,874 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:17,874 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:17,874 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:17,874 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:17,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:17,879 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:17,879 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:17,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:17,880 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:17,880 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:17,967 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:17,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:17,967 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:17,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:17,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:17,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:17,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2614 [2022-12-13 02:25:17,968 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:25:17,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:17,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1949981664, now seen corresponding path program 1 times [2022-12-13 02:25:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:17,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260822706] [2022-12-13 02:25:17,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:17,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:18,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 02:25:18,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:18,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260822706] [2022-12-13 02:25:18,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260822706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:18,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:18,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:18,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664183365] [2022-12-13 02:25:18,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:18,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:18,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:18,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:18,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:18,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:18,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:18,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:18,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:18,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:18,103 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:18,103 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:18,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:18,104 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:18,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:18,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:18,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:18,105 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:18,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:18,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:18,107 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:18,108 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:18,108 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:18,108 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:18,108 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:18,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:18,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:18,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:18,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:18,114 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:18,114 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:18,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:18,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:18,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:18,201 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:18,201 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:18,201 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:18,201 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 02:25:18,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:18,201 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:18,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2615 [2022-12-13 02:25:18,202 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:25:18,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:18,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1978610815, now seen corresponding path program 1 times [2022-12-13 02:25:18,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:18,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057800026] [2022-12-13 02:25:18,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:18,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:18,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:25:18,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:18,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057800026] [2022-12-13 02:25:18,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057800026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:18,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:18,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:18,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527325065] [2022-12-13 02:25:18,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:18,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:18,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:18,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:18,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:18,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:18,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:18,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:18,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:18,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:18,336 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:18,336 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:18,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:18,337 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:18,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:18,338 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:18,338 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:18,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:18,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:18,340 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:18,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:18,340 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:18,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:18,340 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:18,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:18,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:18,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:18,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:18,346 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:18,346 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:18,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:18,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:18,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:18,433 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:18,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:18,433 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:18,433 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 02:25:18,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:18,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:18,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2616 [2022-12-13 02:25:18,433 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:25:18,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:18,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2007239966, now seen corresponding path program 1 times [2022-12-13 02:25:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:18,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878525915] [2022-12-13 02:25:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:18,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:25:18,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:18,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878525915] [2022-12-13 02:25:18,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878525915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:18,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:18,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:18,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803505072] [2022-12-13 02:25:18,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:18,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:18,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:18,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:18,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:18,487 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:18,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:18,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:18,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:18,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:18,562 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:18,562 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:18,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:18,563 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:18,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:18,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:18,564 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:18,564 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:18,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:18,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:18,566 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:18,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:18,567 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:18,567 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:18,567 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:18,567 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:18,567 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:18,567 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:18,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:18,573 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:18,573 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:18,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:18,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:18,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:18,659 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:18,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:25:18,659 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:18,659 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 02:25:18,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:18,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:18,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2617 [2022-12-13 02:25:18,660 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:25:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2035869117, now seen corresponding path program 1 times [2022-12-13 02:25:18,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:18,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294248609] [2022-12-13 02:25:18,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:18,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:18,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:25:18,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:18,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294248609] [2022-12-13 02:25:18,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294248609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:18,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:18,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:18,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990103229] [2022-12-13 02:25:18,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:18,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:18,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:18,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:18,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:18,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:18,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:18,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:18,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:18,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:18,786 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:18,787 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:18,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:18,788 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:18,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:18,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:18,788 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:18,788 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:18,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:18,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:18,791 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:18,791 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:18,791 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:18,791 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:18,791 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:18,791 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:18,792 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:18,792 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:18,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:18,797 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:18,797 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:18,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:18,798 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:18,798 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:18,884 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:18,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:18,885 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:18,885 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 02:25:18,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:18,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:18,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2618 [2022-12-13 02:25:18,885 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:25:18,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:18,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2064498268, now seen corresponding path program 1 times [2022-12-13 02:25:18,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:18,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103587187] [2022-12-13 02:25:18,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:18,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25: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 02:25:18,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:18,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103587187] [2022-12-13 02:25:18,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103587187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:18,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:18,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:18,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121389873] [2022-12-13 02:25:18,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:18,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:18,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:18,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:18,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:18,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:18,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:18,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:19,005 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:19,006 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:19,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1089 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:19,007 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:19,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:19,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:19,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:19,007 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:19,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:19,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:19,010 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:19,010 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:19,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:19,010 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,011 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:19,011 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:19,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:19,016 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:19,016 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:19,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:19,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:19,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:19,104 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:19,104 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:19,104 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:19,104 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 02:25:19,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:19,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:19,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2619 [2022-12-13 02:25:19,105 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:25:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2093127419, now seen corresponding path program 1 times [2022-12-13 02:25:19,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:19,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715063686] [2022-12-13 02:25:19,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:19,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:19,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:25:19,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:19,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715063686] [2022-12-13 02:25:19,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715063686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:19,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:19,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:19,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111148392] [2022-12-13 02:25:19,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:19,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:19,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:19,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:19,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:19,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:19,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:19,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:19,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:19,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:19,225 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:19,225 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:19,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:19,226 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:19,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:19,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:19,227 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:19,227 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:19,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:19,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:19,229 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:19,230 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:19,230 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:19,230 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:19,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:19,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:19,236 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:19,236 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:19,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:19,236 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:19,236 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:19,326 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:19,327 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:19,327 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:19,327 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 02:25:19,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:19,327 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:19,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2620 [2022-12-13 02:25:19,327 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:25:19,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:19,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2121756570, now seen corresponding path program 1 times [2022-12-13 02:25:19,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:19,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073182317] [2022-12-13 02:25:19,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:19,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:19,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:25:19,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:19,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073182317] [2022-12-13 02:25:19,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073182317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:19,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:19,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:19,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550204902] [2022-12-13 02:25:19,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:19,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:19,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:19,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:19,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:19,398 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:19,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:19,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:19,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:19,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:19,465 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:19,465 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:25:19,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:19,467 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:19,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:19,467 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:19,467 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:19,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:19,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:19,470 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,470 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:19,470 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:19,470 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:19,470 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,470 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:19,470 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:19,470 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:19,476 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:19,476 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:25:19,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:19,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:19,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:19,565 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:19,566 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:19,566 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:19,566 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 02:25:19,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:19,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:19,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2621 [2022-12-13 02:25:19,566 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:25:19,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:19,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2144581575, now seen corresponding path program 1 times [2022-12-13 02:25:19,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:19,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933760331] [2022-12-13 02:25:19,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:19,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:19,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:25:19,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:19,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933760331] [2022-12-13 02:25:19,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933760331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:19,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:19,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:19,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488842255] [2022-12-13 02:25:19,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:19,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:19,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:19,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:19,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:19,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:19,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:19,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:19,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:19,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:19,685 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:19,685 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:19,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:19,686 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:19,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:19,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:19,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:19,687 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:19,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:19,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:19,689 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,689 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:19,689 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:19,689 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:19,689 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,689 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:19,689 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:19,690 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:19,695 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:19,695 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:19,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:19,696 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:19,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:19,784 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:19,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:19,784 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:19,784 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 02:25:19,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:19,785 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:19,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2622 [2022-12-13 02:25:19,785 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:25:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2115952424, now seen corresponding path program 1 times [2022-12-13 02:25:19,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:19,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144704019] [2022-12-13 02:25:19,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:19,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:19,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:25:19,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:19,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144704019] [2022-12-13 02:25:19,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144704019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:19,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:19,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:19,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868834657] [2022-12-13 02:25:19,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:19,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:19,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:19,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:19,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:19,839 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:19,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:19,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:19,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:19,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:19,906 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:19,906 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:19,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:19,907 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:19,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:19,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:19,908 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:19,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:19,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:19,910 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,910 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:19,910 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:19,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:19,910 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:19,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:19,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:19,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:19,916 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:19,916 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:19,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:19,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:19,917 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:20,005 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:20,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:20,005 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:20,005 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 02:25:20,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:20,005 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:20,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2623 [2022-12-13 02:25:20,006 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:25:20,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:20,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2087323273, now seen corresponding path program 1 times [2022-12-13 02:25:20,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:20,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458055240] [2022-12-13 02:25:20,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:20,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:20,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:25:20,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:20,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458055240] [2022-12-13 02:25:20,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458055240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:20,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:20,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:20,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431597890] [2022-12-13 02:25:20,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:20,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:20,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:20,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:20,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:20,063 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:20,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:20,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:20,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:20,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:20,139 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:20,140 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:20,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:20,141 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:20,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:20,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:20,141 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:20,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:20,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:20,144 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:20,144 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:20,144 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:20,144 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:20,144 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:20,144 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:20,144 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:20,144 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:20,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:20,150 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:20,150 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:20,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:20,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:20,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:20,238 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:20,239 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:20,239 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:20,239 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 02:25:20,239 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:20,239 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:20,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2624 [2022-12-13 02:25:20,239 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:25:20,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:20,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2058694122, now seen corresponding path program 1 times [2022-12-13 02:25:20,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:20,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115333614] [2022-12-13 02:25:20,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:20,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:20,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:25:20,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:20,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115333614] [2022-12-13 02:25:20,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115333614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:20,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:20,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:20,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004678235] [2022-12-13 02:25:20,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:20,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:20,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:20,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:20,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:20,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:20,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:20,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:20,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:20,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:20,398 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:20,398 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:20,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:20,399 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:20,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:20,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:20,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:20,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:20,400 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:20,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:20,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:20,402 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:20,402 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:20,402 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:20,402 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:20,402 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:20,403 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:20,403 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:20,403 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:20,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:20,408 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:20,408 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:20,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:20,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:20,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:20,496 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:20,497 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:20,497 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:20,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:20,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:20,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:20,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2625 [2022-12-13 02:25:20,497 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:25:20,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2030064971, now seen corresponding path program 1 times [2022-12-13 02:25:20,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:20,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298884225] [2022-12-13 02:25:20,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:20,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:20,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:25:20,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:20,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298884225] [2022-12-13 02:25:20,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298884225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:20,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:20,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:20,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147977033] [2022-12-13 02:25:20,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:20,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:20,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:20,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:20,566 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:20,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:20,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:20,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:20,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:20,632 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:20,632 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:20,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:20,633 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:20,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:20,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:20,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:20,633 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:20,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:20,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:20,636 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:20,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:20,636 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:20,636 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:20,636 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:20,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:20,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:20,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:20,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:20,642 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:20,642 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:20,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:20,643 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:20,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:20,730 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:20,731 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:20,731 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:20,731 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 02:25:20,731 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:20,731 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:20,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2626 [2022-12-13 02:25:20,731 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:25:20,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2001435820, now seen corresponding path program 1 times [2022-12-13 02:25:20,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:20,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128805837] [2022-12-13 02:25:20,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:20,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:20,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:25:20,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:20,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128805837] [2022-12-13 02:25:20,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128805837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:20,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:20,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:20,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921752461] [2022-12-13 02:25:20,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:20,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:20,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:20,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:20,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:20,787 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:20,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:20,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:20,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:20,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:20,854 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:20,854 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:20,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1131 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:20,856 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:20,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:20,856 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:20,856 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:20,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:20,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:20,858 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:20,858 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:20,859 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:20,859 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:20,859 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:20,859 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:20,859 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:20,859 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:20,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:20,865 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:20,865 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:20,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:20,866 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:20,866 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:20,967 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:20,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 02:25:20,967 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:20,967 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 02:25:20,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:20,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:20,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2627 [2022-12-13 02:25:20,968 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:25:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:20,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1972806669, now seen corresponding path program 1 times [2022-12-13 02:25:20,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:20,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922758258] [2022-12-13 02:25:20,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:20,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:21,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 02:25:21,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:21,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922758258] [2022-12-13 02:25:21,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922758258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:21,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:21,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:21,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582917617] [2022-12-13 02:25:21,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:21,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:21,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:21,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:21,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:21,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:21,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:21,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:21,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:21,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:21,108 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:21,108 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:21,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:21,109 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:21,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:21,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:21,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:21,110 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:21,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:21,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:21,112 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:21,113 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:21,113 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:21,113 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:21,113 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:21,113 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:21,113 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:21,113 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:21,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:21,119 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:21,119 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:21,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:21,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:21,119 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:21,216 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:21,217 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:25:21,217 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:21,217 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 02:25:21,217 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:21,217 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:21,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2628 [2022-12-13 02:25:21,217 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:25:21,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:21,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1944177518, now seen corresponding path program 1 times [2022-12-13 02:25:21,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:21,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444314416] [2022-12-13 02:25:21,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:21,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:21,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:25:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:21,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444314416] [2022-12-13 02:25:21,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444314416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:21,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:21,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565070202] [2022-12-13 02:25:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:21,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:21,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:21,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:21,275 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:21,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:21,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:21,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:21,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:21,345 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:21,345 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:21,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:21,346 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:21,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:21,347 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:21,347 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:21,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:21,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:21,351 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:21,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:21,351 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:21,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:21,351 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:21,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:21,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:21,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:21,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:21,360 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:21,360 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:21,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:21,361 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:21,361 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:21,454 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:21,454 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 02:25:21,454 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:21,454 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 02:25:21,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:21,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:21,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2629 [2022-12-13 02:25:21,455 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:25:21,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1915548367, now seen corresponding path program 1 times [2022-12-13 02:25:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:21,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977230140] [2022-12-13 02:25:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:21,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:21,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:25:21,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:21,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977230140] [2022-12-13 02:25:21,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977230140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:21,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:21,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21483224] [2022-12-13 02:25:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:21,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:21,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:21,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:21,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:21,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:21,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:21,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:21,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:21,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:21,598 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:21,598 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:25:21,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:21,599 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:21,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:21,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:21,600 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:21,600 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:21,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:21,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:21,602 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:21,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:21,602 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:21,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:21,603 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:21,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:21,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:21,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:21,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:21,609 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:21,609 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:21,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:21,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:21,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:21,721 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:21,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:25:21,721 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:21,721 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 02:25:21,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:21,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:21,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2630 [2022-12-13 02:25:21,721 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:25:21,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1886919216, now seen corresponding path program 1 times [2022-12-13 02:25:21,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:21,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886282079] [2022-12-13 02:25:21,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:21,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:21,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:25:21,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:21,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886282079] [2022-12-13 02:25:21,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886282079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:21,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:21,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:21,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297431149] [2022-12-13 02:25:21,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:21,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:21,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:21,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:21,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:21,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:21,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:21,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:21,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:21,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:21,856 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:21,856 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:21,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:21,857 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:21,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:21,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:21,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:21,858 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:21,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:21,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:21,860 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:21,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:21,861 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:21,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:21,861 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:21,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:21,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:21,861 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:21,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:21,866 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:21,867 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:21,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:21,867 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:21,867 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:21,956 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:21,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:21,957 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:21,957 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 02:25:21,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:21,957 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:21,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2631 [2022-12-13 02:25:21,957 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:25:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1858290065, now seen corresponding path program 1 times [2022-12-13 02:25:21,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:21,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394219607] [2022-12-13 02:25:21,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:21,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:22,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:25:22,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:22,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394219607] [2022-12-13 02:25:22,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394219607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:22,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:22,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53921467] [2022-12-13 02:25:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:22,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:22,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:22,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:22,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:22,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:22,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:22,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:22,075 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:22,075 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:22,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:22,076 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:22,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:22,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:22,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:22,077 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:22,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:22,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:22,079 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:22,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:22,080 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:22,080 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:22,080 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:22,080 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:22,080 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:22,080 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:22,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:22,086 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:22,086 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:22,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:22,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:22,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:22,176 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:22,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:22,177 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:22,177 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 02:25:22,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:22,177 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:22,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2632 [2022-12-13 02:25:22,177 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:25:22,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:22,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1829660914, now seen corresponding path program 1 times [2022-12-13 02:25:22,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:22,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879759720] [2022-12-13 02:25:22,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:22,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:22,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:25:22,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:22,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879759720] [2022-12-13 02:25:22,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879759720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:22,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:22,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:22,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474564680] [2022-12-13 02:25:22,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:22,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:22,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:22,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:22,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:22,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:22,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:22,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:22,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:22,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:22,298 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:22,298 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:22,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:22,299 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:22,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:22,299 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:22,299 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:22,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:22,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:22,302 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:22,302 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:22,302 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:22,302 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:22,302 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:22,302 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:22,302 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:22,303 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:22,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:22,308 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:22,308 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:22,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:22,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:22,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:22,396 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:22,396 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:22,396 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:22,396 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 02:25:22,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:22,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:22,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2633 [2022-12-13 02:25:22,397 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:25:22,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:22,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1801031763, now seen corresponding path program 1 times [2022-12-13 02:25:22,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:22,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674949312] [2022-12-13 02:25:22,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:22,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:22,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:25:22,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:22,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674949312] [2022-12-13 02:25:22,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674949312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:22,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:22,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:22,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104912566] [2022-12-13 02:25:22,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:22,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:22,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:22,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:22,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:22,466 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:22,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:22,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:22,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:22,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:22,545 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:22,545 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:22,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:22,546 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:22,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:22,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:22,547 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:22,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:22,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:22,551 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:22,551 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:22,551 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:22,551 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:22,552 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:22,552 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:22,552 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:22,552 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:22,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:22,560 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:22,560 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:22,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:22,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:22,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:22,671 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:22,672 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:25:22,672 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:22,672 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 02:25:22,672 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:22,672 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:22,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2634 [2022-12-13 02:25:22,672 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:25:22,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1772402612, now seen corresponding path program 1 times [2022-12-13 02:25:22,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:22,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163220270] [2022-12-13 02:25:22,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:22,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:22,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:25:22,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:22,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163220270] [2022-12-13 02:25:22,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163220270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:22,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:22,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:22,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807186104] [2022-12-13 02:25:22,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:22,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:22,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:22,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:22,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:22,730 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:22,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:22,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:22,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:22,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:22,796 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:22,797 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:25:22,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:22,798 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:22,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:22,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:22,798 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:22,798 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:22,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:22,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:22,801 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:22,801 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:22,801 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:22,801 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:22,801 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:22,801 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:22,801 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:22,801 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:22,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:22,807 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:22,807 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:25:22,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:22,808 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:22,808 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:22,895 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:22,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:22,896 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:22,896 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 02:25:22,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:22,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:22,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2635 [2022-12-13 02:25:22,896 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:25:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:22,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1743773461, now seen corresponding path program 1 times [2022-12-13 02:25:22,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:22,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143314557] [2022-12-13 02:25:22,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:22,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:22,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:25:22,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:22,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143314557] [2022-12-13 02:25:22,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143314557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:22,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:22,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:22,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285518190] [2022-12-13 02:25:22,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:22,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:22,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:22,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:22,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:22,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:22,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:22,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:22,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:22,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:23,042 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:23,042 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:23,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:23,043 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:23,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:23,043 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:23,043 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:23,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:23,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:23,046 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:23,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:23,046 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:23,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:23,046 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:23,046 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:23,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:23,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:23,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:23,052 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:23,052 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:23,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:23,052 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:23,052 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:23,140 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:23,140 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:23,141 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:23,141 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 02:25:23,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:23,141 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:23,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2636 [2022-12-13 02:25:23,141 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:25:23,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1715144310, now seen corresponding path program 1 times [2022-12-13 02:25:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:23,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978501077] [2022-12-13 02:25:23,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:23,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:23,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:25:23,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:23,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978501077] [2022-12-13 02:25:23,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978501077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:23,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:23,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:23,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661646339] [2022-12-13 02:25:23,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:23,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:23,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:23,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:23,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:23,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:23,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:23,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:23,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:23,274 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:23,274 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:23,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:23,275 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:23,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:23,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:23,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:23,276 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:23,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:23,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:23,278 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:23,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:23,278 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:23,279 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:23,279 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:23,279 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:23,279 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:23,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:23,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:23,284 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:23,285 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:23,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:23,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:23,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:23,383 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:23,384 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:25:23,384 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:23,384 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 02:25:23,384 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:23,384 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:23,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2637 [2022-12-13 02:25:23,384 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:25:23,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:23,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1686515159, now seen corresponding path program 1 times [2022-12-13 02:25:23,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:23,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296444647] [2022-12-13 02:25:23,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:23,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:23,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 02:25:23,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:23,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296444647] [2022-12-13 02:25:23,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296444647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:23,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:23,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:23,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594510638] [2022-12-13 02:25:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:23,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:23,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:23,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:23,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:23,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:23,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:23,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:23,540 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:23,540 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:23,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:23,541 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:23,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:23,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:23,542 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:23,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:23,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:23,544 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:23,544 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:23,544 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:23,544 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:23,544 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:23,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:23,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:23,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:23,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:23,550 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:23,550 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:25:23,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:23,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:23,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:23,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:23,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:23,638 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:23,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:23,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:23,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:23,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2638 [2022-12-13 02:25:23,638 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:25:23,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:23,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1657886008, now seen corresponding path program 1 times [2022-12-13 02:25:23,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:23,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959900042] [2022-12-13 02:25:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:23,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:23,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:25:23,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:23,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959900042] [2022-12-13 02:25:23,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959900042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:23,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:23,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:23,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234961036] [2022-12-13 02:25:23,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:23,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:23,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:23,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:23,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:23,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:23,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:23,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:23,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:23,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:23,776 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:23,776 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:25:23,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:23,777 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:23,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:23,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:23,778 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:23,778 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:23,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:23,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:23,780 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:23,780 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:23,780 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:23,780 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:23,780 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:23,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:23,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:23,781 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:23,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:23,786 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:23,786 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:23,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:23,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:23,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:23,873 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:23,874 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:23,874 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:23,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:23,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:23,874 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:23,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2639 [2022-12-13 02:25:23,874 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:25:23,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1629256857, now seen corresponding path program 1 times [2022-12-13 02:25:23,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:23,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585211215] [2022-12-13 02:25:23,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:23,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:23,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:25:23,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:23,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585211215] [2022-12-13 02:25:23,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585211215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:23,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:23,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:23,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251011449] [2022-12-13 02:25:23,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:23,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:23,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:23,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:23,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:23,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:23,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:23,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:23,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:23,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:23,996 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:23,997 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:23,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:23,998 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:23,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:23,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:23,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:23,998 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:23,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:24,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:24,000 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:24,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:24,001 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:24,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:24,001 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:24,001 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:24,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:24,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:24,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:24,006 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:24,007 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:24,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:24,007 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:24,007 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:24,119 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:24,120 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:25:24,120 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:24,120 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 02:25:24,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:24,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:24,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2640 [2022-12-13 02:25:24,120 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:25:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1600627706, now seen corresponding path program 1 times [2022-12-13 02:25:24,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:24,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084559273] [2022-12-13 02:25:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:24,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:24,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 02:25:24,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:24,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084559273] [2022-12-13 02:25:24,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084559273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:24,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:24,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:24,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197174255] [2022-12-13 02:25:24,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:24,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:24,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:24,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:24,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:24,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:24,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:24,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:24,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:24,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:24,286 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:24,286 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:24,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:24,287 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:24,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:24,287 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:24,287 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:24,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:24,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:24,290 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:24,290 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:24,290 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:24,290 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:24,290 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:24,290 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:24,290 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:24,291 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:24,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:24,296 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:24,296 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:24,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:24,297 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:24,297 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:24,383 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:24,383 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:24,384 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:24,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:24,384 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:24,384 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:24,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2641 [2022-12-13 02:25:24,384 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:25:24,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:24,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1571998555, now seen corresponding path program 1 times [2022-12-13 02:25:24,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:24,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693922373] [2022-12-13 02:25:24,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:24,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:24,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:25:24,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:24,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693922373] [2022-12-13 02:25:24,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693922373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:24,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:24,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935280518] [2022-12-13 02:25:24,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:24,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:24,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:24,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:24,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:24,454 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:24,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:24,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:24,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:24,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:24,537 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:24,537 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:24,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:24,538 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:24,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:24,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:24,539 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:24,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:24,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:24,542 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:24,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:24,542 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:24,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:24,542 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:24,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:24,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:24,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:24,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:24,548 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:24,548 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:24,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:24,549 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:24,549 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:24,637 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:24,637 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:24,637 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:24,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:24,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:24,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:24,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2642 [2022-12-13 02:25:24,638 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:25:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1543369404, now seen corresponding path program 1 times [2022-12-13 02:25:24,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:24,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173635321] [2022-12-13 02:25:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:24,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:24,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 02:25:24,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:24,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173635321] [2022-12-13 02:25:24,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173635321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:24,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:24,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542248043] [2022-12-13 02:25:24,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:24,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:24,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:24,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:24,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:24,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:24,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:24,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:24,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:24,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:24,836 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:24,836 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:24,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1125 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:24,837 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:24,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:24,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:24,837 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:24,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:24,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:24,840 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:24,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:24,840 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:24,840 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:24,840 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:24,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:24,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:24,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:24,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:24,846 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:24,846 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:24,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:24,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:24,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:24,933 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:24,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:24,933 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:24,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:24,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:24,933 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:24,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2643 [2022-12-13 02:25:24,934 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:25:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:24,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1514740253, now seen corresponding path program 1 times [2022-12-13 02:25:24,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:24,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085974624] [2022-12-13 02:25:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:24,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:24,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:25:24,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:24,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085974624] [2022-12-13 02:25:24,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085974624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:24,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:24,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:24,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850190386] [2022-12-13 02:25:24,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:24,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:24,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:24,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:24,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:24,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:24,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:24,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:24,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:24,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:25,066 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:25,066 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:25,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:25,067 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:25,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:25,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:25,067 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:25,067 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:25,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:25,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:25,070 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,070 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:25,070 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:25,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:25,070 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,071 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:25,071 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:25,071 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:25,076 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:25,076 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:25,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:25,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:25,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:25,164 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:25,165 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:25,165 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:25,165 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 02:25:25,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:25,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:25,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2644 [2022-12-13 02:25:25,165 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:25:25,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:25,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1486111102, now seen corresponding path program 1 times [2022-12-13 02:25:25,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:25,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233773456] [2022-12-13 02:25:25,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:25,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:25,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:25:25,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:25,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233773456] [2022-12-13 02:25:25,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233773456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:25,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:25,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:25,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075963610] [2022-12-13 02:25:25,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:25,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:25,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:25,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:25,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:25,220 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:25,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:25,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:25,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:25,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:25,295 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:25,295 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:25,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:25,296 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:25,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:25,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:25,297 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:25,297 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:25,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:25,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:25,299 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,299 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:25,299 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:25,299 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:25,299 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,300 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:25,300 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:25,300 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:25,305 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:25,305 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:25:25,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:25,306 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:25,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:25,392 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:25,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:25,393 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:25,393 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 02:25:25,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:25,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:25,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2645 [2022-12-13 02:25:25,393 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:25:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:25,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1457481951, now seen corresponding path program 1 times [2022-12-13 02:25:25,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:25,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254417596] [2022-12-13 02:25:25,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:25,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25: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:25:25,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:25,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254417596] [2022-12-13 02:25:25,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254417596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:25,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:25,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:25,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774309392] [2022-12-13 02:25:25,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:25,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:25,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:25,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:25,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:25,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:25,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:25,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:25,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:25,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:25,539 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:25,540 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:25,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:25,541 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:25,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:25,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:25,541 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:25,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:25,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:25,544 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,544 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:25,544 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:25,544 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:25,544 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:25,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:25,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:25,550 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:25,550 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:25,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:25,551 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:25,551 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:25,637 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:25,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:25,638 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:25,638 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 02:25:25,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:25,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:25,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2646 [2022-12-13 02:25:25,638 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:25:25,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:25,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1428852800, now seen corresponding path program 1 times [2022-12-13 02:25:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:25,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273295025] [2022-12-13 02:25:25,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:25,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:25,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:25:25,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:25,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273295025] [2022-12-13 02:25:25,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273295025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:25,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:25,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:25,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314373641] [2022-12-13 02:25:25,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:25,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:25,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:25,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:25,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:25,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:25,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:25,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:25,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:25,759 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:25,759 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:25,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:25,760 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:25,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:25,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:25,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:25,761 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:25,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:25,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:25,763 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:25,764 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:25,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:25,764 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:25,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:25,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:25,770 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:25,770 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:25:25,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:25,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:25,770 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:25,858 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:25,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:25,858 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:25,858 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 02:25:25,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:25,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:25,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2647 [2022-12-13 02:25:25,859 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:25:25,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:25,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1400223649, now seen corresponding path program 1 times [2022-12-13 02:25:25,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:25,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293743525] [2022-12-13 02:25:25,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:25,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:25,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:25,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293743525] [2022-12-13 02:25:25,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293743525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:25,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:25,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:25,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448284848] [2022-12-13 02:25:25,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:25,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:25,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:25,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:25,915 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:25,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:25,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:25,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:25,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:25,989 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:25,989 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:25,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:25,991 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:25,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:25,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:25,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:25,991 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:25,991 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:25,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:25,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:25,994 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,994 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:25,994 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:25,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:25,994 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,994 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:25,994 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:25,994 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:25,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:26,000 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:26,000 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:26,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:26,001 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:26,001 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:26,087 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:26,088 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:26,088 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:26,088 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 02:25:26,088 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:26,088 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:26,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2648 [2022-12-13 02:25:26,088 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:25:26,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:26,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1371594498, now seen corresponding path program 1 times [2022-12-13 02:25:26,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:26,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996047438] [2022-12-13 02:25:26,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:26,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:26,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:26,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996047438] [2022-12-13 02:25:26,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996047438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:26,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:26,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:26,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515004723] [2022-12-13 02:25:26,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:26,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:26,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:26,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:26,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:26,145 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:26,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:26,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:26,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:26,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:26,211 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:26,212 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:26,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:26,213 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:26,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:26,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:26,213 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:26,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:26,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:26,216 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:26,216 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:26,216 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:26,216 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:26,216 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:26,216 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:26,216 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:26,216 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:26,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:26,222 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:26,222 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:26,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:26,222 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:26,222 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:26,310 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:26,310 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:26,310 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:26,310 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 02:25:26,310 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:26,310 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:26,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2649 [2022-12-13 02:25:26,310 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:25:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1342965347, now seen corresponding path program 1 times [2022-12-13 02:25:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:26,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430941663] [2022-12-13 02:25:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:26,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:25:26,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:26,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430941663] [2022-12-13 02:25:26,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430941663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:26,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:26,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:26,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396477748] [2022-12-13 02:25:26,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:26,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:26,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:26,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:26,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:26,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:26,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:26,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:26,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:26,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:26,442 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:26,442 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:26,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:26,443 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:26,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:26,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:26,444 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:26,444 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:26,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:26,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:26,447 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:26,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:26,447 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:26,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:26,447 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:26,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:26,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:26,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:26,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:26,453 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:26,453 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:26,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:26,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:26,454 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:26,541 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:26,542 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:26,542 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:26,542 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 02:25:26,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:26,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:26,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2650 [2022-12-13 02:25:26,542 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:25:26,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:26,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1314336196, now seen corresponding path program 1 times [2022-12-13 02:25:26,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:26,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951650074] [2022-12-13 02:25:26,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:26,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:26,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:25:26,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:26,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951650074] [2022-12-13 02:25:26,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951650074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:26,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:26,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:26,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549190997] [2022-12-13 02:25:26,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:26,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:26,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:26,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:26,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:26,614 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:26,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:26,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:26,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:26,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:26,690 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:26,690 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:26,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:26,691 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:26,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:26,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:26,692 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:26,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:26,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:26,694 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:26,694 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:26,694 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:26,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:26,695 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:26,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:26,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:26,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:26,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:26,700 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:26,700 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:26,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:26,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:26,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:26,788 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:26,789 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:26,789 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:26,789 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 02:25:26,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:26,789 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:26,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2651 [2022-12-13 02:25:26,789 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:25:26,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:26,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1285707045, now seen corresponding path program 1 times [2022-12-13 02:25:26,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:26,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571851415] [2022-12-13 02:25:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:26,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:26,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:25:26,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:26,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571851415] [2022-12-13 02:25:26,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571851415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:26,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:26,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:26,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605074486] [2022-12-13 02:25:26,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:26,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:26,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:26,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:26,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:26,846 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:26,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:26,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:26,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:26,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:26,923 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:26,923 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:26,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:26,924 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:26,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:26,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:26,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:26,925 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:26,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:26,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:26,927 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:26,927 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:26,927 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:26,927 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:26,927 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:26,928 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:26,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:26,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:26,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:26,933 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:26,933 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:26,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:26,934 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:26,934 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:27,022 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:27,022 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:27,022 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:27,022 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 02:25:27,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:27,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:27,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2652 [2022-12-13 02:25:27,022 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:25:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:27,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1257077894, now seen corresponding path program 1 times [2022-12-13 02:25:27,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:27,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964849417] [2022-12-13 02:25:27,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:27,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:27,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:25:27,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:27,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964849417] [2022-12-13 02:25:27,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964849417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:27,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:27,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:27,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167782115] [2022-12-13 02:25:27,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:27,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:27,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:27,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:27,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:27,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:27,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:27,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:27,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:27,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:27,152 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:27,153 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:27,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:27,154 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:27,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:27,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:27,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:27,154 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:27,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:27,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:27,157 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:27,157 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:27,157 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:27,157 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:27,157 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:27,157 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:27,157 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:27,157 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:27,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:27,163 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:27,163 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:27,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:27,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:27,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:27,250 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:27,251 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:27,251 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:27,251 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 02:25:27,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:27,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:27,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2653 [2022-12-13 02:25:27,251 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:25:27,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1228448743, now seen corresponding path program 1 times [2022-12-13 02:25:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:27,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835123622] [2022-12-13 02:25:27,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:27,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:25:27,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:27,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835123622] [2022-12-13 02:25:27,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835123622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:27,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:27,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:27,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700640287] [2022-12-13 02:25:27,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:27,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:27,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:27,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:27,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:27,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:27,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:27,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:27,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:27,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:27,399 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:27,399 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:27,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1126 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:27,400 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:27,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:27,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:27,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:27,401 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:27,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:27,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:27,403 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:27,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:27,403 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:27,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:27,404 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:27,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:27,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:27,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:27,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:27,409 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:27,409 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:27,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:27,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:27,410 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:27,498 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:27,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:27,499 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:27,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:27,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:27,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:27,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2654 [2022-12-13 02:25:27,499 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:25:27,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1199819592, now seen corresponding path program 1 times [2022-12-13 02:25:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703426752] [2022-12-13 02:25:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:27,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:25:27,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:27,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703426752] [2022-12-13 02:25:27,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703426752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:27,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:27,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:27,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277676925] [2022-12-13 02:25:27,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:27,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:27,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:27,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:27,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:27,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:27,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:27,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:27,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:27,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:27,631 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:27,631 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:27,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:27,632 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:27,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:27,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:27,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:27,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:27,633 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:27,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:27,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:27,636 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:27,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:27,636 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:27,636 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:27,636 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:27,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:27,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:27,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:27,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:27,642 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:27,642 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:27,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:27,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:27,642 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:27,730 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:27,730 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:27,730 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:27,730 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 02:25:27,731 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:27,731 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:27,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2655 [2022-12-13 02:25:27,731 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:25:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:27,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1171190441, now seen corresponding path program 1 times [2022-12-13 02:25:27,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:27,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899790333] [2022-12-13 02:25:27,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:27,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:27,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:25:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:27,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899790333] [2022-12-13 02:25:27,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899790333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:27,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:27,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:27,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122072324] [2022-12-13 02:25:27,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:27,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:27,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:27,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:27,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:27,801 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:27,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:27,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:27,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:27,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:27,876 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:27,876 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:27,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:27,877 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:27,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:27,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:27,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:27,878 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:27,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:27,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:27,880 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:27,880 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:27,880 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:27,880 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:27,880 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:27,881 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:27,881 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:27,881 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:27,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:27,886 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:27,886 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:25:27,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:27,887 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:27,887 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:27,974 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:27,974 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:27,975 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:27,975 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 02:25:27,975 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:27,975 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:27,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2656 [2022-12-13 02:25:27,975 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:25:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1142561290, now seen corresponding path program 1 times [2022-12-13 02:25:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:27,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655227541] [2022-12-13 02:25:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:28,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 02:25:28,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:28,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655227541] [2022-12-13 02:25:28,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655227541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:28,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:28,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:28,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421572311] [2022-12-13 02:25:28,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:28,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:28,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:28,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:28,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:28,031 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:28,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:28,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:28,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:28,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:28,100 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:28,100 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:28,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:28,101 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:28,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:28,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:28,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:28,102 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:28,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:28,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:28,104 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:28,104 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:28,104 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:28,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:28,105 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:28,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:28,105 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:28,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:28,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:28,110 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:28,110 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:28,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:28,111 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:28,111 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:28,199 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:28,199 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:28,199 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:28,199 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 02:25:28,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:28,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:28,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2657 [2022-12-13 02:25:28,200 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:25:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:28,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1113932139, now seen corresponding path program 1 times [2022-12-13 02:25:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:28,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806224366] [2022-12-13 02:25:28,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:28,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:28,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:25:28,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:28,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806224366] [2022-12-13 02:25:28,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806224366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:28,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:28,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:28,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206405782] [2022-12-13 02:25:28,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:28,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:28,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:28,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:28,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:28,252 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:28,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:28,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:28,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:28,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:28,327 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:28,327 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:28,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:28,328 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:28,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:28,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:28,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:28,329 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:28,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:28,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:28,332 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:28,332 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:28,332 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:28,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:28,332 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:28,332 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:28,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:28,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:28,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:28,338 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:28,338 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:28,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:28,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:28,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:28,425 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:28,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:28,425 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:28,426 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 02:25:28,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:28,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:28,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2658 [2022-12-13 02:25:28,426 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:25:28,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:28,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1085302988, now seen corresponding path program 1 times [2022-12-13 02:25:28,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:28,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889372741] [2022-12-13 02:25:28,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:28,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:28,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:25:28,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:28,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889372741] [2022-12-13 02:25:28,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889372741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:28,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:28,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:28,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127691373] [2022-12-13 02:25:28,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:28,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:28,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:28,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:28,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:28,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:28,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:28,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:28,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:28,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:28,551 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:28,551 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:28,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:28,552 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:28,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:28,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:28,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:28,553 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:28,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:28,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:28,555 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:28,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:28,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:28,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:28,556 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:28,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:28,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:28,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:28,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:28,561 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:28,561 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:28,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:28,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:28,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:28,649 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:28,650 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:28,650 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:28,650 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 02:25:28,650 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:28,650 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:28,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2659 [2022-12-13 02:25:28,650 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:25:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1056673837, now seen corresponding path program 1 times [2022-12-13 02:25:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:28,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33890748] [2022-12-13 02:25:28,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:28,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:28,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 02:25:28,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:28,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33890748] [2022-12-13 02:25:28,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33890748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:28,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:28,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:28,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970943882] [2022-12-13 02:25:28,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:28,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:28,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:28,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:28,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:28,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:28,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:28,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:28,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:28,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:28,768 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:28,768 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:28,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:28,769 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:28,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:28,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:28,770 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:28,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:28,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:28,772 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:28,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:28,773 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:28,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:28,773 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:28,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:28,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:28,773 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:28,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:28,779 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:28,779 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:28,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:28,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:28,779 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:28,867 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:28,867 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:28,867 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:28,868 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 02:25:28,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:28,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:28,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2660 [2022-12-13 02:25:28,868 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:25:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1028044686, now seen corresponding path program 1 times [2022-12-13 02:25:28,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:28,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265633536] [2022-12-13 02:25:28,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:28,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:28,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:25:28,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:28,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265633536] [2022-12-13 02:25:28,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265633536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:28,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:28,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:28,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834998388] [2022-12-13 02:25:28,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:28,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:28,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:28,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:28,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:28,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:28,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:28,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:28,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:28,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:29,000 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:29,000 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:29,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:29,001 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:29,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:29,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:29,001 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:29,001 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:29,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:29,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:29,004 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,004 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:29,004 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:29,004 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:29,004 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,004 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:29,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:29,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:29,010 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:29,010 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:29,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:29,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:29,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:29,097 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:29,097 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:29,097 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:29,097 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 02:25:29,097 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:29,098 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:29,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2661 [2022-12-13 02:25:29,098 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:25:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash -999415535, now seen corresponding path program 1 times [2022-12-13 02:25:29,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:29,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345074850] [2022-12-13 02:25:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:29,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:29,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:25:29,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:29,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345074850] [2022-12-13 02:25:29,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345074850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:29,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:29,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:29,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701506135] [2022-12-13 02:25:29,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:29,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:29,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:29,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:29,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:29,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:29,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:29,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:29,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:29,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:29,251 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:29,251 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:29,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:29,253 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:29,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:29,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:29,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:29,253 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:29,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:29,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:29,257 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,257 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:29,257 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:29,257 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:29,257 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,258 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:29,258 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:29,258 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:29,265 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:29,266 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:29,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:29,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:29,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:29,375 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:29,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:25:29,376 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:29,376 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 02:25:29,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:29,376 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:29,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2662 [2022-12-13 02:25:29,376 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:25:29,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:29,376 INFO L85 PathProgramCache]: Analyzing trace with hash -970786384, now seen corresponding path program 1 times [2022-12-13 02:25:29,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:29,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827829830] [2022-12-13 02:25:29,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:29,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:29,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:25:29,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:29,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827829830] [2022-12-13 02:25:29,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827829830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:29,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:29,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:29,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091403972] [2022-12-13 02:25:29,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:29,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:29,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:29,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:29,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:29,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:29,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:29,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:29,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:29,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:29,533 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:29,533 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:29,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:29,534 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:29,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:29,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:29,535 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:29,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:29,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:29,538 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:29,538 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:29,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:29,538 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,538 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:29,538 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:29,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:29,544 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:29,544 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:29,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:29,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:29,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:29,632 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:29,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:29,633 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:29,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:29,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:29,633 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:29,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2663 [2022-12-13 02:25:29,633 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:25:29,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash -942157233, now seen corresponding path program 1 times [2022-12-13 02:25:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:29,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631845015] [2022-12-13 02:25:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:29,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:25:29,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:29,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631845015] [2022-12-13 02:25:29,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631845015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:29,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:29,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:29,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945091341] [2022-12-13 02:25:29,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:29,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:29,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:29,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:29,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:29,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:29,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:29,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:29,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:29,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:29,763 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:29,763 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:29,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:29,764 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:29,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:29,765 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:29,765 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:29,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:29,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:29,767 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:29,768 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:29,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:29,768 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:29,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:29,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:29,773 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:29,774 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:29,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:29,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:29,774 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:29,864 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:29,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:29,864 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:29,864 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 02:25:29,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:29,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:29,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2664 [2022-12-13 02:25:29,864 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:25:29,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:29,865 INFO L85 PathProgramCache]: Analyzing trace with hash -913528082, now seen corresponding path program 1 times [2022-12-13 02:25:29,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:29,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146911217] [2022-12-13 02:25:29,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:29,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:29,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:25:29,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:29,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146911217] [2022-12-13 02:25:29,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146911217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:29,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:29,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:29,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929092185] [2022-12-13 02:25:29,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:29,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:29,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:29,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:29,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:29,921 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:29,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:29,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:29,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:29,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:29,987 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:29,987 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:29,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:29,989 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:29,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:29,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:29,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:29,989 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:29,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:29,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:29,992 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,992 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:29,992 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:29,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:29,992 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:29,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:29,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:29,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:29,998 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:29,998 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:29,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:29,999 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:29,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:30,088 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:30,089 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:30,089 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:30,089 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 02:25:30,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:30,089 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:30,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2665 [2022-12-13 02:25:30,089 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:25:30,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:30,089 INFO L85 PathProgramCache]: Analyzing trace with hash -884898931, now seen corresponding path program 1 times [2022-12-13 02:25:30,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:30,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733389101] [2022-12-13 02:25:30,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:30,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:30,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:30,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733389101] [2022-12-13 02:25:30,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733389101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:30,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:30,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:30,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447379339] [2022-12-13 02:25:30,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:30,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:30,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:30,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:30,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:30,158 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:30,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:30,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:30,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:30,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:30,234 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:30,234 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:30,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:30,235 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:30,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:30,236 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:30,236 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:30,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:30,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:30,239 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:30,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:30,239 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:30,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:30,239 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:30,239 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:30,239 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:30,239 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:30,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:30,245 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:30,245 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:30,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:30,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:30,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:30,333 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:30,334 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:30,334 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:30,334 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 02:25:30,334 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:30,334 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:30,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2666 [2022-12-13 02:25:30,334 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:25:30,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:30,335 INFO L85 PathProgramCache]: Analyzing trace with hash -856269780, now seen corresponding path program 1 times [2022-12-13 02:25:30,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:30,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711968518] [2022-12-13 02:25:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:30,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:30,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:25:30,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:30,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711968518] [2022-12-13 02:25:30,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711968518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:30,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:30,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:30,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771412705] [2022-12-13 02:25:30,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:30,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:30,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:30,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:30,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:30,390 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:30,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:30,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:30,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:30,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:30,466 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:30,466 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:30,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:30,467 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:30,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:30,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:30,468 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:30,468 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:30,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:30,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:30,470 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:30,470 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:30,471 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:30,471 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:30,471 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:30,471 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:30,471 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:30,471 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:30,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:30,476 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:30,477 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:30,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:30,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:30,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:30,564 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:30,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:30,565 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:30,565 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 02:25:30,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:30,565 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:30,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2667 [2022-12-13 02:25:30,565 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:25:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:30,565 INFO L85 PathProgramCache]: Analyzing trace with hash -827640629, now seen corresponding path program 1 times [2022-12-13 02:25:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:30,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984277362] [2022-12-13 02:25:30,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:30,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:30,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:25:30,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:30,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984277362] [2022-12-13 02:25:30,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984277362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:30,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:30,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:30,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422969911] [2022-12-13 02:25:30,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:30,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:30,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:30,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:30,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:30,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:30,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:30,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:30,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:30,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:30,688 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:30,688 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:25:30,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:30,689 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:30,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:30,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:30,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:30,690 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:30,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:30,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:30,692 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:30,692 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:30,692 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:30,692 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:30,692 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:30,692 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:30,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:30,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:30,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:30,698 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:30,698 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:25:30,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:30,699 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:30,699 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:30,786 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:30,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:30,786 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:30,786 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 02:25:30,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:30,787 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:30,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2668 [2022-12-13 02:25:30,787 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:25:30,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:30,787 INFO L85 PathProgramCache]: Analyzing trace with hash -799011478, now seen corresponding path program 1 times [2022-12-13 02:25:30,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:30,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068825783] [2022-12-13 02:25:30,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:30,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:30,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:25:30,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:30,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068825783] [2022-12-13 02:25:30,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068825783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:30,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:30,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884260292] [2022-12-13 02:25:30,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:30,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:30,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:30,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:30,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:30,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:30,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:30,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:30,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:30,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:30,905 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:30,906 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:30,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:30,907 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:30,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:30,907 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:30,907 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:30,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:30,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:30,910 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:30,910 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:30,910 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:30,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:30,910 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:30,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:30,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:30,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:30,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:30,916 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:30,916 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:30,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:30,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:30,917 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:31,004 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:31,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:31,005 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:31,005 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 02:25:31,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:31,005 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:31,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2669 [2022-12-13 02:25:31,005 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:25:31,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:31,005 INFO L85 PathProgramCache]: Analyzing trace with hash -770382327, now seen corresponding path program 1 times [2022-12-13 02:25:31,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:31,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515318551] [2022-12-13 02:25:31,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:31,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:31,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:25:31,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:31,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515318551] [2022-12-13 02:25:31,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515318551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:31,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:31,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:31,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234534933] [2022-12-13 02:25:31,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:31,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:31,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:31,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:31,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:31,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:31,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:31,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:31,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:31,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:31,144 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:31,144 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:31,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:31,145 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:31,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:31,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:31,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:31,146 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:31,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:31,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:31,148 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:31,148 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:31,149 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:31,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:31,149 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:31,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:31,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:31,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:31,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:31,154 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:31,155 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:31,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:31,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:31,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:31,242 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:31,242 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:31,242 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:31,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:31,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:31,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:31,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2670 [2022-12-13 02:25:31,243 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:25:31,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:31,243 INFO L85 PathProgramCache]: Analyzing trace with hash -741753176, now seen corresponding path program 1 times [2022-12-13 02:25:31,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:31,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494218728] [2022-12-13 02:25:31,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:31,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:31,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:25:31,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:31,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494218728] [2022-12-13 02:25:31,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494218728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:31,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:31,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128756726] [2022-12-13 02:25:31,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:31,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:31,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:31,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:31,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:31,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:31,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:31,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:31,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:31,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:31,380 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:31,380 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:31,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:31,381 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:31,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:31,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:31,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:31,382 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:31,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:31,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:31,384 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:31,385 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:31,385 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:31,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:31,385 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:31,385 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:31,385 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:31,385 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:31,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:31,391 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:31,391 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:31,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:31,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:31,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:31,478 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:31,479 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:31,479 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:31,479 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 02:25:31,479 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:31,479 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:31,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2671 [2022-12-13 02:25:31,479 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:25:31,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:31,479 INFO L85 PathProgramCache]: Analyzing trace with hash -713124025, now seen corresponding path program 1 times [2022-12-13 02:25:31,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:31,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137084993] [2022-12-13 02:25:31,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:31,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:31,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:25:31,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:31,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137084993] [2022-12-13 02:25:31,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137084993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:31,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:31,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:31,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997158277] [2022-12-13 02:25:31,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:31,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:31,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:31,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:31,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:31,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:31,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:31,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:31,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:31,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:31,602 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:31,602 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:31,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:31,603 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:31,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:31,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:31,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:31,603 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:31,603 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:31,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:31,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:31,606 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:31,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:31,606 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:31,606 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:31,606 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:31,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:31,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:31,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:31,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:31,613 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:31,613 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:25:31,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:31,613 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:31,613 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:31,701 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:31,701 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:31,701 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:31,702 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 02:25:31,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:31,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:31,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2672 [2022-12-13 02:25:31,702 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:25:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:31,702 INFO L85 PathProgramCache]: Analyzing trace with hash -684494874, now seen corresponding path program 1 times [2022-12-13 02:25:31,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:31,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082769313] [2022-12-13 02:25:31,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:31,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:31,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:25:31,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:31,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082769313] [2022-12-13 02:25:31,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082769313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:31,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:31,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:31,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615000158] [2022-12-13 02:25:31,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:31,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:31,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:31,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:31,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:31,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:31,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:31,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:31,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:31,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:31,822 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:31,822 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:31,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:31,823 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:31,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:31,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:31,823 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:31,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:31,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:31,826 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:31,826 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:31,826 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:31,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:31,826 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:31,826 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:31,826 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:31,826 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:31,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:31,832 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:31,832 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:25:31,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:31,832 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:31,832 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:31,918 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:31,918 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:25:31,918 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:31,918 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 02:25:31,918 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:31,918 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:31,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2673 [2022-12-13 02:25:31,918 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:25:31,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:31,919 INFO L85 PathProgramCache]: Analyzing trace with hash -655865723, now seen corresponding path program 1 times [2022-12-13 02:25:31,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:31,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551765966] [2022-12-13 02:25:31,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:31,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:31,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:25:31,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:31,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551765966] [2022-12-13 02:25:31,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551765966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:31,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:31,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:31,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999186766] [2022-12-13 02:25:31,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:31,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:31,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:31,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:31,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:31,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:31,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:31,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:31,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:31,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:32,040 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:32,040 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:32,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:32,041 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:32,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:32,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:32,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:32,042 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:32,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:32,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:32,044 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,045 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:32,045 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:32,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:32,045 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:32,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:32,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:32,051 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:32,051 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:32,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:32,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:32,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:32,138 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:32,139 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:32,139 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:32,139 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 02:25:32,139 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:32,139 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:32,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2674 [2022-12-13 02:25:32,139 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:25:32,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash -627236572, now seen corresponding path program 1 times [2022-12-13 02:25:32,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:32,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26427291] [2022-12-13 02:25:32,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:32,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:32,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:25:32,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:32,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26427291] [2022-12-13 02:25:32,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26427291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:32,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:32,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:32,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85811823] [2022-12-13 02:25:32,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:32,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:32,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:32,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:32,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:32,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:32,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:32,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:32,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:32,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:32,263 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:32,263 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:32,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:32,264 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:32,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:32,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:32,265 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:32,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:32,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:32,267 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,268 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:32,268 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:32,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:32,268 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,268 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:32,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:32,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:32,274 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:32,274 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:32,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:32,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:32,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:32,361 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:32,362 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:32,362 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:32,362 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 02:25:32,362 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:32,362 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:32,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2675 [2022-12-13 02:25:32,362 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:25:32,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:32,362 INFO L85 PathProgramCache]: Analyzing trace with hash -598607421, now seen corresponding path program 1 times [2022-12-13 02:25:32,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:32,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145199780] [2022-12-13 02:25:32,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:32,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:32,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:25:32,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:32,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145199780] [2022-12-13 02:25:32,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145199780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:32,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:32,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:32,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080237094] [2022-12-13 02:25:32,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:32,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:32,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:32,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:32,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:32,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:32,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:32,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:32,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:32,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:32,495 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:32,496 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:32,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:32,497 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:32,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:32,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:32,497 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:32,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:32,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:32,500 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,500 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:32,500 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:32,500 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:32,500 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:32,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:32,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:32,506 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:32,506 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:32,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:32,506 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:32,506 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:32,593 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:32,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:32,594 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:32,594 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 02:25:32,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:32,594 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:32,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2676 [2022-12-13 02:25:32,594 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:25:32,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:32,595 INFO L85 PathProgramCache]: Analyzing trace with hash -569978270, now seen corresponding path program 1 times [2022-12-13 02:25:32,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:32,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820135928] [2022-12-13 02:25:32,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:32,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:32,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:25:32,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:32,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820135928] [2022-12-13 02:25:32,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820135928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:32,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:32,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:32,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386531416] [2022-12-13 02:25:32,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:32,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:32,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:32,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:32,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:32,669 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:32,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:32,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:32,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:32,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:32,745 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:32,746 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:32,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:32,747 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:32,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:32,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:32,747 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:32,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:32,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:32,750 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:32,750 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:32,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:32,750 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:32,750 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:32,750 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:32,756 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:32,756 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:32,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:32,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:32,757 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:32,843 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:32,844 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:32,844 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:32,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:32,844 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:32,844 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:32,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2677 [2022-12-13 02:25:32,845 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:25:32,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:32,845 INFO L85 PathProgramCache]: Analyzing trace with hash -541349119, now seen corresponding path program 1 times [2022-12-13 02:25:32,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:32,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189633710] [2022-12-13 02:25:32,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:32,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:32,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:25:32,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:32,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189633710] [2022-12-13 02:25:32,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189633710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:32,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:32,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:32,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953639412] [2022-12-13 02:25:32,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:32,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:32,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:32,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:32,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:32,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:32,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:32,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:32,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:32,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:32,979 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:32,980 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:32,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:32,981 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:32,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:32,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:32,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:32,981 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:32,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:32,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:32,984 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:32,984 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:32,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:32,984 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:32,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:32,984 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:32,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:32,990 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:32,990 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:32,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:32,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:32,991 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:33,080 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:33,081 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:33,081 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:33,081 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 02:25:33,081 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:33,081 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:33,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2678 [2022-12-13 02:25:33,081 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:25:33,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash -512719968, now seen corresponding path program 1 times [2022-12-13 02:25:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:33,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977932098] [2022-12-13 02:25:33,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:33,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:33,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:33,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977932098] [2022-12-13 02:25:33,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977932098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:33,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:33,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:33,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323831754] [2022-12-13 02:25:33,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:33,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:33,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:33,138 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:33,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:33,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:33,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:33,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:33,205 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:33,205 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:33,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:33,206 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:33,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:33,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:33,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:33,207 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:33,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:33,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:33,210 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:33,210 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:33,210 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:33,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:33,210 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:33,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:33,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:33,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:33,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:33,217 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:33,217 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:33,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:33,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:33,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:33,304 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:33,305 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:33,305 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:33,305 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 02:25:33,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:33,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:33,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2679 [2022-12-13 02:25:33,305 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:25:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash -484090817, now seen corresponding path program 1 times [2022-12-13 02:25:33,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:33,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826401009] [2022-12-13 02:25:33,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:33,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:25:33,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:33,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826401009] [2022-12-13 02:25:33,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826401009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:33,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:33,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972581191] [2022-12-13 02:25:33,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:33,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:33,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:33,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:33,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:33,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:33,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:33,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:33,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:33,454 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:33,454 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:33,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:33,455 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:33,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:33,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:33,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:33,455 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:33,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:33,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:33,458 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:33,458 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:33,458 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:33,459 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:33,459 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:33,459 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:33,459 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:33,459 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:33,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:33,464 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:33,465 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:33,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:33,465 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:33,465 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:33,552 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:33,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:33,553 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:33,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:33,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:33,553 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:33,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2680 [2022-12-13 02:25:33,553 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:25:33,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:33,553 INFO L85 PathProgramCache]: Analyzing trace with hash -455461666, now seen corresponding path program 1 times [2022-12-13 02:25:33,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:33,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417725122] [2022-12-13 02:25:33,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:33,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:33,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:25:33,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:33,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417725122] [2022-12-13 02:25:33,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417725122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:33,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:33,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626630136] [2022-12-13 02:25:33,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:33,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:33,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:33,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:33,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:33,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:33,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:33,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:33,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:33,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:33,689 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:33,689 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:25:33,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:33,691 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:33,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:33,691 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:33,691 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:33,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:33,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:33,693 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:33,694 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:33,694 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:33,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:33,694 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:33,694 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:33,694 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:33,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:33,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:33,700 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:33,700 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:25:33,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:33,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:33,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:33,787 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:33,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:33,788 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:33,788 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 02:25:33,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:33,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:33,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2681 [2022-12-13 02:25:33,788 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:25:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:33,788 INFO L85 PathProgramCache]: Analyzing trace with hash -426832515, now seen corresponding path program 1 times [2022-12-13 02:25:33,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:33,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76599733] [2022-12-13 02:25:33,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:33,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:33,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 02:25:33,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:33,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76599733] [2022-12-13 02:25:33,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76599733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:33,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:33,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:33,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151154894] [2022-12-13 02:25:33,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:33,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:33,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:33,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:33,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:33,843 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:33,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:33,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:33,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:33,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:33,919 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:33,919 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:33,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:33,920 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:33,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:33,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:33,921 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:33,921 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:33,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:33,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:33,923 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:33,923 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:33,923 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:33,923 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:33,923 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:33,924 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:33,924 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:33,924 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:33,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:33,929 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:33,929 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:33,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:33,930 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:33,930 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:34,017 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:34,018 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:34,018 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:34,018 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 02:25:34,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:34,018 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:34,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2682 [2022-12-13 02:25:34,018 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:25:34,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash -398203364, now seen corresponding path program 1 times [2022-12-13 02:25:34,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:34,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746654288] [2022-12-13 02:25:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:34,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:34,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:25:34,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:34,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746654288] [2022-12-13 02:25:34,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746654288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:34,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:34,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:34,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852800532] [2022-12-13 02:25:34,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:34,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:34,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:34,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:34,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:34,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:34,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:34,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:34,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:34,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:34,145 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:34,145 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:34,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:34,146 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:34,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:34,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:34,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:34,147 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:34,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:34,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:34,149 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:34,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:34,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:34,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:34,150 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:34,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:34,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:34,150 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:34,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:34,156 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:34,156 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:34,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:34,156 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:34,156 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:34,243 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:34,244 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:34,244 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:34,244 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 02:25:34,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:34,244 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:34,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2683 [2022-12-13 02:25:34,244 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:25:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash -369574213, now seen corresponding path program 1 times [2022-12-13 02:25:34,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:34,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950337079] [2022-12-13 02:25:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:34,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:25:34,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:34,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950337079] [2022-12-13 02:25:34,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950337079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:34,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:34,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:34,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481480357] [2022-12-13 02:25:34,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:34,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:34,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:34,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:34,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:34,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:34,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:34,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:34,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:34,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:34,365 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:34,365 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:34,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:34,366 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:34,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:34,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:34,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:34,366 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:34,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:34,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:34,369 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:34,369 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:34,369 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:34,369 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:34,369 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:34,370 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:34,370 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:34,370 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:34,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:34,375 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:34,375 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:34,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:34,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:34,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:34,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:34,464 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:34,464 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:34,464 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 02:25:34,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:34,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:34,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2684 [2022-12-13 02:25:34,464 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:25:34,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:34,465 INFO L85 PathProgramCache]: Analyzing trace with hash -340945062, now seen corresponding path program 1 times [2022-12-13 02:25:34,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:34,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391415264] [2022-12-13 02:25:34,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:34,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:34,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:25:34,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:34,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391415264] [2022-12-13 02:25:34,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391415264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:34,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:34,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587416099] [2022-12-13 02:25:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:34,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:34,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:34,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:34,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:34,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:34,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:34,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:34,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:34,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:34,598 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:34,598 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:34,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:34,599 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:34,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:34,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:34,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:34,600 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:34,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:34,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:34,602 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:34,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:34,602 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:34,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:34,602 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:34,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:34,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:34,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:34,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:34,611 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:34,611 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:34,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:34,612 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:34,612 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:34,700 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:34,701 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:25:34,701 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:34,701 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 02:25:34,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:34,701 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:34,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2685 [2022-12-13 02:25:34,701 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:25:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash -312315911, now seen corresponding path program 1 times [2022-12-13 02:25:34,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:34,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232168101] [2022-12-13 02:25:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:34,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:25:34,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:34,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232168101] [2022-12-13 02:25:34,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232168101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:34,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:34,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892594947] [2022-12-13 02:25:34,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:34,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:34,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:34,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:34,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:34,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:34,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:34,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:34,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:34,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:34,849 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:34,850 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:25:34,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:34,851 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:34,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:34,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:34,851 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:34,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:34,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:34,854 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:34,854 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:34,854 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:34,854 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:34,854 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:34,854 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:34,854 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:34,854 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:34,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:34,860 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:34,860 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:25:34,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:34,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:34,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:34,972 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:34,972 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:25:34,972 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:34,973 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 02:25:34,973 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:34,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:34,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2686 [2022-12-13 02:25:34,973 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:25:34,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:34,973 INFO L85 PathProgramCache]: Analyzing trace with hash -283686760, now seen corresponding path program 1 times [2022-12-13 02:25:34,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:34,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128575650] [2022-12-13 02:25:34,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:34,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:35,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:25:35,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:35,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128575650] [2022-12-13 02:25:35,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128575650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:35,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:35,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348038622] [2022-12-13 02:25:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:35,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:35,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:35,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:35,048 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:35,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:35,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:35,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:35,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:35,136 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:35,136 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:35,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:35,137 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:35,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:35,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:35,138 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:35,138 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:35,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:35,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:35,142 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:35,142 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:35,142 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:35,142 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:35,142 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:35,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:35,143 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:35,143 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:35,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:35,148 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:35,148 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:35,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:35,149 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:35,149 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:35,235 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:35,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:35,236 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:35,236 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 02:25:35,236 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:35,236 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:35,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2687 [2022-12-13 02:25:35,236 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:25:35,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:35,237 INFO L85 PathProgramCache]: Analyzing trace with hash -255057609, now seen corresponding path program 1 times [2022-12-13 02:25:35,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:35,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388208785] [2022-12-13 02:25:35,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:35,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:35,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:25:35,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:35,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388208785] [2022-12-13 02:25:35,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388208785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:35,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:35,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:35,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098682901] [2022-12-13 02:25:35,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:35,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:35,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:35,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:35,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:35,309 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:35,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:35,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:35,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:35,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:35,382 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:35,383 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:35,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:35,384 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:35,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:35,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:35,384 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:35,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:35,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:35,387 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:35,387 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:35,387 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:35,387 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:35,387 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:35,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:35,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:35,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:35,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:35,393 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:35,393 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:35,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:35,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:35,394 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:35,479 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:35,479 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:25:35,479 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:35,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:35,480 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:35,480 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:35,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2688 [2022-12-13 02:25:35,480 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:25:35,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash -226428458, now seen corresponding path program 1 times [2022-12-13 02:25:35,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:35,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998255247] [2022-12-13 02:25:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:35,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:35,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:25:35,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:35,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998255247] [2022-12-13 02:25:35,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998255247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:35,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:35,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:35,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383535118] [2022-12-13 02:25:35,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:35,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:35,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:35,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:35,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:35,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:35,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:35,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:35,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:35,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:35,613 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:35,613 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:35,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:35,614 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:35,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:35,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:35,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:35,615 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:35,615 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:35,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:35,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:35,617 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:35,617 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:35,617 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:35,617 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:35,617 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:35,618 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:35,618 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:35,618 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:35,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:35,623 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:35,623 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:35,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:35,624 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:35,624 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:35,710 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:35,711 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:35,711 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:35,711 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 02:25:35,711 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:35,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:35,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2689 [2022-12-13 02:25:35,711 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:25:35,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:35,711 INFO L85 PathProgramCache]: Analyzing trace with hash -197799307, now seen corresponding path program 1 times [2022-12-13 02:25:35,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:35,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159974296] [2022-12-13 02:25:35,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:35,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:35,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:25:35,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:35,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159974296] [2022-12-13 02:25:35,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159974296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:35,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:35,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:35,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850344804] [2022-12-13 02:25:35,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:35,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:35,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:35,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:35,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:35,770 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:35,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:35,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:35,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:35,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:35,846 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:35,846 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:25:35,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:35,848 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:35,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:35,848 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:35,848 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:35,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:35,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:35,851 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:35,851 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:35,851 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:35,851 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:35,851 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:35,851 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:35,851 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:35,851 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:35,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:35,857 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:35,857 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:25:35,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:35,858 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:35,858 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:35,945 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:35,946 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:35,946 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:35,946 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 02:25:35,946 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:35,946 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:35,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2690 [2022-12-13 02:25:35,946 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:25:35,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:35,946 INFO L85 PathProgramCache]: Analyzing trace with hash -169170156, now seen corresponding path program 1 times [2022-12-13 02:25:35,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:35,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111740348] [2022-12-13 02:25:35,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:35,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:36,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 02:25:36,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:36,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111740348] [2022-12-13 02:25:36,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111740348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:36,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:36,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:36,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811491856] [2022-12-13 02:25:36,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:36,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:36,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:36,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:36,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:36,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:36,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:36,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:36,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:36,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:36,105 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:36,105 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:36,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:36,106 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:36,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:36,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:36,106 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:36,106 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:36,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:36,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:36,109 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:36,109 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:36,109 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:36,109 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:36,109 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:36,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:36,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:36,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:36,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:36,115 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:36,115 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:36,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:36,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:36,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:36,214 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:36,215 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:25:36,215 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:36,215 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 02:25:36,215 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:36,215 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:36,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2691 [2022-12-13 02:25:36,215 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:25:36,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:36,215 INFO L85 PathProgramCache]: Analyzing trace with hash -140541005, now seen corresponding path program 1 times [2022-12-13 02:25:36,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:36,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141390683] [2022-12-13 02:25:36,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:36,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:36,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:25:36,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:36,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141390683] [2022-12-13 02:25:36,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141390683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:36,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:36,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:36,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044368758] [2022-12-13 02:25:36,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:36,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:36,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:36,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:36,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:36,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:36,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:36,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:36,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:36,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:36,350 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:36,350 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:36,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:36,351 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:36,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:36,352 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:36,352 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:36,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:36,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:36,355 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:36,355 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:36,355 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:36,355 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:36,355 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:36,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:36,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:36,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:36,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:36,361 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:36,361 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:36,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:36,362 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:36,362 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:36,448 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:36,449 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:36,449 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:36,449 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 02:25:36,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:36,449 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:36,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2692 [2022-12-13 02:25:36,449 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:25:36,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:36,449 INFO L85 PathProgramCache]: Analyzing trace with hash -111911854, now seen corresponding path program 1 times [2022-12-13 02:25:36,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:36,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710562442] [2022-12-13 02:25:36,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:36,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:36,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:25:36,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:36,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710562442] [2022-12-13 02:25:36,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710562442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:36,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:36,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:36,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385927336] [2022-12-13 02:25:36,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:36,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:36,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:36,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:36,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:36,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:36,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:36,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:36,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:36,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:36,583 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:36,583 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:36,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:36,584 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:36,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:36,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:36,585 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:36,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:36,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:36,587 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:36,587 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:36,588 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:36,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:36,588 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:36,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:36,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:36,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:36,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:36,593 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:36,593 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:36,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:36,594 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:36,594 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:36,682 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:36,683 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:36,683 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:36,683 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 02:25:36,683 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:36,683 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:36,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2693 [2022-12-13 02:25:36,683 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:25:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:36,683 INFO L85 PathProgramCache]: Analyzing trace with hash -83282703, now seen corresponding path program 1 times [2022-12-13 02:25:36,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:36,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294846145] [2022-12-13 02:25:36,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:36,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25: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 02:25:36,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:36,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294846145] [2022-12-13 02:25:36,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294846145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:36,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:36,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:36,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743254291] [2022-12-13 02:25:36,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:36,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:36,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:36,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:36,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:36,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:36,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:36,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:36,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:36,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:36,808 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:36,808 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:36,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:36,809 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:36,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:36,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:36,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:36,810 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:36,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:36,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:36,812 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:36,813 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:36,813 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:36,813 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:36,813 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:36,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:36,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:36,813 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:36,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:36,819 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:36,819 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:36,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:36,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:36,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:36,907 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:36,908 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:36,908 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:36,908 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 02:25:36,908 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:36,908 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:36,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2694 [2022-12-13 02:25:36,908 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:25:36,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:36,908 INFO L85 PathProgramCache]: Analyzing trace with hash -54653552, now seen corresponding path program 1 times [2022-12-13 02:25:36,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:36,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119804731] [2022-12-13 02:25:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:36,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:25:36,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:36,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119804731] [2022-12-13 02:25:36,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119804731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:36,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:36,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:36,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252052220] [2022-12-13 02:25:36,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:36,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:36,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:36,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:36,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:36,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:36,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:36,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:36,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:36,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:37,042 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:37,042 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:37,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:37,043 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:37,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:37,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:37,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:37,044 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:37,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:37,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:37,046 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:37,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:37,046 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:37,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:37,047 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:37,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:37,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:37,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:37,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:37,053 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:37,053 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:37,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:37,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:37,053 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:37,142 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:37,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:37,143 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:37,143 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 02:25:37,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:37,143 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:37,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2695 [2022-12-13 02:25:37,143 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:25:37,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:37,143 INFO L85 PathProgramCache]: Analyzing trace with hash -26024401, now seen corresponding path program 1 times [2022-12-13 02:25:37,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:37,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251113293] [2022-12-13 02:25:37,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:37,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:37,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:25:37,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:37,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251113293] [2022-12-13 02:25:37,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251113293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:37,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:37,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:37,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433029891] [2022-12-13 02:25:37,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:37,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:37,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:37,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:37,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:37,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:37,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:37,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:37,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:37,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:37,308 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:37,309 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:37,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:37,310 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:37,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:37,310 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:37,310 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:37,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:37,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:37,313 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:37,313 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:37,313 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:37,313 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:37,313 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:37,313 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:37,313 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:37,313 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:37,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:37,319 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:37,319 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:37,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:37,320 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:37,320 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:37,409 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:37,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:37,409 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:37,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:37,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:37,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:37,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2696 [2022-12-13 02:25:37,409 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:25:37,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2604750, now seen corresponding path program 1 times [2022-12-13 02:25:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:37,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426124920] [2022-12-13 02:25:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:37,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:37,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:25:37,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:37,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426124920] [2022-12-13 02:25:37,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426124920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:37,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:37,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:37,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389959994] [2022-12-13 02:25:37,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:37,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:37,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:37,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:37,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:37,482 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:37,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:37,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:37,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:37,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:37,550 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:37,550 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:37,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:37,551 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:37,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:37,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:37,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:37,552 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:37,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:37,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:37,555 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:37,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:37,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:37,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:37,555 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:37,555 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:37,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:37,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:37,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:37,561 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:37,561 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:37,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:37,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:37,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:37,653 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:37,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:25:37,654 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:37,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:37,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:37,654 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:37,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2697 [2022-12-13 02:25:37,654 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:25:37,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash 31233901, now seen corresponding path program 1 times [2022-12-13 02:25:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:37,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962552969] [2022-12-13 02:25:37,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:37,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:37,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:25:37,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:37,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962552969] [2022-12-13 02:25:37,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962552969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:37,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:37,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:37,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418331777] [2022-12-13 02:25:37,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:37,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:37,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:37,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:37,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:37,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:37,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:37,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:37,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:37,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:37,779 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:37,779 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:37,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:37,780 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:37,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:37,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:37,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:37,781 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:37,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:37,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:37,783 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:37,783 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:37,783 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:37,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:37,783 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:37,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:37,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:37,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:37,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:37,789 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:37,789 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:25:37,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:37,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:37,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:37,879 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:37,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:37,880 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:37,880 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 02:25:37,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:37,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:37,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2698 [2022-12-13 02:25:37,880 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:25:37,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:37,880 INFO L85 PathProgramCache]: Analyzing trace with hash 59863052, now seen corresponding path program 1 times [2022-12-13 02:25:37,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:37,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288258790] [2022-12-13 02:25:37,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:37,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:37,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:25:37,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:37,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288258790] [2022-12-13 02:25:37,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288258790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:37,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:37,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:37,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490376529] [2022-12-13 02:25:37,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:37,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:37,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:37,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:37,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:37,938 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:37,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:37,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:37,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:37,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:38,005 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:38,005 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:38,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:38,006 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:38,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:38,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:38,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:38,007 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:38,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:38,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:38,009 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:38,010 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:38,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:38,010 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:38,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:38,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:38,015 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:38,016 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:38,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:38,016 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:38,016 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:38,122 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:38,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 02:25:38,123 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:38,123 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 02:25:38,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:38,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:38,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2699 [2022-12-13 02:25:38,123 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:25:38,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:38,123 INFO L85 PathProgramCache]: Analyzing trace with hash 88492203, now seen corresponding path program 1 times [2022-12-13 02:25:38,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:38,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369882943] [2022-12-13 02:25:38,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:38,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:38,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:38,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369882943] [2022-12-13 02:25:38,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369882943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:38,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:38,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:38,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232961911] [2022-12-13 02:25:38,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:38,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:38,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:38,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:38,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:38,182 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:38,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:38,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:38,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:38,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:38,258 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:38,258 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:38,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:38,259 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:38,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:38,260 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:38,260 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:38,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:38,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:38,262 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,262 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:38,263 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:38,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:38,263 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:38,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:38,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:38,269 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:38,269 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:38,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:38,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:38,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:38,367 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:38,368 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:25:38,368 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:38,368 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 02:25:38,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:38,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:38,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2700 [2022-12-13 02:25:38,368 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:25:38,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash 117121354, now seen corresponding path program 1 times [2022-12-13 02:25:38,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:38,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386481989] [2022-12-13 02:25:38,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:38,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:38,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:38,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386481989] [2022-12-13 02:25:38,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386481989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:38,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:38,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046500282] [2022-12-13 02:25:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:38,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:38,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:38,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:38,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:38,437 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:38,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:38,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:38,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:38,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:38,505 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:38,505 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:38,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:38,506 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:38,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:38,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:38,507 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:38,507 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:38,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:38,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:38,509 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,510 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:38,510 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:38,510 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:38,510 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,510 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:38,510 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:38,510 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:38,516 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:38,516 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:38,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:38,516 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:38,516 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:38,608 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:38,608 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:25:38,608 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:38,608 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 02:25:38,608 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:38,609 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:38,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2701 [2022-12-13 02:25:38,609 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:25:38,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash 145750505, now seen corresponding path program 1 times [2022-12-13 02:25:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:38,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945270041] [2022-12-13 02:25:38,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:38,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:38,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:38,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:38,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945270041] [2022-12-13 02:25:38,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945270041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:38,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:38,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:38,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997887534] [2022-12-13 02:25:38,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:38,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:38,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:38,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:38,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:38,666 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:38,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:38,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:38,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:38,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:38,733 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:38,733 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:38,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:38,734 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:38,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:38,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:38,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:38,735 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:38,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:38,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:38,737 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,737 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:38,737 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:38,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:38,737 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:38,738 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:38,738 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:38,743 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:38,743 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:38,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:38,744 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:38,744 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:38,833 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:38,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:38,834 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:38,834 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 02:25:38,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:38,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:38,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2702 [2022-12-13 02:25:38,834 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:25:38,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:38,834 INFO L85 PathProgramCache]: Analyzing trace with hash 174379656, now seen corresponding path program 1 times [2022-12-13 02:25:38,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:38,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524349925] [2022-12-13 02:25:38,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:38,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:38,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:25:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:38,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524349925] [2022-12-13 02:25:38,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524349925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:38,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:38,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235895619] [2022-12-13 02:25:38,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:38,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:38,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:38,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:38,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:38,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:38,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:38,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:38,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:38,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:38,972 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:38,972 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:38,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:38,973 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:38,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:38,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:38,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:38,974 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:38,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:38,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:38,976 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:38,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:38,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:38,977 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:38,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:38,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:38,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:38,983 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:38,983 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:38,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:38,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:38,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:39,077 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:39,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:25:39,078 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:39,078 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 02:25:39,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:39,078 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:39,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2703 [2022-12-13 02:25:39,078 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:25:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:39,078 INFO L85 PathProgramCache]: Analyzing trace with hash 203008807, now seen corresponding path program 1 times [2022-12-13 02:25:39,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:39,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577015205] [2022-12-13 02:25:39,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:39,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:39,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:25:39,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:39,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577015205] [2022-12-13 02:25:39,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577015205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:39,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:39,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:39,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442376981] [2022-12-13 02:25:39,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:39,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:39,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:39,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:39,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:39,142 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:39,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:39,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:39,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:39,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:39,209 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:39,209 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:39,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:39,210 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:39,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:39,211 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:39,211 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:39,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:39,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:39,213 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:39,213 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:39,213 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:39,213 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:39,213 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:39,214 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:39,214 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:39,214 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:39,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:39,219 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:39,219 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:39,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:39,220 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:39,220 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:39,309 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:39,310 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:39,310 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:39,310 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 02:25:39,310 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:39,310 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:39,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2704 [2022-12-13 02:25:39,310 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:25:39,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:39,310 INFO L85 PathProgramCache]: Analyzing trace with hash 231637958, now seen corresponding path program 1 times [2022-12-13 02:25:39,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:39,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265623706] [2022-12-13 02:25:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:39,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:39,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:25:39,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:39,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265623706] [2022-12-13 02:25:39,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265623706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:39,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:39,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:39,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242847403] [2022-12-13 02:25:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:39,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:39,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:39,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:39,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:39,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:39,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:39,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:39,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:39,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:39,441 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:39,442 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:39,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:39,443 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:39,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:39,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:39,443 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:39,443 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:39,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:39,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:39,446 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:39,446 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:39,446 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:39,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:39,446 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:39,446 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:39,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:39,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:39,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:39,452 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:39,452 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:39,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:39,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:39,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:39,541 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:39,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:39,542 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:39,542 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 02:25:39,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:39,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:39,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2705 [2022-12-13 02:25:39,542 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:25:39,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:39,542 INFO L85 PathProgramCache]: Analyzing trace with hash 260267109, now seen corresponding path program 1 times [2022-12-13 02:25:39,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:39,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721871852] [2022-12-13 02:25:39,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:39,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:25:39,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:39,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721871852] [2022-12-13 02:25:39,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721871852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:39,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:39,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011092314] [2022-12-13 02:25:39,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:39,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:39,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:39,614 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:39,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:39,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:39,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:39,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:39,681 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:39,681 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:39,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:39,682 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:39,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:39,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:39,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:39,682 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:39,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:39,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:39,685 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:39,685 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:39,685 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:39,685 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:39,685 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:39,685 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:39,685 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:39,686 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:39,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:39,691 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:39,691 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:39,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:39,692 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:39,692 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:39,779 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:39,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:39,780 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:39,780 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 02:25:39,780 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:39,780 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:39,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2706 [2022-12-13 02:25:39,780 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:25:39,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:39,780 INFO L85 PathProgramCache]: Analyzing trace with hash 288896260, now seen corresponding path program 1 times [2022-12-13 02:25:39,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:39,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636026643] [2022-12-13 02:25:39,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:39,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:39,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:25:39,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:39,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636026643] [2022-12-13 02:25:39,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636026643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:39,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:39,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:39,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796721571] [2022-12-13 02:25:39,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:39,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:39,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:39,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:39,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:39,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:39,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:39,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:39,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:39,935 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:39,936 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:39,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:39,937 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:39,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:39,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:39,937 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:39,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:39,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:39,940 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:39,940 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:39,940 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:39,940 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:39,940 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:39,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:39,940 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:39,940 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:39,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:39,946 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:39,946 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:39,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:39,946 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:39,946 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:40,038 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:40,039 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:25:40,039 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:40,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:40,039 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:40,039 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:40,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2707 [2022-12-13 02:25:40,039 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:25:40,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash 317525411, now seen corresponding path program 1 times [2022-12-13 02:25:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:40,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86310105] [2022-12-13 02:25:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:40,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:40,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:25:40,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:40,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86310105] [2022-12-13 02:25:40,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86310105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:40,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:40,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:40,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859179423] [2022-12-13 02:25:40,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:40,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:40,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:40,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:40,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:40,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:40,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:40,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:40,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:40,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:40,170 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:40,170 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:40,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:40,171 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:40,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:40,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:40,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:40,172 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:40,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:40,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:40,174 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:40,174 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:40,174 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:40,174 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:40,175 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:40,175 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:40,175 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:40,175 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:40,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:40,180 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:40,180 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:40,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:40,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:40,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:40,269 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:40,269 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:40,269 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:40,269 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 02:25:40,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:40,269 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:40,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2708 [2022-12-13 02:25:40,269 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:25:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:40,270 INFO L85 PathProgramCache]: Analyzing trace with hash 346154562, now seen corresponding path program 1 times [2022-12-13 02:25:40,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:40,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607122173] [2022-12-13 02:25:40,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:40,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:40,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:25:40,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:40,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607122173] [2022-12-13 02:25:40,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607122173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:40,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:40,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:40,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739858538] [2022-12-13 02:25:40,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:40,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:40,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:40,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:40,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:40,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:40,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:40,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:40,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:40,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:40,393 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:40,393 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:40,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:40,394 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:40,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:40,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:40,395 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:40,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:40,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:40,397 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:40,397 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:40,397 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:40,398 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:40,398 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:40,398 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:40,398 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:40,398 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:40,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:40,403 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:40,404 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:40,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:40,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:40,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:40,492 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:40,492 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:40,492 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:40,492 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 02:25:40,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:40,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:40,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2709 [2022-12-13 02:25:40,492 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:25:40,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash 374783713, now seen corresponding path program 1 times [2022-12-13 02:25:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:40,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087521262] [2022-12-13 02:25:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:40,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:25:40,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:40,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087521262] [2022-12-13 02:25:40,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087521262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:40,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:40,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:40,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000188910] [2022-12-13 02:25:40,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:40,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:40,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:40,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:40,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:40,551 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:40,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:40,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:40,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:40,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:40,626 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:40,626 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:40,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:40,627 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:40,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:40,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:40,628 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:40,628 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:40,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:40,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:40,630 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:40,630 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:40,631 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:40,631 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:40,631 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:40,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:40,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:40,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:40,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:40,637 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:40,637 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:40,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:40,637 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:40,637 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:40,724 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:40,725 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:40,725 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:40,725 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 02:25:40,725 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:40,725 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:40,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2710 [2022-12-13 02:25:40,725 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:25:40,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:40,726 INFO L85 PathProgramCache]: Analyzing trace with hash 403412864, now seen corresponding path program 1 times [2022-12-13 02:25:40,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:40,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321426274] [2022-12-13 02:25:40,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:40,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:40,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:25:40,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:40,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321426274] [2022-12-13 02:25:40,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321426274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:40,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:40,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:40,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336266725] [2022-12-13 02:25:40,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:40,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:40,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:40,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:40,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:40,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:40,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:40,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:40,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:40,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:40,868 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:40,869 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:40,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:40,870 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:40,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:40,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:40,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:40,870 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:40,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:40,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:40,873 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:40,873 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:40,873 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:40,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:40,873 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:40,873 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:40,873 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:40,873 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:40,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:40,879 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:40,879 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:40,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:40,880 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:40,880 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:40,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:40,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:40,970 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:40,970 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 02:25:40,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:40,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:40,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2711 [2022-12-13 02:25:40,970 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:25:40,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash 432042015, now seen corresponding path program 1 times [2022-12-13 02:25:40,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:40,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693998723] [2022-12-13 02:25:40,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:40,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:41,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:25:41,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:41,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693998723] [2022-12-13 02:25:41,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693998723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:41,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:41,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:41,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506351410] [2022-12-13 02:25:41,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:41,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:41,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:41,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:41,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:41,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:41,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:41,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:41,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:41,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:41,091 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:41,091 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:41,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:41,092 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:41,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:41,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:41,093 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:41,093 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:41,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:41,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:41,095 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:41,095 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:41,095 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:41,095 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:41,095 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:41,096 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:41,096 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:41,096 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:41,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:41,101 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:41,101 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:25:41,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:41,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:41,102 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:41,189 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:41,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:41,190 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:41,190 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 02:25:41,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:41,190 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:41,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2712 [2022-12-13 02:25:41,190 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:25:41,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:41,190 INFO L85 PathProgramCache]: Analyzing trace with hash 460671166, now seen corresponding path program 1 times [2022-12-13 02:25:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:41,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306751313] [2022-12-13 02:25:41,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:41,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:41,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:25:41,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:41,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306751313] [2022-12-13 02:25:41,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306751313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:41,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:41,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:41,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585031988] [2022-12-13 02:25:41,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:41,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:41,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:41,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:41,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:41,267 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:41,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:41,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:41,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:41,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:41,336 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:41,336 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:41,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:41,338 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:41,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:41,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:41,338 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:41,338 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:41,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:41,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:41,341 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:41,341 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:41,341 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:41,341 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:41,341 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:41,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:41,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:41,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:41,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:41,347 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:41,347 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:41,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:41,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:41,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:41,437 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:41,438 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:41,438 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:41,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:41,438 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:41,438 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:41,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2713 [2022-12-13 02:25:41,438 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:25:41,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:41,438 INFO L85 PathProgramCache]: Analyzing trace with hash 489300317, now seen corresponding path program 1 times [2022-12-13 02:25:41,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:41,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124789231] [2022-12-13 02:25:41,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:41,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:25:41,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:41,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124789231] [2022-12-13 02:25:41,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124789231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:41,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:41,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:41,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972461319] [2022-12-13 02:25:41,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:41,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:41,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:41,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:41,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:41,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:41,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:41,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:41,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:41,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:41,575 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:41,575 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:41,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:41,576 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:41,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:41,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:41,577 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:41,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:41,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:41,579 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:41,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:41,580 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:41,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:41,580 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:41,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:41,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:41,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:41,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:41,586 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:41,586 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:25:41,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:41,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:41,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:41,680 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:41,681 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:25:41,681 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:41,681 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 02:25:41,681 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:41,681 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:41,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2714 [2022-12-13 02:25:41,681 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:25:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:41,681 INFO L85 PathProgramCache]: Analyzing trace with hash 517929468, now seen corresponding path program 1 times [2022-12-13 02:25:41,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:41,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593822372] [2022-12-13 02:25:41,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:41,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:41,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:25:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:41,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593822372] [2022-12-13 02:25:41,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593822372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:41,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:41,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:41,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825433457] [2022-12-13 02:25:41,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:41,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:41,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:41,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:41,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:41,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:41,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:41,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:41,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:41,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:41,832 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:41,832 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:25:41,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:41,834 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:41,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:41,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:41,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:41,834 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:41,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:41,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:41,837 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:41,837 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:41,837 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:41,837 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:41,837 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:41,837 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:41,837 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:41,837 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:41,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:41,843 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:41,843 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:25:41,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:41,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:41,844 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:41,932 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:41,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:41,932 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:41,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:41,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:41,932 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:41,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2715 [2022-12-13 02:25:41,933 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:25:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash 546558619, now seen corresponding path program 1 times [2022-12-13 02:25:41,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:41,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719344806] [2022-12-13 02:25:41,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:41,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:41,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:25:41,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:41,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719344806] [2022-12-13 02:25:41,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719344806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:41,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:41,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:41,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372632804] [2022-12-13 02:25:41,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:41,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:41,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:41,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:41,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:41,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:41,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:41,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:41,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:41,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:42,076 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:42,076 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:42,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:42,077 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:42,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:42,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:42,078 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:42,078 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:42,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:42,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:42,080 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:42,081 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:42,081 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:42,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:42,081 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:42,081 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:42,081 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:42,081 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:42,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:42,086 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:42,087 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:42,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:42,087 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:42,087 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:42,176 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:42,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:42,177 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:42,177 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 02:25:42,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:42,177 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:42,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2716 [2022-12-13 02:25:42,177 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:25:42,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:42,177 INFO L85 PathProgramCache]: Analyzing trace with hash 575187770, now seen corresponding path program 1 times [2022-12-13 02:25:42,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:42,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525649437] [2022-12-13 02:25:42,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:42,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:42,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:25:42,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:42,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525649437] [2022-12-13 02:25:42,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525649437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:42,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:42,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:42,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238721357] [2022-12-13 02:25:42,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:42,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:42,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:42,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:42,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:42,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:42,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:42,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:42,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:42,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:42,326 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:42,327 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:42,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:42,328 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:42,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:42,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:42,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:42,328 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:42,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:42,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:42,331 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:42,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:42,331 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:42,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:42,331 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:42,331 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:42,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:42,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:42,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:42,337 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:42,337 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:42,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:42,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:42,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:42,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:42,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:42,427 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:42,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:42,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:42,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:42,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2717 [2022-12-13 02:25:42,427 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:25:42,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:42,428 INFO L85 PathProgramCache]: Analyzing trace with hash 603816921, now seen corresponding path program 1 times [2022-12-13 02:25:42,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:42,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281865365] [2022-12-13 02:25:42,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:42,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25: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 02:25:42,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:42,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281865365] [2022-12-13 02:25:42,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281865365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:42,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:42,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:42,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683035802] [2022-12-13 02:25:42,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:42,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:42,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:42,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:42,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:42,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:42,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:42,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:42,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:42,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:42,551 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:42,551 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:42,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:42,552 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:42,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:42,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:42,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:42,553 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:42,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:42,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:42,555 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:42,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:42,556 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:42,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:42,556 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:42,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:42,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:42,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:42,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:42,562 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:42,562 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:42,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:42,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:42,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:42,650 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:42,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:42,651 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:42,651 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 02:25:42,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:42,651 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:42,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2718 [2022-12-13 02:25:42,651 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:25:42,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:42,651 INFO L85 PathProgramCache]: Analyzing trace with hash 632446072, now seen corresponding path program 1 times [2022-12-13 02:25:42,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:42,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015602031] [2022-12-13 02:25:42,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:42,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 02:25:42,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:42,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015602031] [2022-12-13 02:25:42,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015602031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:42,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:42,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:42,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193147198] [2022-12-13 02:25:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:42,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:42,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:42,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:42,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:42,708 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:42,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:42,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:42,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:42,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:42,775 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:42,775 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:42,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:42,776 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:42,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:42,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:42,777 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:42,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:42,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:42,779 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:42,779 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:42,780 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:42,780 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:42,780 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:42,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:42,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:42,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:42,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:42,786 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:42,786 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:42,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:42,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:42,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:42,875 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:42,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:42,875 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:42,875 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 02:25:42,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:42,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:42,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2719 [2022-12-13 02:25:42,875 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:25:42,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:42,876 INFO L85 PathProgramCache]: Analyzing trace with hash 661075223, now seen corresponding path program 1 times [2022-12-13 02:25:42,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:42,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818419834] [2022-12-13 02:25:42,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:42,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:42,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:25:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:42,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818419834] [2022-12-13 02:25:42,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818419834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:42,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:42,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:42,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280050978] [2022-12-13 02:25:42,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:42,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:42,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:42,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:42,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:42,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:42,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:42,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:42,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:42,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:43,004 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:43,005 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:43,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:43,006 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:43,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:43,006 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:43,006 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:43,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:43,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:43,008 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:43,009 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:43,009 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:43,009 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,009 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:43,009 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:43,009 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:43,014 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:43,015 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:43,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:43,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:43,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:43,103 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:43,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:43,103 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:43,103 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 02:25:43,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:43,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:43,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2720 [2022-12-13 02:25:43,104 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:25:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash 689704374, now seen corresponding path program 1 times [2022-12-13 02:25:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:43,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875810297] [2022-12-13 02:25:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:43,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25: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 02:25:43,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:43,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875810297] [2022-12-13 02:25:43,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875810297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:43,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:43,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:43,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896105160] [2022-12-13 02:25:43,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:43,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:43,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:43,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:43,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:43,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:43,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:43,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:43,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:43,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:43,233 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:43,233 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:43,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:43,234 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:43,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:43,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:43,234 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:43,235 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:43,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:43,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:43,237 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,237 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:43,237 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:43,237 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:43,238 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,238 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:43,238 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:43,238 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:43,243 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:43,243 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:43,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:43,244 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:43,244 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:43,331 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:43,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:43,331 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:43,331 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 02:25:43,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:43,331 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:43,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2721 [2022-12-13 02:25:43,331 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:25:43,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash 718333525, now seen corresponding path program 1 times [2022-12-13 02:25:43,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:43,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409930926] [2022-12-13 02:25:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:43,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:43,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:25:43,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:43,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409930926] [2022-12-13 02:25:43,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409930926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:43,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:43,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:43,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642303588] [2022-12-13 02:25:43,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:43,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:43,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:43,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:43,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:43,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:43,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:43,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:43,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:43,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:43,455 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:43,456 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:43,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:43,457 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:43,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:43,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:43,457 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:43,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:43,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:43,460 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,460 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:43,460 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:43,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:43,460 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:43,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:43,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:43,466 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:43,466 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:43,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:43,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:43,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:43,554 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:43,555 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:43,555 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:43,555 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 02:25:43,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:43,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:43,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2722 [2022-12-13 02:25:43,555 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:25:43,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash 746962676, now seen corresponding path program 1 times [2022-12-13 02:25:43,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:43,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489005192] [2022-12-13 02:25:43,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:43,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:43,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:25:43,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:43,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489005192] [2022-12-13 02:25:43,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489005192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:43,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:43,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:43,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505188161] [2022-12-13 02:25:43,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:43,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:43,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:43,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:43,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:43,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:43,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:43,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:43,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:43,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:43,701 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:43,701 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:43,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:43,702 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:43,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:43,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:43,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:43,702 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:43,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:43,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:43,705 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:43,705 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:43,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:43,705 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,705 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:43,705 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:43,705 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:43,711 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:43,711 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:43,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:43,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:43,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:43,799 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:43,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:43,799 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:43,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:43,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:43,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:43,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2723 [2022-12-13 02:25:43,800 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:25:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:43,800 INFO L85 PathProgramCache]: Analyzing trace with hash 775591827, now seen corresponding path program 1 times [2022-12-13 02:25:43,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:43,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660907785] [2022-12-13 02:25:43,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:43,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:43,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 02:25:43,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:43,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660907785] [2022-12-13 02:25:43,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660907785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:43,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:43,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:43,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110695954] [2022-12-13 02:25:43,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:43,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:43,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:43,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:43,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:43,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:43,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:43,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:43,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:43,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:43,941 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:43,941 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:43,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:43,942 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:43,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:43,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:43,943 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:43,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:43,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:43,945 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:43,946 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:43,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:43,946 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,946 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:43,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:43,946 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:43,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:43,952 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:43,952 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:43,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:43,952 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:43,952 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:44,040 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:44,040 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:44,040 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:44,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:44,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:44,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:44,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2724 [2022-12-13 02:25:44,040 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:25:44,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash 804220978, now seen corresponding path program 1 times [2022-12-13 02:25:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:44,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060268197] [2022-12-13 02:25:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:44,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:25:44,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:44,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060268197] [2022-12-13 02:25:44,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060268197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:44,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:44,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:44,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020342539] [2022-12-13 02:25:44,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:44,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:44,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:44,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:44,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:44,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:44,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:44,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:44,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:44,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:44,165 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:44,166 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:44,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:44,167 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:44,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:44,167 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:44,167 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:44,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:44,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:44,170 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:44,170 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:44,170 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:44,170 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:44,170 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:44,170 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:44,170 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:44,170 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:44,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:44,176 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:44,176 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:44,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:44,177 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:44,177 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:44,275 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:44,275 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:25:44,275 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:44,275 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 02:25:44,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:44,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:44,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2725 [2022-12-13 02:25:44,276 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:25:44,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash 832850129, now seen corresponding path program 1 times [2022-12-13 02:25:44,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:44,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133583199] [2022-12-13 02:25:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:44,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:44,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:25:44,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:44,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133583199] [2022-12-13 02:25:44,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133583199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:44,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:44,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:44,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293033472] [2022-12-13 02:25:44,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:44,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:44,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:44,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:44,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:44,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:44,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:44,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:44,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:44,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:44,404 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:44,405 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:44,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:44,406 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:44,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:44,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:44,406 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:44,406 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:44,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:44,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:44,409 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:44,409 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:44,409 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:44,409 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:44,409 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:44,409 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:44,409 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:44,409 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:44,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:44,415 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:44,415 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:44,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:44,416 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:44,416 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:44,501 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:44,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:44,502 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:44,502 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 02:25:44,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:44,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:44,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2726 [2022-12-13 02:25:44,502 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:25:44,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash 861479280, now seen corresponding path program 1 times [2022-12-13 02:25:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:44,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434609299] [2022-12-13 02:25:44,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:44,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:44,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:25:44,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:44,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434609299] [2022-12-13 02:25:44,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434609299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:44,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:44,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:44,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828931355] [2022-12-13 02:25:44,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:44,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:44,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:44,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:44,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:44,558 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:44,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:44,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:44,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:44,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:44,623 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:44,623 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:44,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:44,624 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:44,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:44,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:44,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:44,625 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:44,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:44,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:44,628 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:44,628 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:44,628 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:44,628 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:44,628 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:44,628 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:44,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:44,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:44,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:44,634 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:44,634 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:44,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:44,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:44,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:44,721 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:44,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:44,721 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:44,721 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 02:25:44,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:44,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:44,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2727 [2022-12-13 02:25:44,722 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:25:44,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:44,722 INFO L85 PathProgramCache]: Analyzing trace with hash 890108431, now seen corresponding path program 1 times [2022-12-13 02:25:44,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:44,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570304001] [2022-12-13 02:25:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:44,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:44,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:25:44,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:44,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570304001] [2022-12-13 02:25:44,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570304001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:44,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:44,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:44,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881758710] [2022-12-13 02:25:44,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:44,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:44,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:44,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:44,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:44,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:44,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:44,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:44,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:44,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:44,842 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:44,842 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:44,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:44,843 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:44,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:44,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:44,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:44,844 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:44,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:44,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:44,846 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:44,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:44,846 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:44,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:44,846 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:44,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:44,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:44,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:44,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:44,852 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:44,852 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:44,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:44,853 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:44,853 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:44,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:44,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:44,942 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:44,942 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 02:25:44,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:44,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:44,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2728 [2022-12-13 02:25:44,942 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:25:44,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:44,942 INFO L85 PathProgramCache]: Analyzing trace with hash 918737582, now seen corresponding path program 1 times [2022-12-13 02:25:44,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:44,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135191431] [2022-12-13 02:25:44,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:44,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:44,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:25:44,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:44,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135191431] [2022-12-13 02:25:44,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135191431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:44,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:44,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:45,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266634183] [2022-12-13 02:25:45,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:45,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:45,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:45,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:45,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:45,000 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:45,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:45,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:45,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:45,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:45,069 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:45,069 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:45,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:45,070 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:45,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:45,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:45,071 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:45,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:45,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:45,073 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:45,074 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:45,074 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:45,074 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:45,074 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:45,074 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:45,074 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:45,074 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:45,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:45,080 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:45,080 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:45,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:45,080 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:45,080 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:45,167 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:45,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:45,168 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:45,168 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 02:25:45,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:45,168 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:45,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2729 [2022-12-13 02:25:45,168 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:25:45,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash 947366733, now seen corresponding path program 1 times [2022-12-13 02:25:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:45,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416146205] [2022-12-13 02:25:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:45,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:25:45,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:45,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416146205] [2022-12-13 02:25:45,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416146205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:45,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:45,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039458756] [2022-12-13 02:25:45,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:45,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:45,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:45,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:45,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:45,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:45,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:45,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:45,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:45,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:45,294 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:45,294 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:45,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:45,295 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:45,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:45,295 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:45,295 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:45,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:45,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:45,298 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:45,298 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:45,298 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:45,298 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:45,298 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:45,299 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:45,299 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:45,299 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:45,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:45,304 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:45,304 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:45,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:45,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:45,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:45,403 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:45,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 02:25:45,404 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:45,404 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 02:25:45,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:45,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:45,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2730 [2022-12-13 02:25:45,404 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:25:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:45,404 INFO L85 PathProgramCache]: Analyzing trace with hash 975995884, now seen corresponding path program 1 times [2022-12-13 02:25:45,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:45,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314026172] [2022-12-13 02:25:45,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:45,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:45,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:25:45,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:45,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314026172] [2022-12-13 02:25:45,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314026172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:45,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:45,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:45,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264808326] [2022-12-13 02:25:45,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:45,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:45,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:45,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:45,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:45,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:45,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:45,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:45,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:45,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:45,527 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:45,527 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:45,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:45,528 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:45,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:45,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:45,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:45,529 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:45,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:45,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:45,531 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:45,531 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:45,531 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:45,532 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:45,532 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:45,532 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:45,532 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:45,532 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:45,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:45,537 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:45,537 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:45,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:45,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:45,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:45,624 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:45,625 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:45,625 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:45,625 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 02:25:45,625 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:45,625 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:45,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2731 [2022-12-13 02:25:45,625 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:25:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1004625035, now seen corresponding path program 1 times [2022-12-13 02:25:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:45,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560537254] [2022-12-13 02:25:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:45,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:25:45,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:45,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560537254] [2022-12-13 02:25:45,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560537254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:45,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:45,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:45,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411244773] [2022-12-13 02:25:45,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:45,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:45,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:45,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:45,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:45,698 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:45,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:45,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:45,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:45,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:45,782 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:45,782 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:45,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:45,783 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:45,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:45,784 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:45,784 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:45,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:45,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:45,787 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:45,787 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:45,787 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:45,787 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:45,787 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:45,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:45,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:45,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:45,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:45,793 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:45,793 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:45,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:45,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:45,793 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:45,881 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:45,881 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:45,881 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:45,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:45,881 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:45,881 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:45,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2732 [2022-12-13 02:25:45,882 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:25:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1033254186, now seen corresponding path program 1 times [2022-12-13 02:25:45,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:45,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602103914] [2022-12-13 02:25:45,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:45,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:25:45,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:45,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602103914] [2022-12-13 02:25:45,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602103914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:45,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:45,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:45,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385516003] [2022-12-13 02:25:45,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:45,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:45,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:45,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:45,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:45,938 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:45,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:45,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:45,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:45,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:46,003 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:46,004 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:46,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:46,005 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:46,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:46,005 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:46,005 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:46,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:46,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:46,008 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,008 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:46,008 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:46,008 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:46,008 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,008 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:46,008 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:46,008 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:46,014 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:46,014 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:46,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:46,014 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:46,014 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:46,102 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:46,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:46,103 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:46,103 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 02:25:46,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:46,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:46,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2733 [2022-12-13 02:25:46,103 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:25:46,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:46,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1061883337, now seen corresponding path program 1 times [2022-12-13 02:25:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:46,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366951586] [2022-12-13 02:25:46,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:46,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:25:46,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:46,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366951586] [2022-12-13 02:25:46,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366951586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:46,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:46,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:46,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752912627] [2022-12-13 02:25:46,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:46,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:46,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:46,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:46,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:46,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:46,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:46,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:46,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:46,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:46,237 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:46,237 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:46,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:46,238 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:46,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:46,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:46,238 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:46,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:46,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:46,241 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,241 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:46,241 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:46,241 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:46,241 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,241 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:46,241 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:46,241 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:46,247 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:46,247 INFO L131 PetriNetUnfolder]: For 435/444 co-relation queries the response was YES. [2022-12-13 02:25:46,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/444 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:46,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:46,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:46,335 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:46,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:46,335 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:46,335 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 02:25:46,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:46,336 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:46,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2734 [2022-12-13 02:25:46,336 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:25:46,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:46,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1090512488, now seen corresponding path program 1 times [2022-12-13 02:25:46,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:46,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935781663] [2022-12-13 02:25:46,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:46,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:46,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:25:46,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:46,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935781663] [2022-12-13 02:25:46,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935781663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:46,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:46,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:46,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413730773] [2022-12-13 02:25:46,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:46,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:46,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:46,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:46,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:46,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:46,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:46,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:46,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:46,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:46,456 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:46,457 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:46,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:46,457 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:46,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:46,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:46,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:46,458 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:46,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:46,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:46,460 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,461 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:46,461 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:46,461 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:46,461 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,461 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:46,461 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:46,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:46,466 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:46,466 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:46,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:46,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:46,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:46,565 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:46,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:25:46,566 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:46,566 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 02:25:46,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:46,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:46,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2735 [2022-12-13 02:25:46,566 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:25:46,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:46,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1119141639, now seen corresponding path program 1 times [2022-12-13 02:25:46,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:46,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129838403] [2022-12-13 02:25:46,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:46,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:46,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:25:46,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:46,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129838403] [2022-12-13 02:25:46,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129838403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:46,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:46,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:46,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152579560] [2022-12-13 02:25:46,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:46,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:46,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:46,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:46,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:46,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:46,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:46,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:46,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:46,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:46,686 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:46,686 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:46,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:46,687 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:46,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:46,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:46,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:46,687 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:46,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:46,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:46,690 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,690 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:46,690 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:46,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:46,690 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:46,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:46,690 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:46,696 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:46,696 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:46,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:46,696 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:46,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:46,785 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:46,785 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:46,785 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:46,786 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 02:25:46,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:46,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:46,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2736 [2022-12-13 02:25:46,786 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:25:46,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1147770790, now seen corresponding path program 1 times [2022-12-13 02:25:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:46,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488936930] [2022-12-13 02:25:46,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:46,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:46,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:25:46,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:46,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488936930] [2022-12-13 02:25:46,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488936930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:46,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:46,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:46,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687784991] [2022-12-13 02:25:46,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:46,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:46,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:46,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:46,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:46,840 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:46,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:46,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:46,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:46,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:46,917 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:46,917 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:46,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:46,918 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:46,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:46,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:46,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:46,919 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:46,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:46,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:46,921 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,921 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:46,921 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:46,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:46,921 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,922 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:46,922 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:46,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:46,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:46,927 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:46,927 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:46,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:46,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:46,928 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:47,013 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:47,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:47,014 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:47,014 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 02:25:47,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:47,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:47,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2737 [2022-12-13 02:25:47,014 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:25:47,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1176399941, now seen corresponding path program 1 times [2022-12-13 02:25:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:47,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963528080] [2022-12-13 02:25:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:47,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:25:47,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:47,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963528080] [2022-12-13 02:25:47,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963528080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:47,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:47,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:47,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149113339] [2022-12-13 02:25:47,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:47,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:47,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:47,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:47,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:47,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:47,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:47,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:47,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:47,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:47,148 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:47,148 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:47,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:47,149 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:47,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:47,150 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:47,150 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:47,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:47,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:47,152 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:47,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:47,152 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:47,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:47,153 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:47,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:47,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:47,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:47,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:47,158 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:47,158 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:25:47,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:47,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:47,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:47,246 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:47,246 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:47,247 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:47,247 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 02:25:47,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:47,247 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:47,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2738 [2022-12-13 02:25:47,247 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:25:47,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:47,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1205029092, now seen corresponding path program 1 times [2022-12-13 02:25:47,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:47,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724860374] [2022-12-13 02:25:47,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:47,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:47,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:25:47,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:47,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724860374] [2022-12-13 02:25:47,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724860374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:47,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:47,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:47,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909697738] [2022-12-13 02:25:47,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:47,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:47,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:47,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:47,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:47,304 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:47,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:47,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:47,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:47,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:47,370 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:47,370 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:47,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:47,371 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:47,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:47,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:47,372 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:47,372 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:47,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:47,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:47,374 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:47,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:47,375 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:47,375 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:47,375 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:47,375 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:47,375 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:47,375 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:47,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:47,381 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:47,381 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:47,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:47,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:47,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:47,470 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:47,471 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:47,471 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:47,471 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 02:25:47,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:47,471 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:47,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2739 [2022-12-13 02:25:47,471 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:25:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:47,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1233658243, now seen corresponding path program 1 times [2022-12-13 02:25:47,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:47,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184115172] [2022-12-13 02:25:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:47,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:47,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:25:47,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:47,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184115172] [2022-12-13 02:25:47,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184115172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:47,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:47,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:47,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515725604] [2022-12-13 02:25:47,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:47,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:47,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:47,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:47,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:47,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:47,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:47,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:47,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:47,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:47,596 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:47,596 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:47,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:47,597 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:47,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:47,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:47,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:47,597 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:47,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:47,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:47,600 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:47,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:47,600 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:47,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:47,600 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:47,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:47,601 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:47,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:47,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:47,606 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:47,606 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:47,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:47,607 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:47,607 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:47,707 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:47,707 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:25:47,707 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:47,707 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 02:25:47,707 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:47,707 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:47,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2740 [2022-12-13 02:25:47,708 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:25:47,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:47,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1262287394, now seen corresponding path program 1 times [2022-12-13 02:25:47,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:47,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629880576] [2022-12-13 02:25:47,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:47,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:47,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:25:47,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:47,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629880576] [2022-12-13 02:25:47,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629880576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:47,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:47,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:47,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734300961] [2022-12-13 02:25:47,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:47,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:47,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:47,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:47,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:47,781 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:47,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:47,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:47,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:47,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:47,857 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:47,857 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:47,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:47,858 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:47,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:47,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:47,859 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:47,859 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:47,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:47,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:47,861 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:47,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:47,862 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:47,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:47,862 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:47,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:47,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:47,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:47,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:47,868 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:47,868 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:47,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:47,868 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:47,868 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:47,955 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:47,955 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:47,956 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:47,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:47,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:47,956 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:47,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2741 [2022-12-13 02:25:47,956 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:25:47,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:47,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1290916545, now seen corresponding path program 1 times [2022-12-13 02:25:47,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:47,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403805339] [2022-12-13 02:25:47,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:47,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25: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:25:48,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:48,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403805339] [2022-12-13 02:25:48,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403805339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:48,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:48,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:48,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417289909] [2022-12-13 02:25:48,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:48,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:48,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:48,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:48,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:48,013 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:48,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:48,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:48,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:48,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:48,090 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:48,090 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:48,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:48,091 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:48,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:48,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:48,092 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:48,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:48,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:48,094 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:48,094 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:48,095 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:48,095 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:48,095 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:48,095 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:48,095 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:48,095 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:48,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:48,100 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:48,101 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:48,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:48,101 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:48,101 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:48,188 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:48,189 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:48,189 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:48,189 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 02:25:48,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:48,189 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:48,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2742 [2022-12-13 02:25:48,189 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:25:48,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:48,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1319545696, now seen corresponding path program 1 times [2022-12-13 02:25:48,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:48,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233518405] [2022-12-13 02:25:48,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:48,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:48,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:25:48,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:48,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233518405] [2022-12-13 02:25:48,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233518405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:48,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:48,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247669005] [2022-12-13 02:25:48,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:48,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:48,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:48,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:48,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:48,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:48,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:48,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:48,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:48,313 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:48,314 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:48,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:48,315 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:48,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:48,315 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:48,315 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:48,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:48,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:48,318 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:48,318 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:48,318 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:48,318 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:48,318 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:48,318 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:48,318 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:48,319 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:48,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:48,324 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:48,324 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:48,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:48,325 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:48,325 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:48,413 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:48,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:48,414 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:48,414 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 02:25:48,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:48,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:48,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2743 [2022-12-13 02:25:48,414 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:25:48,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:48,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1348174847, now seen corresponding path program 1 times [2022-12-13 02:25:48,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:48,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466583763] [2022-12-13 02:25:48,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:48,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:48,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:25:48,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:48,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466583763] [2022-12-13 02:25:48,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466583763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:48,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:48,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:48,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014051368] [2022-12-13 02:25:48,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:48,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:48,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:48,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:48,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:48,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:48,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:48,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:48,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:48,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:48,538 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:48,539 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:48,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:48,540 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:48,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:48,540 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:48,540 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:48,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:48,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:48,543 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:48,543 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:48,543 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:48,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:48,543 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:48,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:48,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:48,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:48,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:48,549 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:48,549 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:48,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:48,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:48,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:48,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:48,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:48,639 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:48,639 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 02:25:48,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:48,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:48,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2744 [2022-12-13 02:25:48,639 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:25:48,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:48,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1376803998, now seen corresponding path program 1 times [2022-12-13 02:25:48,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:48,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720191977] [2022-12-13 02:25:48,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:48,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:48,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:25:48,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:48,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720191977] [2022-12-13 02:25:48,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720191977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:48,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:48,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:48,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120694777] [2022-12-13 02:25:48,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:48,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:48,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:48,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:48,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:48,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:48,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:48,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:48,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:48,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:48,769 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:48,769 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:48,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:48,770 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:48,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:48,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:48,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:48,770 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:48,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:48,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:48,773 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:48,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:48,773 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:48,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:48,773 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:48,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:48,774 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:48,774 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:48,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:48,779 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:48,779 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:48,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:48,780 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:48,780 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:48,880 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:48,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:25:48,880 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:48,880 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 02:25:48,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:48,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:48,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2745 [2022-12-13 02:25:48,881 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:25:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:48,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1405433149, now seen corresponding path program 1 times [2022-12-13 02:25:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:48,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507500303] [2022-12-13 02:25:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:48,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:48,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:25:48,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:48,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507500303] [2022-12-13 02:25:48,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507500303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:48,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:48,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:48,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668787158] [2022-12-13 02:25:48,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:48,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:48,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:48,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:48,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:48,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:48,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:48,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:48,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:48,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:49,005 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:49,005 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:49,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:49,006 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:49,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:49,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:49,007 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:49,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:49,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:49,009 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:49,010 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:49,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:49,010 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:49,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:49,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:49,016 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:49,016 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:49,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:49,016 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:49,016 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:49,102 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:49,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:49,103 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:49,103 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 02:25:49,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:49,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:49,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2746 [2022-12-13 02:25:49,103 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:25:49,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1434062300, now seen corresponding path program 1 times [2022-12-13 02:25:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:49,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325212258] [2022-12-13 02:25:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:49,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:49,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:25:49,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:49,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325212258] [2022-12-13 02:25:49,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325212258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:49,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:49,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:49,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704169421] [2022-12-13 02:25:49,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:49,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:49,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:49,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:49,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:49,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:49,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:49,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:49,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:49,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:49,227 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:49,227 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:49,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:49,228 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:49,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:49,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:49,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:49,229 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:49,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:49,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:49,231 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:49,231 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:49,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:49,231 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:49,232 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:49,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:49,237 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:49,237 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:49,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:49,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:49,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:49,326 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:49,326 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:49,326 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:49,326 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 02:25:49,326 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:49,326 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:49,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2747 [2022-12-13 02:25:49,327 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:25:49,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:49,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1462691451, now seen corresponding path program 1 times [2022-12-13 02:25:49,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:49,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478156443] [2022-12-13 02:25:49,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:49,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:49,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:25:49,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:49,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478156443] [2022-12-13 02:25:49,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478156443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:49,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:49,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:49,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101068625] [2022-12-13 02:25:49,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:49,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:49,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:49,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:49,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:49,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:49,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:49,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:49,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:49,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:49,467 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:49,467 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:49,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:49,468 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:49,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:49,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:49,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:49,469 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:49,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:49,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:49,471 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,472 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:49,472 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:49,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:49,472 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:49,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:49,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:49,478 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:49,478 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:49,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:49,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:49,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:49,565 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:49,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:49,565 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:49,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:49,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:49,565 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:49,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2748 [2022-12-13 02:25:49,566 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:25:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1491320602, now seen corresponding path program 1 times [2022-12-13 02:25:49,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:49,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159621091] [2022-12-13 02:25:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:49,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:25:49,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:49,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159621091] [2022-12-13 02:25:49,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159621091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:49,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:49,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:49,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357614363] [2022-12-13 02:25:49,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:49,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:49,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:49,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:49,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:49,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:49,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:49,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:49,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:49,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:49,692 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:49,692 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:49,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:49,693 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:49,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:49,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:49,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:49,694 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:49,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:49,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:49,697 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,697 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:49,697 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:49,697 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:49,697 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,697 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:49,697 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:49,697 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:49,703 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:49,703 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:49,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:49,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:49,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:49,790 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:49,791 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:49,791 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:49,791 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 02:25:49,791 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:49,791 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:49,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2749 [2022-12-13 02:25:49,791 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:25:49,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:49,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1519949753, now seen corresponding path program 1 times [2022-12-13 02:25:49,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:49,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358421318] [2022-12-13 02:25:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:49,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:49,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:25:49,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:49,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358421318] [2022-12-13 02:25:49,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358421318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:49,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:49,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:49,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659331118] [2022-12-13 02:25:49,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:49,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:49,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:49,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:49,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:49,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:49,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:49,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:49,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:49,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:49,919 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:49,919 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:49,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:49,920 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:49,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:49,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:49,920 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:49,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:49,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:49,923 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,923 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:49,923 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:49,923 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:49,923 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,923 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:49,924 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:49,924 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:49,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:49,929 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:49,929 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:49,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:49,941 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:49,941 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:50,026 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:50,027 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:25:50,027 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:50,027 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 02:25:50,027 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:50,027 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:50,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2750 [2022-12-13 02:25:50,027 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:25:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:50,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1548578904, now seen corresponding path program 1 times [2022-12-13 02:25:50,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:50,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115067953] [2022-12-13 02:25:50,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:50,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:50,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 02:25:50,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:50,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115067953] [2022-12-13 02:25:50,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115067953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:50,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:50,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:50,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729757964] [2022-12-13 02:25:50,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:50,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:50,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:50,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:50,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:50,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:50,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:50,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:50,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:50,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:50,170 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:50,170 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:50,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:50,171 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:50,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:50,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:50,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:50,172 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:50,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:50,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:50,176 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:50,176 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:50,176 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:50,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:50,176 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:50,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:50,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:50,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:50,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:50,184 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:50,185 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:50,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:50,185 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:50,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:50,296 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:50,296 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:25:50,296 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:50,296 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 02:25:50,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:50,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:50,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2751 [2022-12-13 02:25:50,297 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:25:50,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:50,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1577208055, now seen corresponding path program 1 times [2022-12-13 02:25:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:50,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609606565] [2022-12-13 02:25:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:50,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:50,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:25:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:50,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609606565] [2022-12-13 02:25:50,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609606565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:50,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:50,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:50,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564522181] [2022-12-13 02:25:50,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:50,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:50,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:50,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:50,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:50,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:50,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:50,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:50,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:50,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:50,439 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:50,440 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:50,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:50,441 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:50,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:50,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:50,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:50,441 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:50,441 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:50,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:50,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:50,445 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:50,445 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:50,445 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:50,445 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:50,445 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:50,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:50,445 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:50,445 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:50,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:50,451 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:50,451 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:50,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:50,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:50,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:50,537 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:50,537 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:25:50,537 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:50,537 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 02:25:50,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:50,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:50,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2752 [2022-12-13 02:25:50,538 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:25:50,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:50,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1605837206, now seen corresponding path program 1 times [2022-12-13 02:25:50,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:50,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452497535] [2022-12-13 02:25:50,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:50,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:50,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:25:50,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:50,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452497535] [2022-12-13 02:25:50,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452497535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:50,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:50,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:50,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475525532] [2022-12-13 02:25:50,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:50,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:50,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:50,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:50,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:50,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:50,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:50,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:50,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:50,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:50,670 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:50,670 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:50,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:50,671 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:50,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:50,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:50,671 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:50,671 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:50,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:50,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:50,674 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:50,674 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:50,674 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:50,674 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:50,674 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:50,674 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:50,674 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:50,674 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:50,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:50,680 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:50,680 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:50,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:50,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:50,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:50,767 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:50,767 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:50,767 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:50,767 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 02:25:50,767 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:50,767 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:50,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2753 [2022-12-13 02:25:50,767 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:25:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1634466357, now seen corresponding path program 1 times [2022-12-13 02:25:50,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:50,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011357646] [2022-12-13 02:25:50,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:50,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:25:50,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:50,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011357646] [2022-12-13 02:25:50,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011357646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:50,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:50,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:50,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635543944] [2022-12-13 02:25:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:50,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:50,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:50,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:50,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:50,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:50,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:50,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:50,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:50,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:50,889 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:50,889 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:50,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:50,890 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:50,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:50,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:50,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:50,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:50,891 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:50,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:50,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:50,894 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:50,894 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:50,894 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:50,894 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:50,894 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:50,894 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:50,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:50,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:50,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:50,900 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:50,900 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:50,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:50,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:50,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:50,986 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:50,987 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:50,987 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:50,987 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 02:25:50,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:50,987 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:50,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2754 [2022-12-13 02:25:50,987 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:25:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1663095508, now seen corresponding path program 1 times [2022-12-13 02:25:50,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:50,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996534019] [2022-12-13 02:25:50,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:50,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:51,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:25:51,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:51,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996534019] [2022-12-13 02:25:51,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996534019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:51,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:51,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020471711] [2022-12-13 02:25:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:51,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:51,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:51,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:51,045 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:51,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:51,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:51,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:51,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:51,111 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:51,111 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:51,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:51,112 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:51,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:51,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:51,113 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:51,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:51,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:51,116 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:51,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:51,116 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:51,116 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:51,116 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:51,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:51,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:51,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:51,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:51,122 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:51,122 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:51,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:51,122 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:51,123 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:51,220 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:51,221 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:25:51,221 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:51,221 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 02:25:51,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:51,221 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:51,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2755 [2022-12-13 02:25:51,221 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:25:51,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:51,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1691724659, now seen corresponding path program 1 times [2022-12-13 02:25:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:51,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037197758] [2022-12-13 02:25:51,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:51,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:51,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:25:51,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:51,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037197758] [2022-12-13 02:25:51,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037197758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:51,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:51,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:51,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697624711] [2022-12-13 02:25:51,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:51,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:51,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:51,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:51,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:51,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:51,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:51,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:51,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:51,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:51,373 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:51,373 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:51,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:51,374 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:51,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:51,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:51,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:51,375 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:51,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:51,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:51,377 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:51,377 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:51,378 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:51,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:51,378 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:51,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:51,378 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:51,378 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:51,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:51,383 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:51,384 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:51,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:51,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:51,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:51,471 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:51,471 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:51,471 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:51,472 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 02:25:51,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:51,472 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:51,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2756 [2022-12-13 02:25:51,472 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:25:51,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:51,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1720353810, now seen corresponding path program 1 times [2022-12-13 02:25:51,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:51,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155752113] [2022-12-13 02:25:51,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:51,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:51,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:25:51,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:51,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155752113] [2022-12-13 02:25:51,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155752113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:51,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:51,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:51,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396567552] [2022-12-13 02:25:51,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:51,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:51,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:51,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:51,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:51,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:51,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:51,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:51,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:51,594 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:51,595 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:51,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1128 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:51,596 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:51,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:51,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:51,596 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:51,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:51,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:51,599 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:51,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:51,599 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:51,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:51,599 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:51,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:51,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:51,599 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:51,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:51,605 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:51,605 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:51,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:51,606 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:51,606 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:51,693 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:51,693 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:51,693 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:51,693 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 02:25:51,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:51,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:51,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2757 [2022-12-13 02:25:51,693 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:25:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1748982961, now seen corresponding path program 1 times [2022-12-13 02:25:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:51,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748598258] [2022-12-13 02:25:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:51,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:51,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:25:51,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:51,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748598258] [2022-12-13 02:25:51,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748598258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:51,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:51,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:51,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665559148] [2022-12-13 02:25:51,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:51,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:51,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:51,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:51,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:51,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:51,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:51,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:51,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:51,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:51,831 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:51,831 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:51,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:51,832 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:51,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:51,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:51,833 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:51,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:51,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:51,835 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:51,835 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:51,836 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:51,836 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:51,836 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:51,836 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:51,836 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:51,836 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:51,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:51,841 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:51,841 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:51,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:51,842 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:51,842 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:51,929 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:51,930 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:51,930 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:51,930 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 02:25:51,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:51,930 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:51,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2758 [2022-12-13 02:25:51,930 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:25:51,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:51,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1777612112, now seen corresponding path program 1 times [2022-12-13 02:25:51,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:51,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508677036] [2022-12-13 02:25:51,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:51,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:51,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:25:51,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:51,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508677036] [2022-12-13 02:25:51,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508677036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:51,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:51,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:51,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760871930] [2022-12-13 02:25:51,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:51,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:51,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:51,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:51,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:51,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:51,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:51,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:51,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:52,054 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:52,054 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:52,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:52,056 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:52,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:52,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:52,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:52,056 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:52,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:52,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:52,059 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:52,059 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:52,059 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:52,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:52,059 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:52,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:52,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:52,059 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:52,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:52,065 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:52,065 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:25:52,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:52,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:52,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:52,153 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:52,154 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:52,154 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:52,154 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 02:25:52,154 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:52,154 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:52,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2759 [2022-12-13 02:25:52,154 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:25:52,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:52,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1806241263, now seen corresponding path program 1 times [2022-12-13 02:25:52,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:52,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998761948] [2022-12-13 02:25:52,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:52,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:52,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:25:52,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:52,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998761948] [2022-12-13 02:25:52,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998761948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:52,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:52,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:52,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809435610] [2022-12-13 02:25:52,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:52,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:52,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:52,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:52,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:52,226 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:52,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:52,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:52,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:52,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:52,302 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:52,302 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:52,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:52,303 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:52,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:52,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:52,303 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:52,303 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:52,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:52,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:52,306 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:52,306 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:52,306 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:52,306 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:52,306 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:52,307 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:52,307 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:52,307 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:52,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:52,312 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:52,312 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:25:52,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:52,313 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:52,313 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:52,411 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:52,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:25:52,412 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:52,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:52,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:52,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:52,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2760 [2022-12-13 02:25:52,412 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:25:52,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1834870414, now seen corresponding path program 1 times [2022-12-13 02:25:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:52,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783741096] [2022-12-13 02:25:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:52,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:52,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:25:52,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:52,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783741096] [2022-12-13 02:25:52,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783741096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:52,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:52,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:52,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136747488] [2022-12-13 02:25:52,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:52,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:52,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:52,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:52,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:52,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:52,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:52,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:52,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:52,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:52,549 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:52,550 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:52,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:52,551 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:52,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:52,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:52,551 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:52,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:52,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:52,554 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:52,554 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:52,554 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:52,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:52,554 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:52,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:52,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:52,554 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:52,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:52,560 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:52,560 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:25:52,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:52,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:52,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:52,650 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:52,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:52,651 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:52,651 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 02:25:52,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:52,651 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:52,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2761 [2022-12-13 02:25:52,651 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:25:52,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:52,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1863499565, now seen corresponding path program 1 times [2022-12-13 02:25:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:52,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514642337] [2022-12-13 02:25:52,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:52,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:25:52,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:52,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514642337] [2022-12-13 02:25:52,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514642337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:52,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:52,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:52,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148537281] [2022-12-13 02:25:52,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:52,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:52,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:52,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:52,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:52,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:52,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:52,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:52,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:52,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:52,786 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:52,786 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:52,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:52,787 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:52,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:52,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:52,788 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:52,788 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:52,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:52,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:52,790 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:52,790 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:52,790 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:52,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:52,790 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:52,791 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:52,791 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:52,791 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:52,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:52,796 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:52,796 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:25:52,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:52,797 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:52,797 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:52,885 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:52,886 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:52,886 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:52,886 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 02:25:52,886 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:52,886 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:52,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2762 [2022-12-13 02:25:52,886 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:25:52,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:52,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1892128716, now seen corresponding path program 1 times [2022-12-13 02:25:52,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:52,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100326895] [2022-12-13 02:25:52,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:52,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:52,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:25:52,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:52,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100326895] [2022-12-13 02:25:52,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100326895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:52,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:52,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:52,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312039255] [2022-12-13 02:25:52,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:52,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:52,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:52,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:52,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:52,943 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:52,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:52,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:52,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:52,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:53,009 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:53,010 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:53,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:53,011 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:53,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:53,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:53,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:53,011 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:53,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:53,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:53,014 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,014 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:53,014 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:53,014 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:53,014 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,014 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:53,014 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:53,014 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:53,020 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:53,020 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:53,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:53,021 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:53,021 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:53,109 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:53,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:53,110 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:53,110 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 02:25:53,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:53,110 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:53,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2763 [2022-12-13 02:25:53,110 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:25:53,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:53,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1920757867, now seen corresponding path program 1 times [2022-12-13 02:25:53,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:53,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48309576] [2022-12-13 02:25:53,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:53,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:53,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:25:53,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:53,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48309576] [2022-12-13 02:25:53,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48309576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:53,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:53,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:53,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065541914] [2022-12-13 02:25:53,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:53,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:53,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:53,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:53,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:53,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:53,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:53,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:53,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:53,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:53,257 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:53,257 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:53,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:53,259 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:53,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:53,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:53,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:53,259 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:53,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:53,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:53,262 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,262 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:53,262 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:53,262 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:53,262 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,262 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:53,262 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:53,262 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:53,268 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:53,268 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:53,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:53,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:53,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:53,359 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:53,359 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:53,359 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:53,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:53,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:53,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:53,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2764 [2022-12-13 02:25:53,359 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:25:53,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:53,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1949387018, now seen corresponding path program 1 times [2022-12-13 02:25:53,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:53,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791997681] [2022-12-13 02:25:53,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:53,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:53,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:25:53,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:53,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791997681] [2022-12-13 02:25:53,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791997681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:53,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:53,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:53,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893432422] [2022-12-13 02:25:53,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:53,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:53,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:53,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:53,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:53,412 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:53,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:53,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:53,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:53,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:53,477 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:53,477 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:53,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:53,478 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:53,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:53,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:53,478 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:53,478 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:53,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:53,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:53,481 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,481 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:53,481 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:53,481 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:53,481 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,481 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:53,481 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:53,481 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:53,497 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:53,497 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:53,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:53,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:53,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:53,584 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:53,585 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:25:53,585 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:53,585 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 02:25:53,585 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:53,585 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:53,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2765 [2022-12-13 02:25:53,585 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:25:53,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1978016169, now seen corresponding path program 1 times [2022-12-13 02:25:53,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:53,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763279459] [2022-12-13 02:25:53,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:53,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:53,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:25:53,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:53,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763279459] [2022-12-13 02:25:53,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763279459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:53,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:53,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:53,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861081791] [2022-12-13 02:25:53,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:53,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:53,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:53,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:53,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:53,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:53,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:53,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:53,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:53,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:53,714 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:53,715 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:53,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:53,716 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:53,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:53,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:53,716 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:53,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:53,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:53,719 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,719 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:53,719 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:53,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:53,719 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:53,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:53,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:53,725 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:53,725 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:53,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:53,725 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:53,725 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:53,814 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:53,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:53,814 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:53,814 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 02:25:53,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:53,814 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:53,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2766 [2022-12-13 02:25:53,815 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:25:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:53,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2006645320, now seen corresponding path program 1 times [2022-12-13 02:25:53,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:53,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811653689] [2022-12-13 02:25:53,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:53,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:53,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:25:53,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:53,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811653689] [2022-12-13 02:25:53,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811653689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:53,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:53,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:53,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726815206] [2022-12-13 02:25:53,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:53,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:53,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:53,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:53,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:53,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:53,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:53,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:53,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:53,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:53,948 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:53,948 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:53,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:53,949 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:53,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:53,950 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:53,950 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:53,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:53,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:53,952 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,952 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:53,952 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:53,952 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:53,952 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,953 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:53,953 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:53,953 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:53,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:53,958 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:53,958 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:53,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:53,959 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:53,959 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:54,046 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:54,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:54,046 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:54,046 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 02:25:54,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:54,047 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:54,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2767 [2022-12-13 02:25:54,047 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:25:54,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:54,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2035274471, now seen corresponding path program 1 times [2022-12-13 02:25:54,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:54,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339002550] [2022-12-13 02:25:54,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:54,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:54,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:25:54,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:54,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339002550] [2022-12-13 02:25:54,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339002550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:54,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:54,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:54,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484154365] [2022-12-13 02:25:54,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:54,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:54,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:54,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:54,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:54,102 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:54,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:54,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:54,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:54,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:54,179 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:54,179 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:54,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:54,180 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:54,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:54,180 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:54,180 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:54,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:54,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:54,183 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:54,183 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:54,183 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:54,183 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:54,183 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:54,184 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:54,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:54,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:54,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:54,189 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:54,189 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:54,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:54,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:54,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:54,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:54,277 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:54,277 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:54,277 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 02:25:54,277 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:54,277 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:54,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2768 [2022-12-13 02:25:54,278 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:25:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:54,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2063903622, now seen corresponding path program 1 times [2022-12-13 02:25:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:54,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190414511] [2022-12-13 02:25:54,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:54,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:25:54,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:54,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190414511] [2022-12-13 02:25:54,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190414511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:54,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:54,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:54,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386480594] [2022-12-13 02:25:54,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:54,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:54,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:54,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:54,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:54,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:54,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:54,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:54,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:54,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:54,409 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:54,409 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:54,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:54,410 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:54,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:54,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:54,411 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:54,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:54,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:54,413 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:54,413 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:54,413 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:54,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:54,414 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:54,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:54,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:54,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:54,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:54,419 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:54,419 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:54,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:54,420 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:54,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:54,508 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:54,508 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:54,508 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:54,508 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 02:25:54,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:54,508 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:54,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2769 [2022-12-13 02:25:54,508 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:25:54,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:54,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2092532773, now seen corresponding path program 1 times [2022-12-13 02:25:54,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:54,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688365148] [2022-12-13 02:25:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:54,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:54,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:25:54,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:54,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688365148] [2022-12-13 02:25:54,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688365148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:54,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:54,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:54,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607852660] [2022-12-13 02:25:54,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:54,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:54,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:54,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:54,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:54,580 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:54,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:54,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:54,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:54,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:54,650 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:54,650 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:54,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:54,651 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:54,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:54,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:54,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:54,651 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:54,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:54,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:54,654 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:54,654 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:54,654 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:54,654 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:54,654 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:54,655 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:54,655 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:54,655 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:54,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:54,670 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:54,671 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:54,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:54,671 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:54,671 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:54,758 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:54,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:25:54,759 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:54,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:54,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:54,759 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:54,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2770 [2022-12-13 02:25:54,759 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:25:54,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:54,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2121161924, now seen corresponding path program 1 times [2022-12-13 02:25:54,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:54,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985367125] [2022-12-13 02:25:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:54,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:25:54,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:54,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985367125] [2022-12-13 02:25:54,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985367125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:54,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:54,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:54,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812266877] [2022-12-13 02:25:54,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:54,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:54,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:54,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:54,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:54,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:54,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:54,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:54,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:54,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:54,884 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:54,884 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:54,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:54,886 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:54,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:54,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:54,886 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:54,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:54,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:54,888 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:54,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:54,889 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:54,889 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:54,889 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:54,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:54,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:54,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:54,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:54,895 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:54,895 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:54,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:54,895 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:54,895 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:54,984 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:54,984 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:54,984 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:54,984 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 02:25:54,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:54,984 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:54,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2771 [2022-12-13 02:25:54,984 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:25:54,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:54,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2145176221, now seen corresponding path program 1 times [2022-12-13 02:25:54,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:54,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903185692] [2022-12-13 02:25:54,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:54,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:55,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:25:55,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:55,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903185692] [2022-12-13 02:25:55,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903185692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:55,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:55,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:55,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011199076] [2022-12-13 02:25:55,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:55,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:55,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:55,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:55,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:55,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:55,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:55,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:55,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:55,116 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:55,116 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:55,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:55,117 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:55,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:55,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:55,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:55,118 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:55,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:55,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:55,120 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:55,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:55,120 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:55,120 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:55,120 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:55,120 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:55,120 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:55,120 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:55,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:55,126 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:55,126 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:25:55,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:55,127 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:55,127 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:55,214 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:55,215 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:55,215 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:55,215 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 02:25:55,215 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:55,215 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:55,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2772 [2022-12-13 02:25:55,215 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:25:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2116547070, now seen corresponding path program 1 times [2022-12-13 02:25:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:55,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939205141] [2022-12-13 02:25:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:55,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:25:55,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:55,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939205141] [2022-12-13 02:25:55,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939205141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:55,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:55,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:55,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724963123] [2022-12-13 02:25:55,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:55,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:55,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:55,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:55,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:55,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:55,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:55,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:55,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:55,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:55,340 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:55,340 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:55,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:55,341 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:55,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:55,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:55,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:55,342 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:55,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:55,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:55,344 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:55,345 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:55,345 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:55,345 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:55,345 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:55,345 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:55,345 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:55,345 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:55,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:55,351 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:55,351 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:55,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:55,351 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:55,351 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:55,440 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:55,440 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:55,440 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:55,440 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 02:25:55,440 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:55,440 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:55,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2773 [2022-12-13 02:25:55,440 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:25:55,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2087917919, now seen corresponding path program 1 times [2022-12-13 02:25:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:55,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444784407] [2022-12-13 02:25:55,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:55,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:55,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:55,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444784407] [2022-12-13 02:25:55,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444784407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:55,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:55,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:55,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990841648] [2022-12-13 02:25:55,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:55,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:55,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:55,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:55,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:55,499 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:55,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:55,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:55,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:55,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:55,566 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:55,566 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:55,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:55,567 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:55,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:55,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:55,568 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:55,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:55,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:55,570 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:55,570 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:55,570 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:55,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:55,571 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:55,571 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:55,571 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:55,571 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:55,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:55,577 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:55,577 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:55,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:55,577 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:55,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:55,667 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:55,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:55,667 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:55,667 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 02:25:55,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:55,667 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:55,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2774 [2022-12-13 02:25:55,668 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:25:55,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2059288768, now seen corresponding path program 1 times [2022-12-13 02:25:55,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:55,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384509625] [2022-12-13 02:25:55,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:55,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384509625] [2022-12-13 02:25:55,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384509625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:55,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:55,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:55,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736803407] [2022-12-13 02:25:55,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:55,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:55,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:55,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:55,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:55,726 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:55,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:55,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:55,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:55,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:55,794 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:55,794 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:55,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:55,796 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:55,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:55,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:55,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:55,796 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:55,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:55,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:55,799 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:55,799 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:55,799 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:55,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:55,799 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:55,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:55,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:55,799 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:55,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:55,815 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:55,815 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:55,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:55,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:55,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:55,908 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:55,908 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 02:25:55,908 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:55,908 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 02:25:55,908 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:55,908 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:55,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2775 [2022-12-13 02:25:55,909 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:25:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2030659617, now seen corresponding path program 1 times [2022-12-13 02:25:55,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:55,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035539006] [2022-12-13 02:25:55,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:55,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:55,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:25:55,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:55,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035539006] [2022-12-13 02:25:55,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035539006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:55,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:55,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:55,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683972463] [2022-12-13 02:25:55,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:55,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:55,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:55,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:55,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:55,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:55,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:55,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:55,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:56,046 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:56,046 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:56,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:56,047 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:56,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:56,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:56,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:56,048 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:56,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:56,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:56,050 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,050 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:56,051 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:56,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:56,051 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:56,051 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:56,051 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:56,056 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:56,057 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:56,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:56,057 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:56,057 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:56,148 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:56,148 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:25:56,148 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:56,148 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 02:25:56,148 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:56,148 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:56,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2776 [2022-12-13 02:25:56,149 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:25:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2002030466, now seen corresponding path program 1 times [2022-12-13 02:25:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:56,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268916279] [2022-12-13 02:25:56,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:56,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:56,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 02:25:56,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:56,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268916279] [2022-12-13 02:25:56,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268916279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:56,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:56,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:56,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566301517] [2022-12-13 02:25:56,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:56,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:56,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:56,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:56,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:56,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:56,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:56,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:56,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:56,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:56,274 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:56,274 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:56,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:56,275 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:56,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:56,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:56,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:56,276 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:56,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:56,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:56,278 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:56,278 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:56,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:56,278 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,279 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:56,279 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:56,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:56,284 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:56,284 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:56,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:56,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:56,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:56,374 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:56,374 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:25:56,374 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:56,374 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 02:25:56,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:56,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:56,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2777 [2022-12-13 02:25:56,375 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:25:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1973401315, now seen corresponding path program 1 times [2022-12-13 02:25:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:56,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102275535] [2022-12-13 02:25:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:56,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:56,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:25:56,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:56,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102275535] [2022-12-13 02:25:56,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102275535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:56,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:56,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:56,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304902653] [2022-12-13 02:25:56,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:56,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:56,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:56,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:56,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:56,430 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:56,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:56,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:56,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:56,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:56,496 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:56,496 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:56,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:56,498 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:56,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:56,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:56,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:56,498 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:56,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:56,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:56,501 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,501 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:56,501 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:56,501 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:56,501 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,501 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:56,501 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:56,501 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:56,507 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:56,507 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:56,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:56,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:56,508 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:56,596 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:56,596 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:56,596 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:56,596 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 02:25:56,596 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:56,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:56,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2778 [2022-12-13 02:25:56,597 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:25:56,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1944772164, now seen corresponding path program 1 times [2022-12-13 02:25:56,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:56,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282881620] [2022-12-13 02:25:56,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:56,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:56,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:25:56,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:56,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282881620] [2022-12-13 02:25:56,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282881620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:56,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:56,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:56,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480379787] [2022-12-13 02:25:56,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:56,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:56,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:56,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:56,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:56,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:56,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:56,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:56,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:56,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:56,727 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:56,727 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:56,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:56,728 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:56,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:56,729 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:56,729 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:56,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:56,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:56,731 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,731 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:56,731 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:56,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:56,732 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:56,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:56,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:56,737 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:56,737 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:56,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:56,738 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:56,738 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:56,826 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:56,826 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:56,826 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:56,826 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 02:25:56,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:56,826 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:56,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2779 [2022-12-13 02:25:56,826 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:25:56,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1916143013, now seen corresponding path program 1 times [2022-12-13 02:25:56,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:56,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258945312] [2022-12-13 02:25:56,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:56,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:56,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:25:56,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:56,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258945312] [2022-12-13 02:25:56,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258945312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:56,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:56,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:56,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487451614] [2022-12-13 02:25:56,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:56,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:56,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:56,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:56,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:56,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:56,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:56,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:56,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:56,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:56,956 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:56,956 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:56,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:56,957 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:56,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:56,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:56,958 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:56,958 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:56,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:56,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:56,960 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,960 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:56,960 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:56,960 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:56,960 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,961 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:56,961 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:56,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:56,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:56,976 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:56,976 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:25:56,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:56,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:56,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:57,064 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:57,065 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:25:57,065 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:57,065 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 02:25:57,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:57,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:57,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2780 [2022-12-13 02:25:57,065 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:25:57,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:57,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1887513862, now seen corresponding path program 1 times [2022-12-13 02:25:57,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:57,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609984252] [2022-12-13 02:25:57,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:57,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 02:25:57,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:57,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609984252] [2022-12-13 02:25:57,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609984252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:57,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:57,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:57,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377478263] [2022-12-13 02:25:57,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:57,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:57,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:57,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:57,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:57,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:57,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:57,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:57,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:57,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:57,195 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:57,195 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:57,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:57,196 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:57,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:57,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:57,196 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:57,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:57,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:57,199 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:57,199 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:57,199 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:57,199 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:57,199 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:57,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:57,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:57,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:57,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:57,205 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:57,205 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:57,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:57,205 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:57,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:57,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:57,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:25:57,292 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:57,292 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 02:25:57,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:57,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:57,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2781 [2022-12-13 02:25:57,292 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:25:57,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1858884711, now seen corresponding path program 1 times [2022-12-13 02:25:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:57,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619632079] [2022-12-13 02:25:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:57,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:25:57,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:57,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619632079] [2022-12-13 02:25:57,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619632079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:57,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:57,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:57,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973562247] [2022-12-13 02:25:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:57,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:57,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:57,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:57,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:57,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:57,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:57,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:57,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:57,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:57,416 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:57,416 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:25:57,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:57,417 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:57,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:57,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:57,417 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:57,417 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:57,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:57,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:57,420 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:57,420 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:57,420 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:57,420 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:57,420 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:57,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:57,420 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:57,420 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:57,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:57,426 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:57,426 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:57,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:57,426 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:57,426 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:57,514 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:57,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:57,514 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:57,514 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 02:25:57,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:57,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:57,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2782 [2022-12-13 02:25:57,515 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:25:57,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1830255560, now seen corresponding path program 1 times [2022-12-13 02:25:57,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:57,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546776104] [2022-12-13 02:25:57,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:57,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:57,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:25:57,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:57,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546776104] [2022-12-13 02:25:57,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546776104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:57,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:57,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533034927] [2022-12-13 02:25:57,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:57,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:57,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:57,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:57,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:57,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:57,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:57,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:57,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:57,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:57,637 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:57,637 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:57,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:57,638 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:57,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:57,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:57,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:57,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:57,638 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:57,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:57,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:57,641 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:57,641 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:57,641 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:57,641 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:57,641 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:57,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:57,641 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:57,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:57,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:57,647 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:57,647 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:57,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:57,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:57,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:57,736 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:57,736 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:57,736 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:57,736 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 02:25:57,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:57,736 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:57,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2783 [2022-12-13 02:25:57,737 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:25:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1801626409, now seen corresponding path program 1 times [2022-12-13 02:25:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:57,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198461368] [2022-12-13 02:25:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:57,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:25:57,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:57,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198461368] [2022-12-13 02:25:57,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198461368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:57,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:57,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:57,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125487170] [2022-12-13 02:25:57,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:57,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:57,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:57,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:57,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:57,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:57,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:57,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:57,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:57,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:57,861 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:57,862 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:57,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:57,863 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:57,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:57,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:57,863 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:57,863 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:57,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:57,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:57,866 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:57,866 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:57,866 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:57,866 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:57,866 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:57,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:57,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:57,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:57,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:57,872 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:57,872 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:57,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:57,872 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:57,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:57,960 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:57,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:57,961 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:57,961 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 02:25:57,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:57,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:57,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2784 [2022-12-13 02:25:57,961 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:25:57,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1772997258, now seen corresponding path program 1 times [2022-12-13 02:25:57,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:57,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263920582] [2022-12-13 02:25:57,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:57,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:58,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:25:58,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:58,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263920582] [2022-12-13 02:25:58,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263920582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:58,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:58,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:58,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920673483] [2022-12-13 02:25:58,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:58,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:58,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:58,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:58,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:58,038 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:58,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:58,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:58,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:58,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:58,113 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:58,113 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:58,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:58,114 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:58,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:58,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:58,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:58,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:58,115 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:58,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:58,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:58,117 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:58,118 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:58,118 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:58,118 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:58,118 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:58,118 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:58,118 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:58,118 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:58,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:58,134 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:58,134 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:58,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:58,135 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:58,135 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:58,223 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:58,223 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:25:58,223 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:58,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:58,223 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:58,223 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:58,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2785 [2022-12-13 02:25:58,223 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:25:58,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:58,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1744368107, now seen corresponding path program 1 times [2022-12-13 02:25:58,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:58,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244058947] [2022-12-13 02:25:58,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:58,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:58,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:25:58,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:58,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244058947] [2022-12-13 02:25:58,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244058947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:58,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:58,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:58,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981020365] [2022-12-13 02:25:58,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:58,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:58,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:58,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:58,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:58,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:58,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:58,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:58,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:58,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:58,356 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:58,357 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:58,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:58,358 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:58,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:58,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:58,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:58,358 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:58,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:58,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:58,361 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:58,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:58,361 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:58,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:58,361 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:58,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:58,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:58,362 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:58,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:58,367 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:58,367 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:25:58,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:58,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:58,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:58,455 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:58,455 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:58,456 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:58,456 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 02:25:58,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:58,456 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:58,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2786 [2022-12-13 02:25:58,456 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:25:58,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:58,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1715738956, now seen corresponding path program 1 times [2022-12-13 02:25:58,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:58,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052309136] [2022-12-13 02:25:58,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:58,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:58,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:25:58,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:58,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052309136] [2022-12-13 02:25:58,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052309136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:58,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:58,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:58,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321366266] [2022-12-13 02:25:58,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:58,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:58,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:58,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:58,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:58,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:58,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:58,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:58,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:58,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:58,618 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:58,618 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:25:58,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:58,619 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:58,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:58,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:58,619 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:58,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:58,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:58,622 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:58,622 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:58,622 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:58,622 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:58,622 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:58,622 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:58,622 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:58,622 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:58,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:58,628 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:58,628 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:25:58,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:58,629 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:58,629 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:58,716 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:58,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:58,717 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:58,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:25:58,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:58,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:58,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2787 [2022-12-13 02:25:58,717 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:25:58,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:58,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1687109805, now seen corresponding path program 1 times [2022-12-13 02:25:58,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:58,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017338340] [2022-12-13 02:25:58,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:58,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:58,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:25:58,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:58,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017338340] [2022-12-13 02:25:58,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017338340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:58,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:58,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:58,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322358954] [2022-12-13 02:25:58,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:58,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:58,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:58,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:58,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:58,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:58,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:58,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:58,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:58,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:58,842 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:58,842 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:58,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:58,844 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:58,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:58,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:58,844 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:58,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:58,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:58,847 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:58,847 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:58,847 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:58,847 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:58,847 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:58,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:58,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:58,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:58,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:58,853 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:58,853 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:58,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:58,854 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:58,854 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:58,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:58,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:58,942 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:58,942 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 02:25:58,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:58,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:58,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2788 [2022-12-13 02:25:58,942 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:25:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:58,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1658480654, now seen corresponding path program 1 times [2022-12-13 02:25:58,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:58,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133421681] [2022-12-13 02:25:58,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:59,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:25:59,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:59,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133421681] [2022-12-13 02:25:59,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133421681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:59,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:59,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:59,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063403948] [2022-12-13 02:25:59,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:59,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:59,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:59,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:59,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:59,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:59,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:59,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:59,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:59,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:59,077 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:59,077 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:59,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:59,078 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:59,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:59,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:59,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:59,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:59,079 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:59,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:59,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:59,081 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:59,081 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:59,081 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:59,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:59,082 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:59,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:59,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:59,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:59,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:59,087 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:59,087 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:59,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:59,088 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:59,088 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:59,176 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:59,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:59,177 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:59,177 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 02:25:59,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:59,177 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:59,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2789 [2022-12-13 02:25:59,177 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:25:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:59,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1629851503, now seen corresponding path program 1 times [2022-12-13 02:25:59,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:59,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104444035] [2022-12-13 02:25:59,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:59,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:59,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:25:59,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:59,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104444035] [2022-12-13 02:25:59,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104444035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:59,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:59,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:59,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639993402] [2022-12-13 02:25:59,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:59,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:59,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:59,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:59,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:59,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:59,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:59,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:59,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:59,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:59,320 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:59,321 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:59,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:59,322 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:59,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:59,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:59,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:59,322 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:59,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:59,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:59,324 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:59,324 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:59,325 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:59,325 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:59,325 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:59,325 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:59,325 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:59,325 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:59,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:59,331 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:59,331 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:25:59,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:59,331 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:59,331 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:59,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:59,419 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:25:59,419 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:59,419 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 02:25:59,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:59,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:59,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2790 [2022-12-13 02:25:59,419 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:25:59,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:59,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1601222352, now seen corresponding path program 1 times [2022-12-13 02:25:59,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:59,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679216336] [2022-12-13 02:25:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:59,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:25:59,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:59,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679216336] [2022-12-13 02:25:59,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679216336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:59,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:59,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:59,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871432878] [2022-12-13 02:25:59,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:59,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:59,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:59,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:59,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:59,474 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:59,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:59,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:59,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:59,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:59,540 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:59,540 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:25:59,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1098 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:59,541 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:59,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:59,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:59,542 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:59,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:59,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:59,544 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:59,544 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:59,545 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:59,545 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:59,545 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:59,545 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:59,545 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:59,545 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:59,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:59,550 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:59,551 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:59,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:59,551 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:59,551 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:59,640 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:59,640 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:25:59,640 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:59,640 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 02:25:59,640 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:59,640 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:59,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2791 [2022-12-13 02:25:59,641 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:25:59,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1572593201, now seen corresponding path program 1 times [2022-12-13 02:25:59,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:59,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496354245] [2022-12-13 02:25:59,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:59,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:59,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:25:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:59,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496354245] [2022-12-13 02:25:59,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496354245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:59,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:59,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:59,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750088242] [2022-12-13 02:25:59,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:59,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:59,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:59,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:59,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:59,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:59,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:59,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:59,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:59,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:59,772 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:25:59,772 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:25:59,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:25:59,773 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:25:59,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:59,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:25:59,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:25:59,774 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:25:59,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:25:59,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:59,776 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:59,777 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:25:59,777 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:25:59,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:59,777 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:59,777 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:59,777 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:59,777 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:25:59,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:59,783 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:25:59,783 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:25:59,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:25:59,783 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:25:59,783 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:25:59,875 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:59,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:25:59,875 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:25:59,875 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 02:25:59,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:59,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:59,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2792 [2022-12-13 02:25:59,876 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:25:59,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:59,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1543964050, now seen corresponding path program 1 times [2022-12-13 02:25:59,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:59,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744526354] [2022-12-13 02:25:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:59,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:59,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:25:59,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:59,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744526354] [2022-12-13 02:25:59,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744526354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:59,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:59,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:59,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228514564] [2022-12-13 02:25:59,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:59,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:59,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:59,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:59,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:59,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:25:59,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:25:59,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:59,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:25:59,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:00,006 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:00,006 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:00,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:00,007 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:00,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:00,008 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:00,008 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:00,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:00,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:00,011 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,011 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:00,011 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:00,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:00,011 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,011 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:00,011 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:00,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:00,017 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:00,017 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:26:00,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:00,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:00,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:00,107 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:00,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:26:00,108 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:00,108 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 02:26:00,108 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:00,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:00,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2793 [2022-12-13 02:26:00,108 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:26:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:00,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1515334899, now seen corresponding path program 1 times [2022-12-13 02:26:00,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:00,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804933274] [2022-12-13 02:26:00,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:00,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:00,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:26:00,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:00,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804933274] [2022-12-13 02:26:00,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804933274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:00,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:00,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:00,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299833536] [2022-12-13 02:26:00,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:00,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:00,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:00,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:00,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:00,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:00,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:00,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:00,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:00,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:00,232 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:00,232 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:00,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:00,233 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:00,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:00,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:00,234 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:00,234 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:00,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:00,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:00,236 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,237 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:00,237 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:00,237 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:00,237 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:00,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:00,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:00,243 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:00,243 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:00,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:00,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:00,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:00,331 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:00,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:00,331 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:00,331 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 02:26:00,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:00,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:00,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2794 [2022-12-13 02:26:00,332 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:26:00,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1486705748, now seen corresponding path program 1 times [2022-12-13 02:26:00,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:00,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340041161] [2022-12-13 02:26:00,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:00,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:26:00,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:00,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340041161] [2022-12-13 02:26:00,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340041161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:00,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:00,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142128411] [2022-12-13 02:26:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:00,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:00,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:00,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:00,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:00,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:00,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:00,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:00,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:00,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:00,477 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:00,478 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:00,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:00,479 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:00,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:00,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:00,479 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:00,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:00,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:00,482 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,482 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:00,482 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:00,482 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:00,482 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,482 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:00,482 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:00,482 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:00,488 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:00,488 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:00,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:00,489 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:00,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:00,577 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:00,577 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:00,577 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:00,577 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 02:26:00,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:00,577 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:00,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2795 [2022-12-13 02:26:00,578 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:26:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:00,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1458076597, now seen corresponding path program 1 times [2022-12-13 02:26:00,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:00,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335413118] [2022-12-13 02:26:00,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:00,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:00,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:26:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:00,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335413118] [2022-12-13 02:26:00,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335413118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:00,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:00,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:00,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007876765] [2022-12-13 02:26:00,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:00,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:00,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:00,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:00,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:00,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:00,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:00,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:00,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:00,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:00,703 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:00,703 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:00,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:00,704 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:00,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:00,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:00,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:00,705 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:00,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:00,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:00,707 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:00,707 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:00,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:00,707 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,708 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:00,708 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:00,708 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:00,713 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:00,713 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:00,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:00,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:00,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:00,801 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:00,802 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:00,802 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:00,802 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 02:26:00,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:00,802 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:00,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2796 [2022-12-13 02:26:00,802 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:26:00,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1429447446, now seen corresponding path program 1 times [2022-12-13 02:26:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:00,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689407988] [2022-12-13 02:26:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:00,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:00,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:26:00,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:00,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689407988] [2022-12-13 02:26:00,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689407988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:00,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:00,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:00,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019948860] [2022-12-13 02:26:00,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:00,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:00,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:00,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:00,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:00,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:00,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:00,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:00,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:00,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:00,932 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:00,932 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:00,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:00,933 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:00,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:00,933 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:00,933 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:00,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:00,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:00,936 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:00,936 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:00,936 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:00,936 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,936 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:00,936 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:00,936 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:00,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:00,942 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:00,942 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:00,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:00,942 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:00,942 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:01,028 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:01,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:01,029 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:01,029 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 02:26:01,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:01,029 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:01,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2797 [2022-12-13 02:26:01,029 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:26:01,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1400818295, now seen corresponding path program 1 times [2022-12-13 02:26:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:01,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401024743] [2022-12-13 02:26:01,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:01,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:01,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 02:26:01,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:01,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401024743] [2022-12-13 02:26:01,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401024743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:01,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:01,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:01,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558024402] [2022-12-13 02:26:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:01,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:01,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:01,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:01,082 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:01,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:01,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:01,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:01,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:01,156 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:01,157 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:01,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1125 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:01,157 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:01,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:01,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:01,158 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:01,158 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:01,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:01,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:01,160 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:01,160 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:01,161 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:01,161 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:01,161 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:01,161 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:01,161 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:01,161 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:01,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:01,166 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:01,166 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:26:01,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:01,167 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:01,167 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:01,255 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:01,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:01,255 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:01,255 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 02:26:01,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:01,255 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:01,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2798 [2022-12-13 02:26:01,255 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:26:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1372189144, now seen corresponding path program 1 times [2022-12-13 02:26:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:01,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551156379] [2022-12-13 02:26:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:01,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:26:01,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:01,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551156379] [2022-12-13 02:26:01,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551156379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:01,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:01,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:01,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744192892] [2022-12-13 02:26:01,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:01,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:01,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:01,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:01,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:01,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:01,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:01,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:01,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:01,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:01,394 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:01,394 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:01,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:01,395 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:01,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:01,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:01,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:01,396 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:01,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:01,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:01,398 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:01,398 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:01,399 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:01,399 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:01,399 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:01,399 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:01,399 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:01,399 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:01,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:01,404 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:01,404 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:26:01,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:01,405 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:01,405 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:01,493 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:01,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:01,493 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:01,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:01,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:01,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:01,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2799 [2022-12-13 02:26:01,494 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:26:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:01,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1343559993, now seen corresponding path program 1 times [2022-12-13 02:26:01,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:01,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984953050] [2022-12-13 02:26:01,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:01,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:01,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:26:01,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:01,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984953050] [2022-12-13 02:26:01,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984953050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:01,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:01,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:01,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329307697] [2022-12-13 02:26:01,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:01,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:01,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:01,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:01,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:01,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:01,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:01,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:01,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:01,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:01,653 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:01,654 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:26:01,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:01,655 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:01,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:01,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:01,655 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:01,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:01,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:01,658 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:01,658 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:01,658 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:01,658 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:01,658 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:01,658 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:01,658 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:01,658 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:01,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:01,664 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:01,664 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:26:01,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:01,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:01,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:01,751 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:01,752 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:01,752 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:01,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:01,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:01,752 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:01,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2800 [2022-12-13 02:26:01,752 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:26:01,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1314930842, now seen corresponding path program 1 times [2022-12-13 02:26:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:01,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115525600] [2022-12-13 02:26:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:01,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:01,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:26:01,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:01,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115525600] [2022-12-13 02:26:01,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115525600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:01,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:01,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:01,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879092348] [2022-12-13 02:26:01,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:01,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:01,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:01,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:01,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:01,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:01,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:01,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:01,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:01,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:01,885 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:01,885 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:01,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:01,887 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:01,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:01,887 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:01,887 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:01,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:01,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:01,890 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:01,890 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:01,890 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:01,890 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:01,890 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:01,890 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:01,890 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:01,890 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:01,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:01,896 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:01,896 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:01,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:01,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:01,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:01,983 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:01,984 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:01,984 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:01,984 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 02:26:01,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:01,984 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:01,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2801 [2022-12-13 02:26:01,984 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:26:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1286301691, now seen corresponding path program 1 times [2022-12-13 02:26:01,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:01,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742476122] [2022-12-13 02:26:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:02,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:26:02,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:02,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742476122] [2022-12-13 02:26:02,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742476122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:02,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:02,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:02,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484293226] [2022-12-13 02:26:02,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:02,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:02,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:02,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:02,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:02,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:02,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:02,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:02,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:02,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:02,113 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:02,113 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:02,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:02,114 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:02,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:02,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:02,115 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:02,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:02,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:02,117 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:02,117 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:02,118 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:02,118 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:02,118 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:02,118 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:02,118 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:02,118 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:02,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:02,123 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:02,124 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:02,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:02,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:02,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:02,220 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:02,220 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 02:26:02,220 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:02,221 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 02:26:02,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:02,221 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:02,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2802 [2022-12-13 02:26:02,221 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:26:02,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:02,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1257672540, now seen corresponding path program 1 times [2022-12-13 02:26:02,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:02,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36574192] [2022-12-13 02:26:02,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:02,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:02,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:26:02,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:02,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36574192] [2022-12-13 02:26:02,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36574192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:02,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:02,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:02,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918084205] [2022-12-13 02:26:02,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:02,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:02,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:02,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:02,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:02,278 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:02,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:02,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:02,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:02,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:02,354 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:02,354 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:02,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:02,355 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:02,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:02,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:02,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:02,356 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:02,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:02,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:02,358 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:02,359 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:02,359 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:02,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:02,359 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:02,359 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:02,359 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:02,359 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:02,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:02,365 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:02,365 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:26:02,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:02,365 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:02,365 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:02,451 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:02,452 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:02,452 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:02,452 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 02:26:02,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:02,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:02,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2803 [2022-12-13 02:26:02,452 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:26:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:02,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1229043389, now seen corresponding path program 1 times [2022-12-13 02:26:02,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:02,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159898949] [2022-12-13 02:26:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:02,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:02,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:26:02,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:02,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159898949] [2022-12-13 02:26:02,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159898949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:02,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:02,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:02,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643336382] [2022-12-13 02:26:02,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:02,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:02,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:02,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:02,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:02,526 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:02,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:02,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:02,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:02,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:02,593 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:02,594 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:02,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:02,595 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:02,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:02,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:02,595 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:02,595 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:02,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:02,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:02,598 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:02,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:02,598 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:02,598 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:02,598 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:02,598 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:02,598 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:02,598 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:02,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:02,604 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:02,604 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:02,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:02,604 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:02,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:02,691 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:02,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:02,692 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:02,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:02,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:02,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:02,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2804 [2022-12-13 02:26:02,692 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:26:02,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:02,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1200414238, now seen corresponding path program 1 times [2022-12-13 02:26:02,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:02,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049259999] [2022-12-13 02:26:02,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:02,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:02,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:26:02,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:02,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049259999] [2022-12-13 02:26:02,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049259999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:02,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:02,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:02,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358815238] [2022-12-13 02:26:02,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:02,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:02,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:02,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:02,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:02,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:02,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:02,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:02,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:02,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:02,837 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:02,837 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:02,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:02,838 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:02,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:02,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:02,839 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:02,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:02,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:02,841 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:02,841 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:02,842 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:02,842 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:02,842 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:02,842 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:02,842 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:02,842 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:02,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:02,847 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:02,848 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:02,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:02,848 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:02,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:02,935 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:02,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:02,935 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:02,935 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 02:26:02,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:02,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:02,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2805 [2022-12-13 02:26:02,936 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:26:02,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1171785087, now seen corresponding path program 1 times [2022-12-13 02:26:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:02,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576236364] [2022-12-13 02:26:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:02,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:26:02,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:02,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576236364] [2022-12-13 02:26:02,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576236364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:02,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:02,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:02,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347392967] [2022-12-13 02:26:02,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:02,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:02,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:02,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:02,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:02,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:02,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:02,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:02,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:02,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:03,059 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:03,059 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:03,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:03,060 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:03,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:03,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:03,061 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:03,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:03,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:03,063 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,063 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:03,064 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:03,064 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:03,064 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:03,064 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:03,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:03,070 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:03,070 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:26:03,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:03,070 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:03,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:03,157 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:03,157 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:03,158 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:03,158 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 02:26:03,158 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:03,158 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:03,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2806 [2022-12-13 02:26:03,158 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:26:03,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1143155936, now seen corresponding path program 1 times [2022-12-13 02:26:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:03,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043761051] [2022-12-13 02:26:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:03,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:03,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:26:03,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:03,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043761051] [2022-12-13 02:26:03,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043761051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:03,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:03,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:03,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067956037] [2022-12-13 02:26:03,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:03,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:03,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:03,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:03,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:03,214 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:03,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:03,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:03,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:03,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:03,280 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:03,280 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:03,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:03,281 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:03,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:03,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:03,281 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:03,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:03,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:03,284 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,284 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:03,284 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:03,284 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:03,284 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,285 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:03,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:03,285 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:03,290 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:03,290 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:03,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:03,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:03,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:03,377 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:03,377 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:03,377 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:03,377 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 02:26:03,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:03,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:03,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2807 [2022-12-13 02:26:03,377 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:26:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1114526785, now seen corresponding path program 1 times [2022-12-13 02:26:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:03,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486528769] [2022-12-13 02:26:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:03,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:26:03,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:03,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486528769] [2022-12-13 02:26:03,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486528769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:03,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:03,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:03,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26712715] [2022-12-13 02:26:03,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:03,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:03,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:03,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:03,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:03,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:03,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:03,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:03,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:03,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:03,499 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:03,499 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:03,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:03,500 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:03,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:03,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:03,500 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:03,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:03,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:03,503 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,503 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:03,503 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:03,503 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:03,503 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,503 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:03,503 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:03,503 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:03,509 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:03,509 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:26:03,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:03,509 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:03,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:03,597 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:03,598 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:03,598 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:03,598 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 02:26:03,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:03,598 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:03,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2808 [2022-12-13 02:26:03,598 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:26:03,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:03,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1085897634, now seen corresponding path program 1 times [2022-12-13 02:26:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:03,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148612523] [2022-12-13 02:26:03,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:03,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:03,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 02:26:03,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:03,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148612523] [2022-12-13 02:26:03,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148612523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:03,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:03,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:03,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712101234] [2022-12-13 02:26:03,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:03,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:03,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:03,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:03,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:03,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:03,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:03,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:03,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:03,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:03,738 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:03,738 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:26:03,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:03,739 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:03,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:03,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:03,739 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:03,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:03,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:03,742 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:03,742 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:03,742 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:03,742 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,742 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:03,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:03,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:03,748 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:03,748 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:26:03,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:03,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:03,749 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:03,836 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:03,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:03,836 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:03,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:03,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:03,837 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:03,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2809 [2022-12-13 02:26:03,837 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:26:03,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1057268483, now seen corresponding path program 1 times [2022-12-13 02:26:03,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:03,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512356283] [2022-12-13 02:26:03,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:03,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:03,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:26:03,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:03,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512356283] [2022-12-13 02:26:03,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512356283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:03,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:03,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:03,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746395857] [2022-12-13 02:26:03,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:03,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:03,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:03,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:03,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:03,914 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:03,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:03,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:03,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:03,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:03,979 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:03,979 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:03,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:03,980 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:03,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:03,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:03,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:03,981 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:03,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:03,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:03,983 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,983 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:03,983 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:03,983 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:03,983 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,983 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:03,983 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:03,984 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:03,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:03,989 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:03,989 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:03,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:03,990 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:03,990 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:04,077 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:04,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:04,078 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:04,078 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 02:26:04,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:04,078 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:04,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2810 [2022-12-13 02:26:04,078 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:26:04,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1028639332, now seen corresponding path program 1 times [2022-12-13 02:26:04,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:04,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597077584] [2022-12-13 02:26:04,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:04,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:04,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:26:04,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:04,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597077584] [2022-12-13 02:26:04,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597077584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:04,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:04,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:04,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622407007] [2022-12-13 02:26:04,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:04,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:04,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:04,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:04,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:04,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:04,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:04,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:04,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:04,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:04,226 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:04,226 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:04,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:04,228 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:04,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:04,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:04,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:04,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:04,228 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:04,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:04,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:04,230 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:04,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:04,231 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:04,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:04,231 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:04,231 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:04,231 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:04,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:04,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:04,237 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:04,237 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:04,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:04,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:04,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:04,324 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:04,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:04,324 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:04,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:04,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:04,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:04,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2811 [2022-12-13 02:26:04,325 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:26:04,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:04,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1000010181, now seen corresponding path program 1 times [2022-12-13 02:26:04,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:04,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322845597] [2022-12-13 02:26:04,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:04,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:04,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:26:04,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:04,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322845597] [2022-12-13 02:26:04,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322845597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:04,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:04,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:04,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908682905] [2022-12-13 02:26:04,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:04,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:04,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:04,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:04,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:04,381 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:04,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:04,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:04,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:04,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:04,453 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:04,453 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:04,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:04,454 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:04,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:04,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:04,455 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:04,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:04,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:04,457 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:04,457 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:04,458 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:04,458 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:04,458 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:04,458 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:04,458 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:04,458 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:04,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:04,463 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:04,463 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:26:04,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:04,464 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:04,464 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:04,550 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:04,550 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:26:04,551 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:04,551 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 02:26:04,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:04,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:04,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2812 [2022-12-13 02:26:04,551 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:26:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:04,551 INFO L85 PathProgramCache]: Analyzing trace with hash -971381030, now seen corresponding path program 1 times [2022-12-13 02:26:04,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:04,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444477064] [2022-12-13 02:26:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:04,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:04,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:26:04,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:04,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444477064] [2022-12-13 02:26:04,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444477064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:04,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:04,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:04,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960663428] [2022-12-13 02:26:04,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:04,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:04,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:04,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:04,624 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:04,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:04,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:04,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:04,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:04,709 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:04,709 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:04,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:04,710 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:04,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:04,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:04,711 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:04,711 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:04,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:04,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:04,713 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:04,713 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:04,713 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:04,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:04,714 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:04,714 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:04,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:04,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:04,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:04,719 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:04,719 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:04,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:04,720 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:04,720 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:04,808 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:04,808 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:04,808 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:04,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:04,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:04,808 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:04,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2813 [2022-12-13 02:26:04,808 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:26:04,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:04,809 INFO L85 PathProgramCache]: Analyzing trace with hash -942751879, now seen corresponding path program 1 times [2022-12-13 02:26:04,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:04,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513983267] [2022-12-13 02:26:04,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:04,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:04,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:26:04,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:04,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513983267] [2022-12-13 02:26:04,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513983267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:04,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:04,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:04,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927889189] [2022-12-13 02:26:04,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:04,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:04,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:04,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:04,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:04,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:04,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:04,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:04,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:04,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:04,949 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:04,949 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:04,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1119 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:04,951 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:04,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:04,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:04,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:04,951 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:04,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:04,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:04,954 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:04,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:04,954 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:04,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:04,954 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:04,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:04,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:04,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:04,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:04,960 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:04,960 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:26:04,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:04,961 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:04,961 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:05,048 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:05,049 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:05,049 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:05,049 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 02:26:05,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:05,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:05,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2814 [2022-12-13 02:26:05,049 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:26:05,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:05,049 INFO L85 PathProgramCache]: Analyzing trace with hash -914122728, now seen corresponding path program 1 times [2022-12-13 02:26:05,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:05,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721399294] [2022-12-13 02:26:05,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:05,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:05,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 02:26:05,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:05,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721399294] [2022-12-13 02:26:05,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721399294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:05,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:05,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:05,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362063583] [2022-12-13 02:26:05,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:05,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:05,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:05,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:05,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:05,128 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:05,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:05,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:05,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:05,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:05,200 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:05,200 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:26:05,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:05,201 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:05,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:05,201 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:05,201 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:05,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:05,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:05,204 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:05,204 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:05,204 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:05,204 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:05,204 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:05,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:05,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:05,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:05,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:05,210 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:05,210 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:26:05,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:05,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:05,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:05,297 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:05,297 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:05,297 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:05,297 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 02:26:05,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:05,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:05,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2815 [2022-12-13 02:26:05,298 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:26:05,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:05,298 INFO L85 PathProgramCache]: Analyzing trace with hash -885493577, now seen corresponding path program 1 times [2022-12-13 02:26:05,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:05,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276640786] [2022-12-13 02:26:05,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:05,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:05,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:26:05,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:05,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276640786] [2022-12-13 02:26:05,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276640786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:05,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:05,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:05,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666314535] [2022-12-13 02:26:05,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:05,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:05,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:05,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:05,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:05,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:05,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:05,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:05,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:05,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:05,422 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:05,422 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:05,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:05,423 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:05,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:05,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:05,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:05,424 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:05,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:05,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:05,426 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:05,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:05,426 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:05,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:05,427 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:05,427 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:05,427 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:05,427 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:05,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:05,432 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:05,433 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:05,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:05,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:05,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:05,520 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:05,521 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:05,521 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:05,521 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 02:26:05,521 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:05,521 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:05,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2816 [2022-12-13 02:26:05,521 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:26:05,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:05,521 INFO L85 PathProgramCache]: Analyzing trace with hash -856864426, now seen corresponding path program 1 times [2022-12-13 02:26:05,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:05,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470193046] [2022-12-13 02:26:05,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:05,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:05,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:26:05,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:05,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470193046] [2022-12-13 02:26:05,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470193046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:05,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:05,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:05,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833146840] [2022-12-13 02:26:05,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:05,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:05,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:05,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:05,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:05,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:05,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:05,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:05,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:05,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:05,644 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:05,645 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:05,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:05,646 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:05,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:05,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:05,646 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:05,646 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:05,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:05,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:05,649 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:05,649 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:05,649 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:05,649 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:05,649 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:05,649 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:05,649 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:05,650 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:05,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:05,655 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:05,655 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:05,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:05,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:05,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:05,742 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:05,743 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:05,743 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:05,743 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 02:26:05,743 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:05,743 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:05,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2817 [2022-12-13 02:26:05,743 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:26:05,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash -828235275, now seen corresponding path program 1 times [2022-12-13 02:26:05,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:05,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661022402] [2022-12-13 02:26:05,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:05,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:05,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:26:05,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:05,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661022402] [2022-12-13 02:26:05,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661022402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:05,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:05,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:05,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710624082] [2022-12-13 02:26:05,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:05,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:05,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:05,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:05,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:05,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:05,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:05,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:05,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:05,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:05,893 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:05,893 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:05,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:05,895 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:05,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:05,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:05,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:05,895 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:05,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:05,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:05,898 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:05,898 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:05,898 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:05,898 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:05,898 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:05,898 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:05,898 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:05,898 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:05,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:05,904 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:05,904 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:26:05,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:05,904 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:05,904 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:05,994 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:05,995 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:26:05,995 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:05,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:05,995 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:05,995 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:05,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2818 [2022-12-13 02:26:05,995 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:26:05,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:05,995 INFO L85 PathProgramCache]: Analyzing trace with hash -799606124, now seen corresponding path program 1 times [2022-12-13 02:26:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:05,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187864779] [2022-12-13 02:26:05,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:05,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:06,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:26:06,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:06,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187864779] [2022-12-13 02:26:06,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187864779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:06,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:06,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:06,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633772199] [2022-12-13 02:26:06,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:06,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:06,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:06,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:06,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:06,071 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:06,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:06,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:06,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:06,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:06,150 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:06,150 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:06,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:06,151 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:06,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:06,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:06,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:06,152 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:06,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:06,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:06,154 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:06,154 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:06,155 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:06,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:06,155 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:06,155 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:06,155 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:06,155 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:06,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:06,160 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:06,160 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:06,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:06,161 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:06,161 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:06,248 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:06,249 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:06,249 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:06,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:06,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:06,249 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:06,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2819 [2022-12-13 02:26:06,249 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:26:06,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:06,249 INFO L85 PathProgramCache]: Analyzing trace with hash -770976973, now seen corresponding path program 1 times [2022-12-13 02:26:06,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:06,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875859784] [2022-12-13 02:26:06,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:06,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:06,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:26:06,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:06,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875859784] [2022-12-13 02:26:06,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875859784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:06,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:06,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:06,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713101870] [2022-12-13 02:26:06,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:06,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:06,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:06,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:06,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:06,312 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:06,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:06,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:06,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:06,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:06,388 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:06,388 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:06,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:06,389 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:06,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:06,389 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:06,389 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:06,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:06,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:06,392 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:06,392 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:06,392 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:06,392 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:06,392 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:06,392 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:06,393 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:06,393 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:06,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:06,398 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:06,398 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:26:06,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:06,399 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:06,399 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:06,486 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:06,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:06,486 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:06,486 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 02:26:06,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:06,486 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:06,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2820 [2022-12-13 02:26:06,486 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:26:06,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:06,487 INFO L85 PathProgramCache]: Analyzing trace with hash -742347822, now seen corresponding path program 1 times [2022-12-13 02:26:06,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:06,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171458862] [2022-12-13 02:26:06,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:06,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:06,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 02:26:06,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:06,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171458862] [2022-12-13 02:26:06,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171458862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:06,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:06,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561372128] [2022-12-13 02:26:06,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:06,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:06,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:06,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:06,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:06,543 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:06,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:06,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:06,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:06,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:06,610 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:06,610 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:06,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:06,611 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:06,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:06,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:06,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:06,612 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:06,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:06,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:06,614 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:06,614 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:06,615 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:06,615 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:06,615 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:06,615 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:06,615 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:06,615 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:06,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:06,620 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:06,621 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:26:06,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:06,621 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:06,621 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:06,711 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:06,711 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:06,711 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:06,711 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 02:26:06,711 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:06,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:06,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2821 [2022-12-13 02:26:06,711 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:26:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:06,712 INFO L85 PathProgramCache]: Analyzing trace with hash -713718671, now seen corresponding path program 1 times [2022-12-13 02:26:06,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:06,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982844879] [2022-12-13 02:26:06,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:06,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:06,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:26:06,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:06,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982844879] [2022-12-13 02:26:06,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982844879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:06,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:06,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:06,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453344405] [2022-12-13 02:26:06,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:06,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:06,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:06,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:06,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:06,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:06,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:06,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:06,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:06,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:06,870 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:06,870 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:26:06,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:06,871 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:06,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:06,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:06,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:06,872 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:06,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:06,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:06,874 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:06,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:06,875 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:06,875 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:06,875 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:06,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:06,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:06,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:06,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:06,881 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:06,881 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:26:06,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 445 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:06,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:06,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:06,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:06,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:06,970 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:06,970 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 02:26:06,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:06,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:06,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2822 [2022-12-13 02:26:06,970 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:26:06,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:06,971 INFO L85 PathProgramCache]: Analyzing trace with hash -685089520, now seen corresponding path program 1 times [2022-12-13 02:26:06,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:06,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454338947] [2022-12-13 02:26:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:06,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:07,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 02:26:07,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:07,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454338947] [2022-12-13 02:26:07,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454338947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:07,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:07,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:07,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101708861] [2022-12-13 02:26:07,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:07,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:07,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:07,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:07,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:07,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:07,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:07,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:07,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:07,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:07,095 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:07,095 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:07,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:07,096 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:07,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:07,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:07,097 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:07,097 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:07,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:07,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:07,100 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:07,100 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:07,100 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:07,100 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:07,100 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:07,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:07,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:07,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:07,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:07,106 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:07,106 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:07,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:07,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:07,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:07,194 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:07,195 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:07,195 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:07,195 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 02:26:07,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:07,195 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:07,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2823 [2022-12-13 02:26:07,195 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:26:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash -656460369, now seen corresponding path program 1 times [2022-12-13 02:26:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:07,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320737482] [2022-12-13 02:26:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:07,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:07,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:26:07,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:07,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320737482] [2022-12-13 02:26:07,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320737482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:07,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:07,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:07,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744557241] [2022-12-13 02:26:07,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:07,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:07,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:07,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:07,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:07,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:07,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:07,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:07,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:07,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:07,330 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:07,330 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:07,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:07,331 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:07,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:07,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:07,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:07,332 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:07,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:07,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:07,335 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:07,335 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:07,335 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:07,335 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:07,335 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:07,335 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:07,335 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:07,335 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:07,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:07,341 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:07,341 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:07,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:07,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:07,342 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:07,429 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:07,430 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:07,430 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:07,430 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 02:26:07,430 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:07,430 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:07,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2824 [2022-12-13 02:26:07,430 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:26:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:07,430 INFO L85 PathProgramCache]: Analyzing trace with hash -627831218, now seen corresponding path program 1 times [2022-12-13 02:26:07,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:07,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255343309] [2022-12-13 02:26:07,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:07,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:07,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:26:07,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:07,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255343309] [2022-12-13 02:26:07,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255343309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:07,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:07,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:07,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823121823] [2022-12-13 02:26:07,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:07,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:07,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:07,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:07,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:07,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:07,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:07,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:07,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:07,587 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:07,588 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:07,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:07,589 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:07,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:07,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:07,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:07,589 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:07,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:07,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:07,592 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:07,592 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:07,592 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:07,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:07,592 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:07,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:07,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:07,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:07,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:07,598 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:07,598 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:26:07,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:07,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:07,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:07,686 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:07,687 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:07,687 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:07,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:07,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:07,687 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:07,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2825 [2022-12-13 02:26:07,687 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:26:07,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:07,687 INFO L85 PathProgramCache]: Analyzing trace with hash -599202067, now seen corresponding path program 1 times [2022-12-13 02:26:07,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:07,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628035637] [2022-12-13 02:26:07,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:07,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:07,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:26:07,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:07,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628035637] [2022-12-13 02:26:07,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628035637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:07,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:07,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118107337] [2022-12-13 02:26:07,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:07,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:07,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:07,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:07,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:07,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:07,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:07,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:07,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:07,808 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:07,808 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:26:07,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:07,809 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:07,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:07,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:07,810 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:07,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:07,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:07,812 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:07,812 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:07,812 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:07,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:07,812 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:07,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:07,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:07,813 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:07,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:07,818 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:07,818 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:26:07,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:07,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:07,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:07,905 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:07,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:07,905 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:07,905 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 02:26:07,906 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:07,906 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:07,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2826 [2022-12-13 02:26:07,906 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:26:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash -570572916, now seen corresponding path program 1 times [2022-12-13 02:26:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:07,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367950425] [2022-12-13 02:26:07,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:07,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26: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:26:07,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:07,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367950425] [2022-12-13 02:26:07,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367950425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:07,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:07,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:07,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092639490] [2022-12-13 02:26:07,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:07,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:07,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:07,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:07,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:07,961 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:07,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:07,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:07,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:07,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:08,028 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:08,028 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:08,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:08,029 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:08,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:08,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:08,029 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:08,030 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:08,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:08,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:08,032 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:08,032 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:08,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:08,032 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,033 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:08,033 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:08,033 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:08,038 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:08,038 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:26:08,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:08,039 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:08,039 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:08,127 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:08,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:08,127 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:08,127 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 02:26:08,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:08,128 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:08,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2827 [2022-12-13 02:26:08,128 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:26:08,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:08,128 INFO L85 PathProgramCache]: Analyzing trace with hash -541943765, now seen corresponding path program 1 times [2022-12-13 02:26:08,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:08,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576379310] [2022-12-13 02:26:08,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:08,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:08,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:26:08,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:08,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576379310] [2022-12-13 02:26:08,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576379310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:08,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:08,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:08,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701690395] [2022-12-13 02:26:08,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:08,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:08,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:08,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:08,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:08,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:08,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:08,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:08,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:08,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:08,261 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:08,261 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:08,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:08,262 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:08,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:08,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:08,263 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:08,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:08,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:08,265 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,265 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:08,265 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:08,265 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:08,265 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,266 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:08,266 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:08,266 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:08,271 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:08,271 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:08,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:08,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:08,272 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:08,359 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:08,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:08,360 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:08,360 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 02:26:08,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:08,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:08,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2828 [2022-12-13 02:26:08,360 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:26:08,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:08,360 INFO L85 PathProgramCache]: Analyzing trace with hash -513314614, now seen corresponding path program 1 times [2022-12-13 02:26:08,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:08,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836885969] [2022-12-13 02:26:08,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:08,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:08,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:26:08,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:08,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836885969] [2022-12-13 02:26:08,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836885969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:08,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:08,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67252606] [2022-12-13 02:26:08,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:08,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:08,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:08,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:08,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:08,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:08,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:08,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:08,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:08,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:08,491 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:08,491 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:08,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1128 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:08,492 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:08,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:08,493 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:08,493 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:08,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:08,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:08,495 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,495 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:08,495 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:08,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:08,496 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,496 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:08,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:08,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:08,501 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:08,501 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:26:08,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:08,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:08,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:08,589 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:08,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:08,589 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:08,589 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 02:26:08,590 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:08,590 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:08,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2829 [2022-12-13 02:26:08,590 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:26:08,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash -484685463, now seen corresponding path program 1 times [2022-12-13 02:26:08,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:08,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319335032] [2022-12-13 02:26:08,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:08,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:08,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:26:08,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:08,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319335032] [2022-12-13 02:26:08,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319335032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:08,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:08,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:08,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114207812] [2022-12-13 02:26:08,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:08,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:08,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:08,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:08,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:08,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:08,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:08,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:08,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:08,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:08,739 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:08,739 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:08,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:08,740 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:08,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:08,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:08,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:08,741 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:08,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:08,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:08,743 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:08,744 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:08,744 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:08,744 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:08,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:08,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:08,750 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:08,750 INFO L131 PetriNetUnfolder]: For 432/450 co-relation queries the response was YES. [2022-12-13 02:26:08,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/450 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:08,750 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:08,750 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:08,837 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:08,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:08,838 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:08,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:08,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:08,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:08,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2830 [2022-12-13 02:26:08,838 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:26:08,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:08,838 INFO L85 PathProgramCache]: Analyzing trace with hash -456056312, now seen corresponding path program 1 times [2022-12-13 02:26:08,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:08,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962286188] [2022-12-13 02:26:08,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:08,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:08,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:26:08,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:08,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962286188] [2022-12-13 02:26:08,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962286188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:08,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:08,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:08,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237970132] [2022-12-13 02:26:08,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:08,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:08,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:08,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:08,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:08,895 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:08,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:08,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:08,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:08,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:08,970 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:08,971 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:08,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:08,972 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:08,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:08,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:08,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:08,972 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:08,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:08,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:08,975 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,975 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:08,975 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:08,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:08,975 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:08,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:08,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:08,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:08,981 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:08,981 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:08,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:08,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:08,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:09,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:09,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:09,070 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:09,070 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 02:26:09,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:09,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:09,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2831 [2022-12-13 02:26:09,070 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:26:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:09,071 INFO L85 PathProgramCache]: Analyzing trace with hash -427427161, now seen corresponding path program 1 times [2022-12-13 02:26:09,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:09,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772447446] [2022-12-13 02:26:09,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:09,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:09,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:26:09,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:09,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772447446] [2022-12-13 02:26:09,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772447446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:09,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:09,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:09,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426834103] [2022-12-13 02:26:09,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:09,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:09,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:09,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:09,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:09,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:09,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:09,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:09,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:09,192 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:09,193 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:09,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:09,194 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:09,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:09,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:09,194 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:09,194 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:09,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:09,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:09,197 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:09,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:09,197 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:09,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:09,197 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:09,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:09,197 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:09,197 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:09,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:09,203 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:09,203 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:09,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:09,203 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:09,203 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:09,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:09,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:09,292 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:09,292 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 02:26:09,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:09,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:09,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2832 [2022-12-13 02:26:09,292 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:26:09,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:09,292 INFO L85 PathProgramCache]: Analyzing trace with hash -398798010, now seen corresponding path program 1 times [2022-12-13 02:26:09,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:09,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011291081] [2022-12-13 02:26:09,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:09,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:09,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:26:09,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:09,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011291081] [2022-12-13 02:26:09,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011291081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:09,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:09,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:09,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582581678] [2022-12-13 02:26:09,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:09,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:09,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:09,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:09,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:09,346 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:09,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:09,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:09,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:09,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:09,410 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:09,410 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:09,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:09,411 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:09,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:09,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:09,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:09,412 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:09,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:09,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:09,415 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:09,415 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:09,415 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:09,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:09,415 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:09,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:09,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:09,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:09,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:09,421 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:09,421 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:09,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:09,421 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:09,421 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:09,509 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:09,509 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:09,509 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:09,509 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 02:26:09,509 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:09,509 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:09,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2833 [2022-12-13 02:26:09,509 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:26:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash -370168859, now seen corresponding path program 1 times [2022-12-13 02:26:09,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:09,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209340741] [2022-12-13 02:26:09,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:09,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:09,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 02:26:09,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:09,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209340741] [2022-12-13 02:26:09,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209340741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:09,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:09,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:09,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386385840] [2022-12-13 02:26:09,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:09,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:09,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:09,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:09,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:09,567 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:09,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:09,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:09,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:09,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:09,641 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:09,641 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:09,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:09,643 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:09,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:09,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:09,644 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:09,644 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:09,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:09,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:09,646 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:09,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:09,647 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:09,647 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:09,647 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:09,647 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:09,647 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:09,647 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:09,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:09,652 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:09,653 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:26:09,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:09,653 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:09,653 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:09,752 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:09,752 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:26:09,752 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:09,752 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 02:26:09,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:09,752 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:09,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2834 [2022-12-13 02:26:09,752 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:26:09,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -341539708, now seen corresponding path program 1 times [2022-12-13 02:26:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:09,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171498115] [2022-12-13 02:26:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:09,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:09,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171498115] [2022-12-13 02:26:09,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171498115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:09,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:09,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:09,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499976046] [2022-12-13 02:26:09,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:09,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:09,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:09,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:09,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:09,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:09,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:09,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:09,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:09,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:09,898 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:09,899 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:09,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:09,900 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:09,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:09,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:09,900 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:09,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:09,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:09,903 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:09,903 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:09,903 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:09,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:09,903 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:09,903 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:09,903 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:09,903 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:09,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:09,909 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:09,909 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:09,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:09,909 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:09,909 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:09,997 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:09,997 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:09,997 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:09,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:09,997 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:09,997 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:09,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2835 [2022-12-13 02:26:09,997 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:26:09,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:09,998 INFO L85 PathProgramCache]: Analyzing trace with hash -312910557, now seen corresponding path program 1 times [2022-12-13 02:26:09,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:09,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570730631] [2022-12-13 02:26:09,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:09,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:10,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:26:10,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:10,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570730631] [2022-12-13 02:26:10,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570730631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:10,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:10,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:10,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220703647] [2022-12-13 02:26:10,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:10,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:10,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:10,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:10,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:10,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:10,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:10,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:10,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:10,144 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:10,144 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:10,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:10,145 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:10,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:10,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:10,146 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:10,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:10,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:10,149 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:10,149 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:10,149 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:10,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:10,149 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:10,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:10,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:10,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:10,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:10,155 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:10,155 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:10,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:10,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:10,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:10,254 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:10,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:26:10,254 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:10,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:10,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:10,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:10,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2836 [2022-12-13 02:26:10,255 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:26:10,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash -284281406, now seen corresponding path program 1 times [2022-12-13 02:26:10,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:10,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582998683] [2022-12-13 02:26:10,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:10,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26: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:26:10,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:10,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582998683] [2022-12-13 02:26:10,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582998683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:10,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:10,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:10,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767542716] [2022-12-13 02:26:10,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:10,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:10,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:10,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:10,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:10,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:10,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:10,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:10,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:10,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:10,386 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:10,386 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:10,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:10,387 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:10,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:10,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:10,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:10,388 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:10,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:10,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:10,390 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:10,391 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:10,391 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:10,391 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:10,391 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:10,391 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:10,391 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:10,391 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:10,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:10,397 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:10,397 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:10,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:10,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:10,397 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:10,485 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:10,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:10,486 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:10,486 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 02:26:10,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:10,486 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:10,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2837 [2022-12-13 02:26:10,486 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:26:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash -255652255, now seen corresponding path program 1 times [2022-12-13 02:26:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:10,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075413302] [2022-12-13 02:26:10,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:10,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:10,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:26:10,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:10,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075413302] [2022-12-13 02:26:10,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075413302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:10,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:10,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:10,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124567690] [2022-12-13 02:26:10,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:10,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:10,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:10,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:10,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:10,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:10,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:10,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:10,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:10,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:10,616 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:10,617 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:10,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:10,618 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:10,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:10,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:10,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:10,618 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:10,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:10,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:10,620 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:10,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:10,621 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:10,621 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:10,621 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:10,621 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:10,621 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:10,621 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:10,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:10,626 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:10,627 INFO L131 PetriNetUnfolder]: For 434/452 co-relation queries the response was YES. [2022-12-13 02:26:10,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/452 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:10,627 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:10,627 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:10,715 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:10,715 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:10,715 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:10,716 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 02:26:10,716 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:10,716 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:10,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2838 [2022-12-13 02:26:10,716 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:26:10,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:10,716 INFO L85 PathProgramCache]: Analyzing trace with hash -227023104, now seen corresponding path program 1 times [2022-12-13 02:26:10,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:10,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345164267] [2022-12-13 02:26:10,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:10,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:10,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:26:10,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:10,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345164267] [2022-12-13 02:26:10,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345164267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:10,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:10,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:10,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424772916] [2022-12-13 02:26:10,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:10,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:10,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:10,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:10,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:10,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:10,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:10,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:10,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:10,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:10,850 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:10,850 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:10,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:10,852 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:10,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:10,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:10,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:10,852 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:10,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:10,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:10,867 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:10,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:10,867 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:10,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:10,867 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:10,867 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:10,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:10,867 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:10,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:10,873 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:10,873 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:26:10,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:10,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:10,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:10,964 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:10,965 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:26:10,965 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:10,965 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 02:26:10,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:10,965 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:10,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2839 [2022-12-13 02:26:10,965 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:26:10,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:10,966 INFO L85 PathProgramCache]: Analyzing trace with hash -198393953, now seen corresponding path program 1 times [2022-12-13 02:26:10,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:10,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915361969] [2022-12-13 02:26:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:11,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:26:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:11,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915361969] [2022-12-13 02:26:11,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915361969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:11,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:11,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828606964] [2022-12-13 02:26:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:11,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:11,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:11,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:11,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:11,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:11,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:11,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:11,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:11,100 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:11,100 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:11,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1100 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:11,101 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:11,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:11,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:11,102 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:11,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:11,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:11,104 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:11,104 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:11,105 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:11,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:11,105 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:11,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:11,105 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:11,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:11,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:11,110 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:11,111 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:11,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:11,111 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:11,111 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:11,198 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:11,198 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:11,199 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:11,199 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 02:26:11,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:11,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:11,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2840 [2022-12-13 02:26:11,199 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:26:11,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:11,199 INFO L85 PathProgramCache]: Analyzing trace with hash -169764802, now seen corresponding path program 1 times [2022-12-13 02:26:11,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:11,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364430670] [2022-12-13 02:26:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:11,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:11,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:26:11,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:11,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364430670] [2022-12-13 02:26:11,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364430670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:11,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:11,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:11,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426950842] [2022-12-13 02:26:11,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:11,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:11,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:11,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:11,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:11,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:11,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:11,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:11,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:11,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:11,346 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:11,346 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:11,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:11,347 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:11,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:11,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:11,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:11,348 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:11,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:11,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:11,351 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:11,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:11,351 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:11,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:11,351 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:11,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:11,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:11,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:11,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:11,357 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:11,357 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:26:11,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:11,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:11,357 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:11,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:11,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:11,445 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:11,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:11,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:11,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:11,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2841 [2022-12-13 02:26:11,446 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:26:11,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:11,446 INFO L85 PathProgramCache]: Analyzing trace with hash -141135651, now seen corresponding path program 1 times [2022-12-13 02:26:11,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:11,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105457972] [2022-12-13 02:26:11,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:11,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:11,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 02:26:11,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:11,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105457972] [2022-12-13 02:26:11,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105457972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:11,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:11,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:11,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348627685] [2022-12-13 02:26:11,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:11,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:11,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:11,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:11,518 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:11,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:11,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:11,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:11,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:11,596 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:11,596 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:11,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:11,597 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:11,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:11,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:11,598 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:11,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:11,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:11,601 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:11,601 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:11,601 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:11,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:11,601 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:11,601 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:11,601 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:11,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:11,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:11,607 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:11,607 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:11,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:11,607 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:11,608 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:11,695 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:11,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:11,696 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:11,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:11,696 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:11,696 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:11,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2842 [2022-12-13 02:26:11,696 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:26:11,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash -112506500, now seen corresponding path program 1 times [2022-12-13 02:26:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:11,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784904125] [2022-12-13 02:26:11,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:11,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:11,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:26:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:11,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784904125] [2022-12-13 02:26:11,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784904125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:11,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:11,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289246877] [2022-12-13 02:26:11,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:11,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:11,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:11,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:11,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:11,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:11,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:11,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:11,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:11,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:11,829 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:11,830 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:11,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:11,831 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:11,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:11,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:11,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:11,831 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:11,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:11,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:11,834 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:11,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:11,834 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:11,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:11,834 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:11,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:11,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:11,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:11,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:11,840 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:11,840 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:11,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:11,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:11,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:11,932 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:11,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:26:11,932 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:11,932 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 02:26:11,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:11,932 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:11,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2843 [2022-12-13 02:26:11,932 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:26:11,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:11,933 INFO L85 PathProgramCache]: Analyzing trace with hash -83877349, now seen corresponding path program 1 times [2022-12-13 02:26:11,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:11,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908806707] [2022-12-13 02:26:11,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:11,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:11,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:26:11,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:11,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908806707] [2022-12-13 02:26:11,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908806707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:11,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:11,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:11,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817869425] [2022-12-13 02:26:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:11,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:11,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:11,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:11,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:11,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:11,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:11,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:11,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:12,066 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:12,066 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:12,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:12,067 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:12,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:12,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:12,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:12,067 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:12,067 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:12,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:12,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:12,070 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,070 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:12,070 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:12,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:12,070 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:12,071 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:12,071 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:12,076 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:12,076 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:12,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:12,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:12,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:12,165 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:12,165 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:12,165 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:12,165 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 02:26:12,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:12,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:12,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2844 [2022-12-13 02:26:12,165 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:26:12,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash -55248198, now seen corresponding path program 1 times [2022-12-13 02:26:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:12,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324150702] [2022-12-13 02:26:12,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:12,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:26:12,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:12,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324150702] [2022-12-13 02:26:12,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324150702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:12,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:12,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:12,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064900302] [2022-12-13 02:26:12,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:12,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:12,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:12,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:12,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:12,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:12,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:12,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:12,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:12,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:12,291 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:12,291 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:12,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:12,292 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:12,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:12,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:12,293 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:12,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:12,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:12,295 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:12,295 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:12,295 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:12,295 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,296 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:12,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:12,296 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:12,301 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:12,301 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:26:12,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:12,302 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:12,302 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:12,389 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:12,389 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:12,389 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:12,389 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 02:26:12,389 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:12,389 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:12,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2845 [2022-12-13 02:26:12,389 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:26:12,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:12,390 INFO L85 PathProgramCache]: Analyzing trace with hash -26619047, now seen corresponding path program 1 times [2022-12-13 02:26:12,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:12,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763035697] [2022-12-13 02:26:12,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:12,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:26:12,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:12,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763035697] [2022-12-13 02:26:12,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763035697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:12,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:12,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622208094] [2022-12-13 02:26:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:12,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:12,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:12,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:12,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:12,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:12,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:12,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:12,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:12,537 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:12,538 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:12,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:12,539 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:12,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:12,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:12,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:12,539 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:12,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:12,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:12,542 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:12,542 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:12,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:12,543 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:12,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:12,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:12,548 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:12,549 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:12,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:12,549 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:12,549 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:12,637 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:12,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:12,638 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:12,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:12,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:12,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:12,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2846 [2022-12-13 02:26:12,638 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:26:12,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2010104, now seen corresponding path program 1 times [2022-12-13 02:26:12,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:12,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662636397] [2022-12-13 02:26:12,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:12,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:26:12,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:12,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662636397] [2022-12-13 02:26:12,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662636397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:12,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:12,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050564281] [2022-12-13 02:26:12,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:12,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:12,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:12,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:12,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:12,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:12,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:12,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:12,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:12,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:12,761 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:12,762 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:12,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:12,763 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:12,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:12,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:12,763 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:12,763 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:12,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:12,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:12,766 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,766 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:12,766 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:12,766 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:12,766 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,766 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:12,767 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:12,767 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:12,772 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:12,772 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:12,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:12,773 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:12,773 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:12,861 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:12,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:12,862 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:12,862 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 02:26:12,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:12,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:12,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2847 [2022-12-13 02:26:12,862 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:26:12,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:12,862 INFO L85 PathProgramCache]: Analyzing trace with hash 30639255, now seen corresponding path program 1 times [2022-12-13 02:26:12,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:12,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103742824] [2022-12-13 02:26:12,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:12,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:26:12,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:12,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103742824] [2022-12-13 02:26:12,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103742824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:12,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:12,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:12,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704708863] [2022-12-13 02:26:12,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:12,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:12,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:12,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:12,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:12,918 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:12,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:12,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:12,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:12,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:12,995 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:12,995 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:12,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:12,996 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:12,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:12,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:12,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:12,996 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:12,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:12,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:12,999 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,999 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:12,999 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:12,999 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:12,999 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:12,999 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:12,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:13,000 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:13,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:13,005 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:13,005 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:13,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:13,006 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:13,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:13,096 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:13,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:26:13,097 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:13,097 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 02:26:13,097 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:13,097 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:13,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2848 [2022-12-13 02:26:13,097 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:26:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:13,097 INFO L85 PathProgramCache]: Analyzing trace with hash 59268406, now seen corresponding path program 1 times [2022-12-13 02:26:13,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:13,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769174485] [2022-12-13 02:26:13,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:13,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:13,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:26:13,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:13,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769174485] [2022-12-13 02:26:13,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769174485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:13,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:13,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766733036] [2022-12-13 02:26:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:13,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:13,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:13,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:13,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:13,185 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:13,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:13,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:13,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:13,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:13,271 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:13,271 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:13,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:13,272 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:13,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:13,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:13,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:13,272 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:13,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:13,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:13,275 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:13,275 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:13,275 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:13,275 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:13,275 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:13,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:13,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:13,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:13,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:13,281 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:13,281 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:13,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:13,282 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:13,282 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:13,373 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:13,374 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 02:26:13,374 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:13,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:13,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:13,374 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:13,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2849 [2022-12-13 02:26:13,374 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:26:13,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:13,374 INFO L85 PathProgramCache]: Analyzing trace with hash 87897557, now seen corresponding path program 1 times [2022-12-13 02:26:13,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:13,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923214035] [2022-12-13 02:26:13,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:13,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:13,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:26:13,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:13,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923214035] [2022-12-13 02:26:13,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923214035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:13,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:13,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:13,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390176274] [2022-12-13 02:26:13,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:13,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:13,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:13,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:13,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:13,432 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:13,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:13,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:13,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:13,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:13,498 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:13,498 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:13,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:13,499 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:13,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:13,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:13,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:13,500 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:13,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:13,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:13,502 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:13,502 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:13,503 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:13,503 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:13,503 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:13,503 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:13,503 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:13,503 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:13,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:13,509 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:13,509 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:13,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:13,509 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:13,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:13,597 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:13,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:13,597 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:13,597 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 02:26:13,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:13,598 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:13,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2850 [2022-12-13 02:26:13,598 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:26:13,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:13,598 INFO L85 PathProgramCache]: Analyzing trace with hash 116526708, now seen corresponding path program 1 times [2022-12-13 02:26:13,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:13,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95653634] [2022-12-13 02:26:13,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:13,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:13,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:26:13,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:13,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95653634] [2022-12-13 02:26:13,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95653634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:13,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:13,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:13,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647043917] [2022-12-13 02:26:13,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:13,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:13,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:13,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:13,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:13,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:13,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:13,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:13,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:13,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:13,753 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:13,753 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:13,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:13,754 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:13,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:13,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:13,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:13,755 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:13,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:13,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:13,757 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:13,757 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:13,758 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:13,758 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:13,758 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:13,758 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:13,758 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:13,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:13,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:13,763 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:13,763 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:13,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:13,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:13,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:13,850 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:13,851 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:13,851 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:13,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:13,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:13,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:13,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2851 [2022-12-13 02:26:13,851 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:26:13,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash 145155859, now seen corresponding path program 1 times [2022-12-13 02:26:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:13,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093036059] [2022-12-13 02:26:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:13,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:26:13,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:13,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093036059] [2022-12-13 02:26:13,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093036059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:13,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:13,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:13,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832028708] [2022-12-13 02:26:13,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:13,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:13,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:13,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:13,909 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:13,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:13,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:13,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:13,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:13,984 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:13,985 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:13,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1124 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:13,986 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:13,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:13,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:13,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:13,986 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:13,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:13,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:13,988 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:13,989 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:13,989 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:13,989 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:13,989 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:13,989 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:13,989 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:13,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:13,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:13,994 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:13,995 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:26:13,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:13,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:13,995 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:14,081 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:14,081 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:26:14,081 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:14,082 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 02:26:14,082 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:14,082 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:14,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2852 [2022-12-13 02:26:14,082 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:26:14,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:14,082 INFO L85 PathProgramCache]: Analyzing trace with hash 173785010, now seen corresponding path program 1 times [2022-12-13 02:26:14,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:14,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412526818] [2022-12-13 02:26:14,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:14,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:14,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:26:14,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:14,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412526818] [2022-12-13 02:26:14,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412526818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:14,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:14,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:14,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873610719] [2022-12-13 02:26:14,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:14,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:14,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:14,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:14,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:14,140 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:14,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:14,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:14,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:14,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:14,214 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:14,214 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:14,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:14,215 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:14,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:14,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:14,216 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:14,216 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:14,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:14,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:14,218 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:14,219 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:14,219 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:14,219 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:14,219 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:14,219 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:14,219 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:14,219 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:14,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:14,224 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:14,225 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:14,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:14,225 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:14,225 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:14,312 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:14,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:14,313 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:14,313 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 02:26:14,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:14,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:14,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2853 [2022-12-13 02:26:14,313 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:26:14,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:14,313 INFO L85 PathProgramCache]: Analyzing trace with hash 202414161, now seen corresponding path program 1 times [2022-12-13 02:26:14,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:14,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974785239] [2022-12-13 02:26:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:14,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:14,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:26:14,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:14,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974785239] [2022-12-13 02:26:14,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974785239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:14,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:14,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:14,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529096584] [2022-12-13 02:26:14,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:14,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:14,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:14,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:14,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:14,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:14,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:14,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:14,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:14,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:14,450 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:14,450 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:14,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:14,451 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:14,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:14,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:14,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:14,452 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:14,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:14,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:14,454 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:14,454 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:14,454 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:14,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:14,454 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:14,455 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:14,455 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:14,455 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:14,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:14,460 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:14,460 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:26:14,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:14,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:14,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:14,548 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:14,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:14,549 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:14,549 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 02:26:14,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:14,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:14,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2854 [2022-12-13 02:26:14,549 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:26:14,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash 231043312, now seen corresponding path program 1 times [2022-12-13 02:26:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:14,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59745077] [2022-12-13 02:26:14,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:14,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:14,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:26:14,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:14,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59745077] [2022-12-13 02:26:14,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59745077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:14,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:14,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:14,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103776092] [2022-12-13 02:26:14,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:14,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:14,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:14,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:14,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:14,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:14,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:14,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:14,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:14,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:14,673 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:14,673 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:14,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:14,674 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:14,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:14,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:14,675 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:14,675 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:14,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:14,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:14,678 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:14,678 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:14,678 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:14,678 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:14,678 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:14,678 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:14,678 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:14,678 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:14,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:14,684 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:14,684 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:14,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:14,684 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:14,684 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:14,772 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:14,772 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:14,772 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:14,772 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 02:26:14,772 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:14,772 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:14,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2855 [2022-12-13 02:26:14,773 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:26:14,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:14,773 INFO L85 PathProgramCache]: Analyzing trace with hash 259672463, now seen corresponding path program 1 times [2022-12-13 02:26:14,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:14,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944725462] [2022-12-13 02:26:14,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:14,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:14,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:26:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:14,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944725462] [2022-12-13 02:26:14,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944725462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:14,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:14,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:14,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694830252] [2022-12-13 02:26:14,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:14,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:14,828 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:14,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:14,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:14,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:14,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:14,895 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:14,895 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:14,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1096 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:14,896 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:14,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:14,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:14,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:14,897 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:14,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:14,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:14,900 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:14,900 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:14,900 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:14,900 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:14,900 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:14,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:14,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:14,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:14,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:14,906 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:14,906 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:14,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:14,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:14,907 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:14,993 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:14,993 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:14,993 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:14,994 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 02:26:14,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:14,994 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:14,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2856 [2022-12-13 02:26:14,994 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:26:14,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:14,994 INFO L85 PathProgramCache]: Analyzing trace with hash 288301614, now seen corresponding path program 1 times [2022-12-13 02:26:14,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:14,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217187378] [2022-12-13 02:26:14,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:14,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:15,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:26:15,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:15,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217187378] [2022-12-13 02:26:15,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217187378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:15,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:15,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:15,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293736504] [2022-12-13 02:26:15,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:15,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:15,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:15,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:15,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:15,052 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:15,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:15,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:15,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:15,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:15,118 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:15,119 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:15,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:15,120 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:15,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:15,120 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:15,120 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:15,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:15,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:15,123 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:15,123 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:15,123 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:15,123 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:15,123 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:15,123 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:15,124 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:15,124 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:15,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:15,129 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:15,129 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:26:15,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:15,130 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:15,130 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:15,217 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:15,218 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:15,218 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:15,218 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 02:26:15,218 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:15,218 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:15,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2857 [2022-12-13 02:26:15,218 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:26:15,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:15,219 INFO L85 PathProgramCache]: Analyzing trace with hash 316930765, now seen corresponding path program 1 times [2022-12-13 02:26:15,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:15,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670758183] [2022-12-13 02:26:15,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:15,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:15,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:26:15,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:15,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670758183] [2022-12-13 02:26:15,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670758183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:15,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:15,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:15,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689941947] [2022-12-13 02:26:15,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:15,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:15,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:15,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:15,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:15,277 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:15,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:15,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:15,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:15,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:15,343 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:15,343 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:15,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:15,344 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:15,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:15,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:15,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:15,345 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:15,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:15,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:15,347 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:15,347 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:15,348 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:15,348 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:15,348 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:15,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:15,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:15,348 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:15,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:15,353 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:15,354 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:26:15,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:15,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:15,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:15,441 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:15,442 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:15,442 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:15,442 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 02:26:15,442 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:15,442 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:15,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2858 [2022-12-13 02:26:15,442 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:26:15,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:15,443 INFO L85 PathProgramCache]: Analyzing trace with hash 345559916, now seen corresponding path program 1 times [2022-12-13 02:26:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:15,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504310430] [2022-12-13 02:26:15,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:15,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:15,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:26:15,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:15,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504310430] [2022-12-13 02:26:15,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504310430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:15,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:15,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117154946] [2022-12-13 02:26:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:15,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:15,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:15,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:15,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:15,510 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:15,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:15,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:15,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:15,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:15,585 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:15,585 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:15,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1122 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:15,586 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:15,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:15,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:15,587 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:15,587 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:15,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:15,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:15,590 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:15,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:15,590 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:15,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:15,590 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:15,590 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:15,590 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:15,590 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:15,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:15,596 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:15,596 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:15,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:15,596 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:15,596 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:15,685 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:15,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:15,685 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:15,685 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 02:26:15,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:15,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:15,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2859 [2022-12-13 02:26:15,686 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:26:15,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash 374189067, now seen corresponding path program 1 times [2022-12-13 02:26:15,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:15,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012479528] [2022-12-13 02:26:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:15,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:15,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:26:15,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:15,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012479528] [2022-12-13 02:26:15,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012479528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:15,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:15,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:15,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641152120] [2022-12-13 02:26:15,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:15,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:15,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:15,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:15,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:15,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:15,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:15,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:15,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:15,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:15,807 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:15,807 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:15,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:15,808 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:15,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:15,809 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:15,809 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:15,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:15,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:15,811 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:15,812 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:15,812 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:15,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:15,812 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:15,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:15,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:15,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:15,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:15,818 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:15,818 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:26:15,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:15,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:15,818 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:15,906 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:15,907 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:15,907 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:15,907 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 02:26:15,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:15,907 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:15,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2860 [2022-12-13 02:26:15,907 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:26:15,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:15,907 INFO L85 PathProgramCache]: Analyzing trace with hash 402818218, now seen corresponding path program 1 times [2022-12-13 02:26:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:15,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456384091] [2022-12-13 02:26:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:15,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:26:15,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:15,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456384091] [2022-12-13 02:26:15,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456384091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:15,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:15,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:15,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736871281] [2022-12-13 02:26:15,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:15,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:15,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:15,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:15,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:15,965 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:15,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:15,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:15,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:15,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:16,042 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:16,042 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:16,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:16,043 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:16,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:16,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:16,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:16,044 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:16,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:16,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:16,046 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:16,046 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:16,047 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:16,047 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:16,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:16,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:16,052 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:16,052 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:16,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:16,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:16,053 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:16,141 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:16,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:16,142 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:16,142 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 02:26:16,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:16,142 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:16,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2861 [2022-12-13 02:26:16,142 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:26:16,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash 431447369, now seen corresponding path program 1 times [2022-12-13 02:26:16,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:16,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798746363] [2022-12-13 02:26:16,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26: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:26:16,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:16,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798746363] [2022-12-13 02:26:16,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798746363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:16,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:16,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:16,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235073016] [2022-12-13 02:26:16,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:16,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:16,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:16,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:16,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:16,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:16,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:16,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:16,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:16,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:16,273 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:16,274 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:16,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:16,275 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:16,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:16,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:16,275 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:16,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:16,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:16,277 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:16,278 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:16,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:16,278 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:16,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:16,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:16,283 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:16,283 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:16,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:16,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:16,284 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:16,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:16,371 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:16,371 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:16,372 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 02:26:16,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:16,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:16,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2862 [2022-12-13 02:26:16,372 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:26:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash 460076520, now seen corresponding path program 1 times [2022-12-13 02:26:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:16,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989904049] [2022-12-13 02:26:16,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:16,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:16,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:26:16,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:16,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989904049] [2022-12-13 02:26:16,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989904049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:16,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:16,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:16,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511166882] [2022-12-13 02:26:16,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:16,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:16,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:16,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:16,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:16,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:16,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:16,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:16,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:16,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:16,494 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:16,494 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:16,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:16,495 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:16,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:16,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:16,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:16,495 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:16,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:16,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:16,498 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:16,498 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:16,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:16,498 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,498 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:16,498 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:16,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:16,504 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:16,504 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:16,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:16,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:16,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:16,591 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:16,591 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:16,591 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:16,591 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 02:26:16,591 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:16,591 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:16,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2863 [2022-12-13 02:26:16,592 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:26:16,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash 488705671, now seen corresponding path program 1 times [2022-12-13 02:26:16,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:16,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129788117] [2022-12-13 02:26:16,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:16,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:16,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:16,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129788117] [2022-12-13 02:26:16,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129788117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:16,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:16,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:16,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142765161] [2022-12-13 02:26:16,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:16,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:16,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:16,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:16,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:16,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:16,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:16,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:16,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:16,734 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:16,734 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:16,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:16,735 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:16,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:16,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:16,736 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:16,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:16,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:16,738 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,738 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:16,738 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:16,738 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:16,739 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:16,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:16,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:16,744 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:16,744 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:16,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:16,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:16,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:16,832 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:16,832 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:16,832 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:16,832 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 02:26:16,832 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:16,832 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:16,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2864 [2022-12-13 02:26:16,832 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:26:16,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash 517334822, now seen corresponding path program 1 times [2022-12-13 02:26:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:16,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476071445] [2022-12-13 02:26:16,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:16,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:26:16,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:16,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476071445] [2022-12-13 02:26:16,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476071445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:16,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:16,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749018515] [2022-12-13 02:26:16,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:16,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:16,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:16,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:16,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:16,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:16,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:16,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:16,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:16,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:16,955 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:16,955 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:16,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:16,956 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:16,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:16,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:16,957 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:16,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:16,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:16,959 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,959 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:16,959 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:16,959 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:16,959 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:16,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:16,960 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:16,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:16,965 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:16,965 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:16,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:16,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:16,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:17,054 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:17,055 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:17,055 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:17,055 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 02:26:17,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:17,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:17,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2865 [2022-12-13 02:26:17,055 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:26:17,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:17,055 INFO L85 PathProgramCache]: Analyzing trace with hash 545963973, now seen corresponding path program 1 times [2022-12-13 02:26:17,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:17,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464889755] [2022-12-13 02:26:17,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:17,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:17,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 02:26:17,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:17,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464889755] [2022-12-13 02:26:17,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464889755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:17,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:17,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:17,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257836246] [2022-12-13 02:26:17,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:17,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:17,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:17,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:17,111 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:17,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:17,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:17,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:17,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:17,176 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:17,176 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:17,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:17,177 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:17,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:17,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:17,178 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:17,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:17,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:17,180 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:17,180 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:17,180 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:17,180 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:17,180 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:17,181 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:17,181 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:17,181 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:17,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:17,186 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:17,186 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:26:17,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:17,187 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:17,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:17,276 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:17,277 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:26:17,277 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:17,277 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 02:26:17,277 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:17,277 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:17,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2866 [2022-12-13 02:26:17,277 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:26:17,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:17,277 INFO L85 PathProgramCache]: Analyzing trace with hash 574593124, now seen corresponding path program 1 times [2022-12-13 02:26:17,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:17,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128333663] [2022-12-13 02:26:17,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:17,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:17,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:26:17,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:17,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128333663] [2022-12-13 02:26:17,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128333663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:17,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:17,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:17,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033630001] [2022-12-13 02:26:17,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:17,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:17,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:17,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:17,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:17,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:17,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:17,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:17,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:17,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:17,400 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:17,400 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:17,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:17,401 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:17,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:17,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:17,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:17,401 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:17,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:17,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:17,404 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:17,404 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:17,404 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:17,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:17,404 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:17,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:17,405 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:17,405 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:17,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:17,410 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:17,410 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:17,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:17,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:17,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:17,499 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:17,500 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:17,500 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:17,500 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 02:26:17,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:17,500 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:17,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2867 [2022-12-13 02:26:17,500 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:26:17,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash 603222275, now seen corresponding path program 1 times [2022-12-13 02:26:17,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:17,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204581164] [2022-12-13 02:26:17,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:17,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:26:17,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:17,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204581164] [2022-12-13 02:26:17,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204581164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:17,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:17,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:17,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788465367] [2022-12-13 02:26:17,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:17,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:17,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:17,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:17,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:17,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:17,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:17,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:17,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:17,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:17,623 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:17,623 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:17,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1113 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:17,624 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:17,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:17,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:17,625 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:17,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:17,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:17,627 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:17,627 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:17,627 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:17,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:17,627 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:17,628 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:17,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:17,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:17,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:17,633 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:17,633 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:26:17,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:17,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:17,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:17,723 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:17,724 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 02:26:17,724 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:17,724 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 02:26:17,724 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:17,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:17,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2868 [2022-12-13 02:26:17,724 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:26:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:17,724 INFO L85 PathProgramCache]: Analyzing trace with hash 631851426, now seen corresponding path program 1 times [2022-12-13 02:26:17,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:17,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504376463] [2022-12-13 02:26:17,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:17,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:17,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:26:17,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:17,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504376463] [2022-12-13 02:26:17,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504376463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:17,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:17,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:17,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923094633] [2022-12-13 02:26:17,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:17,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:17,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:17,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:17,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:17,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:17,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:17,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:17,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:17,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:17,868 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:17,868 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:17,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:17,870 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:17,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:17,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:17,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:17,870 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:17,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:17,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:17,872 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:17,873 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:17,873 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:17,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:17,873 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:17,873 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:17,873 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:17,873 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:17,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:17,879 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:17,879 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:17,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:17,879 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:17,879 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:17,968 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:17,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:17,968 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:17,968 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 02:26:17,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:17,968 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:17,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2869 [2022-12-13 02:26:17,968 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:26:17,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:17,969 INFO L85 PathProgramCache]: Analyzing trace with hash 660480577, now seen corresponding path program 1 times [2022-12-13 02:26:17,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:17,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445424873] [2022-12-13 02:26:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:18,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:26:18,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:18,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445424873] [2022-12-13 02:26:18,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445424873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:18,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:18,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:18,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060581660] [2022-12-13 02:26:18,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:18,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:18,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:18,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:18,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:18,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:18,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:18,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:18,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:18,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:18,093 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:18,093 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:18,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:18,094 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:18,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:18,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:18,094 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:18,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:18,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:18,097 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:18,097 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:18,097 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:18,097 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:18,097 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:18,098 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:18,098 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:18,098 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:18,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:18,103 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:18,103 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:26:18,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:18,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:18,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:18,193 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:18,193 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:18,193 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:18,193 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 02:26:18,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:18,193 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:18,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2870 [2022-12-13 02:26:18,194 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:26:18,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:18,194 INFO L85 PathProgramCache]: Analyzing trace with hash 689109728, now seen corresponding path program 1 times [2022-12-13 02:26:18,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:18,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969431674] [2022-12-13 02:26:18,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:18,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:18,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:26:18,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:18,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969431674] [2022-12-13 02:26:18,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969431674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:18,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:18,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:18,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023071501] [2022-12-13 02:26:18,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:18,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:18,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:18,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:18,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:18,252 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:18,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:18,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:18,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:18,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:18,319 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:18,319 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:18,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:18,320 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:18,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:18,321 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:18,321 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:18,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:18,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:18,323 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:18,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:18,324 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:18,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:18,324 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:18,324 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:18,324 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:18,324 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:18,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:18,329 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:18,330 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:18,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:18,330 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:18,330 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:18,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:18,419 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:18,419 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:18,419 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 02:26:18,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:18,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:18,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2871 [2022-12-13 02:26:18,419 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:26:18,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:18,419 INFO L85 PathProgramCache]: Analyzing trace with hash 717738879, now seen corresponding path program 1 times [2022-12-13 02:26:18,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:18,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28751670] [2022-12-13 02:26:18,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:18,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:18,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:26:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:18,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28751670] [2022-12-13 02:26:18,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28751670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:18,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:18,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879610620] [2022-12-13 02:26:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:18,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:18,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:18,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:18,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:18,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:18,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:18,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:18,546 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:18,546 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:18,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:18,547 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:18,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:18,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:18,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:18,548 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:18,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:18,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:18,550 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:18,550 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:18,550 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:18,550 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:18,550 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:18,551 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:18,551 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:18,551 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:18,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:18,556 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:18,556 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:18,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:18,557 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:18,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:18,645 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:18,646 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:18,646 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:18,646 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 02:26:18,646 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:18,646 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:18,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2872 [2022-12-13 02:26:18,646 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:26:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:18,646 INFO L85 PathProgramCache]: Analyzing trace with hash 746368030, now seen corresponding path program 1 times [2022-12-13 02:26:18,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:18,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381498505] [2022-12-13 02:26:18,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:18,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:18,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 02:26:18,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:18,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381498505] [2022-12-13 02:26:18,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381498505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:18,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:18,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:18,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806799516] [2022-12-13 02:26:18,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:18,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:18,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:18,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:18,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:18,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:18,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:18,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:18,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:18,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:18,779 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:18,779 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:18,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:18,780 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:18,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:18,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:18,781 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:18,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:18,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:18,783 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:18,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:18,784 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:18,784 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:18,784 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:18,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:18,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:18,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:18,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:18,790 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:18,790 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:18,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:18,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:18,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:18,879 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:18,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:18,879 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:18,879 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 02:26:18,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:18,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:18,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2873 [2022-12-13 02:26:18,880 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:26:18,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:18,880 INFO L85 PathProgramCache]: Analyzing trace with hash 774997181, now seen corresponding path program 1 times [2022-12-13 02:26:18,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:18,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780193389] [2022-12-13 02:26:18,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:18,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:18,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:26:18,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:18,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780193389] [2022-12-13 02:26:18,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780193389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:18,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:18,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:18,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731364472] [2022-12-13 02:26:18,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:18,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:18,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:18,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:18,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:18,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:18,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:18,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:18,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:18,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:19,023 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:19,023 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:19,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:19,024 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:19,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:19,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:19,024 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:19,025 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:19,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:19,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:19,027 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,027 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:19,027 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:19,027 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:19,028 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:19,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:19,028 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:19,033 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:19,033 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:19,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:19,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:19,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:19,122 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:19,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:19,123 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:19,123 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 02:26:19,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:19,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:19,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2874 [2022-12-13 02:26:19,123 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:26:19,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash 803626332, now seen corresponding path program 1 times [2022-12-13 02:26:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:19,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96970191] [2022-12-13 02:26:19,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:19,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:19,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:26:19,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:19,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96970191] [2022-12-13 02:26:19,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96970191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:19,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:19,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:19,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597160619] [2022-12-13 02:26:19,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:19,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:19,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:19,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:19,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:19,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:19,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:19,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:19,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:19,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:19,247 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:19,247 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:19,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:19,248 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:19,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:19,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:19,249 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:19,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:19,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:19,251 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,251 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:19,251 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:19,251 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:19,251 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,252 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:19,252 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:19,252 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:19,257 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:19,257 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:26:19,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:19,258 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:19,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:19,346 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:19,347 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:19,347 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:19,347 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 02:26:19,347 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:19,347 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:19,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2875 [2022-12-13 02:26:19,347 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:26:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash 832255483, now seen corresponding path program 1 times [2022-12-13 02:26:19,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:19,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096085457] [2022-12-13 02:26:19,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:19,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:19,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:26:19,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:19,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096085457] [2022-12-13 02:26:19,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096085457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:19,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:19,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544800081] [2022-12-13 02:26:19,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:19,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:19,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:19,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:19,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:19,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:19,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:19,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:19,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:19,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:19,488 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:19,488 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:19,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1099 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:19,489 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:19,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:19,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:19,490 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:19,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:19,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:19,493 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,493 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:19,493 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:19,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:19,493 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:19,493 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:19,493 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:19,499 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:19,499 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:19,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:19,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:19,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:19,588 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:19,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:19,589 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:19,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:19,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:19,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:19,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2876 [2022-12-13 02:26:19,589 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:26:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash 860884634, now seen corresponding path program 1 times [2022-12-13 02:26:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:19,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784366449] [2022-12-13 02:26:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:19,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:26:19,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:19,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784366449] [2022-12-13 02:26:19,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784366449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:19,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:19,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:19,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229657037] [2022-12-13 02:26:19,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:19,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:19,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:19,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:19,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:19,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:19,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:19,713 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:19,713 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:19,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:19,714 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:19,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:19,715 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:19,715 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:19,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:19,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:19,717 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,717 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:19,717 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:19,718 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:19,718 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:19,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:19,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:19,723 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:19,723 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:19,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:19,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:19,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:19,810 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:19,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:19,811 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:19,811 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 02:26:19,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:19,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:19,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2877 [2022-12-13 02:26:19,811 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:26:19,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:19,811 INFO L85 PathProgramCache]: Analyzing trace with hash 889513785, now seen corresponding path program 1 times [2022-12-13 02:26:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:19,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116052721] [2022-12-13 02:26:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:19,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:26:19,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:19,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116052721] [2022-12-13 02:26:19,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116052721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:19,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:19,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:19,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943388156] [2022-12-13 02:26:19,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:19,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:19,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:19,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:19,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:19,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:19,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:19,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:19,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:19,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:19,942 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:19,943 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:19,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:19,944 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:19,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:19,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:19,944 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:19,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:19,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:19,946 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:19,947 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:19,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:19,947 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:19,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:19,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:19,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:19,952 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:19,952 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:19,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:19,953 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:19,953 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:20,040 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:20,040 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:20,040 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:20,041 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 02:26:20,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:20,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:20,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2878 [2022-12-13 02:26:20,041 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:26:20,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash 918142936, now seen corresponding path program 1 times [2022-12-13 02:26:20,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:20,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472581637] [2022-12-13 02:26:20,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:20,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26: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:26:20,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:20,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472581637] [2022-12-13 02:26:20,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472581637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:20,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:20,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:20,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348743947] [2022-12-13 02:26:20,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:20,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:20,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:20,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:20,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:20,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:20,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:20,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:20,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:20,172 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:20,172 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:20,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:20,173 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:20,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:20,174 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:20,174 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:20,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:20,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:20,176 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:20,176 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:20,176 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:20,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:20,176 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:20,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:20,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:20,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:20,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:20,182 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:20,182 INFO L131 PetriNetUnfolder]: For 435/444 co-relation queries the response was YES. [2022-12-13 02:26:20,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 435/444 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:20,183 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:20,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:20,269 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:20,270 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:20,270 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:20,270 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 02:26:20,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:20,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:20,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2879 [2022-12-13 02:26:20,270 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:26:20,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:20,270 INFO L85 PathProgramCache]: Analyzing trace with hash 946772087, now seen corresponding path program 1 times [2022-12-13 02:26:20,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:20,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669350316] [2022-12-13 02:26:20,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:20,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26: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:26:20,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:20,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669350316] [2022-12-13 02:26:20,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669350316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:20,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:20,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:20,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521852133] [2022-12-13 02:26:20,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:20,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:20,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:20,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:20,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:20,328 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:20,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:20,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:20,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:20,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:20,393 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:20,394 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:20,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:20,395 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:20,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:20,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:20,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:20,395 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:20,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:20,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:20,398 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:20,398 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:20,398 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:20,398 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:20,398 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:20,398 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:20,398 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:20,398 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:20,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:20,404 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:20,404 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:20,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:20,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:20,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:20,492 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:20,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:20,493 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:20,493 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 02:26:20,493 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:20,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:20,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2880 [2022-12-13 02:26:20,493 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:26:20,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:20,493 INFO L85 PathProgramCache]: Analyzing trace with hash 975401238, now seen corresponding path program 1 times [2022-12-13 02:26:20,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:20,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493912055] [2022-12-13 02:26:20,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:20,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:20,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:26:20,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:20,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493912055] [2022-12-13 02:26:20,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493912055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:20,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:20,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:20,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656136676] [2022-12-13 02:26:20,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:20,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:20,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:20,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:20,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:20,550 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:20,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:20,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:20,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:20,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:20,616 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:20,616 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:20,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:20,617 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:20,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:20,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:20,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:20,617 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:20,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:20,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:20,620 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:20,620 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:20,620 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:20,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:20,620 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:20,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:20,620 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:20,621 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:20,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:20,626 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:20,626 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:20,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:20,627 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:20,627 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:20,713 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:20,714 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:20,714 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:20,714 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 02:26:20,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:20,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:20,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2881 [2022-12-13 02:26:20,714 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:26:20,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:20,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1004030389, now seen corresponding path program 1 times [2022-12-13 02:26:20,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:20,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812414961] [2022-12-13 02:26:20,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:20,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:20,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:26:20,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:20,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812414961] [2022-12-13 02:26:20,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812414961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:20,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:20,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:20,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916387519] [2022-12-13 02:26:20,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:20,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:20,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:20,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:20,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:20,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:20,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:20,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:20,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:20,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:20,838 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:20,838 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:20,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:20,839 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:20,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:20,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:20,840 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:20,840 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:20,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:20,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:20,843 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:20,843 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:20,843 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:20,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:20,843 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:20,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:20,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:20,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:20,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:20,849 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:20,849 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:20,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:20,850 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:20,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:20,938 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:20,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:20,938 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:20,938 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 02:26:20,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:20,938 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:20,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2882 [2022-12-13 02:26:20,938 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:26:20,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1032659540, now seen corresponding path program 1 times [2022-12-13 02:26:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:20,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512806255] [2022-12-13 02:26:20,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:20,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:21,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:26:21,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:21,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512806255] [2022-12-13 02:26:21,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512806255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:21,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:21,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:21,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121002939] [2022-12-13 02:26:21,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:21,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:21,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:21,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:21,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:21,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:21,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:21,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:21,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:21,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:21,114 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:21,114 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:21,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1123 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:21,115 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:21,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:21,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:21,116 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:21,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:21,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:21,118 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:21,118 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:21,118 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:21,118 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:21,118 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:21,119 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:21,119 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:21,119 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:21,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:21,124 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:21,124 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:26:21,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:21,125 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:21,125 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:21,223 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:21,223 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 02:26:21,223 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:21,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:21,223 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:21,224 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:21,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2883 [2022-12-13 02:26:21,224 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:26:21,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:21,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1061288691, now seen corresponding path program 1 times [2022-12-13 02:26:21,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:21,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080808695] [2022-12-13 02:26:21,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:21,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:21,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:26:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:21,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080808695] [2022-12-13 02:26:21,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080808695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:21,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:21,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:21,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833639114] [2022-12-13 02:26:21,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:21,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:21,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:21,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:21,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:21,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:21,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:21,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:21,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:21,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:21,350 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:21,350 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:21,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1127 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:21,351 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:21,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:21,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:21,351 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:21,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:21,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:21,354 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:21,354 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:21,354 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:21,354 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:21,354 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:21,354 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:21,354 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:21,354 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:21,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:21,360 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:21,360 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:21,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:21,360 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:21,361 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:21,447 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:21,448 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:21,448 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:21,448 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 02:26:21,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:21,448 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:21,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2884 [2022-12-13 02:26:21,448 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:26:21,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1089917842, now seen corresponding path program 1 times [2022-12-13 02:26:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:21,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414479692] [2022-12-13 02:26:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:21,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:26:21,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:21,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414479692] [2022-12-13 02:26:21,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414479692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:21,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:21,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:21,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452899890] [2022-12-13 02:26:21,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:21,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:21,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:21,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:21,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:21,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:21,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:21,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:21,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:21,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:21,584 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:21,584 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:21,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:21,585 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:21,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:21,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:21,586 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:21,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:21,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:21,588 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:21,589 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:21,589 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:21,589 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:21,589 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:21,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:21,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:21,589 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:21,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:21,594 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:21,595 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:26:21,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:21,595 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:21,595 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:21,683 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:21,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:21,684 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:21,684 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 02:26:21,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:21,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:21,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2885 [2022-12-13 02:26:21,684 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:26:21,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:21,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1118546993, now seen corresponding path program 1 times [2022-12-13 02:26:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:21,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998740927] [2022-12-13 02:26:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:21,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:21,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:26:21,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:21,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998740927] [2022-12-13 02:26:21,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998740927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:21,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:21,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:21,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69710360] [2022-12-13 02:26:21,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:21,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:21,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:21,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:21,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:21,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:21,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:21,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:21,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:21,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:21,836 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:21,836 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:21,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:21,837 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:21,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:21,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:21,838 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:21,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:21,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:21,841 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:21,841 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:21,841 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:21,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:21,841 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:21,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:21,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:21,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:21,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:21,847 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:21,847 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:21,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:21,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:21,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:21,936 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:21,937 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:21,937 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:21,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:21,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:21,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:21,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2886 [2022-12-13 02:26:21,937 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:26:21,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1147176144, now seen corresponding path program 1 times [2022-12-13 02:26:21,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:21,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508562377] [2022-12-13 02:26:21,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:21,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:22,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:26:22,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:22,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508562377] [2022-12-13 02:26:22,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508562377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:22,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:22,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:22,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104164775] [2022-12-13 02:26:22,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:22,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:22,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:22,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:22,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:22,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:22,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:22,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:22,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:22,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:22,097 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:22,097 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:22,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:22,098 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:22,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:22,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:22,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:22,099 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:22,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:22,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:22,101 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:22,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:22,102 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:22,102 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:22,102 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:22,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:22,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:22,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:22,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:22,107 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:22,108 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:22,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:22,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:22,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:22,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:22,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 02:26:22,200 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:22,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:22,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:22,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:22,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2887 [2022-12-13 02:26:22,201 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:26:22,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:22,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1175805295, now seen corresponding path program 1 times [2022-12-13 02:26:22,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:22,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153900671] [2022-12-13 02:26:22,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:22,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:22,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:26:22,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:22,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153900671] [2022-12-13 02:26:22,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153900671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:22,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:22,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568136136] [2022-12-13 02:26:22,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:22,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:22,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:22,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:22,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:22,259 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:22,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:22,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:22,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:22,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:22,346 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:22,347 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:22,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:22,348 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:22,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:22,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:22,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:22,348 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:22,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:22,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:22,351 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:22,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:22,351 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:22,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:22,351 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:22,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:22,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:22,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:22,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:22,357 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:22,357 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:22,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:22,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:22,357 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:22,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:22,446 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:22,446 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:22,446 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 02:26:22,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:22,446 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:22,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2888 [2022-12-13 02:26:22,446 INFO L420 AbstractCegarLoop]: === Iteration 2890 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:22,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:22,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1204434446, now seen corresponding path program 1 times [2022-12-13 02:26:22,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:22,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484440110] [2022-12-13 02:26:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:22,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:26:22,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:22,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484440110] [2022-12-13 02:26:22,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484440110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:22,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:22,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:22,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575823005] [2022-12-13 02:26:22,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:22,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:22,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:22,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:22,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:22,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:22,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:22,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:22,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:22,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:22,566 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:22,566 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:22,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:22,567 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:22,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:22,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:22,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:22,568 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:22,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:22,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:22,571 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:22,571 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:22,571 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:22,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:22,571 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:22,571 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:22,571 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:22,571 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:22,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:22,577 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:22,577 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:22,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:22,577 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:22,577 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:22,665 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:22,665 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:22,665 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:22,665 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 02:26:22,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:22,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:22,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2889 [2022-12-13 02:26:22,666 INFO L420 AbstractCegarLoop]: === Iteration 2891 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:22,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1233063597, now seen corresponding path program 1 times [2022-12-13 02:26:22,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:22,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400926662] [2022-12-13 02:26:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:22,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:22,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:26:22,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:22,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400926662] [2022-12-13 02:26:22,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400926662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:22,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:22,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:22,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143794777] [2022-12-13 02:26:22,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:22,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:22,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:22,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:22,722 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:22,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:22,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:22,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:22,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:22,797 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:22,798 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:22,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:22,799 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:22,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:22,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:22,799 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:22,799 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:22,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:22,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:22,802 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:22,802 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:22,802 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:22,802 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:22,802 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:22,802 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:22,802 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:22,802 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:22,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:22,808 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:22,808 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:26:22,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:22,808 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:22,808 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:22,896 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:22,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:22,896 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:22,896 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 02:26:22,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:22,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:22,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2890 [2022-12-13 02:26:22,897 INFO L420 AbstractCegarLoop]: === Iteration 2892 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1261692748, now seen corresponding path program 1 times [2022-12-13 02:26:22,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:22,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103428517] [2022-12-13 02:26:22,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:22,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:22,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:26:22,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:22,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103428517] [2022-12-13 02:26:22,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103428517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:22,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:22,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:22,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790130516] [2022-12-13 02:26:22,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:22,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:22,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:22,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:22,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:22,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:22,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:22,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:22,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:22,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:23,029 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:23,029 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:23,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1116 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:23,030 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:23,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:23,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:23,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:23,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:23,031 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:23,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:23,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:23,033 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,034 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:23,034 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:23,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:23,034 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:23,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:23,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:23,040 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:23,040 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:23,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:23,040 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:23,040 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:23,127 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:23,128 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:23,128 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:23,128 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 02:26:23,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:23,128 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:23,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2891 [2022-12-13 02:26:23,128 INFO L420 AbstractCegarLoop]: === Iteration 2893 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:23,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:23,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1290321899, now seen corresponding path program 1 times [2022-12-13 02:26:23,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:23,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016431081] [2022-12-13 02:26:23,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:23,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:23,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 02:26:23,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:23,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016431081] [2022-12-13 02:26:23,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016431081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:23,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:23,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396746190] [2022-12-13 02:26:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:23,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:23,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:23,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:23,186 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:23,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:23,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:23,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:23,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:23,253 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:23,253 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:23,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:23,254 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:23,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:23,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:23,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:23,254 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:23,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:23,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:23,257 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,257 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:23,257 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:23,257 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:23,257 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:23,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:23,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:23,263 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:23,263 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:26:23,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:23,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:23,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:23,349 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:23,350 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:23,350 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:23,350 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 02:26:23,350 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:23,350 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:23,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2892 [2022-12-13 02:26:23,350 INFO L420 AbstractCegarLoop]: === Iteration 2894 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:23,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1318951050, now seen corresponding path program 1 times [2022-12-13 02:26:23,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:23,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572911631] [2022-12-13 02:26:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:23,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:23,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:26:23,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:23,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572911631] [2022-12-13 02:26:23,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572911631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:23,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:23,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:23,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966883179] [2022-12-13 02:26:23,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:23,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:23,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:23,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:23,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:23,408 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:23,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:23,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:23,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:23,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:23,495 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:23,495 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:23,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:23,496 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:23,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:23,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:23,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:23,497 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:23,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:23,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:23,500 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,500 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:23,500 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:23,500 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:23,500 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:23,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:23,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:23,506 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:23,506 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:23,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 444 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:23,506 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:23,506 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:23,594 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:23,595 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:23,595 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:23,595 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 02:26:23,595 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:23,595 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:23,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2893 [2022-12-13 02:26:23,595 INFO L420 AbstractCegarLoop]: === Iteration 2895 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:23,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1347580201, now seen corresponding path program 1 times [2022-12-13 02:26:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:23,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119867787] [2022-12-13 02:26:23,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:23,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:23,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:26:23,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:23,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119867787] [2022-12-13 02:26:23,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119867787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:23,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:23,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:23,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725444794] [2022-12-13 02:26:23,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:23,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:23,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:23,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:23,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:23,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:23,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:23,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:23,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:23,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:23,718 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:23,718 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:23,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:23,719 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:23,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:23,720 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:23,720 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:23,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:23,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:23,722 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:23,722 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:23,722 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:23,723 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:23,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:23,723 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:23,728 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:23,728 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:23,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:23,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:23,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:23,816 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:23,816 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:23,816 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:23,816 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 02:26:23,816 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:23,816 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:23,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2894 [2022-12-13 02:26:23,816 INFO L420 AbstractCegarLoop]: === Iteration 2896 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:23,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1376209352, now seen corresponding path program 1 times [2022-12-13 02:26:23,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:23,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893747844] [2022-12-13 02:26:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:23,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:23,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:23,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893747844] [2022-12-13 02:26:23,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893747844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:23,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:23,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:23,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087913927] [2022-12-13 02:26:23,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:23,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:23,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:23,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:23,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:23,872 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:23,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:23,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:23,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:23,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:23,938 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:23,938 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:23,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:23,939 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:23,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:23,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:23,940 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:23,940 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:23,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:23,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:23,942 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,942 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:23,943 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:23,943 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:23,943 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,943 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:23,943 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:23,943 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:23,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:23,948 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:23,948 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:23,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:23,949 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:23,949 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:24,035 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:24,036 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:24,036 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:24,036 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 02:26:24,036 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:24,036 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:24,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2895 [2022-12-13 02:26:24,037 INFO L420 AbstractCegarLoop]: === Iteration 2897 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:24,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1404838503, now seen corresponding path program 1 times [2022-12-13 02:26:24,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:24,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123760844] [2022-12-13 02:26:24,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:24,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:24,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:24,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123760844] [2022-12-13 02:26:24,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123760844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:24,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:24,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:24,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594642494] [2022-12-13 02:26:24,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:24,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:24,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:24,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:24,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:24,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:24,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:24,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:24,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:24,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:24,184 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:24,185 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:24,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:24,186 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:24,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:24,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:24,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:24,186 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:24,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:24,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:24,189 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:24,189 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:24,189 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:24,189 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:24,189 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:24,189 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:24,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:24,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:24,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:24,195 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:24,195 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:24,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:24,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:24,196 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:24,283 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:24,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:24,283 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:24,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:24,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:24,283 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:24,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2896 [2022-12-13 02:26:24,284 INFO L420 AbstractCegarLoop]: === Iteration 2898 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:24,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1433467654, now seen corresponding path program 1 times [2022-12-13 02:26:24,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:24,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661352700] [2022-12-13 02:26:24,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:24,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:24,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 02:26:24,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:24,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661352700] [2022-12-13 02:26:24,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661352700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:24,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:24,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716284336] [2022-12-13 02:26:24,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:24,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:24,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:24,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:24,342 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:24,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:24,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:24,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:24,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:24,417 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:24,418 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:24,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:24,419 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:24,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:24,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:24,419 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:24,419 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:24,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:24,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:24,422 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:24,422 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:24,422 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:24,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:24,422 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:24,422 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:24,422 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:24,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:24,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:24,428 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:24,428 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:24,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:24,429 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:24,429 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:24,516 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:24,516 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:24,517 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:24,517 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 02:26:24,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:24,517 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:24,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2897 [2022-12-13 02:26:24,517 INFO L420 AbstractCegarLoop]: === Iteration 2899 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:24,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:24,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1462096805, now seen corresponding path program 1 times [2022-12-13 02:26:24,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:24,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111606053] [2022-12-13 02:26:24,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:24,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:24,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:26:24,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:24,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111606053] [2022-12-13 02:26:24,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111606053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:24,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:24,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:24,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888715618] [2022-12-13 02:26:24,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:24,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:24,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:24,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:24,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:24,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:24,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:24,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:24,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:24,661 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:24,661 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:24,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:24,662 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:24,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:24,662 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:24,662 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:24,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:24,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:24,665 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:24,665 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:24,665 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:24,665 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:24,665 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:24,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:24,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:24,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:24,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:24,671 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:24,671 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:24,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:24,672 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:24,672 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:24,757 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:24,758 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:24,758 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:24,758 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 02:26:24,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:24,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:24,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2898 [2022-12-13 02:26:24,758 INFO L420 AbstractCegarLoop]: === Iteration 2900 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:24,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1490725956, now seen corresponding path program 1 times [2022-12-13 02:26:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:24,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054023728] [2022-12-13 02:26:24,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:24,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:26:24,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:24,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054023728] [2022-12-13 02:26:24,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054023728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:24,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:24,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:24,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912285605] [2022-12-13 02:26:24,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:24,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:24,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:24,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:24,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:24,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:24,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:24,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:24,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:24,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:24,881 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:24,881 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:24,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:24,883 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:24,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:24,883 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:24,883 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:24,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:24,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:24,886 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:24,886 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:24,886 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:24,886 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:24,886 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:24,886 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:24,886 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:24,886 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:24,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:24,892 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:24,892 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:26:24,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:24,892 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:24,892 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:24,979 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:24,980 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:24,980 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:24,980 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 02:26:24,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:24,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:24,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2899 [2022-12-13 02:26:24,980 INFO L420 AbstractCegarLoop]: === Iteration 2901 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:24,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:24,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1519355107, now seen corresponding path program 1 times [2022-12-13 02:26:24,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:24,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170244425] [2022-12-13 02:26:24,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:24,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26: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:26:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:25,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170244425] [2022-12-13 02:26:25,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170244425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:25,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:25,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:25,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245077500] [2022-12-13 02:26:25,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:25,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:25,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:25,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:25,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:25,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:25,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:25,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:25,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:25,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:25,100 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:25,100 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:25,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1101 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:25,101 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:25,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:25,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:25,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:25,102 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:25,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:25,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:25,104 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:25,104 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:25,104 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:25,104 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:25,104 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:25,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:25,105 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:25,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:25,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:25,110 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:25,110 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:25,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:25,111 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:25,111 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:25,196 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:25,197 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:25,197 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:25,197 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 02:26:25,197 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:25,197 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:25,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2900 [2022-12-13 02:26:25,197 INFO L420 AbstractCegarLoop]: === Iteration 2902 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:25,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:25,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1547984258, now seen corresponding path program 1 times [2022-12-13 02:26:25,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:25,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039898026] [2022-12-13 02:26:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:25,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:25,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:26:25,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:25,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039898026] [2022-12-13 02:26:25,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039898026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:25,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:25,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:25,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721946502] [2022-12-13 02:26:25,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:25,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:25,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:25,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:25,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:25,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:25,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:25,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:25,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:25,314 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:25,315 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:25,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:25,316 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:25,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:25,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:25,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:25,316 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:25,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:25,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:25,319 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:25,319 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:25,319 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:25,319 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:25,319 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:25,319 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:25,319 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:25,319 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:25,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:25,325 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:25,325 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:25,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:25,325 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:25,325 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:25,412 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:25,412 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:25,413 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:25,413 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 02:26:25,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:25,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:25,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2901 [2022-12-13 02:26:25,413 INFO L420 AbstractCegarLoop]: === Iteration 2903 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:25,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1576613409, now seen corresponding path program 1 times [2022-12-13 02:26:25,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:25,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205698228] [2022-12-13 02:26:25,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:25,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:25,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:26:25,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:25,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205698228] [2022-12-13 02:26:25,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205698228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:25,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:25,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:25,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317934724] [2022-12-13 02:26:25,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:25,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:25,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:25,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:25,470 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:25,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:25,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:25,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:25,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:25,549 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:25,549 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:25,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1114 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:25,550 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:25,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:25,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:25,551 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:25,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:25,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:25,553 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:25,553 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:25,553 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:25,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:25,554 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:25,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:25,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:25,554 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:25,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:25,559 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:25,559 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:25,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:25,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:25,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:25,647 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:25,648 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:25,648 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:25,648 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 02:26:25,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:25,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:25,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2902 [2022-12-13 02:26:25,648 INFO L420 AbstractCegarLoop]: === Iteration 2904 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:25,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1605242560, now seen corresponding path program 1 times [2022-12-13 02:26:25,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:25,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392308770] [2022-12-13 02:26:25,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:25,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:25,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:26:25,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:25,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392308770] [2022-12-13 02:26:25,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392308770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:25,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:25,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:25,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058483491] [2022-12-13 02:26:25,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:25,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:25,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:25,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:25,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:25,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:25,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:25,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:25,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:25,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:25,789 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:25,789 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:25,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:25,790 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:25,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:25,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:25,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:25,791 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:25,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:25,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:25,793 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:25,793 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:25,794 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:25,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:25,794 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:25,794 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:25,794 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:25,794 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:25,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:25,799 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:25,799 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:25,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:25,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:25,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:25,888 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:25,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:25,889 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:25,889 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 02:26:25,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:25,889 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:25,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2903 [2022-12-13 02:26:25,889 INFO L420 AbstractCegarLoop]: === Iteration 2905 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:25,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1633871711, now seen corresponding path program 1 times [2022-12-13 02:26:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:25,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155490159] [2022-12-13 02:26:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:25,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:26:25,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:25,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155490159] [2022-12-13 02:26:25,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155490159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:25,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:25,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:25,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646764352] [2022-12-13 02:26:25,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:25,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:25,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:25,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:25,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:25,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:25,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:25,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:25,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:25,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:26,011 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:26,012 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:26,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:26,013 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:26,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:26,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:26,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:26,013 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:26,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:26,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:26,016 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,016 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:26,016 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:26,016 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:26,016 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,016 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:26,016 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:26,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:26,022 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:26,022 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:26,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:26,022 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:26,022 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:26,109 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:26,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:26,110 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:26,110 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 02:26:26,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:26,110 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:26,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2904 [2022-12-13 02:26:26,110 INFO L420 AbstractCegarLoop]: === Iteration 2906 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:26,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:26,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1662500862, now seen corresponding path program 1 times [2022-12-13 02:26:26,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:26,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081120526] [2022-12-13 02:26:26,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:26,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:26,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:26:26,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:26,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081120526] [2022-12-13 02:26:26,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081120526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:26,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:26,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:26,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485333082] [2022-12-13 02:26:26,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:26,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:26,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:26,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:26,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:26,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:26,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:26,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:26,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:26,233 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:26,234 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:26,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:26,235 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:26,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:26,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:26,235 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:26,235 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:26,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:26,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:26,238 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,238 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:26,238 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:26,238 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:26,238 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,238 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:26,238 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:26,238 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:26,244 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:26,244 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:26,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:26,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:26,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:26,333 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:26,334 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:26,334 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:26,334 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 02:26:26,334 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:26,334 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:26,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2905 [2022-12-13 02:26:26,334 INFO L420 AbstractCegarLoop]: === Iteration 2907 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:26,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:26,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1691130013, now seen corresponding path program 1 times [2022-12-13 02:26:26,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:26,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822831964] [2022-12-13 02:26:26,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:26,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:26,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:26:26,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:26,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822831964] [2022-12-13 02:26:26,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822831964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:26,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:26,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:26,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753160987] [2022-12-13 02:26:26,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:26,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:26,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:26,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:26,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:26,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:26,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:26,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:26,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:26,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:26,467 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:26,467 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:26,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:26,468 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:26,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:26,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:26,469 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:26,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:26,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:26,471 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,471 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:26,472 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:26,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:26,472 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:26,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:26,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:26,477 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:26,478 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:26,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:26,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:26,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:26,565 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:26,566 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:26,566 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:26,566 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 02:26:26,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:26,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:26,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2906 [2022-12-13 02:26:26,566 INFO L420 AbstractCegarLoop]: === Iteration 2908 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:26,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1719759164, now seen corresponding path program 1 times [2022-12-13 02:26:26,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:26,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592412088] [2022-12-13 02:26:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:26,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:26,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:26:26,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:26,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592412088] [2022-12-13 02:26:26,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592412088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:26,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:26,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:26,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633018570] [2022-12-13 02:26:26,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:26,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:26,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:26,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:26,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:26,624 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:26,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:26,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:26,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:26,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:26,699 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:26,699 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:26,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:26,700 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:26,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:26,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:26,700 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:26,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:26,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:26,703 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:26,703 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:26,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:26,703 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:26,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:26,703 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:26,709 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:26,709 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:26,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:26,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:26,710 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:26,798 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:26,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:26,799 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:26,799 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 02:26:26,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:26,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:26,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2907 [2022-12-13 02:26:26,799 INFO L420 AbstractCegarLoop]: === Iteration 2909 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:26,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1748388315, now seen corresponding path program 1 times [2022-12-13 02:26:26,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:26,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848807658] [2022-12-13 02:26:26,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:26,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:26,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:26:26,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:26,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848807658] [2022-12-13 02:26:26,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848807658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:26,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:26,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:26,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619437114] [2022-12-13 02:26:26,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:26,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:26,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:26,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:26,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:26,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:26,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:26,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:26,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:26,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:26,935 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:26,935 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:26,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:26,936 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:26,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:26,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:26,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:26,937 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:26,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:26,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:26,939 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,939 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:26,939 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:26,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:26,939 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:26,940 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:26,940 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:26,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:26,945 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:26,945 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:26,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:26,946 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:26,946 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:27,033 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:27,034 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:27,034 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:27,034 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 02:26:27,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:27,034 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:27,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2908 [2022-12-13 02:26:27,034 INFO L420 AbstractCegarLoop]: === Iteration 2910 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:27,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:27,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1777017466, now seen corresponding path program 1 times [2022-12-13 02:26:27,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:27,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005623302] [2022-12-13 02:26:27,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:27,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:27,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:26:27,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:27,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005623302] [2022-12-13 02:26:27,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005623302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:27,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:27,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228492561] [2022-12-13 02:26:27,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:27,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:27,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:27,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:27,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:27,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:27,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:27,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:27,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:27,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:27,168 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:27,168 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:27,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:27,169 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:27,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:27,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:27,169 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:27,169 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:27,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:27,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:27,172 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:27,172 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:27,172 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:27,172 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:27,172 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:27,172 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:27,172 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:27,173 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:27,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:27,178 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:27,178 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:27,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:27,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:27,179 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:27,266 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:27,267 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:27,267 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:27,267 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 02:26:27,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:27,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:27,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2909 [2022-12-13 02:26:27,267 INFO L420 AbstractCegarLoop]: === Iteration 2911 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:27,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1805646617, now seen corresponding path program 1 times [2022-12-13 02:26:27,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:27,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860683599] [2022-12-13 02:26:27,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:27,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:27,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:26:27,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:27,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860683599] [2022-12-13 02:26:27,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860683599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:27,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:27,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:27,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10920409] [2022-12-13 02:26:27,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:27,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:27,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:27,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:27,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:27,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:27,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:27,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:27,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:27,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:27,398 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:27,398 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:27,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1120 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:27,399 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:27,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:27,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:27,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:27,400 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:27,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:27,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:27,402 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:27,402 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:27,403 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:27,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:27,403 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:27,403 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:27,403 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:27,403 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:27,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:27,408 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:27,409 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:26:27,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:27,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:27,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:27,498 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:27,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:27,498 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:27,498 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 02:26:27,498 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:27,498 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:27,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2910 [2022-12-13 02:26:27,498 INFO L420 AbstractCegarLoop]: === Iteration 2912 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:27,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1834275768, now seen corresponding path program 1 times [2022-12-13 02:26:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046160631] [2022-12-13 02:26:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:27,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:26:27,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:27,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046160631] [2022-12-13 02:26:27,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046160631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:27,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:27,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:27,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384756556] [2022-12-13 02:26:27,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:27,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:27,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:27,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:27,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:27,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:27,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:27,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:27,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:27,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:27,633 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:27,633 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:26:27,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1122 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:27,635 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:27,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:27,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:27,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:27,635 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:27,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:27,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:27,638 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:27,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:27,638 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:27,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:27,638 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:27,638 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:27,638 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:27,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:27,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:27,644 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:27,644 INFO L131 PetriNetUnfolder]: For 433/442 co-relation queries the response was YES. [2022-12-13 02:26:27,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/442 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:27,644 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:27,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:27,731 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:27,732 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:27,732 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:27,732 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 02:26:27,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:27,732 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:27,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2911 [2022-12-13 02:26:27,732 INFO L420 AbstractCegarLoop]: === Iteration 2913 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:27,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:27,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1862904919, now seen corresponding path program 1 times [2022-12-13 02:26:27,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:27,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064125571] [2022-12-13 02:26:27,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:27,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:27,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:26:27,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:27,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064125571] [2022-12-13 02:26:27,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064125571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:27,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:27,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:27,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727370571] [2022-12-13 02:26:27,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:27,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:27,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:27,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:27,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:27,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:27,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:27,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:27,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:27,862 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:27,863 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:27,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:27,864 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:27,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:27,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:27,864 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:27,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:27,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:27,867 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:27,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:27,867 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:27,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:27,867 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:27,867 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:27,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:27,867 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:27,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:27,873 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:27,873 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:27,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:27,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:27,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:27,961 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:27,962 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:27,962 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:27,962 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 02:26:27,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:27,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:27,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2912 [2022-12-13 02:26:27,962 INFO L420 AbstractCegarLoop]: === Iteration 2914 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:27,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:27,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1891534070, now seen corresponding path program 1 times [2022-12-13 02:26:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:27,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813144106] [2022-12-13 02:26:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:27,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26: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 02:26:28,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:28,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813144106] [2022-12-13 02:26:28,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813144106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:28,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:28,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:28,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260867005] [2022-12-13 02:26:28,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:28,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:28,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:28,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:28,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:28,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:28,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:28,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:28,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:28,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:28,110 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:28,110 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:28,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:28,111 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:28,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:28,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:28,112 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:28,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:28,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:28,114 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:28,114 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:28,114 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:28,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:28,114 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:28,115 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:28,115 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:28,115 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:28,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:28,120 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:28,120 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:28,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:28,121 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:28,121 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:28,209 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:28,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:28,210 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:28,210 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 02:26:28,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:28,210 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:28,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2913 [2022-12-13 02:26:28,210 INFO L420 AbstractCegarLoop]: === Iteration 2915 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1920163221, now seen corresponding path program 1 times [2022-12-13 02:26:28,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:28,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191867431] [2022-12-13 02:26:28,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:28,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:26:28,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:28,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191867431] [2022-12-13 02:26:28,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191867431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:28,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:28,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153326788] [2022-12-13 02:26:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:28,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:28,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:28,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:28,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:28,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:28,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:28,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:28,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:28,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:28,337 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:28,337 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:28,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:28,338 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:28,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:28,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:28,339 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:28,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:28,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:28,341 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:28,341 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:28,342 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:28,342 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:28,342 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:28,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:28,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:28,342 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:28,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:28,348 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:28,348 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:28,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:28,348 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:28,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:28,435 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:28,435 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:28,435 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:28,435 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 02:26:28,435 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:28,435 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:28,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2914 [2022-12-13 02:26:28,436 INFO L420 AbstractCegarLoop]: === Iteration 2916 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1948792372, now seen corresponding path program 1 times [2022-12-13 02:26:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:28,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46125441] [2022-12-13 02:26:28,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:28,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:28,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:26:28,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:28,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46125441] [2022-12-13 02:26:28,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46125441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:28,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:28,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:28,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568670216] [2022-12-13 02:26:28,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:28,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:28,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:28,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:28,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:28,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:28,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:28,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:28,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:28,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:28,564 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:28,564 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:28,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:28,565 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:28,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:28,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:28,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:28,566 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:28,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:28,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:28,568 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:28,568 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:28,568 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:28,568 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:28,569 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:28,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:28,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:28,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:28,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:28,574 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:28,574 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:28,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:28,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:28,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:28,663 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:28,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:28,664 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:28,664 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 02:26:28,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:28,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:28,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2915 [2022-12-13 02:26:28,664 INFO L420 AbstractCegarLoop]: === Iteration 2917 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:28,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:28,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1977421523, now seen corresponding path program 1 times [2022-12-13 02:26:28,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:28,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60341236] [2022-12-13 02:26:28,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:28,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:28,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:26:28,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:28,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60341236] [2022-12-13 02:26:28,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60341236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:28,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:28,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:28,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916131779] [2022-12-13 02:26:28,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:28,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:28,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:28,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:28,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:28,737 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:28,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:28,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:28,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:28,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:28,812 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:28,812 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:28,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:28,813 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:28,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:28,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:28,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:28,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:28,814 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:28,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:28,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:28,816 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:28,816 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:28,816 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:28,816 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:28,816 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:28,817 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:28,817 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:28,817 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:28,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:28,822 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:28,822 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:28,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:28,823 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:28,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:28,910 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:28,910 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:28,911 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:28,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:28,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:28,911 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:28,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2916 [2022-12-13 02:26:28,911 INFO L420 AbstractCegarLoop]: === Iteration 2918 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:28,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:28,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2006050674, now seen corresponding path program 1 times [2022-12-13 02:26:28,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:28,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898803735] [2022-12-13 02:26:28,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:28,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:28,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:28,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898803735] [2022-12-13 02:26:28,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898803735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:28,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:28,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:28,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016463576] [2022-12-13 02:26:28,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:28,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:28,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:28,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:28,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:28,969 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:28,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:28,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:28,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:28,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:29,045 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:29,046 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:29,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1119 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:29,047 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:29,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:29,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:29,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:29,047 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:29,047 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:29,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:29,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:29,050 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:29,050 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:29,050 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:29,050 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:29,050 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:29,050 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:29,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:29,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:29,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:29,056 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:29,056 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:29,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:29,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:29,057 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:29,144 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:29,144 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:29,144 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:29,144 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 02:26:29,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:29,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:29,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2917 [2022-12-13 02:26:29,145 INFO L420 AbstractCegarLoop]: === Iteration 2919 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:29,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:29,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2034679825, now seen corresponding path program 1 times [2022-12-13 02:26:29,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:29,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345809217] [2022-12-13 02:26:29,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:29,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:29,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:26:29,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:29,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345809217] [2022-12-13 02:26:29,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345809217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:29,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:29,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:29,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387069392] [2022-12-13 02:26:29,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:29,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:29,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:29,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:29,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:29,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:29,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:29,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:29,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:29,307 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:29,308 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:29,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1112 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:29,309 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:29,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:29,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:29,309 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:29,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:29,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:29,312 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:29,312 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:29,312 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:29,312 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:29,312 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:29,312 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:29,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:29,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:29,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:29,318 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:29,318 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:29,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:29,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:29,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:29,407 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:29,407 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:29,407 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:29,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:29,407 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:29,407 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:29,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2918 [2022-12-13 02:26:29,407 INFO L420 AbstractCegarLoop]: === Iteration 2920 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:29,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2063308976, now seen corresponding path program 1 times [2022-12-13 02:26:29,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:29,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027787018] [2022-12-13 02:26:29,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:29,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:29,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:26:29,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:29,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027787018] [2022-12-13 02:26:29,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027787018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:29,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:29,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:29,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742429132] [2022-12-13 02:26:29,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:29,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:29,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:29,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:29,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:29,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:29,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:29,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:29,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:29,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:29,530 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:29,530 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:29,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1104 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:29,531 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:29,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:29,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:29,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:29,531 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:29,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:29,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:29,534 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:29,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:29,534 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:29,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:29,534 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:29,535 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:29,535 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:29,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:29,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:29,540 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:29,540 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:29,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:29,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:29,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:29,629 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:29,630 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:29,630 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:29,630 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 02:26:29,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:29,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:29,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2919 [2022-12-13 02:26:29,630 INFO L420 AbstractCegarLoop]: === Iteration 2921 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2091938127, now seen corresponding path program 1 times [2022-12-13 02:26:29,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:29,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140453316] [2022-12-13 02:26:29,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:29,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:29,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:26:29,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:29,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140453316] [2022-12-13 02:26:29,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140453316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:29,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:29,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:29,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526589590] [2022-12-13 02:26:29,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:29,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:29,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:29,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:29,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:29,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:29,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:29,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:29,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:29,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:29,765 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:29,765 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:29,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:29,766 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:29,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:29,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:29,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:29,767 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:29,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:29,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:29,769 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:29,769 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:29,769 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:29,769 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:29,770 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:29,770 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:29,770 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:29,770 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:29,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:29,775 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:29,775 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:29,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:29,776 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:29,776 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:29,865 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:29,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:29,865 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:29,865 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 02:26:29,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:29,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:29,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2920 [2022-12-13 02:26:29,865 INFO L420 AbstractCegarLoop]: === Iteration 2922 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:29,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:29,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2120567278, now seen corresponding path program 1 times [2022-12-13 02:26:29,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:29,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754125908] [2022-12-13 02:26:29,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:29,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:29,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 02:26:29,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:29,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754125908] [2022-12-13 02:26:29,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754125908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:29,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:29,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:29,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238920469] [2022-12-13 02:26:29,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:29,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:29,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:29,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:29,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:29,923 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:29,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:29,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:29,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:29,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:30,000 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:30,001 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:30,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1118 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:30,002 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:30,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:30,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:30,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:30,002 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:30,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:30,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:30,006 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,006 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:30,006 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:30,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:30,006 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:30,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:30,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:30,012 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:30,012 INFO L131 PetriNetUnfolder]: For 433/451 co-relation queries the response was YES. [2022-12-13 02:26:30,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 433/451 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 446 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:30,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:30,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:30,101 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:30,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:30,102 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:30,102 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 02:26:30,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:30,102 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:30,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2921 [2022-12-13 02:26:30,102 INFO L420 AbstractCegarLoop]: === Iteration 2923 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:30,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:30,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2145770867, now seen corresponding path program 1 times [2022-12-13 02:26:30,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:30,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976154897] [2022-12-13 02:26:30,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:30,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:30,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:26:30,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:30,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976154897] [2022-12-13 02:26:30,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976154897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:30,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:30,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:30,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188540786] [2022-12-13 02:26:30,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:30,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:30,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:30,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:30,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:30,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:30,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:30,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:30,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:30,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:30,237 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:30,237 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:30,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1108 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:30,239 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:30,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:30,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:30,239 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:30,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:30,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:30,242 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,242 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:30,242 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:30,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:30,242 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,242 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:30,242 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:30,242 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:30,248 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:30,248 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:30,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:30,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:30,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:30,336 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:30,337 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:30,337 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:30,337 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 02:26:30,337 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:30,337 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:30,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2922 [2022-12-13 02:26:30,337 INFO L420 AbstractCegarLoop]: === Iteration 2924 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:30,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2117141716, now seen corresponding path program 1 times [2022-12-13 02:26:30,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:30,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993232545] [2022-12-13 02:26:30,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:30,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:30,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:26:30,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:30,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993232545] [2022-12-13 02:26:30,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993232545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:30,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:30,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:30,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005484638] [2022-12-13 02:26:30,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:30,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:30,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:30,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:30,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:30,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:30,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:30,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:30,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:30,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:30,479 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:30,479 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:30,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:30,480 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:30,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:30,481 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:30,481 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:30,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:30,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:30,483 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,483 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:30,483 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:30,484 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:30,484 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,484 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:30,484 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:30,484 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:30,489 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:30,489 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:26:30,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 452 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:30,490 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:30,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:30,578 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:30,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:30,579 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:30,579 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 02:26:30,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:30,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:30,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2923 [2022-12-13 02:26:30,579 INFO L420 AbstractCegarLoop]: === Iteration 2925 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:30,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:30,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2088512565, now seen corresponding path program 1 times [2022-12-13 02:26:30,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:30,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76340052] [2022-12-13 02:26:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:30,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:30,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:26:30,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:30,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76340052] [2022-12-13 02:26:30,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76340052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:30,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:30,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:30,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959411803] [2022-12-13 02:26:30,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:30,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:30,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:30,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:30,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:30,635 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:30,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:30,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:30,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:30,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:30,700 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:30,700 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:30,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:30,702 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:30,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:30,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:30,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:30,702 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:30,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:30,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:30,705 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:30,705 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:30,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:30,705 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,705 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:30,705 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:30,706 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:30,711 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:30,711 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:26:30,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:30,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:30,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:30,799 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:30,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:30,800 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:30,800 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 02:26:30,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:30,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:30,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2924 [2022-12-13 02:26:30,800 INFO L420 AbstractCegarLoop]: === Iteration 2926 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:30,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:30,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2059883414, now seen corresponding path program 1 times [2022-12-13 02:26:30,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:30,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930061719] [2022-12-13 02:26:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:30,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:30,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:26:30,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:30,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930061719] [2022-12-13 02:26:30,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930061719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:30,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:30,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:30,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99898253] [2022-12-13 02:26:30,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:30,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:30,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:30,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:30,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:30,856 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:30,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:30,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:30,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:30,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:30,930 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:30,930 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:30,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1118 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:30,931 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:30,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:30,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:30,932 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:30,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:30,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:30,935 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,935 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:30,935 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:30,935 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:30,935 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,935 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:30,935 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:30,935 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:30,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:30,941 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:30,941 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:30,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:30,941 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:30,941 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:31,028 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:31,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:31,028 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:31,028 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 02:26:31,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:31,029 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:31,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2925 [2022-12-13 02:26:31,029 INFO L420 AbstractCegarLoop]: === Iteration 2927 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:31,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2031254263, now seen corresponding path program 1 times [2022-12-13 02:26:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:31,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975838228] [2022-12-13 02:26:31,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:31,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:31,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:26:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:31,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975838228] [2022-12-13 02:26:31,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975838228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:31,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:31,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:31,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055284977] [2022-12-13 02:26:31,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:31,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:31,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:31,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:31,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:31,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:31,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:31,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:31,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:31,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:31,158 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:31,158 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:31,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:31,159 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:31,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:31,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:31,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:31,160 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:31,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:31,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:31,162 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:31,162 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:31,162 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:31,162 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:31,162 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:31,162 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:31,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:31,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:31,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:31,168 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:31,168 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:26:31,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:31,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:31,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:31,255 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:31,256 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:31,256 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:31,256 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 02:26:31,256 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:31,256 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:31,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2926 [2022-12-13 02:26:31,256 INFO L420 AbstractCegarLoop]: === Iteration 2928 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:31,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2002625112, now seen corresponding path program 1 times [2022-12-13 02:26:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:31,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282451344] [2022-12-13 02:26:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:31,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:26:31,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:31,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282451344] [2022-12-13 02:26:31,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282451344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:31,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:31,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783900023] [2022-12-13 02:26:31,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:31,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:31,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:31,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:31,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:31,313 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:31,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:31,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:31,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:31,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:31,378 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:31,379 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:31,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1115 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:31,379 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:31,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:31,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:31,380 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:31,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:31,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:31,383 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:31,383 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:31,383 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:31,383 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:31,383 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:31,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:31,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:31,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:31,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:31,389 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:31,389 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:31,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:31,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:31,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:31,476 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:31,477 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:31,477 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:31,477 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 02:26:31,477 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:31,477 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:31,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2927 [2022-12-13 02:26:31,477 INFO L420 AbstractCegarLoop]: === Iteration 2929 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:31,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:31,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1973995961, now seen corresponding path program 1 times [2022-12-13 02:26:31,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:31,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029529831] [2022-12-13 02:26:31,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:31,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:31,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:26:31,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:31,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029529831] [2022-12-13 02:26:31,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029529831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:31,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:31,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:31,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921667333] [2022-12-13 02:26:31,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:31,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:31,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:31,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:31,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:31,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:31,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:31,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:31,607 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:31,607 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:31,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:31,608 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:31,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:31,609 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:31,609 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:31,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:31,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:31,611 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:31,611 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:31,612 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:31,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:31,612 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:31,612 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:31,612 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:31,612 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:31,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:31,617 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:31,617 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:31,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 457 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:31,618 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:31,618 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:31,704 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:31,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:31,705 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:31,705 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 02:26:31,705 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:31,705 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:31,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2928 [2022-12-13 02:26:31,705 INFO L420 AbstractCegarLoop]: === Iteration 2930 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:31,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:31,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1945366810, now seen corresponding path program 1 times [2022-12-13 02:26:31,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:31,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045302019] [2022-12-13 02:26:31,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:31,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:31,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:26:31,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:31,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045302019] [2022-12-13 02:26:31,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045302019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:31,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:31,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:31,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579776474] [2022-12-13 02:26:31,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:31,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:31,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:31,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:31,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:31,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:31,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:31,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:31,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:31,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:31,828 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:31,828 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:31,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1109 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:31,829 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:31,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:31,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:31,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:31,830 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:31,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:31,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:31,832 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:31,832 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:31,832 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:31,832 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:31,832 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:31,833 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:31,833 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:31,833 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:31,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:31,838 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:31,838 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:31,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:31,839 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:31,839 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:31,926 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:31,926 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:31,926 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:31,926 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 02:26:31,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:31,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:31,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2929 [2022-12-13 02:26:31,926 INFO L420 AbstractCegarLoop]: === Iteration 2931 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:31,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:31,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1916737659, now seen corresponding path program 1 times [2022-12-13 02:26:31,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:31,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275471836] [2022-12-13 02:26:31,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:31,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:31,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:26:31,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:31,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275471836] [2022-12-13 02:26:31,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275471836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:31,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:31,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:31,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956513900] [2022-12-13 02:26:31,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:31,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:31,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:31,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:31,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:31,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:31,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:31,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:31,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:31,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:32,047 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:32,047 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:32,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:32,048 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:32,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:32,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:32,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:32,048 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:32,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:32,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:32,051 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,051 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:32,051 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:32,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:32,051 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:32,051 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:32,051 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:32,057 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:32,057 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:32,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:32,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:32,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:32,144 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:32,145 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:32,145 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:32,145 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 02:26:32,145 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:32,145 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:32,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2930 [2022-12-13 02:26:32,145 INFO L420 AbstractCegarLoop]: === Iteration 2932 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1888108508, now seen corresponding path program 1 times [2022-12-13 02:26:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:32,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819148537] [2022-12-13 02:26:32,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:32,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:32,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:26:32,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:32,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819148537] [2022-12-13 02:26:32,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819148537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:32,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:32,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:32,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456379178] [2022-12-13 02:26:32,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:32,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:32,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:32,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:32,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:32,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:32,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:32,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:32,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:32,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:32,267 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:32,268 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:32,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:32,269 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:32,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:32,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:32,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:32,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:32,269 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:32,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:32,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:32,272 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:32,272 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:32,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:32,272 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,273 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:32,273 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:32,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:32,278 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:32,278 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:26:32,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:32,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:32,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:32,366 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:32,366 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:32,366 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:32,366 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 02:26:32,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:32,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:32,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2931 [2022-12-13 02:26:32,366 INFO L420 AbstractCegarLoop]: === Iteration 2933 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:32,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:32,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1859479357, now seen corresponding path program 1 times [2022-12-13 02:26:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:32,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240463749] [2022-12-13 02:26:32,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:32,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:32,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:26:32,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:32,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240463749] [2022-12-13 02:26:32,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240463749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:32,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:32,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:32,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049073344] [2022-12-13 02:26:32,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:32,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:32,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:32,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:32,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:32,427 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:32,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:32,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:32,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:32,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:32,493 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:32,494 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:32,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:32,495 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:32,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:32,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:32,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:32,495 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:32,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:32,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:32,498 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:32,498 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:32,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:32,498 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,498 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:32,498 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:32,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:32,504 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:32,504 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:32,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 456 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:32,505 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:32,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:32,592 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:32,592 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:32,593 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:32,593 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 02:26:32,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:32,593 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:32,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2932 [2022-12-13 02:26:32,593 INFO L420 AbstractCegarLoop]: === Iteration 2934 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:32,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:32,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1830850206, now seen corresponding path program 1 times [2022-12-13 02:26:32,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:32,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417140886] [2022-12-13 02:26:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:32,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:32,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:32,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417140886] [2022-12-13 02:26:32,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417140886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:32,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:32,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:32,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878512259] [2022-12-13 02:26:32,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:32,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:32,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:32,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:32,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:32,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:32,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:32,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:32,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:32,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:32,724 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:32,724 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:32,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1121 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:32,725 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:32,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:32,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:32,726 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:32,726 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:32,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:32,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:32,728 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,728 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:32,728 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:32,729 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:32,729 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,729 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:32,729 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:32,729 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:32,734 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:32,734 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:32,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:32,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:32,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:32,822 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:32,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:32,823 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:32,823 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 02:26:32,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:32,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:32,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2933 [2022-12-13 02:26:32,823 INFO L420 AbstractCegarLoop]: === Iteration 2935 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:32,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1802221055, now seen corresponding path program 1 times [2022-12-13 02:26:32,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:32,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2482092] [2022-12-13 02:26:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:32,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:26:32,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:32,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2482092] [2022-12-13 02:26:32,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2482092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:32,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:32,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:32,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244862716] [2022-12-13 02:26:32,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:32,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:32,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:32,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:32,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:32,895 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:32,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:32,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:32,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:32,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:32,973 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:32,973 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:32,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1117 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:32,974 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:32,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:32,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:32,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:32,975 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:32,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:32,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:32,978 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,978 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:32,978 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:32,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:32,978 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:32,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:32,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:32,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:32,984 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:32,984 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:32,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 459 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:32,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:32,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:33,071 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:33,072 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:33,072 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:33,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 02:26:33,072 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:33,072 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:33,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2934 [2022-12-13 02:26:33,072 INFO L420 AbstractCegarLoop]: === Iteration 2936 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:33,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:33,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1773591904, now seen corresponding path program 1 times [2022-12-13 02:26:33,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:33,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034263836] [2022-12-13 02:26:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:33,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:33,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 02:26:33,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:33,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034263836] [2022-12-13 02:26:33,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034263836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:33,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:33,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:33,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715801766] [2022-12-13 02:26:33,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:33,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:33,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:33,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:33,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:33,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:33,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:33,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:33,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:33,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:33,204 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:33,204 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:33,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1111 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:33,205 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:33,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:33,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:33,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:33,205 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:33,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:33,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:33,208 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:33,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:33,208 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:33,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:33,208 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:33,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:33,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:33,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:33,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:33,214 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:33,214 INFO L131 PetriNetUnfolder]: For 432/441 co-relation queries the response was YES. [2022-12-13 02:26:33,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 432/441 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:33,215 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:33,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:33,303 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:33,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:33,303 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:33,303 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 02:26:33,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:33,303 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:33,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2935 [2022-12-13 02:26:33,304 INFO L420 AbstractCegarLoop]: === Iteration 2937 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1744962753, now seen corresponding path program 1 times [2022-12-13 02:26:33,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:33,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798923634] [2022-12-13 02:26:33,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:33,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:33,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:26:33,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:33,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798923634] [2022-12-13 02:26:33,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798923634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:33,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:33,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:33,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503500892] [2022-12-13 02:26:33,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:33,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:33,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:33,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:33,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:33,361 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:33,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:33,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:33,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:33,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:33,437 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:33,438 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:33,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1107 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:33,439 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:33,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:33,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:33,439 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:33,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:33,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:33,442 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:33,442 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:33,442 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:33,442 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:33,442 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:33,442 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:33,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:33,442 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:33,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:33,448 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:33,448 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:33,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:33,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:33,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:33,536 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:33,537 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:26:33,537 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:33,537 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 02:26:33,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:33,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:33,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2936 [2022-12-13 02:26:33,537 INFO L420 AbstractCegarLoop]: === Iteration 2938 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:33,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:33,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1716333602, now seen corresponding path program 1 times [2022-12-13 02:26:33,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:33,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27248313] [2022-12-13 02:26:33,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:33,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:33,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:26:33,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:33,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27248313] [2022-12-13 02:26:33,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27248313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:33,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:33,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:33,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916177173] [2022-12-13 02:26:33,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:33,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:33,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:33,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:33,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:33,595 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:33,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:33,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:33,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:33,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:33,670 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:33,670 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:33,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1120 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:33,671 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:33,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:33,672 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:33,672 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:33,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:33,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:33,674 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:33,674 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:33,675 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:33,675 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:33,675 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:33,675 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:33,675 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:33,675 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:33,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:33,680 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:33,681 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:33,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 458 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:33,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:33,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:33,768 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:33,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:33,769 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:33,769 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 02:26:33,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:33,779 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:33,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2937 [2022-12-13 02:26:33,779 INFO L420 AbstractCegarLoop]: === Iteration 2939 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:33,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:33,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1687704451, now seen corresponding path program 1 times [2022-12-13 02:26:33,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:33,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881440243] [2022-12-13 02:26:33,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:33,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:33,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:26:33,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:33,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881440243] [2022-12-13 02:26:33,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881440243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:33,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:33,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:33,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019582766] [2022-12-13 02:26:33,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:33,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:33,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:33,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:33,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:33,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:33,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:33,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:33,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:33,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:33,904 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:33,904 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:33,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1102 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:33,905 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:33,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:33,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:33,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:33,906 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:33,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:33,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:33,908 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:33,909 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:33,909 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:33,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:33,909 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:33,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:33,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:33,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:33,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:33,915 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:33,915 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:33,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:33,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:33,915 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:34,003 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:34,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:34,003 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:34,003 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 02:26:34,004 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:34,004 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:34,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2938 [2022-12-13 02:26:34,004 INFO L420 AbstractCegarLoop]: === Iteration 2940 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:34,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1659075300, now seen corresponding path program 1 times [2022-12-13 02:26:34,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:34,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210370154] [2022-12-13 02:26:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:34,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:34,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:26:34,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:34,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210370154] [2022-12-13 02:26:34,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210370154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:34,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:34,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:34,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500275125] [2022-12-13 02:26:34,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:34,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:34,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:34,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:34,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:34,063 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:34,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:34,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:34,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:34,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:34,128 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:34,128 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:34,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1123 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:34,129 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:34,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:34,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:34,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:34,130 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:34,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:34,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:34,132 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:34,132 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:34,132 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:34,133 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:34,133 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:34,133 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:34,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:34,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:34,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:34,138 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:34,138 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:34,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:34,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:34,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:34,226 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:34,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:34,226 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:34,226 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 02:26:34,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:34,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:34,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2939 [2022-12-13 02:26:34,227 INFO L420 AbstractCegarLoop]: === Iteration 2941 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:34,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:34,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1630446149, now seen corresponding path program 1 times [2022-12-13 02:26:34,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:34,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779452926] [2022-12-13 02:26:34,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:34,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:34,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:26:34,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:34,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779452926] [2022-12-13 02:26:34,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779452926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:34,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:34,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:34,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409529698] [2022-12-13 02:26:34,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:34,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:34,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:34,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:34,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:34,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:34,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:34,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:34,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:34,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:34,359 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:34,359 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:34,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:34,360 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:34,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:34,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:34,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:34,361 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:34,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:34,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:34,363 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:34,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:34,363 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:34,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:34,364 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:34,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:34,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:34,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:34,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:34,369 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:34,369 INFO L131 PetriNetUnfolder]: For 430/439 co-relation queries the response was YES. [2022-12-13 02:26:34,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/439 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:34,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:34,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:34,457 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:34,457 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:34,457 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:34,457 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 02:26:34,457 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:34,457 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:34,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2940 [2022-12-13 02:26:34,458 INFO L420 AbstractCegarLoop]: === Iteration 2942 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1601816998, now seen corresponding path program 1 times [2022-12-13 02:26:34,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:34,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609753300] [2022-12-13 02:26:34,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:34,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:34,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 02:26:34,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:34,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609753300] [2022-12-13 02:26:34,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609753300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:34,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:34,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:34,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330572065] [2022-12-13 02:26:34,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:34,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:34,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:34,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:34,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:34,513 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:34,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:34,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:34,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:34,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:34,588 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:34,588 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:34,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1113 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:34,589 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:34,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:34,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:34,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:34,590 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:34,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:34,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:34,592 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:34,592 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:34,592 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:34,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:34,592 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:34,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:34,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:34,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:34,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:34,598 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:34,598 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:34,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 453 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:34,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:34,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:34,685 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:34,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:34,686 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:34,686 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 02:26:34,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:34,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:34,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2941 [2022-12-13 02:26:34,686 INFO L420 AbstractCegarLoop]: === Iteration 2943 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:34,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:34,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1573187847, now seen corresponding path program 1 times [2022-12-13 02:26:34,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:34,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799010310] [2022-12-13 02:26:34,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:34,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:34,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:26:34,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:34,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799010310] [2022-12-13 02:26:34,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799010310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:34,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:34,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205667138] [2022-12-13 02:26:34,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:34,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:34,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:34,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:34,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:34,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:34,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:34,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:34,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:34,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:34,808 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:34,808 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:34,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1103 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:34,809 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:34,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:34,809 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:34,810 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:34,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:34,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:34,812 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:34,812 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:34,813 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:34,813 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:34,813 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:34,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:34,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:34,813 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:34,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:34,818 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:34,819 INFO L131 PetriNetUnfolder]: For 431/449 co-relation queries the response was YES. [2022-12-13 02:26:34,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:34,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:34,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:34,917 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:34,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 02:26:34,917 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:34,917 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 02:26:34,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:34,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:34,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2942 [2022-12-13 02:26:34,918 INFO L420 AbstractCegarLoop]: === Iteration 2944 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:34,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:34,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1544558696, now seen corresponding path program 1 times [2022-12-13 02:26:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:34,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282159694] [2022-12-13 02:26:34,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:34,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:26:34,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:34,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282159694] [2022-12-13 02:26:34,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282159694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:34,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:34,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:34,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334026107] [2022-12-13 02:26:34,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:34,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:34,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:34,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:34,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:34,975 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:34,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:34,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:34,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:34,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:35,049 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:35,050 INFO L131 PetriNetUnfolder]: For 1764/1764 co-relation queries the response was YES. [2022-12-13 02:26:35,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1105 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:35,051 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:35,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:35,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:35,051 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:35,051 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:35,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:35,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:35,054 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:35,054 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:35,054 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:35,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:35,054 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:35,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:35,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:35,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:35,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:35,060 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:35,060 INFO L131 PetriNetUnfolder]: For 430/448 co-relation queries the response was YES. [2022-12-13 02:26:35,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 430/448 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 455 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:35,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:35,061 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:35,146 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:35,147 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 02:26:35,147 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:35,147 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 02:26:35,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:35,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:35,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2943 [2022-12-13 02:26:35,147 INFO L420 AbstractCegarLoop]: === Iteration 2945 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:35,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:35,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1515929545, now seen corresponding path program 1 times [2022-12-13 02:26:35,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:35,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543588392] [2022-12-13 02:26:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:35,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:35,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 02:26:35,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:35,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543588392] [2022-12-13 02:26:35,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543588392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:35,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:35,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:35,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056867630] [2022-12-13 02:26:35,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:35,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:35,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:35,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:35,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:35,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:35,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:35,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:35,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:35,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:35,279 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:35,280 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-13 02:26:35,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 23 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:35,281 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:35,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:35,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:35,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:35,281 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:35,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:35,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:35,284 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:35,284 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:35,284 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:35,284 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:35,284 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:35,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:35,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:35,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:35,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:35,290 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:35,290 INFO L131 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2022-12-13 02:26:35,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 451 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:35,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:35,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:35,378 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:35,378 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 02:26:35,379 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:35,379 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 02:26:35,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:35,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:35,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2944 [2022-12-13 02:26:35,379 INFO L420 AbstractCegarLoop]: === Iteration 2946 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:35,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:35,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1487300394, now seen corresponding path program 1 times [2022-12-13 02:26:35,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:35,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280676865] [2022-12-13 02:26:35,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:35,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:35,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:35,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280676865] [2022-12-13 02:26:35,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280676865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:35,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:35,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:35,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738459390] [2022-12-13 02:26:35,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:35,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:35,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:35,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:35,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:35,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:35,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:35,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:35,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:35,500 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:35,500 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2022-12-13 02:26:35,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1117 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:35,501 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:35,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:35,502 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:35,502 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:35,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:35,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:35,504 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:35,504 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:35,504 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:35,504 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:35,504 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:35,505 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:35,505 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:35,505 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:35,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:35,510 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:35,510 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:26:35,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:35,511 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:35,511 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 02:26:35,600 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:35,600 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:26:35,600 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 431 flow [2022-12-13 02:26:35,600 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 02:26:35,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:35,600 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:35,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2945 [2022-12-13 02:26:35,601 INFO L420 AbstractCegarLoop]: === Iteration 2947 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:35,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1458671243, now seen corresponding path program 1 times [2022-12-13 02:26:35,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:35,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735047720] [2022-12-13 02:26:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:35,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:35,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:26:35,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:35,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735047720] [2022-12-13 02:26:35,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735047720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:35,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:35,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:35,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688127654] [2022-12-13 02:26:35,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:35,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:35,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:35,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:35,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:35,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:26:35,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 431 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 02:26:35,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:35,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:26:35,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:35,724 INFO L130 PetriNetUnfolder]: 155/291 cut-off events. [2022-12-13 02:26:35,724 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 02:26:35,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 291 events. 155/291 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1116 event pairs, 25 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1520. Up to 225 conditions per place. [2022-12-13 02:26:35,725 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 42 selfloop transitions, 11 changer transitions 5/58 dead transitions. [2022-12-13 02:26:35,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:35,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 02:26:35,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 02:26:35,726 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 431 flow. Second operand 5 states and 44 transitions. [2022-12-13 02:26:35,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 640 flow [2022-12-13 02:26:35,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 600 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:35,728 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:35,728 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 02:26:35,728 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 02:26:35,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:35,728 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:35,729 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:35,729 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:35,729 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 441 flow [2022-12-13 02:26:35,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:35,734 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 02:26:35,734 INFO L131 PetriNetUnfolder]: For 434/443 co-relation queries the response was YES. [2022-12-13 02:26:35,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 107 events. 29/107 cut-off events. For 434/443 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 448 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 436. Up to 36 conditions per place. [2022-12-13 02:26:35,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 441 flow [2022-12-13 02:26:35,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 Received shutdown request... [2022-12-13 02:26:35,817 WARN L249 SmtUtils]: Removed 14 from assertion stack [2022-12-13 02:26:35,818 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 02:26:35,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2946 [2022-12-13 02:26:35,818 WARN L619 AbstractCegarLoop]: Verification canceled: while SimplifyDDAWithTimeout was simplifying term of DAG size 32 for 9ms.. [2022-12-13 02:26:35,819 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 02:26:35,820 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 02:26:35,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:35,825 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:26:35,825 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:26:35,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:26:35 BasicIcfg [2022-12-13 02:26:35,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:26:35,827 INFO L158 Benchmark]: Toolchain (without parser) took 694255.68ms. Allocated memory was 194.0MB in the beginning and 701.5MB in the end (delta: 507.5MB). Free memory was 159.0MB in the beginning and 170.6MB in the end (delta: -11.6MB). Peak memory consumption was 496.7MB. Max. memory is 8.0GB. [2022-12-13 02:26:35,827 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 171.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:26:35,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.04ms. Allocated memory is still 194.0MB. Free memory was 158.8MB in the beginning and 147.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 02:26:35,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.26ms. Allocated memory is still 194.0MB. Free memory was 147.3MB in the beginning and 145.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:26:35,828 INFO L158 Benchmark]: Boogie Preprocessor took 32.12ms. Allocated memory is still 194.0MB. Free memory was 145.7MB in the beginning and 144.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 02:26:35,828 INFO L158 Benchmark]: RCFGBuilder took 405.60ms. Allocated memory is still 194.0MB. Free memory was 144.6MB in the beginning and 130.5MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 02:26:35,828 INFO L158 Benchmark]: TraceAbstraction took 693535.47ms. Allocated memory was 194.0MB in the beginning and 701.5MB in the end (delta: 507.5MB). Free memory was 128.9MB in the beginning and 170.6MB in the end (delta: -41.7MB). Peak memory consumption was 466.3MB. Max. memory is 8.0GB. [2022-12-13 02:26:35,828 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 171.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.04ms. Allocated memory is still 194.0MB. Free memory was 158.8MB in the beginning and 147.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.26ms. Allocated memory is still 194.0MB. Free memory was 147.3MB in the beginning and 145.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.12ms. Allocated memory is still 194.0MB. Free memory was 145.7MB in the beginning and 144.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 405.60ms. Allocated memory is still 194.0MB. Free memory was 144.6MB in the beginning and 130.5MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 693535.47ms. Allocated memory was 194.0MB in the beginning and 701.5MB in the end (delta: 507.5MB). Free memory was 128.9MB in the beginning and 170.6MB in the end (delta: -41.7MB). Peak memory consumption was 466.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 70 PlacesBefore, 20 PlacesAfterwards, 69 TransitionsBefore, 15 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 54 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 198, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 201, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 201, unknown conditional: 0, unknown unconditional: 201] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 305, Positive conditional cache size: 0, Positive unconditional cache size: 305, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 19 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 66 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: 2, independent unconditional: 4, dependent: 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: 2, independent unconditional: 4, dependent: 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: 2, independent unconditional: 4, dependent: 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: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 2, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 20 PlacesBefore, 19 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 66 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: 0, independent unconditional: 6, dependent: 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: 0, independent unconditional: 6, dependent: 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: 0, independent unconditional: 6, dependent: 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: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 2, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 25 PlacesBefore, 23 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 21, Positive conditional cache size: 9, Positive unconditional cache size: 12, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown 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, 28 PlacesBefore, 28 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 90 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): 21, Positive cache size: 21, Positive conditional cache size: 9, Positive unconditional cache size: 12, Negative cache size: 0, Negative conditional cache size: 0, Negative 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, 32 PlacesBefore, 31 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 24, Positive cache size: 24, Positive conditional cache size: 12, Positive unconditional cache size: 12, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown 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, 36 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 94 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): 24, Positive cache size: 24, Positive conditional cache size: 12, Positive unconditional cache size: 12, Negative cache size: 0, Negative conditional cache size: 0, Negative 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, 39 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 25, Positive conditional cache size: 13, Positive unconditional cache size: 12, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 18, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 32, Positive conditional cache size: 19, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown 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, 42 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 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: 12, independent: 6, independent conditional: 6, 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): 40, Positive cache size: 40, Positive conditional cache size: 25, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 41, Positive conditional cache size: 26, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown 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, 42 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 44, Positive cache size: 44, Positive conditional cache size: 29, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 45, Positive conditional cache size: 30, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown 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, 42 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 46, Positive conditional cache size: 31, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 47, Positive conditional cache size: 32, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown 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, 47 PlacesBefore, 47 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 142 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): 50, Positive cache size: 50, Positive conditional cache size: 35, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 51, Positive conditional cache size: 36, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 52, Positive conditional cache size: 37, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 53, Positive conditional cache size: 38, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 54, Positive conditional cache size: 39, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 55, Positive conditional cache size: 40, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 56, Positive conditional cache size: 41, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 57, Positive conditional cache size: 42, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 58, Positive conditional cache size: 43, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 59, Positive conditional cache size: 44, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 60, Positive conditional cache size: 45, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 61, Positive conditional cache size: 46, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 62, Positive conditional cache size: 47, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 63, Positive conditional cache size: 48, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 64, Positive conditional cache size: 49, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 65, Positive conditional cache size: 50, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 66, Positive conditional cache size: 51, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 67, Positive conditional cache size: 52, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 68, Positive conditional cache size: 53, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 69, Positive conditional cache size: 54, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 70, Positive conditional cache size: 55, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 71, Positive conditional cache size: 56, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 72, Positive conditional cache size: 57, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 73, Positive conditional cache size: 58, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 74, Positive conditional cache size: 59, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 75, Positive conditional cache size: 60, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 76, Positive conditional cache size: 61, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 77, Positive conditional cache size: 62, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 78, Positive conditional cache size: 63, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 79, Positive conditional cache size: 64, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 80, Positive conditional cache size: 65, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 81, Positive conditional cache size: 66, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 82, Positive conditional cache size: 67, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 83, Positive conditional cache size: 68, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 84, Positive conditional cache size: 69, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown 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, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 85, Positive conditional cache size: 70, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 86, Positive conditional cache size: 71, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 87, Positive conditional cache size: 72, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 88, Positive conditional cache size: 73, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 89, Positive conditional cache size: 74, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 90, Positive conditional cache size: 75, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 91, Positive conditional cache size: 76, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 92, Positive conditional cache size: 77, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 93, Positive conditional cache size: 78, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 94, Positive conditional cache size: 79, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 95, Positive conditional cache size: 80, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 96, Positive conditional cache size: 81, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 97, Positive conditional cache size: 82, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 98, Positive conditional cache size: 83, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 99, Positive conditional cache size: 84, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 100, Positive conditional cache size: 85, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 101, Positive conditional cache size: 86, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 102, Positive conditional cache size: 87, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 103, Positive conditional cache size: 88, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 104, Positive conditional cache size: 89, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 105, Positive conditional cache size: 90, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 106, Positive conditional cache size: 91, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 107, Positive conditional cache size: 92, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 108, Positive conditional cache size: 93, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 109, Positive conditional cache size: 94, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 110, Positive conditional cache size: 95, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 111, Positive conditional cache size: 96, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 112, Positive conditional cache size: 97, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 113, Positive conditional cache size: 98, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 114, Positive conditional cache size: 99, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 115, Positive conditional cache size: 100, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 116, Positive conditional cache size: 101, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 117, Positive conditional cache size: 102, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 118, Positive conditional cache size: 103, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 119, Positive conditional cache size: 104, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 120, Positive conditional cache size: 105, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 121, Positive conditional cache size: 106, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 122, Positive conditional cache size: 107, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 123, Positive conditional cache size: 108, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 124, Positive conditional cache size: 109, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 125, Positive conditional cache size: 110, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 111, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 127, Positive conditional cache size: 112, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 128, Positive conditional cache size: 113, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 129, Positive conditional cache size: 114, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 130, Positive conditional cache size: 115, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 131, Positive conditional cache size: 116, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 132, Positive conditional cache size: 117, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 133, Positive conditional cache size: 118, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 134, Positive conditional cache size: 119, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 135, Positive conditional cache size: 120, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 136, Positive conditional cache size: 121, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 137, Positive conditional cache size: 122, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 138, Positive conditional cache size: 123, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 139, Positive conditional cache size: 124, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 140, Positive conditional cache size: 125, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 141, Positive conditional cache size: 126, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 142, Positive conditional cache size: 127, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 143, Positive conditional cache size: 128, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 144, Positive conditional cache size: 129, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 145, Positive conditional cache size: 130, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 146, Positive conditional cache size: 131, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 147, Positive conditional cache size: 132, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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:26:35,863 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, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 148, Positive conditional cache size: 133, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 149, Positive conditional cache size: 134, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 150, Positive conditional cache size: 135, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 151, Positive conditional cache size: 136, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 152, Positive conditional cache size: 137, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 153, Positive conditional cache size: 138, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 154, Positive conditional cache size: 139, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 155, Positive conditional cache size: 140, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 156, Positive conditional cache size: 141, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 157, Positive conditional cache size: 142, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 158, Positive conditional cache size: 143, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 159, Positive conditional cache size: 144, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 160, Positive conditional cache size: 145, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 161, Positive conditional cache size: 146, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 162, Positive conditional cache size: 147, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 163, Positive conditional cache size: 148, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 164, Positive conditional cache size: 149, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 165, Positive conditional cache size: 150, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 166, Positive conditional cache size: 151, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 167, Positive conditional cache size: 152, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 168, Positive conditional cache size: 153, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 169, Positive conditional cache size: 154, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 170, Positive conditional cache size: 155, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 171, Positive conditional cache size: 156, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 172, Positive conditional cache size: 157, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 173, Positive conditional cache size: 158, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 174, Positive conditional cache size: 159, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 175, Positive conditional cache size: 160, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 176, Positive conditional cache size: 161, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 177, Positive conditional cache size: 162, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 178, Positive conditional cache size: 163, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 179, Positive conditional cache size: 164, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 180, Positive conditional cache size: 165, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 181, Positive conditional cache size: 166, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 182, Positive conditional cache size: 167, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 183, Positive conditional cache size: 168, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 184, Positive conditional cache size: 169, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 185, Positive conditional cache size: 170, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 186, Positive conditional cache size: 171, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 187, Positive conditional cache size: 172, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 188, Positive conditional cache size: 173, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 189, Positive conditional cache size: 174, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 190, Positive conditional cache size: 175, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 191, Positive conditional cache size: 176, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 192, Positive conditional cache size: 177, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 193, Positive conditional cache size: 178, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 194, Positive conditional cache size: 179, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 195, Positive conditional cache size: 180, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 196, Positive conditional cache size: 181, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown 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, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 197, Positive conditional cache size: 182, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 198, Positive conditional cache size: 183, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 199, Positive conditional cache size: 184, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 200, Positive conditional cache size: 185, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 201, Positive conditional cache size: 186, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 202, Positive conditional cache size: 187, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 203, Positive conditional cache size: 188, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 204, Positive conditional cache size: 189, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 205, Positive conditional cache size: 190, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 206, Positive conditional cache size: 191, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 207, Positive conditional cache size: 192, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 208, Positive conditional cache size: 193, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 209, Positive conditional cache size: 194, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 210, Positive conditional cache size: 195, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 211, Positive conditional cache size: 196, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 212, Positive conditional cache size: 197, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 213, Positive conditional cache size: 198, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 214, Positive conditional cache size: 199, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 215, Positive conditional cache size: 200, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 216, Positive conditional cache size: 201, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 217, Positive conditional cache size: 202, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 218, Positive conditional cache size: 203, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 219, Positive conditional cache size: 204, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 220, Positive conditional cache size: 205, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 221, Positive conditional cache size: 206, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 222, Positive conditional cache size: 207, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 223, Positive conditional cache size: 208, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 224, Positive conditional cache size: 209, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 225, Positive conditional cache size: 210, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 226, Positive conditional cache size: 211, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 227, Positive conditional cache size: 212, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 228, Positive conditional cache size: 213, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 229, Positive cache size: 229, Positive conditional cache size: 214, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 230, Positive conditional cache size: 215, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 231, Positive conditional cache size: 216, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 232, Positive conditional cache size: 217, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 233, Positive conditional cache size: 218, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 234, Positive conditional cache size: 219, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 235, Positive conditional cache size: 220, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 236, Positive conditional cache size: 221, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 237, Positive conditional cache size: 222, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 238, Positive conditional cache size: 223, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 239, Positive conditional cache size: 224, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 240, Positive conditional cache size: 225, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 241, Positive conditional cache size: 226, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 242, Positive conditional cache size: 227, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 243, Positive conditional cache size: 228, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 244, Positive conditional cache size: 229, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 245, Positive conditional cache size: 230, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 246, Positive conditional cache size: 231, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 247, Positive conditional cache size: 232, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 248, Positive conditional cache size: 233, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 249, Positive conditional cache size: 234, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 250, Positive conditional cache size: 235, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 251, Positive conditional cache size: 236, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 252, Positive conditional cache size: 237, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 253, Positive conditional cache size: 238, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 254, Positive conditional cache size: 239, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 255, Positive conditional cache size: 240, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 256, Positive conditional cache size: 241, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 257, Positive conditional cache size: 242, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 258, Positive conditional cache size: 243, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 259, Positive conditional cache size: 244, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 260, Positive conditional cache size: 245, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 261, Positive conditional cache size: 246, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 262, Positive conditional cache size: 247, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 263, Positive conditional cache size: 248, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 264, Positive conditional cache size: 249, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 265, Positive conditional cache size: 250, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 266, Positive conditional cache size: 251, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 267, Positive conditional cache size: 252, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 268, Positive conditional cache size: 253, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 269, Positive conditional cache size: 254, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 270, Positive conditional cache size: 255, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 271, Positive conditional cache size: 256, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 272, Positive conditional cache size: 257, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 273, Positive conditional cache size: 258, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 274, Positive conditional cache size: 259, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 275, Positive cache size: 275, Positive conditional cache size: 260, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 276, Positive conditional cache size: 261, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 277, Positive conditional cache size: 262, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 278, Positive conditional cache size: 263, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 279, Positive conditional cache size: 264, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 280, Positive cache size: 280, Positive conditional cache size: 265, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 281, Positive cache size: 281, Positive conditional cache size: 266, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 282, Positive conditional cache size: 267, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 283, Positive cache size: 283, Positive conditional cache size: 268, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 284, Positive conditional cache size: 269, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 285, Positive cache size: 285, Positive conditional cache size: 270, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 286, Positive conditional cache size: 271, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 287, Positive cache size: 287, Positive conditional cache size: 272, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 288, Positive conditional cache size: 273, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 289, Positive conditional cache size: 274, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 290, Positive conditional cache size: 275, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 291, Positive conditional cache size: 276, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 292, Positive conditional cache size: 277, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 293, Positive conditional cache size: 278, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 294, Positive conditional cache size: 279, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 295, Positive conditional cache size: 280, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 296, Positive conditional cache size: 281, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 297, Positive conditional cache size: 282, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 298, Positive conditional cache size: 283, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 299, Positive conditional cache size: 284, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 300, Positive conditional cache size: 285, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 301, Positive conditional cache size: 286, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 302, Positive conditional cache size: 287, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 303, Positive conditional cache size: 288, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 304, Positive conditional cache size: 289, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 305, Positive conditional cache size: 290, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 306, Positive conditional cache size: 291, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 307, Positive cache size: 307, Positive conditional cache size: 292, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 308, Positive conditional cache size: 293, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 309, Positive conditional cache size: 294, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 310, Positive conditional cache size: 295, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 311, Positive conditional cache size: 296, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 312, Positive conditional cache size: 297, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 313, Positive cache size: 313, Positive conditional cache size: 298, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 314, Positive conditional cache size: 299, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 315, Positive conditional cache size: 300, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 316, Positive conditional cache size: 301, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 317, Positive cache size: 317, Positive conditional cache size: 302, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 318, Positive conditional cache size: 303, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 319, Positive cache size: 319, Positive conditional cache size: 304, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 320, Positive conditional cache size: 305, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 321, Positive cache size: 321, Positive conditional cache size: 306, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 322, Positive conditional cache size: 307, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 323, Positive conditional cache size: 308, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 324, Positive cache size: 324, Positive conditional cache size: 309, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 325, Positive conditional cache size: 310, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 326, Positive conditional cache size: 311, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 327, Positive conditional cache size: 312, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 328, Positive conditional cache size: 313, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 329, Positive conditional cache size: 314, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 330, Positive conditional cache size: 315, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 331, Positive cache size: 331, Positive conditional cache size: 316, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 332, Positive cache size: 332, Positive conditional cache size: 317, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 333, Positive conditional cache size: 318, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 334, Positive conditional cache size: 319, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 335, Positive conditional cache size: 320, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 336, Positive conditional cache size: 321, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 337, Positive cache size: 337, Positive conditional cache size: 322, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 338, Positive cache size: 338, Positive conditional cache size: 323, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 339, Positive conditional cache size: 324, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 340, Positive conditional cache size: 325, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 341, Positive cache size: 341, Positive conditional cache size: 326, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 342, Positive conditional cache size: 327, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 343, Positive cache size: 343, Positive conditional cache size: 328, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 344, Positive cache size: 344, Positive conditional cache size: 329, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 345, Positive cache size: 345, Positive conditional cache size: 330, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 346, Positive cache size: 346, Positive conditional cache size: 331, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 347, Positive conditional cache size: 332, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 348, Positive conditional cache size: 333, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 349, Positive cache size: 349, Positive conditional cache size: 334, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 350, Positive cache size: 350, Positive conditional cache size: 335, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 351, Positive cache size: 351, Positive conditional cache size: 336, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 352, Positive cache size: 352, Positive conditional cache size: 337, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 353, Positive conditional cache size: 338, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 354, Positive conditional cache size: 339, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 355, Positive cache size: 355, Positive conditional cache size: 340, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 356, Positive cache size: 356, Positive conditional cache size: 341, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 357, Positive cache size: 357, Positive conditional cache size: 342, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 358, Positive cache size: 358, Positive conditional cache size: 343, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 359, Positive cache size: 359, Positive conditional cache size: 344, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 360, Positive conditional cache size: 345, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 361, Positive conditional cache size: 346, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 362, Positive cache size: 362, Positive conditional cache size: 347, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 363, Positive cache size: 363, Positive conditional cache size: 348, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 364, Positive conditional cache size: 349, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 365, Positive cache size: 365, Positive conditional cache size: 350, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 366, Positive cache size: 366, Positive conditional cache size: 351, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 367, Positive cache size: 367, Positive conditional cache size: 352, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 368, Positive cache size: 368, Positive conditional cache size: 353, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 369, Positive cache size: 369, Positive conditional cache size: 354, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 370, Positive cache size: 370, Positive conditional cache size: 355, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 371, Positive cache size: 371, Positive conditional cache size: 356, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 372, Positive conditional cache size: 357, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 373, Positive conditional cache size: 358, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 374, Positive cache size: 374, Positive conditional cache size: 359, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 375, Positive cache size: 375, Positive conditional cache size: 360, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 376, Positive conditional cache size: 361, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 377, Positive cache size: 377, Positive conditional cache size: 362, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 378, Positive conditional cache size: 363, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 379, Positive cache size: 379, Positive conditional cache size: 364, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 380, Positive conditional cache size: 365, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 381, Positive cache size: 381, Positive conditional cache size: 366, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 382, Positive cache size: 382, Positive conditional cache size: 367, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 383, Positive conditional cache size: 368, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 384, Positive conditional cache size: 369, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 385, Positive cache size: 385, Positive conditional cache size: 370, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 386, Positive conditional cache size: 371, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 387, Positive cache size: 387, Positive conditional cache size: 372, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 388, Positive conditional cache size: 373, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 389, Positive cache size: 389, Positive conditional cache size: 374, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 390, Positive conditional cache size: 375, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 391, Positive cache size: 391, Positive conditional cache size: 376, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 392, Positive cache size: 392, Positive conditional cache size: 377, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 393, Positive cache size: 393, Positive conditional cache size: 378, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 394, Positive conditional cache size: 379, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 395, Positive cache size: 395, Positive conditional cache size: 380, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 396, Positive conditional cache size: 381, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 397, Positive cache size: 397, Positive conditional cache size: 382, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 398, Positive conditional cache size: 383, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 399, Positive cache size: 399, Positive conditional cache size: 384, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 400, Positive cache size: 400, Positive conditional cache size: 385, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 401, Positive conditional cache size: 386, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 402, Positive conditional cache size: 387, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 403, Positive conditional cache size: 388, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 404, Positive conditional cache size: 389, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 405, Positive conditional cache size: 390, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 406, Positive conditional cache size: 391, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 407, Positive cache size: 407, Positive conditional cache size: 392, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 408, Positive cache size: 408, Positive conditional cache size: 393, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 409, Positive cache size: 409, Positive conditional cache size: 394, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 410, Positive cache size: 410, Positive conditional cache size: 395, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 411, Positive cache size: 411, Positive conditional cache size: 396, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 412, Positive conditional cache size: 397, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 413, Positive cache size: 413, Positive conditional cache size: 398, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 414, Positive conditional cache size: 399, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 415, Positive cache size: 415, Positive conditional cache size: 400, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 416, Positive cache size: 416, Positive conditional cache size: 401, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 417, Positive cache size: 417, Positive conditional cache size: 402, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 418, Positive cache size: 418, Positive conditional cache size: 403, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 419, Positive conditional cache size: 404, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 420, Positive conditional cache size: 405, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 421, Positive cache size: 421, Positive conditional cache size: 406, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 422, Positive conditional cache size: 407, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 423, Positive cache size: 423, Positive conditional cache size: 408, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 424, Positive cache size: 424, Positive conditional cache size: 409, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 425, Positive cache size: 425, Positive conditional cache size: 410, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 426, Positive cache size: 426, Positive conditional cache size: 411, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 427, Positive cache size: 427, Positive conditional cache size: 412, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 428, Positive cache size: 428, Positive conditional cache size: 413, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 429, Positive cache size: 429, Positive conditional cache size: 414, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 430, Positive cache size: 430, Positive conditional cache size: 415, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 431, Positive conditional cache size: 416, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 432, Positive cache size: 432, Positive conditional cache size: 417, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 433, Positive cache size: 433, Positive conditional cache size: 418, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 434, Positive cache size: 434, Positive conditional cache size: 419, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 435, Positive conditional cache size: 420, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 436, Positive cache size: 436, Positive conditional cache size: 421, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 437, Positive cache size: 437, Positive conditional cache size: 422, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 438, Positive conditional cache size: 423, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 439, Positive conditional cache size: 424, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 440, Positive cache size: 440, Positive conditional cache size: 425, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 441, Positive cache size: 441, Positive conditional cache size: 426, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 442, Positive cache size: 442, Positive conditional cache size: 427, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 443, Positive conditional cache size: 428, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 444, Positive cache size: 444, Positive conditional cache size: 429, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 445, Positive conditional cache size: 430, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 446, Positive cache size: 446, Positive conditional cache size: 431, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 447, Positive cache size: 447, Positive conditional cache size: 432, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 448, Positive conditional cache size: 433, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 449, Positive cache size: 449, Positive conditional cache size: 434, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 450, Positive cache size: 450, Positive conditional cache size: 435, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 451, Positive cache size: 451, Positive conditional cache size: 436, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 452, Positive cache size: 452, Positive conditional cache size: 437, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 453, Positive cache size: 453, Positive conditional cache size: 438, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 454, Positive cache size: 454, Positive conditional cache size: 439, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 455, Positive cache size: 455, Positive conditional cache size: 440, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 456, Positive cache size: 456, Positive conditional cache size: 441, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 457, Positive cache size: 457, Positive conditional cache size: 442, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 458, Positive cache size: 458, Positive conditional cache size: 443, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 459, Positive cache size: 459, Positive conditional cache size: 444, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 460, Positive conditional cache size: 445, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 461, Positive cache size: 461, Positive conditional cache size: 446, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 462, Positive conditional cache size: 447, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 463, Positive cache size: 463, Positive conditional cache size: 448, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 464, Positive conditional cache size: 449, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 465, Positive cache size: 465, Positive conditional cache size: 450, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 466, Positive cache size: 466, Positive conditional cache size: 451, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 467, Positive cache size: 467, Positive conditional cache size: 452, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 468, Positive cache size: 468, Positive conditional cache size: 453, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 469, Positive conditional cache size: 454, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 470, Positive cache size: 470, Positive conditional cache size: 455, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 471, Positive cache size: 471, Positive conditional cache size: 456, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 472, Positive cache size: 472, Positive conditional cache size: 457, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 473, Positive cache size: 473, Positive conditional cache size: 458, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 474, Positive cache size: 474, Positive conditional cache size: 459, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 475, Positive cache size: 475, Positive conditional cache size: 460, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 476, Positive cache size: 476, Positive conditional cache size: 461, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 477, Positive cache size: 477, Positive conditional cache size: 462, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 478, Positive conditional cache size: 463, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 479, Positive cache size: 479, Positive conditional cache size: 464, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 480, Positive conditional cache size: 465, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 481, Positive cache size: 481, Positive conditional cache size: 466, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 482, Positive cache size: 482, Positive conditional cache size: 467, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 483, Positive conditional cache size: 468, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 484, Positive cache size: 484, Positive conditional cache size: 469, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 485, Positive cache size: 485, Positive conditional cache size: 470, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 486, Positive cache size: 486, Positive conditional cache size: 471, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 487, Positive cache size: 487, Positive conditional cache size: 472, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 488, Positive cache size: 488, Positive conditional cache size: 473, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 489, Positive conditional cache size: 474, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 490, Positive cache size: 490, Positive conditional cache size: 475, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 491, Positive cache size: 491, Positive conditional cache size: 476, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 492, Positive cache size: 492, Positive conditional cache size: 477, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 493, Positive cache size: 493, Positive conditional cache size: 478, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 494, Positive conditional cache size: 479, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 495, Positive cache size: 495, Positive conditional cache size: 480, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 496, Positive cache size: 496, Positive conditional cache size: 481, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 497, Positive conditional cache size: 482, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 498, Positive cache size: 498, Positive conditional cache size: 483, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 499, Positive cache size: 499, Positive conditional cache size: 484, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 500, Positive cache size: 500, Positive conditional cache size: 485, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 501, Positive cache size: 501, Positive conditional cache size: 486, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 502, Positive cache size: 502, Positive conditional cache size: 487, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 503, Positive conditional cache size: 488, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 504, Positive cache size: 504, Positive conditional cache size: 489, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 505, Positive cache size: 505, Positive conditional cache size: 490, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 506, Positive cache size: 506, Positive conditional cache size: 491, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 507, Positive cache size: 507, Positive conditional cache size: 492, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 508, Positive cache size: 508, Positive conditional cache size: 493, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 509, Positive cache size: 509, Positive conditional cache size: 494, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 510, Positive cache size: 510, Positive conditional cache size: 495, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 511, Positive conditional cache size: 496, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 512, Positive cache size: 512, Positive conditional cache size: 497, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 513, Positive cache size: 513, Positive conditional cache size: 498, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 514, Positive cache size: 514, Positive conditional cache size: 499, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 515, Positive cache size: 515, Positive conditional cache size: 500, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 516, Positive cache size: 516, Positive conditional cache size: 501, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 517, Positive cache size: 517, Positive conditional cache size: 502, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 518, Positive cache size: 518, Positive conditional cache size: 503, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 519, Positive cache size: 519, Positive conditional cache size: 504, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 520, Positive cache size: 520, Positive conditional cache size: 505, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 521, Positive cache size: 521, Positive conditional cache size: 506, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 522, Positive cache size: 522, Positive conditional cache size: 507, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 523, Positive cache size: 523, Positive conditional cache size: 508, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 524, Positive cache size: 524, Positive conditional cache size: 509, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 525, Positive cache size: 525, Positive conditional cache size: 510, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 526, Positive cache size: 526, Positive conditional cache size: 511, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 527, Positive cache size: 527, Positive conditional cache size: 512, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 528, Positive cache size: 528, Positive conditional cache size: 513, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 529, Positive conditional cache size: 514, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 530, Positive cache size: 530, Positive conditional cache size: 515, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 531, Positive cache size: 531, Positive conditional cache size: 516, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 532, Positive cache size: 532, Positive conditional cache size: 517, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 533, Positive cache size: 533, Positive conditional cache size: 518, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 534, Positive cache size: 534, Positive conditional cache size: 519, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 535, Positive cache size: 535, Positive conditional cache size: 520, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 536, Positive cache size: 536, Positive conditional cache size: 521, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 537, Positive cache size: 537, Positive conditional cache size: 522, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 538, Positive cache size: 538, Positive conditional cache size: 523, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 539, Positive cache size: 539, Positive conditional cache size: 524, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 540, Positive cache size: 540, Positive conditional cache size: 525, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 541, Positive cache size: 541, Positive conditional cache size: 526, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 542, Positive conditional cache size: 527, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 543, Positive cache size: 543, Positive conditional cache size: 528, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 544, Positive cache size: 544, Positive conditional cache size: 529, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 545, Positive cache size: 545, Positive conditional cache size: 530, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 546, Positive cache size: 546, Positive conditional cache size: 531, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 547, Positive cache size: 547, Positive conditional cache size: 532, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 548, Positive cache size: 548, Positive conditional cache size: 533, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 549, Positive cache size: 549, Positive conditional cache size: 534, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 550, Positive conditional cache size: 535, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 551, Positive cache size: 551, Positive conditional cache size: 536, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 552, Positive cache size: 552, Positive conditional cache size: 537, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 553, Positive cache size: 553, Positive conditional cache size: 538, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 554, Positive cache size: 554, Positive conditional cache size: 539, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 555, Positive cache size: 555, Positive conditional cache size: 540, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 556, Positive cache size: 556, Positive conditional cache size: 541, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 557, Positive cache size: 557, Positive conditional cache size: 542, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 558, Positive cache size: 558, Positive conditional cache size: 543, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 559, Positive cache size: 559, Positive conditional cache size: 544, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 560, Positive cache size: 560, Positive conditional cache size: 545, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 561, Positive cache size: 561, Positive conditional cache size: 546, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 562, Positive cache size: 562, Positive conditional cache size: 547, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 563, Positive cache size: 563, Positive conditional cache size: 548, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 564, Positive cache size: 564, Positive conditional cache size: 549, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 565, Positive cache size: 565, Positive conditional cache size: 550, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 566, Positive cache size: 566, Positive conditional cache size: 551, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 567, Positive cache size: 567, Positive conditional cache size: 552, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 568, Positive conditional cache size: 553, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 569, Positive cache size: 569, Positive conditional cache size: 554, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 570, Positive cache size: 570, Positive conditional cache size: 555, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 571, Positive cache size: 571, Positive conditional cache size: 556, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 572, Positive cache size: 572, Positive conditional cache size: 557, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 573, Positive cache size: 573, Positive conditional cache size: 558, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 574, Positive cache size: 574, Positive conditional cache size: 559, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 575, Positive cache size: 575, Positive conditional cache size: 560, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 576, Positive cache size: 576, Positive conditional cache size: 561, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 577, Positive cache size: 577, Positive conditional cache size: 562, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 578, Positive cache size: 578, Positive conditional cache size: 563, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 579, Positive cache size: 579, Positive conditional cache size: 564, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 580, Positive cache size: 580, Positive conditional cache size: 565, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 581, Positive cache size: 581, Positive conditional cache size: 566, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 582, Positive cache size: 582, Positive conditional cache size: 567, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 583, Positive cache size: 583, Positive conditional cache size: 568, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 584, Positive cache size: 584, Positive conditional cache size: 569, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 585, Positive cache size: 585, Positive conditional cache size: 570, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 586, Positive cache size: 586, Positive conditional cache size: 571, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 587, Positive cache size: 587, Positive conditional cache size: 572, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 588, Positive cache size: 588, Positive conditional cache size: 573, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 589, Positive cache size: 589, Positive conditional cache size: 574, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 590, Positive cache size: 590, Positive conditional cache size: 575, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 591, Positive cache size: 591, Positive conditional cache size: 576, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 592, Positive cache size: 592, Positive conditional cache size: 577, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 593, Positive cache size: 593, Positive conditional cache size: 578, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 594, Positive cache size: 594, Positive conditional cache size: 579, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 595, Positive cache size: 595, Positive conditional cache size: 580, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 596, Positive cache size: 596, Positive conditional cache size: 581, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 597, Positive cache size: 597, Positive conditional cache size: 582, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 598, Positive cache size: 598, Positive conditional cache size: 583, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 599, Positive cache size: 599, Positive conditional cache size: 584, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 600, Positive cache size: 600, Positive conditional cache size: 585, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 601, Positive cache size: 601, Positive conditional cache size: 586, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 602, Positive cache size: 602, Positive conditional cache size: 587, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 603, Positive conditional cache size: 588, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 604, Positive cache size: 604, Positive conditional cache size: 589, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 605, Positive cache size: 605, Positive conditional cache size: 590, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 606, Positive cache size: 606, Positive conditional cache size: 591, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 607, Positive cache size: 607, Positive conditional cache size: 592, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 608, Positive cache size: 608, Positive conditional cache size: 593, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 609, Positive cache size: 609, Positive conditional cache size: 594, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 610, Positive cache size: 610, Positive conditional cache size: 595, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 611, Positive cache size: 611, Positive conditional cache size: 596, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 612, Positive cache size: 612, Positive conditional cache size: 597, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 613, Positive cache size: 613, Positive conditional cache size: 598, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 614, Positive cache size: 614, Positive conditional cache size: 599, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 615, Positive cache size: 615, Positive conditional cache size: 600, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 616, Positive cache size: 616, Positive conditional cache size: 601, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 617, Positive cache size: 617, Positive conditional cache size: 602, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 618, Positive cache size: 618, Positive conditional cache size: 603, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 619, Positive cache size: 619, Positive conditional cache size: 604, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 620, Positive cache size: 620, Positive conditional cache size: 605, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 621, Positive cache size: 621, Positive conditional cache size: 606, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 622, Positive cache size: 622, Positive conditional cache size: 607, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 623, Positive cache size: 623, Positive conditional cache size: 608, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 624, Positive cache size: 624, Positive conditional cache size: 609, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 625, Positive cache size: 625, Positive conditional cache size: 610, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 626, Positive cache size: 626, Positive conditional cache size: 611, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 627, Positive cache size: 627, Positive conditional cache size: 612, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 628, Positive cache size: 628, Positive conditional cache size: 613, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 629, Positive cache size: 629, Positive conditional cache size: 614, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 630, Positive cache size: 630, Positive conditional cache size: 615, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 631, Positive cache size: 631, Positive conditional cache size: 616, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 632, Positive conditional cache size: 617, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 633, Positive cache size: 633, Positive conditional cache size: 618, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 634, Positive cache size: 634, Positive conditional cache size: 619, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 635, Positive cache size: 635, Positive conditional cache size: 620, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 636, Positive cache size: 636, Positive conditional cache size: 621, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 637, Positive cache size: 637, Positive conditional cache size: 622, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 638, Positive cache size: 638, Positive conditional cache size: 623, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 639, Positive cache size: 639, Positive conditional cache size: 624, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 640, Positive conditional cache size: 625, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 641, Positive cache size: 641, Positive conditional cache size: 626, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 642, Positive cache size: 642, Positive conditional cache size: 627, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 643, Positive cache size: 643, Positive conditional cache size: 628, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 644, Positive cache size: 644, Positive conditional cache size: 629, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 645, Positive cache size: 645, Positive conditional cache size: 630, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 646, Positive cache size: 646, Positive conditional cache size: 631, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 647, Positive cache size: 647, Positive conditional cache size: 632, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 648, Positive cache size: 648, Positive conditional cache size: 633, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 649, Positive cache size: 649, Positive conditional cache size: 634, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 650, Positive cache size: 650, Positive conditional cache size: 635, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 651, Positive cache size: 651, Positive conditional cache size: 636, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 652, Positive cache size: 652, Positive conditional cache size: 637, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 653, Positive cache size: 653, Positive conditional cache size: 638, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 654, Positive cache size: 654, Positive conditional cache size: 639, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 655, Positive cache size: 655, Positive conditional cache size: 640, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 656, Positive cache size: 656, Positive conditional cache size: 641, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 657, Positive cache size: 657, Positive conditional cache size: 642, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 658, Positive cache size: 658, Positive conditional cache size: 643, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 659, Positive cache size: 659, Positive conditional cache size: 644, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 660, Positive cache size: 660, Positive conditional cache size: 645, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 661, Positive cache size: 661, Positive conditional cache size: 646, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 662, Positive cache size: 662, Positive conditional cache size: 647, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 663, Positive cache size: 663, Positive conditional cache size: 648, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 664, Positive cache size: 664, Positive conditional cache size: 649, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 665, Positive cache size: 665, Positive conditional cache size: 650, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 666, Positive cache size: 666, Positive conditional cache size: 651, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 667, Positive cache size: 667, Positive conditional cache size: 652, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 668, Positive cache size: 668, Positive conditional cache size: 653, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 669, Positive conditional cache size: 654, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 670, Positive cache size: 670, Positive conditional cache size: 655, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 671, Positive cache size: 671, Positive conditional cache size: 656, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 672, Positive cache size: 672, Positive conditional cache size: 657, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 673, Positive cache size: 673, Positive conditional cache size: 658, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 674, Positive cache size: 674, Positive conditional cache size: 659, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 675, Positive cache size: 675, Positive conditional cache size: 660, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 676, Positive cache size: 676, Positive conditional cache size: 661, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 677, Positive cache size: 677, Positive conditional cache size: 662, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 678, Positive cache size: 678, Positive conditional cache size: 663, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 679, Positive cache size: 679, Positive conditional cache size: 664, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 680, Positive cache size: 680, Positive conditional cache size: 665, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 681, Positive cache size: 681, Positive conditional cache size: 666, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 682, Positive cache size: 682, Positive conditional cache size: 667, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 683, Positive cache size: 683, Positive conditional cache size: 668, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 684, Positive cache size: 684, Positive conditional cache size: 669, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 685, Positive cache size: 685, Positive conditional cache size: 670, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 686, Positive cache size: 686, Positive conditional cache size: 671, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 687, Positive cache size: 687, Positive conditional cache size: 672, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 688, Positive cache size: 688, Positive conditional cache size: 673, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 689, Positive cache size: 689, Positive conditional cache size: 674, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 690, Positive cache size: 690, Positive conditional cache size: 675, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 691, Positive cache size: 691, Positive conditional cache size: 676, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 692, Positive cache size: 692, Positive conditional cache size: 677, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 693, Positive cache size: 693, Positive conditional cache size: 678, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 694, Positive cache size: 694, Positive conditional cache size: 679, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 695, Positive cache size: 695, Positive conditional cache size: 680, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 696, Positive cache size: 696, Positive conditional cache size: 681, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 697, Positive cache size: 697, Positive conditional cache size: 682, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 698, Positive cache size: 698, Positive conditional cache size: 683, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 699, Positive cache size: 699, Positive conditional cache size: 684, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 700, Positive cache size: 700, Positive conditional cache size: 685, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 701, Positive cache size: 701, Positive conditional cache size: 686, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 702, Positive cache size: 702, Positive conditional cache size: 687, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 703, Positive cache size: 703, Positive conditional cache size: 688, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 704, Positive cache size: 704, Positive conditional cache size: 689, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 705, Positive cache size: 705, Positive conditional cache size: 690, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 706, Positive cache size: 706, Positive conditional cache size: 691, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 707, Positive cache size: 707, Positive conditional cache size: 692, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 708, Positive cache size: 708, Positive conditional cache size: 693, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 709, Positive cache size: 709, Positive conditional cache size: 694, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 710, Positive cache size: 710, Positive conditional cache size: 695, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 711, Positive conditional cache size: 696, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 712, Positive cache size: 712, Positive conditional cache size: 697, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 713, Positive cache size: 713, Positive conditional cache size: 698, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 714, Positive cache size: 714, Positive conditional cache size: 699, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 715, Positive cache size: 715, Positive conditional cache size: 700, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 716, Positive cache size: 716, Positive conditional cache size: 701, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 717, Positive cache size: 717, Positive conditional cache size: 702, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 718, Positive cache size: 718, Positive conditional cache size: 703, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 719, Positive cache size: 719, Positive conditional cache size: 704, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 720, Positive cache size: 720, Positive conditional cache size: 705, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 721, Positive cache size: 721, Positive conditional cache size: 706, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 722, Positive cache size: 722, Positive conditional cache size: 707, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 723, Positive cache size: 723, Positive conditional cache size: 708, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 724, Positive cache size: 724, Positive conditional cache size: 709, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 725, Positive cache size: 725, Positive conditional cache size: 710, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 726, Positive cache size: 726, Positive conditional cache size: 711, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 727, Positive cache size: 727, Positive conditional cache size: 712, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 728, Positive cache size: 728, Positive conditional cache size: 713, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 729, Positive cache size: 729, Positive conditional cache size: 714, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 730, Positive cache size: 730, Positive conditional cache size: 715, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 731, Positive cache size: 731, Positive conditional cache size: 716, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 732, Positive cache size: 732, Positive conditional cache size: 717, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 733, Positive cache size: 733, Positive conditional cache size: 718, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 734, Positive cache size: 734, Positive conditional cache size: 719, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 735, Positive cache size: 735, Positive conditional cache size: 720, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 736, Positive cache size: 736, Positive conditional cache size: 721, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 737, Positive cache size: 737, Positive conditional cache size: 722, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 738, Positive cache size: 738, Positive conditional cache size: 723, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 739, Positive cache size: 739, Positive conditional cache size: 724, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 740, Positive cache size: 740, Positive conditional cache size: 725, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 741, Positive cache size: 741, Positive conditional cache size: 726, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 742, Positive cache size: 742, Positive conditional cache size: 727, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 743, Positive cache size: 743, Positive conditional cache size: 728, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 744, Positive cache size: 744, Positive conditional cache size: 729, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 745, Positive cache size: 745, Positive conditional cache size: 730, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 746, Positive cache size: 746, Positive conditional cache size: 731, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 747, Positive cache size: 747, Positive conditional cache size: 732, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 748, Positive cache size: 748, Positive conditional cache size: 733, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 749, Positive cache size: 749, Positive conditional cache size: 734, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 750, Positive conditional cache size: 735, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 751, Positive cache size: 751, Positive conditional cache size: 736, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 752, Positive cache size: 752, Positive conditional cache size: 737, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 753, Positive cache size: 753, Positive conditional cache size: 738, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 754, Positive cache size: 754, Positive conditional cache size: 739, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 755, Positive cache size: 755, Positive conditional cache size: 740, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 756, Positive cache size: 756, Positive conditional cache size: 741, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 757, Positive cache size: 757, Positive conditional cache size: 742, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 758, Positive cache size: 758, Positive conditional cache size: 743, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 759, Positive cache size: 759, Positive conditional cache size: 744, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 760, Positive cache size: 760, Positive conditional cache size: 745, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 761, Positive cache size: 761, Positive conditional cache size: 746, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 762, Positive cache size: 762, Positive conditional cache size: 747, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 763, Positive cache size: 763, Positive conditional cache size: 748, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 764, Positive cache size: 764, Positive conditional cache size: 749, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 765, Positive cache size: 765, Positive conditional cache size: 750, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 766, Positive cache size: 766, Positive conditional cache size: 751, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 767, Positive cache size: 767, Positive conditional cache size: 752, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 768, Positive cache size: 768, Positive conditional cache size: 753, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 769, Positive cache size: 769, Positive conditional cache size: 754, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 770, Positive cache size: 770, Positive conditional cache size: 755, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 771, Positive cache size: 771, Positive conditional cache size: 756, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 772, Positive cache size: 772, Positive conditional cache size: 757, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 773, Positive cache size: 773, Positive conditional cache size: 758, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 774, Positive cache size: 774, Positive conditional cache size: 759, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 775, Positive cache size: 775, Positive conditional cache size: 760, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 776, Positive cache size: 776, Positive conditional cache size: 761, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 777, Positive cache size: 777, Positive conditional cache size: 762, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 778, Positive cache size: 778, Positive conditional cache size: 763, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 779, Positive cache size: 779, Positive conditional cache size: 764, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 780, Positive cache size: 780, Positive conditional cache size: 765, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 781, Positive cache size: 781, Positive conditional cache size: 766, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 782, Positive cache size: 782, Positive conditional cache size: 767, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 783, Positive cache size: 783, Positive conditional cache size: 768, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 784, Positive cache size: 784, Positive conditional cache size: 769, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 785, Positive cache size: 785, Positive conditional cache size: 770, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 786, Positive cache size: 786, Positive conditional cache size: 771, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 787, Positive cache size: 787, Positive conditional cache size: 772, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 788, Positive cache size: 788, Positive conditional cache size: 773, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 789, Positive cache size: 789, Positive conditional cache size: 774, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 790, Positive cache size: 790, Positive conditional cache size: 775, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 791, Positive cache size: 791, Positive conditional cache size: 776, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 792, Positive cache size: 792, Positive conditional cache size: 777, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 793, Positive cache size: 793, Positive conditional cache size: 778, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 794, Positive cache size: 794, Positive conditional cache size: 779, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 795, Positive cache size: 795, Positive conditional cache size: 780, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 796, Positive cache size: 796, Positive conditional cache size: 781, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 797, Positive cache size: 797, Positive conditional cache size: 782, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 798, Positive conditional cache size: 783, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 799, Positive cache size: 799, Positive conditional cache size: 784, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 800, Positive cache size: 800, Positive conditional cache size: 785, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 801, Positive cache size: 801, Positive conditional cache size: 786, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 802, Positive cache size: 802, Positive conditional cache size: 787, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 803, Positive cache size: 803, Positive conditional cache size: 788, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 804, Positive cache size: 804, Positive conditional cache size: 789, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 805, Positive cache size: 805, Positive conditional cache size: 790, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 806, Positive cache size: 806, Positive conditional cache size: 791, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 807, Positive cache size: 807, Positive conditional cache size: 792, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 808, Positive cache size: 808, Positive conditional cache size: 793, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 809, Positive cache size: 809, Positive conditional cache size: 794, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 810, Positive cache size: 810, Positive conditional cache size: 795, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 811, Positive cache size: 811, Positive conditional cache size: 796, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 812, Positive cache size: 812, Positive conditional cache size: 797, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 813, Positive cache size: 813, Positive conditional cache size: 798, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 814, Positive cache size: 814, Positive conditional cache size: 799, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 815, Positive cache size: 815, Positive conditional cache size: 800, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 816, Positive cache size: 816, Positive conditional cache size: 801, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 817, Positive cache size: 817, Positive conditional cache size: 802, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 818, Positive cache size: 818, Positive conditional cache size: 803, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 819, Positive cache size: 819, Positive conditional cache size: 804, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 820, Positive cache size: 820, Positive conditional cache size: 805, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 821, Positive cache size: 821, Positive conditional cache size: 806, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 822, Positive cache size: 822, Positive conditional cache size: 807, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 823, Positive cache size: 823, Positive conditional cache size: 808, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 824, Positive cache size: 824, Positive conditional cache size: 809, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 825, Positive cache size: 825, Positive conditional cache size: 810, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 826, Positive cache size: 826, Positive conditional cache size: 811, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 827, Positive cache size: 827, Positive conditional cache size: 812, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 828, Positive cache size: 828, Positive conditional cache size: 813, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 829, Positive cache size: 829, Positive conditional cache size: 814, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 830, Positive cache size: 830, Positive conditional cache size: 815, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 831, Positive cache size: 831, Positive conditional cache size: 816, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 832, Positive cache size: 832, Positive conditional cache size: 817, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 833, Positive cache size: 833, Positive conditional cache size: 818, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 834, Positive cache size: 834, Positive conditional cache size: 819, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 835, Positive cache size: 835, Positive conditional cache size: 820, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown 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, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 836, Positive cache size: 836, Positive conditional cache size: 821, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 837, Positive cache size: 837, Positive conditional cache size: 822, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 838, Positive cache size: 838, Positive conditional cache size: 823, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 839, Positive cache size: 839, Positive conditional cache size: 824, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 840, Positive cache size: 840, Positive conditional cache size: 825, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 841, Positive cache size: 841, Positive conditional cache size: 826, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 842, Positive cache size: 842, Positive conditional cache size: 827, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 843, Positive cache size: 843, Positive conditional cache size: 828, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 844, Positive cache size: 844, Positive conditional cache size: 829, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 845, Positive cache size: 845, Positive conditional cache size: 830, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 846, Positive cache size: 846, Positive conditional cache size: 831, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 847, Positive cache size: 847, Positive conditional cache size: 832, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 848, Positive cache size: 848, Positive conditional cache size: 833, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 849, Positive cache size: 849, Positive conditional cache size: 834, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 850, Positive cache size: 850, Positive conditional cache size: 835, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 851, Positive cache size: 851, Positive conditional cache size: 836, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 852, Positive cache size: 852, Positive conditional cache size: 837, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 853, Positive cache size: 853, Positive conditional cache size: 838, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 854, Positive cache size: 854, Positive conditional cache size: 839, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 855, Positive cache size: 855, Positive conditional cache size: 840, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 856, Positive cache size: 856, Positive conditional cache size: 841, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 857, Positive cache size: 857, Positive conditional cache size: 842, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 858, Positive cache size: 858, Positive conditional cache size: 843, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 859, Positive cache size: 859, Positive conditional cache size: 844, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 860, Positive cache size: 860, Positive conditional cache size: 845, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 861, Positive cache size: 861, Positive conditional cache size: 846, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 862, Positive cache size: 862, Positive conditional cache size: 847, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 863, Positive cache size: 863, Positive conditional cache size: 848, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 864, Positive cache size: 864, Positive conditional cache size: 849, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 865, Positive cache size: 865, Positive conditional cache size: 850, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 866, Positive cache size: 866, Positive conditional cache size: 851, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 867, Positive cache size: 867, Positive conditional cache size: 852, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 868, Positive cache size: 868, Positive conditional cache size: 853, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 869, Positive cache size: 869, Positive conditional cache size: 854, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 870, Positive cache size: 870, Positive conditional cache size: 855, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 871, Positive cache size: 871, Positive conditional cache size: 856, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 872, Positive cache size: 872, Positive conditional cache size: 857, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 873, Positive cache size: 873, Positive conditional cache size: 858, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 874, Positive cache size: 874, Positive conditional cache size: 859, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 875, Positive cache size: 875, Positive conditional cache size: 860, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 876, Positive cache size: 876, Positive conditional cache size: 861, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 877, Positive cache size: 877, Positive conditional cache size: 862, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 878, Positive cache size: 878, Positive conditional cache size: 863, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 879, Positive cache size: 879, Positive conditional cache size: 864, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 880, Positive cache size: 880, Positive conditional cache size: 865, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 881, Positive cache size: 881, Positive conditional cache size: 866, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 882, Positive cache size: 882, Positive conditional cache size: 867, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 883, Positive cache size: 883, Positive conditional cache size: 868, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 884, Positive cache size: 884, Positive conditional cache size: 869, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 885, Positive cache size: 885, Positive conditional cache size: 870, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 886, Positive cache size: 886, Positive conditional cache size: 871, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 887, Positive cache size: 887, Positive conditional cache size: 872, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 888, Positive cache size: 888, Positive conditional cache size: 873, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 889, Positive cache size: 889, Positive conditional cache size: 874, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 890, Positive cache size: 890, Positive conditional cache size: 875, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 891, Positive cache size: 891, Positive conditional cache size: 876, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 892, Positive cache size: 892, Positive conditional cache size: 877, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 893, Positive cache size: 893, Positive conditional cache size: 878, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 894, Positive cache size: 894, Positive conditional cache size: 879, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 895, Positive cache size: 895, Positive conditional cache size: 880, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 896, Positive cache size: 896, Positive conditional cache size: 881, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 897, Positive cache size: 897, Positive conditional cache size: 882, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 898, Positive cache size: 898, Positive conditional cache size: 883, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 899, Positive cache size: 899, Positive conditional cache size: 884, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 900, Positive cache size: 900, Positive conditional cache size: 885, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 901, Positive cache size: 901, Positive conditional cache size: 886, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 902, Positive cache size: 902, Positive conditional cache size: 887, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 903, Positive cache size: 903, Positive conditional cache size: 888, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 904, Positive cache size: 904, Positive conditional cache size: 889, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 905, Positive cache size: 905, Positive conditional cache size: 890, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 906, Positive cache size: 906, Positive conditional cache size: 891, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 907, Positive cache size: 907, Positive conditional cache size: 892, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 908, Positive cache size: 908, Positive conditional cache size: 893, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 909, Positive cache size: 909, Positive conditional cache size: 894, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 910, Positive cache size: 910, Positive conditional cache size: 895, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 911, Positive cache size: 911, Positive conditional cache size: 896, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 912, Positive cache size: 912, Positive conditional cache size: 897, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 913, Positive cache size: 913, Positive conditional cache size: 898, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 914, Positive cache size: 914, Positive conditional cache size: 899, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 915, Positive cache size: 915, Positive conditional cache size: 900, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 916, Positive cache size: 916, Positive conditional cache size: 901, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 917, Positive cache size: 917, Positive conditional cache size: 902, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 918, Positive cache size: 918, Positive conditional cache size: 903, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 919, Positive cache size: 919, Positive conditional cache size: 904, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 920, Positive cache size: 920, Positive conditional cache size: 905, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 921, Positive cache size: 921, Positive conditional cache size: 906, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 922, Positive cache size: 922, Positive conditional cache size: 907, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 923, Positive cache size: 923, Positive conditional cache size: 908, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 924, Positive cache size: 924, Positive conditional cache size: 909, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 925, Positive cache size: 925, Positive conditional cache size: 910, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 926, Positive cache size: 926, Positive conditional cache size: 911, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 927, Positive cache size: 927, Positive conditional cache size: 912, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 928, Positive cache size: 928, Positive conditional cache size: 913, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 929, Positive cache size: 929, Positive conditional cache size: 914, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 930, Positive cache size: 930, Positive conditional cache size: 915, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 931, Positive cache size: 931, Positive conditional cache size: 916, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 932, Positive cache size: 932, Positive conditional cache size: 917, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 933, Positive cache size: 933, Positive conditional cache size: 918, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 934, Positive cache size: 934, Positive conditional cache size: 919, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 935, Positive cache size: 935, Positive conditional cache size: 920, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 936, Positive cache size: 936, Positive conditional cache size: 921, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 937, Positive cache size: 937, Positive conditional cache size: 922, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 938, Positive cache size: 938, Positive conditional cache size: 923, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 939, Positive cache size: 939, Positive conditional cache size: 924, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 940, Positive cache size: 940, Positive conditional cache size: 925, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 941, Positive cache size: 941, Positive conditional cache size: 926, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 942, Positive cache size: 942, Positive conditional cache size: 927, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 943, Positive cache size: 943, Positive conditional cache size: 928, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 944, Positive cache size: 944, Positive conditional cache size: 929, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 945, Positive cache size: 945, Positive conditional cache size: 930, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 946, Positive cache size: 946, Positive conditional cache size: 931, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 947, Positive cache size: 947, Positive conditional cache size: 932, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 948, Positive cache size: 948, Positive conditional cache size: 933, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 949, Positive cache size: 949, Positive conditional cache size: 934, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 950, Positive cache size: 950, Positive conditional cache size: 935, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 951, Positive cache size: 951, Positive conditional cache size: 936, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 952, Positive cache size: 952, Positive conditional cache size: 937, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 953, Positive cache size: 953, Positive conditional cache size: 938, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 954, Positive cache size: 954, Positive conditional cache size: 939, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 955, Positive cache size: 955, Positive conditional cache size: 940, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 956, Positive cache size: 956, Positive conditional cache size: 941, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 957, Positive cache size: 957, Positive conditional cache size: 942, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 958, Positive cache size: 958, Positive conditional cache size: 943, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 959, Positive cache size: 959, Positive conditional cache size: 944, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 960, Positive cache size: 960, Positive conditional cache size: 945, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 961, Positive cache size: 961, Positive conditional cache size: 946, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 962, Positive cache size: 962, Positive conditional cache size: 947, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 963, Positive cache size: 963, Positive conditional cache size: 948, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 964, Positive cache size: 964, Positive conditional cache size: 949, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 965, Positive cache size: 965, Positive conditional cache size: 950, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 966, Positive cache size: 966, Positive conditional cache size: 951, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 967, Positive cache size: 967, Positive conditional cache size: 952, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 968, Positive cache size: 968, Positive conditional cache size: 953, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 969, Positive cache size: 969, Positive conditional cache size: 954, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 970, Positive cache size: 970, Positive conditional cache size: 955, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 971, Positive cache size: 971, Positive conditional cache size: 956, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 972, Positive cache size: 972, Positive conditional cache size: 957, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 973, Positive cache size: 973, Positive conditional cache size: 958, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 974, Positive cache size: 974, Positive conditional cache size: 959, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 975, Positive cache size: 975, Positive conditional cache size: 960, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 976, Positive conditional cache size: 961, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 977, Positive cache size: 977, Positive conditional cache size: 962, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 978, Positive cache size: 978, Positive conditional cache size: 963, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 979, Positive cache size: 979, Positive conditional cache size: 964, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 980, Positive cache size: 980, Positive conditional cache size: 965, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 981, Positive cache size: 981, Positive conditional cache size: 966, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 982, Positive cache size: 982, Positive conditional cache size: 967, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 983, Positive cache size: 983, Positive conditional cache size: 968, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 984, Positive cache size: 984, Positive conditional cache size: 969, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 985, Positive cache size: 985, Positive conditional cache size: 970, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 986, Positive cache size: 986, Positive conditional cache size: 971, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 987, Positive cache size: 987, Positive conditional cache size: 972, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 988, Positive cache size: 988, Positive conditional cache size: 973, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 989, Positive cache size: 989, Positive conditional cache size: 974, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 990, Positive cache size: 990, Positive conditional cache size: 975, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 991, Positive cache size: 991, Positive conditional cache size: 976, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 992, Positive cache size: 992, Positive conditional cache size: 977, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 993, Positive cache size: 993, Positive conditional cache size: 978, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 994, Positive cache size: 994, Positive conditional cache size: 979, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 995, Positive cache size: 995, Positive conditional cache size: 980, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 996, Positive cache size: 996, Positive conditional cache size: 981, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 997, Positive cache size: 997, Positive conditional cache size: 982, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 998, Positive cache size: 998, Positive conditional cache size: 983, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 999, Positive cache size: 999, Positive conditional cache size: 984, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1000, Positive cache size: 1000, Positive conditional cache size: 985, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1001, Positive cache size: 1001, Positive conditional cache size: 986, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1002, Positive cache size: 1002, Positive conditional cache size: 987, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1003, Positive cache size: 1003, Positive conditional cache size: 988, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1004, Positive cache size: 1004, Positive conditional cache size: 989, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1005, Positive cache size: 1005, Positive conditional cache size: 990, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1006, Positive cache size: 1006, Positive conditional cache size: 991, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1007, Positive cache size: 1007, Positive conditional cache size: 992, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1008, Positive cache size: 1008, Positive conditional cache size: 993, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1009, Positive cache size: 1009, Positive conditional cache size: 994, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1010, Positive cache size: 1010, Positive conditional cache size: 995, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 1011, Positive conditional cache size: 996, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1012, Positive cache size: 1012, Positive conditional cache size: 997, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1013, Positive cache size: 1013, Positive conditional cache size: 998, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1014, Positive cache size: 1014, Positive conditional cache size: 999, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1015, Positive cache size: 1015, Positive conditional cache size: 1000, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1016, Positive cache size: 1016, Positive conditional cache size: 1001, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1017, Positive cache size: 1017, Positive conditional cache size: 1002, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1018, Positive cache size: 1018, Positive conditional cache size: 1003, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1019, Positive cache size: 1019, Positive conditional cache size: 1004, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1020, Positive cache size: 1020, Positive conditional cache size: 1005, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1021, Positive cache size: 1021, Positive conditional cache size: 1006, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1022, Positive cache size: 1022, Positive conditional cache size: 1007, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1023, Positive cache size: 1023, Positive conditional cache size: 1008, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1024, Positive cache size: 1024, Positive conditional cache size: 1009, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1025, Positive cache size: 1025, Positive conditional cache size: 1010, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1026, Positive cache size: 1026, Positive conditional cache size: 1011, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1027, Positive cache size: 1027, Positive conditional cache size: 1012, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1028, Positive cache size: 1028, Positive conditional cache size: 1013, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1029, Positive cache size: 1029, Positive conditional cache size: 1014, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1030, Positive cache size: 1030, Positive conditional cache size: 1015, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1031, Positive cache size: 1031, Positive conditional cache size: 1016, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1032, Positive cache size: 1032, Positive conditional cache size: 1017, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1033, Positive cache size: 1033, Positive conditional cache size: 1018, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1034, Positive cache size: 1034, Positive conditional cache size: 1019, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1035, Positive cache size: 1035, Positive conditional cache size: 1020, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1036, Positive cache size: 1036, Positive conditional cache size: 1021, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1037, Positive cache size: 1037, Positive conditional cache size: 1022, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1038, Positive cache size: 1038, Positive conditional cache size: 1023, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1039, Positive cache size: 1039, Positive conditional cache size: 1024, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1040, Positive cache size: 1040, Positive conditional cache size: 1025, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1041, Positive cache size: 1041, Positive conditional cache size: 1026, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1042, Positive cache size: 1042, Positive conditional cache size: 1027, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1043, Positive cache size: 1043, Positive conditional cache size: 1028, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1044, Positive cache size: 1044, Positive conditional cache size: 1029, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1045, Positive cache size: 1045, Positive conditional cache size: 1030, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1046, Positive cache size: 1046, Positive conditional cache size: 1031, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1047, Positive cache size: 1047, Positive conditional cache size: 1032, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1048, Positive cache size: 1048, Positive conditional cache size: 1033, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1049, Positive cache size: 1049, Positive conditional cache size: 1034, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1050, Positive cache size: 1050, Positive conditional cache size: 1035, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1051, Positive cache size: 1051, Positive conditional cache size: 1036, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1052, Positive cache size: 1052, Positive conditional cache size: 1037, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1053, Positive cache size: 1053, Positive conditional cache size: 1038, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1054, Positive cache size: 1054, Positive conditional cache size: 1039, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1055, Positive cache size: 1055, Positive conditional cache size: 1040, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1056, Positive cache size: 1056, Positive conditional cache size: 1041, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1057, Positive cache size: 1057, Positive conditional cache size: 1042, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1058, Positive cache size: 1058, Positive conditional cache size: 1043, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1059, Positive cache size: 1059, Positive conditional cache size: 1044, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1060, Positive cache size: 1060, Positive conditional cache size: 1045, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1061, Positive cache size: 1061, Positive conditional cache size: 1046, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1062, Positive cache size: 1062, Positive conditional cache size: 1047, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1063, Positive cache size: 1063, Positive conditional cache size: 1048, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1064, Positive cache size: 1064, Positive conditional cache size: 1049, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1065, Positive cache size: 1065, Positive conditional cache size: 1050, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1066, Positive cache size: 1066, Positive conditional cache size: 1051, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1067, Positive cache size: 1067, Positive conditional cache size: 1052, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1068, Positive cache size: 1068, Positive conditional cache size: 1053, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1069, Positive cache size: 1069, Positive conditional cache size: 1054, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1070, Positive cache size: 1070, Positive conditional cache size: 1055, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1071, Positive cache size: 1071, Positive conditional cache size: 1056, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1072, Positive cache size: 1072, Positive conditional cache size: 1057, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1073, Positive cache size: 1073, Positive conditional cache size: 1058, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1074, Positive cache size: 1074, Positive conditional cache size: 1059, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1075, Positive cache size: 1075, Positive conditional cache size: 1060, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1076, Positive cache size: 1076, Positive conditional cache size: 1061, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1077, Positive cache size: 1077, Positive conditional cache size: 1062, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1078, Positive cache size: 1078, Positive conditional cache size: 1063, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1079, Positive cache size: 1079, Positive conditional cache size: 1064, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1080, Positive cache size: 1080, Positive conditional cache size: 1065, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1081, Positive cache size: 1081, Positive conditional cache size: 1066, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1082, Positive cache size: 1082, Positive conditional cache size: 1067, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1083, Positive cache size: 1083, Positive conditional cache size: 1068, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1084, Positive cache size: 1084, Positive conditional cache size: 1069, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1085, Positive cache size: 1085, Positive conditional cache size: 1070, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1086, Positive cache size: 1086, Positive conditional cache size: 1071, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1087, Positive cache size: 1087, Positive conditional cache size: 1072, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1088, Positive cache size: 1088, Positive conditional cache size: 1073, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1089, Positive cache size: 1089, Positive conditional cache size: 1074, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1090, Positive cache size: 1090, Positive conditional cache size: 1075, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1091, Positive cache size: 1091, Positive conditional cache size: 1076, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1092, Positive cache size: 1092, Positive conditional cache size: 1077, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1093, Positive cache size: 1093, Positive conditional cache size: 1078, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1094, Positive cache size: 1094, Positive conditional cache size: 1079, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1095, Positive cache size: 1095, Positive conditional cache size: 1080, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1096, Positive cache size: 1096, Positive conditional cache size: 1081, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1097, Positive cache size: 1097, Positive conditional cache size: 1082, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1098, Positive cache size: 1098, Positive conditional cache size: 1083, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1099, Positive cache size: 1099, Positive conditional cache size: 1084, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1100, Positive cache size: 1100, Positive conditional cache size: 1085, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1101, Positive cache size: 1101, Positive conditional cache size: 1086, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1102, Positive cache size: 1102, Positive conditional cache size: 1087, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1103, Positive cache size: 1103, Positive conditional cache size: 1088, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1104, Positive cache size: 1104, Positive conditional cache size: 1089, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1105, Positive cache size: 1105, Positive conditional cache size: 1090, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1106, Positive cache size: 1106, Positive conditional cache size: 1091, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1107, Positive cache size: 1107, Positive conditional cache size: 1092, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1108, Positive cache size: 1108, Positive conditional cache size: 1093, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1109, Positive cache size: 1109, Positive conditional cache size: 1094, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1110, Positive cache size: 1110, Positive conditional cache size: 1095, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1111, Positive cache size: 1111, Positive conditional cache size: 1096, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1112, Positive cache size: 1112, Positive conditional cache size: 1097, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1113, Positive cache size: 1113, Positive conditional cache size: 1098, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1114, Positive cache size: 1114, Positive conditional cache size: 1099, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1115, Positive cache size: 1115, Positive conditional cache size: 1100, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1116, Positive cache size: 1116, Positive conditional cache size: 1101, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1117, Positive cache size: 1117, Positive conditional cache size: 1102, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1118, Positive cache size: 1118, Positive conditional cache size: 1103, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1119, Positive cache size: 1119, Positive conditional cache size: 1104, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1120, Positive cache size: 1120, Positive conditional cache size: 1105, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1121, Positive cache size: 1121, Positive conditional cache size: 1106, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1122, Positive cache size: 1122, Positive conditional cache size: 1107, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1123, Positive cache size: 1123, Positive conditional cache size: 1108, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1124, Positive cache size: 1124, Positive conditional cache size: 1109, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1125, Positive cache size: 1125, Positive conditional cache size: 1110, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1126, Positive cache size: 1126, Positive conditional cache size: 1111, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1127, Positive cache size: 1127, Positive conditional cache size: 1112, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1128, Positive cache size: 1128, Positive conditional cache size: 1113, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1129, Positive cache size: 1129, Positive conditional cache size: 1114, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1130, Positive cache size: 1130, Positive conditional cache size: 1115, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1131, Positive cache size: 1131, Positive conditional cache size: 1116, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1132, Positive cache size: 1132, Positive conditional cache size: 1117, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1133, Positive cache size: 1133, Positive conditional cache size: 1118, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1134, Positive cache size: 1134, Positive conditional cache size: 1119, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1135, Positive cache size: 1135, Positive conditional cache size: 1120, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1136, Positive cache size: 1136, Positive conditional cache size: 1121, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1137, Positive cache size: 1137, Positive conditional cache size: 1122, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1138, Positive cache size: 1138, Positive conditional cache size: 1123, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1139, Positive cache size: 1139, Positive conditional cache size: 1124, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1140, Positive cache size: 1140, Positive conditional cache size: 1125, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1141, Positive cache size: 1141, Positive conditional cache size: 1126, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1142, Positive cache size: 1142, Positive conditional cache size: 1127, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1143, Positive cache size: 1143, Positive conditional cache size: 1128, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1144, Positive cache size: 1144, Positive conditional cache size: 1129, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1145, Positive cache size: 1145, Positive conditional cache size: 1130, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1146, Positive cache size: 1146, Positive conditional cache size: 1131, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1147, Positive cache size: 1147, Positive conditional cache size: 1132, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1148, Positive cache size: 1148, Positive conditional cache size: 1133, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1149, Positive cache size: 1149, Positive conditional cache size: 1134, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1150, Positive cache size: 1150, Positive conditional cache size: 1135, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1151, Positive cache size: 1151, Positive conditional cache size: 1136, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1152, Positive cache size: 1152, Positive conditional cache size: 1137, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1153, Positive cache size: 1153, Positive conditional cache size: 1138, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1154, Positive cache size: 1154, Positive conditional cache size: 1139, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1155, Positive cache size: 1155, Positive conditional cache size: 1140, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1156, Positive cache size: 1156, Positive conditional cache size: 1141, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1157, Positive cache size: 1157, Positive conditional cache size: 1142, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1158, Positive cache size: 1158, Positive conditional cache size: 1143, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1159, Positive cache size: 1159, Positive conditional cache size: 1144, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1160, Positive cache size: 1160, Positive conditional cache size: 1145, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1161, Positive cache size: 1161, Positive conditional cache size: 1146, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1162, Positive cache size: 1162, Positive conditional cache size: 1147, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1163, Positive cache size: 1163, Positive conditional cache size: 1148, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1164, Positive cache size: 1164, Positive conditional cache size: 1149, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1165, Positive cache size: 1165, Positive conditional cache size: 1150, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1166, Positive cache size: 1166, Positive conditional cache size: 1151, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1167, Positive cache size: 1167, Positive conditional cache size: 1152, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1168, Positive cache size: 1168, Positive conditional cache size: 1153, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1169, Positive cache size: 1169, Positive conditional cache size: 1154, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1170, Positive cache size: 1170, Positive conditional cache size: 1155, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1171, Positive cache size: 1171, Positive conditional cache size: 1156, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1172, Positive cache size: 1172, Positive conditional cache size: 1157, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1173, Positive cache size: 1173, Positive conditional cache size: 1158, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1174, Positive cache size: 1174, Positive conditional cache size: 1159, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1175, Positive cache size: 1175, Positive conditional cache size: 1160, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1176, Positive cache size: 1176, Positive conditional cache size: 1161, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1177, Positive cache size: 1177, Positive conditional cache size: 1162, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1178, Positive cache size: 1178, Positive conditional cache size: 1163, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1179, Positive cache size: 1179, Positive conditional cache size: 1164, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1180, Positive cache size: 1180, Positive conditional cache size: 1165, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1181, Positive cache size: 1181, Positive conditional cache size: 1166, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1182, Positive cache size: 1182, Positive conditional cache size: 1167, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1183, Positive cache size: 1183, Positive conditional cache size: 1168, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1184, Positive cache size: 1184, Positive conditional cache size: 1169, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1185, Positive cache size: 1185, Positive conditional cache size: 1170, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1186, Positive cache size: 1186, Positive conditional cache size: 1171, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1187, Positive cache size: 1187, Positive conditional cache size: 1172, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1188, Positive cache size: 1188, Positive conditional cache size: 1173, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1189, Positive cache size: 1189, Positive conditional cache size: 1174, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1190, Positive cache size: 1190, Positive conditional cache size: 1175, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1191, Positive cache size: 1191, Positive conditional cache size: 1176, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1192, Positive cache size: 1192, Positive conditional cache size: 1177, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1193, Positive cache size: 1193, Positive conditional cache size: 1178, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1194, Positive cache size: 1194, Positive conditional cache size: 1179, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1195, Positive cache size: 1195, Positive conditional cache size: 1180, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1196, Positive cache size: 1196, Positive conditional cache size: 1181, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1197, Positive cache size: 1197, Positive conditional cache size: 1182, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1198, Positive cache size: 1198, Positive conditional cache size: 1183, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1199, Positive cache size: 1199, Positive conditional cache size: 1184, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1200, Positive cache size: 1200, Positive conditional cache size: 1185, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1201, Positive cache size: 1201, Positive conditional cache size: 1186, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1202, Positive cache size: 1202, Positive conditional cache size: 1187, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1203, Positive cache size: 1203, Positive conditional cache size: 1188, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1204, Positive cache size: 1204, Positive conditional cache size: 1189, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1205, Positive cache size: 1205, Positive conditional cache size: 1190, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1206, Positive cache size: 1206, Positive conditional cache size: 1191, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1207, Positive cache size: 1207, Positive conditional cache size: 1192, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1208, Positive cache size: 1208, Positive conditional cache size: 1193, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1209, Positive cache size: 1209, Positive conditional cache size: 1194, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1210, Positive cache size: 1210, Positive conditional cache size: 1195, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1211, Positive cache size: 1211, Positive conditional cache size: 1196, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1212, Positive cache size: 1212, Positive conditional cache size: 1197, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1213, Positive cache size: 1213, Positive conditional cache size: 1198, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1214, Positive cache size: 1214, Positive conditional cache size: 1199, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1215, Positive cache size: 1215, Positive conditional cache size: 1200, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1216, Positive cache size: 1216, Positive conditional cache size: 1201, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1217, Positive cache size: 1217, Positive conditional cache size: 1202, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1218, Positive cache size: 1218, Positive conditional cache size: 1203, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1219, Positive cache size: 1219, Positive conditional cache size: 1204, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1220, Positive cache size: 1220, Positive conditional cache size: 1205, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1221, Positive cache size: 1221, Positive conditional cache size: 1206, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1222, Positive cache size: 1222, Positive conditional cache size: 1207, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1223, Positive cache size: 1223, Positive conditional cache size: 1208, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1224, Positive cache size: 1224, Positive conditional cache size: 1209, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1225, Positive cache size: 1225, Positive conditional cache size: 1210, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1226, Positive conditional cache size: 1211, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1227, Positive cache size: 1227, Positive conditional cache size: 1212, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1228, Positive cache size: 1228, Positive conditional cache size: 1213, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1229, Positive cache size: 1229, Positive conditional cache size: 1214, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1230, Positive cache size: 1230, Positive conditional cache size: 1215, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1231, Positive cache size: 1231, Positive conditional cache size: 1216, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1232, Positive cache size: 1232, Positive conditional cache size: 1217, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1233, Positive cache size: 1233, Positive conditional cache size: 1218, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1234, Positive cache size: 1234, Positive conditional cache size: 1219, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1235, Positive cache size: 1235, Positive conditional cache size: 1220, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1236, Positive cache size: 1236, Positive conditional cache size: 1221, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1237, Positive cache size: 1237, Positive conditional cache size: 1222, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1238, Positive cache size: 1238, Positive conditional cache size: 1223, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1239, Positive cache size: 1239, Positive conditional cache size: 1224, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1240, Positive cache size: 1240, Positive conditional cache size: 1225, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1241, Positive cache size: 1241, Positive conditional cache size: 1226, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1242, Positive cache size: 1242, Positive conditional cache size: 1227, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1243, Positive cache size: 1243, Positive conditional cache size: 1228, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1244, Positive cache size: 1244, Positive conditional cache size: 1229, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1245, Positive cache size: 1245, Positive conditional cache size: 1230, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1246, Positive cache size: 1246, Positive conditional cache size: 1231, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1247, Positive cache size: 1247, Positive conditional cache size: 1232, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1248, Positive cache size: 1248, Positive conditional cache size: 1233, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1249, Positive cache size: 1249, Positive conditional cache size: 1234, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1250, Positive cache size: 1250, Positive conditional cache size: 1235, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1251, Positive cache size: 1251, Positive conditional cache size: 1236, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1252, Positive cache size: 1252, Positive conditional cache size: 1237, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1253, Positive cache size: 1253, Positive conditional cache size: 1238, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1254, Positive cache size: 1254, Positive conditional cache size: 1239, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1255, Positive cache size: 1255, Positive conditional cache size: 1240, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1256, Positive cache size: 1256, Positive conditional cache size: 1241, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1257, Positive cache size: 1257, Positive conditional cache size: 1242, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1258, Positive cache size: 1258, Positive conditional cache size: 1243, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1259, Positive cache size: 1259, Positive conditional cache size: 1244, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1260, Positive cache size: 1260, Positive conditional cache size: 1245, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1261, Positive cache size: 1261, Positive conditional cache size: 1246, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1262, Positive cache size: 1262, Positive conditional cache size: 1247, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1263, Positive cache size: 1263, Positive conditional cache size: 1248, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1264, Positive cache size: 1264, Positive conditional cache size: 1249, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1265, Positive conditional cache size: 1250, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1266, Positive cache size: 1266, Positive conditional cache size: 1251, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1267, Positive cache size: 1267, Positive conditional cache size: 1252, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1268, Positive cache size: 1268, Positive conditional cache size: 1253, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1269, Positive cache size: 1269, Positive conditional cache size: 1254, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1270, Positive cache size: 1270, Positive conditional cache size: 1255, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1271, Positive cache size: 1271, Positive conditional cache size: 1256, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1272, Positive cache size: 1272, Positive conditional cache size: 1257, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1273, Positive cache size: 1273, Positive conditional cache size: 1258, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1274, Positive cache size: 1274, Positive conditional cache size: 1259, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1275, Positive cache size: 1275, Positive conditional cache size: 1260, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1276, Positive cache size: 1276, Positive conditional cache size: 1261, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1277, Positive cache size: 1277, Positive conditional cache size: 1262, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1278, Positive cache size: 1278, Positive conditional cache size: 1263, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1279, Positive cache size: 1279, Positive conditional cache size: 1264, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1280, Positive cache size: 1280, Positive conditional cache size: 1265, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1281, Positive cache size: 1281, Positive conditional cache size: 1266, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1282, Positive cache size: 1282, Positive conditional cache size: 1267, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1283, Positive cache size: 1283, Positive conditional cache size: 1268, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1284, Positive cache size: 1284, Positive conditional cache size: 1269, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1285, Positive cache size: 1285, Positive conditional cache size: 1270, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1286, Positive cache size: 1286, Positive conditional cache size: 1271, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1287, Positive cache size: 1287, Positive conditional cache size: 1272, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1288, Positive cache size: 1288, Positive conditional cache size: 1273, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1289, Positive cache size: 1289, Positive conditional cache size: 1274, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1290, Positive cache size: 1290, Positive conditional cache size: 1275, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1291, Positive cache size: 1291, Positive conditional cache size: 1276, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1292, Positive cache size: 1292, Positive conditional cache size: 1277, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1293, Positive cache size: 1293, Positive conditional cache size: 1278, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1294, Positive cache size: 1294, Positive conditional cache size: 1279, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1295, Positive cache size: 1295, Positive conditional cache size: 1280, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1296, Positive cache size: 1296, Positive conditional cache size: 1281, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1297, Positive cache size: 1297, Positive conditional cache size: 1282, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1298, Positive cache size: 1298, Positive conditional cache size: 1283, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1299, Positive cache size: 1299, Positive conditional cache size: 1284, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1300, Positive cache size: 1300, Positive conditional cache size: 1285, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1301, Positive cache size: 1301, Positive conditional cache size: 1286, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1302, Positive cache size: 1302, Positive conditional cache size: 1287, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1303, Positive cache size: 1303, Positive conditional cache size: 1288, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1304, Positive cache size: 1304, Positive conditional cache size: 1289, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1305, Positive cache size: 1305, Positive conditional cache size: 1290, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1306, Positive conditional cache size: 1291, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1307, Positive cache size: 1307, Positive conditional cache size: 1292, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1308, Positive cache size: 1308, Positive conditional cache size: 1293, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1309, Positive cache size: 1309, Positive conditional cache size: 1294, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1310, Positive cache size: 1310, Positive conditional cache size: 1295, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1311, Positive cache size: 1311, Positive conditional cache size: 1296, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1312, Positive cache size: 1312, Positive conditional cache size: 1297, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1313, Positive cache size: 1313, Positive conditional cache size: 1298, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1314, Positive cache size: 1314, Positive conditional cache size: 1299, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1315, Positive cache size: 1315, Positive conditional cache size: 1300, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1316, Positive cache size: 1316, Positive conditional cache size: 1301, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1317, Positive cache size: 1317, Positive conditional cache size: 1302, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1318, Positive cache size: 1318, Positive conditional cache size: 1303, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1319, Positive cache size: 1319, Positive conditional cache size: 1304, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1320, Positive cache size: 1320, Positive conditional cache size: 1305, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1321, Positive cache size: 1321, Positive conditional cache size: 1306, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1322, Positive cache size: 1322, Positive conditional cache size: 1307, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1323, Positive cache size: 1323, Positive conditional cache size: 1308, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1324, Positive cache size: 1324, Positive conditional cache size: 1309, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1325, Positive cache size: 1325, Positive conditional cache size: 1310, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1326, Positive cache size: 1326, Positive conditional cache size: 1311, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1327, Positive cache size: 1327, Positive conditional cache size: 1312, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1328, Positive cache size: 1328, Positive conditional cache size: 1313, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1329, Positive cache size: 1329, Positive conditional cache size: 1314, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1330, Positive cache size: 1330, Positive conditional cache size: 1315, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1331, Positive cache size: 1331, Positive conditional cache size: 1316, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1332, Positive cache size: 1332, Positive conditional cache size: 1317, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1333, Positive cache size: 1333, Positive conditional cache size: 1318, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1334, Positive cache size: 1334, Positive conditional cache size: 1319, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1335, Positive cache size: 1335, Positive conditional cache size: 1320, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1336, Positive cache size: 1336, Positive conditional cache size: 1321, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1337, Positive cache size: 1337, Positive conditional cache size: 1322, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1338, Positive cache size: 1338, Positive conditional cache size: 1323, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1339, Positive cache size: 1339, Positive conditional cache size: 1324, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1340, Positive cache size: 1340, Positive conditional cache size: 1325, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1341, Positive cache size: 1341, Positive conditional cache size: 1326, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1342, Positive cache size: 1342, Positive conditional cache size: 1327, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1343, Positive cache size: 1343, Positive conditional cache size: 1328, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1344, Positive cache size: 1344, Positive conditional cache size: 1329, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1345, Positive cache size: 1345, Positive conditional cache size: 1330, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1346, Positive cache size: 1346, Positive conditional cache size: 1331, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1347, Positive cache size: 1347, Positive conditional cache size: 1332, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1348, Positive cache size: 1348, Positive conditional cache size: 1333, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1349, Positive cache size: 1349, Positive conditional cache size: 1334, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1350, Positive cache size: 1350, Positive conditional cache size: 1335, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1351, Positive cache size: 1351, Positive conditional cache size: 1336, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1352, Positive cache size: 1352, Positive conditional cache size: 1337, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1353, Positive cache size: 1353, Positive conditional cache size: 1338, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1354, Positive cache size: 1354, Positive conditional cache size: 1339, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1355, Positive cache size: 1355, Positive conditional cache size: 1340, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1356, Positive cache size: 1356, Positive conditional cache size: 1341, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1357, Positive cache size: 1357, Positive conditional cache size: 1342, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1358, Positive cache size: 1358, Positive conditional cache size: 1343, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1359, Positive cache size: 1359, Positive conditional cache size: 1344, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1360, Positive cache size: 1360, Positive conditional cache size: 1345, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1361, Positive cache size: 1361, Positive conditional cache size: 1346, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1362, Positive cache size: 1362, Positive conditional cache size: 1347, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1363, Positive cache size: 1363, Positive conditional cache size: 1348, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1364, Positive cache size: 1364, Positive conditional cache size: 1349, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1365, Positive cache size: 1365, Positive conditional cache size: 1350, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1366, Positive cache size: 1366, Positive conditional cache size: 1351, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1367, Positive cache size: 1367, Positive conditional cache size: 1352, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1368, Positive cache size: 1368, Positive conditional cache size: 1353, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1369, Positive cache size: 1369, Positive conditional cache size: 1354, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1370, Positive cache size: 1370, Positive conditional cache size: 1355, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1371, Positive cache size: 1371, Positive conditional cache size: 1356, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1372, Positive cache size: 1372, Positive conditional cache size: 1357, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1373, Positive cache size: 1373, Positive conditional cache size: 1358, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1374, Positive cache size: 1374, Positive conditional cache size: 1359, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1375, Positive cache size: 1375, Positive conditional cache size: 1360, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1376, Positive cache size: 1376, Positive conditional cache size: 1361, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1377, Positive cache size: 1377, Positive conditional cache size: 1362, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1378, Positive cache size: 1378, Positive conditional cache size: 1363, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1379, Positive cache size: 1379, Positive conditional cache size: 1364, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1380, Positive cache size: 1380, Positive conditional cache size: 1365, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1381, Positive cache size: 1381, Positive conditional cache size: 1366, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1382, Positive cache size: 1382, Positive conditional cache size: 1367, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1383, Positive cache size: 1383, Positive conditional cache size: 1368, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1384, Positive cache size: 1384, Positive conditional cache size: 1369, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1385, Positive cache size: 1385, Positive conditional cache size: 1370, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1386, Positive cache size: 1386, Positive conditional cache size: 1371, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1387, Positive cache size: 1387, Positive conditional cache size: 1372, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1388, Positive cache size: 1388, Positive conditional cache size: 1373, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1389, Positive cache size: 1389, Positive conditional cache size: 1374, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1390, Positive cache size: 1390, Positive conditional cache size: 1375, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1391, Positive cache size: 1391, Positive conditional cache size: 1376, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1392, Positive cache size: 1392, Positive conditional cache size: 1377, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1393, Positive cache size: 1393, Positive conditional cache size: 1378, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1394, Positive cache size: 1394, Positive conditional cache size: 1379, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1395, Positive cache size: 1395, Positive conditional cache size: 1380, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1396, Positive cache size: 1396, Positive conditional cache size: 1381, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1397, Positive cache size: 1397, Positive conditional cache size: 1382, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1398, Positive cache size: 1398, Positive conditional cache size: 1383, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1399, Positive cache size: 1399, Positive conditional cache size: 1384, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1400, Positive cache size: 1400, Positive conditional cache size: 1385, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1401, Positive cache size: 1401, Positive conditional cache size: 1386, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1402, Positive cache size: 1402, Positive conditional cache size: 1387, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1403, Positive cache size: 1403, Positive conditional cache size: 1388, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1404, Positive cache size: 1404, Positive conditional cache size: 1389, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1405, Positive cache size: 1405, Positive conditional cache size: 1390, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1406, Positive cache size: 1406, Positive conditional cache size: 1391, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1407, Positive cache size: 1407, Positive conditional cache size: 1392, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1408, Positive cache size: 1408, Positive conditional cache size: 1393, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1409, Positive cache size: 1409, Positive conditional cache size: 1394, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1410, Positive cache size: 1410, Positive conditional cache size: 1395, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1411, Positive cache size: 1411, Positive conditional cache size: 1396, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1412, Positive cache size: 1412, Positive conditional cache size: 1397, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1413, Positive cache size: 1413, Positive conditional cache size: 1398, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1414, Positive cache size: 1414, Positive conditional cache size: 1399, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1415, Positive cache size: 1415, Positive conditional cache size: 1400, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1416, Positive cache size: 1416, Positive conditional cache size: 1401, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1417, Positive cache size: 1417, Positive conditional cache size: 1402, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1418, Positive cache size: 1418, Positive conditional cache size: 1403, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1419, Positive cache size: 1419, Positive conditional cache size: 1404, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1420, Positive cache size: 1420, Positive conditional cache size: 1405, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1421, Positive cache size: 1421, Positive conditional cache size: 1406, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1422, Positive cache size: 1422, Positive conditional cache size: 1407, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1423, Positive cache size: 1423, Positive conditional cache size: 1408, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1424, Positive cache size: 1424, Positive conditional cache size: 1409, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1425, Positive cache size: 1425, Positive conditional cache size: 1410, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1426, Positive cache size: 1426, Positive conditional cache size: 1411, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1427, Positive cache size: 1427, Positive conditional cache size: 1412, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1428, Positive cache size: 1428, Positive conditional cache size: 1413, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1429, Positive cache size: 1429, Positive conditional cache size: 1414, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1430, Positive cache size: 1430, Positive conditional cache size: 1415, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1431, Positive cache size: 1431, Positive conditional cache size: 1416, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1432, Positive cache size: 1432, Positive conditional cache size: 1417, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1433, Positive cache size: 1433, Positive conditional cache size: 1418, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1434, Positive cache size: 1434, Positive conditional cache size: 1419, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1435, Positive cache size: 1435, Positive conditional cache size: 1420, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1436, Positive cache size: 1436, Positive conditional cache size: 1421, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1437, Positive cache size: 1437, Positive conditional cache size: 1422, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1438, Positive cache size: 1438, Positive conditional cache size: 1423, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1439, Positive cache size: 1439, Positive conditional cache size: 1424, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1440, Positive cache size: 1440, Positive conditional cache size: 1425, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1441, Positive cache size: 1441, Positive conditional cache size: 1426, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1442, Positive cache size: 1442, Positive conditional cache size: 1427, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1443, Positive cache size: 1443, Positive conditional cache size: 1428, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1444, Positive cache size: 1444, Positive conditional cache size: 1429, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1445, Positive cache size: 1445, Positive conditional cache size: 1430, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1446, Positive cache size: 1446, Positive conditional cache size: 1431, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1447, Positive cache size: 1447, Positive conditional cache size: 1432, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1448, Positive cache size: 1448, Positive conditional cache size: 1433, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1449, Positive cache size: 1449, Positive conditional cache size: 1434, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1450, Positive cache size: 1450, Positive conditional cache size: 1435, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1451, Positive cache size: 1451, Positive conditional cache size: 1436, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1452, Positive cache size: 1452, Positive conditional cache size: 1437, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1453, Positive cache size: 1453, Positive conditional cache size: 1438, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1454, Positive cache size: 1454, Positive conditional cache size: 1439, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1455, Positive cache size: 1455, Positive conditional cache size: 1440, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1456, Positive cache size: 1456, Positive conditional cache size: 1441, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1457, Positive cache size: 1457, Positive conditional cache size: 1442, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1458, Positive cache size: 1458, Positive conditional cache size: 1443, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1459, Positive cache size: 1459, Positive conditional cache size: 1444, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1460, Positive cache size: 1460, Positive conditional cache size: 1445, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1461, Positive cache size: 1461, Positive conditional cache size: 1446, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1462, Positive cache size: 1462, Positive conditional cache size: 1447, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1463, Positive cache size: 1463, Positive conditional cache size: 1448, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1464, Positive cache size: 1464, Positive conditional cache size: 1449, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1465, Positive cache size: 1465, Positive conditional cache size: 1450, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1466, Positive cache size: 1466, Positive conditional cache size: 1451, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1467, Positive cache size: 1467, Positive conditional cache size: 1452, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1468, Positive cache size: 1468, Positive conditional cache size: 1453, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1469, Positive cache size: 1469, Positive conditional cache size: 1454, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1470, Positive cache size: 1470, Positive conditional cache size: 1455, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1471, Positive cache size: 1471, Positive conditional cache size: 1456, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1472, Positive cache size: 1472, Positive conditional cache size: 1457, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1473, Positive cache size: 1473, Positive conditional cache size: 1458, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1474, Positive cache size: 1474, Positive conditional cache size: 1459, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1475, Positive cache size: 1475, Positive conditional cache size: 1460, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1476, Positive cache size: 1476, Positive conditional cache size: 1461, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1477, Positive cache size: 1477, Positive conditional cache size: 1462, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1478, Positive cache size: 1478, Positive conditional cache size: 1463, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1479, Positive cache size: 1479, Positive conditional cache size: 1464, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1480, Positive cache size: 1480, Positive conditional cache size: 1465, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1481, Positive cache size: 1481, Positive conditional cache size: 1466, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1482, Positive cache size: 1482, Positive conditional cache size: 1467, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1483, Positive cache size: 1483, Positive conditional cache size: 1468, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1484, Positive cache size: 1484, Positive conditional cache size: 1469, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1485, Positive cache size: 1485, Positive conditional cache size: 1470, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1486, Positive cache size: 1486, Positive conditional cache size: 1471, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1487, Positive cache size: 1487, Positive conditional cache size: 1472, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1488, Positive cache size: 1488, Positive conditional cache size: 1473, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1489, Positive cache size: 1489, Positive conditional cache size: 1474, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1490, Positive cache size: 1490, Positive conditional cache size: 1475, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1491, Positive cache size: 1491, Positive conditional cache size: 1476, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1492, Positive cache size: 1492, Positive conditional cache size: 1477, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1493, Positive cache size: 1493, Positive conditional cache size: 1478, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1494, Positive cache size: 1494, Positive conditional cache size: 1479, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1495, Positive cache size: 1495, Positive conditional cache size: 1480, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1496, Positive cache size: 1496, Positive conditional cache size: 1481, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1497, Positive cache size: 1497, Positive conditional cache size: 1482, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1498, Positive cache size: 1498, Positive conditional cache size: 1483, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1499, Positive cache size: 1499, Positive conditional cache size: 1484, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1500, Positive cache size: 1500, Positive conditional cache size: 1485, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1501, Positive cache size: 1501, Positive conditional cache size: 1486, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1502, Positive cache size: 1502, Positive conditional cache size: 1487, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1503, Positive cache size: 1503, Positive conditional cache size: 1488, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1504, Positive cache size: 1504, Positive conditional cache size: 1489, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1505, Positive cache size: 1505, Positive conditional cache size: 1490, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1506, Positive cache size: 1506, Positive conditional cache size: 1491, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1507, Positive cache size: 1507, Positive conditional cache size: 1492, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1508, Positive cache size: 1508, Positive conditional cache size: 1493, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1509, Positive cache size: 1509, Positive conditional cache size: 1494, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1510, Positive cache size: 1510, Positive conditional cache size: 1495, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1511, Positive cache size: 1511, Positive conditional cache size: 1496, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1512, Positive cache size: 1512, Positive conditional cache size: 1497, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1513, Positive cache size: 1513, Positive conditional cache size: 1498, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1514, Positive cache size: 1514, Positive conditional cache size: 1499, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1515, Positive cache size: 1515, Positive conditional cache size: 1500, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1516, Positive cache size: 1516, Positive conditional cache size: 1501, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1517, Positive cache size: 1517, Positive conditional cache size: 1502, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1518, Positive cache size: 1518, Positive conditional cache size: 1503, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1519, Positive cache size: 1519, Positive conditional cache size: 1504, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1520, Positive cache size: 1520, Positive conditional cache size: 1505, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1521, Positive cache size: 1521, Positive conditional cache size: 1506, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1522, Positive cache size: 1522, Positive conditional cache size: 1507, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1523, Positive cache size: 1523, Positive conditional cache size: 1508, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1524, Positive cache size: 1524, Positive conditional cache size: 1509, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1525, Positive cache size: 1525, Positive conditional cache size: 1510, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1526, Positive cache size: 1526, Positive conditional cache size: 1511, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1527, Positive cache size: 1527, Positive conditional cache size: 1512, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1528, Positive cache size: 1528, Positive conditional cache size: 1513, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1529, Positive cache size: 1529, Positive conditional cache size: 1514, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1530, Positive cache size: 1530, Positive conditional cache size: 1515, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1531, Positive cache size: 1531, Positive conditional cache size: 1516, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1532, Positive cache size: 1532, Positive conditional cache size: 1517, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1533, Positive cache size: 1533, Positive conditional cache size: 1518, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1534, Positive cache size: 1534, Positive conditional cache size: 1519, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1535, Positive cache size: 1535, Positive conditional cache size: 1520, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1536, Positive cache size: 1536, Positive conditional cache size: 1521, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1537, Positive cache size: 1537, Positive conditional cache size: 1522, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1538, Positive cache size: 1538, Positive conditional cache size: 1523, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1539, Positive cache size: 1539, Positive conditional cache size: 1524, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1540, Positive cache size: 1540, Positive conditional cache size: 1525, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1541, Positive cache size: 1541, Positive conditional cache size: 1526, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1542, Positive cache size: 1542, Positive conditional cache size: 1527, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1543, Positive cache size: 1543, Positive conditional cache size: 1528, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1544, Positive cache size: 1544, Positive conditional cache size: 1529, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1545, Positive cache size: 1545, Positive conditional cache size: 1530, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1546, Positive cache size: 1546, Positive conditional cache size: 1531, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1547, Positive cache size: 1547, Positive conditional cache size: 1532, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1548, Positive cache size: 1548, Positive conditional cache size: 1533, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1549, Positive cache size: 1549, Positive conditional cache size: 1534, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1550, Positive cache size: 1550, Positive conditional cache size: 1535, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1551, Positive cache size: 1551, Positive conditional cache size: 1536, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1552, Positive cache size: 1552, Positive conditional cache size: 1537, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1553, Positive cache size: 1553, Positive conditional cache size: 1538, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1554, Positive cache size: 1554, Positive conditional cache size: 1539, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1555, Positive cache size: 1555, Positive conditional cache size: 1540, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1556, Positive cache size: 1556, Positive conditional cache size: 1541, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1557, Positive cache size: 1557, Positive conditional cache size: 1542, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1558, Positive cache size: 1558, Positive conditional cache size: 1543, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1559, Positive cache size: 1559, Positive conditional cache size: 1544, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1560, Positive cache size: 1560, Positive conditional cache size: 1545, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1561, Positive cache size: 1561, Positive conditional cache size: 1546, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1562, Positive cache size: 1562, Positive conditional cache size: 1547, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1563, Positive cache size: 1563, Positive conditional cache size: 1548, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1564, Positive cache size: 1564, Positive conditional cache size: 1549, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1565, Positive cache size: 1565, Positive conditional cache size: 1550, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1566, Positive cache size: 1566, Positive conditional cache size: 1551, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1567, Positive cache size: 1567, Positive conditional cache size: 1552, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1568, Positive cache size: 1568, Positive conditional cache size: 1553, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1569, Positive cache size: 1569, Positive conditional cache size: 1554, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1570, Positive cache size: 1570, Positive conditional cache size: 1555, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1571, Positive cache size: 1571, Positive conditional cache size: 1556, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1572, Positive cache size: 1572, Positive conditional cache size: 1557, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1573, Positive cache size: 1573, Positive conditional cache size: 1558, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1574, Positive cache size: 1574, Positive conditional cache size: 1559, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1575, Positive cache size: 1575, Positive conditional cache size: 1560, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1576, Positive cache size: 1576, Positive conditional cache size: 1561, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1577, Positive cache size: 1577, Positive conditional cache size: 1562, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1578, Positive cache size: 1578, Positive conditional cache size: 1563, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1579, Positive cache size: 1579, Positive conditional cache size: 1564, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1580, Positive cache size: 1580, Positive conditional cache size: 1565, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1581, Positive cache size: 1581, Positive conditional cache size: 1566, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1582, Positive cache size: 1582, Positive conditional cache size: 1567, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1583, Positive cache size: 1583, Positive conditional cache size: 1568, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1584, Positive cache size: 1584, Positive conditional cache size: 1569, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1585, Positive cache size: 1585, Positive conditional cache size: 1570, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1586, Positive cache size: 1586, Positive conditional cache size: 1571, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1587, Positive cache size: 1587, Positive conditional cache size: 1572, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1588, Positive cache size: 1588, Positive conditional cache size: 1573, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1589, Positive cache size: 1589, Positive conditional cache size: 1574, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1590, Positive cache size: 1590, Positive conditional cache size: 1575, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1591, Positive cache size: 1591, Positive conditional cache size: 1576, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1592, Positive cache size: 1592, Positive conditional cache size: 1577, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1593, Positive cache size: 1593, Positive conditional cache size: 1578, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1594, Positive cache size: 1594, Positive conditional cache size: 1579, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1595, Positive cache size: 1595, Positive conditional cache size: 1580, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1596, Positive conditional cache size: 1581, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1597, Positive cache size: 1597, Positive conditional cache size: 1582, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1598, Positive cache size: 1598, Positive conditional cache size: 1583, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1599, Positive cache size: 1599, Positive conditional cache size: 1584, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1600, Positive cache size: 1600, Positive conditional cache size: 1585, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1601, Positive cache size: 1601, Positive conditional cache size: 1586, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1602, Positive cache size: 1602, Positive conditional cache size: 1587, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1603, Positive cache size: 1603, Positive conditional cache size: 1588, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1604, Positive cache size: 1604, Positive conditional cache size: 1589, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1605, Positive cache size: 1605, Positive conditional cache size: 1590, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1606, Positive cache size: 1606, Positive conditional cache size: 1591, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1607, Positive cache size: 1607, Positive conditional cache size: 1592, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1608, Positive cache size: 1608, Positive conditional cache size: 1593, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1609, Positive cache size: 1609, Positive conditional cache size: 1594, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1610, Positive cache size: 1610, Positive conditional cache size: 1595, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1611, Positive cache size: 1611, Positive conditional cache size: 1596, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1612, Positive cache size: 1612, Positive conditional cache size: 1597, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1613, Positive cache size: 1613, Positive conditional cache size: 1598, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1614, Positive cache size: 1614, Positive conditional cache size: 1599, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1615, Positive cache size: 1615, Positive conditional cache size: 1600, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1616, Positive cache size: 1616, Positive conditional cache size: 1601, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1617, Positive cache size: 1617, Positive conditional cache size: 1602, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1618, Positive cache size: 1618, Positive conditional cache size: 1603, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1619, Positive cache size: 1619, Positive conditional cache size: 1604, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1620, Positive cache size: 1620, Positive conditional cache size: 1605, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1621, Positive cache size: 1621, Positive conditional cache size: 1606, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1622, Positive cache size: 1622, Positive conditional cache size: 1607, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1623, Positive cache size: 1623, Positive conditional cache size: 1608, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1624, Positive cache size: 1624, Positive conditional cache size: 1609, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1625, Positive cache size: 1625, Positive conditional cache size: 1610, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1626, Positive cache size: 1626, Positive conditional cache size: 1611, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1627, Positive cache size: 1627, Positive conditional cache size: 1612, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1628, Positive cache size: 1628, Positive conditional cache size: 1613, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1629, Positive cache size: 1629, Positive conditional cache size: 1614, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1630, Positive cache size: 1630, Positive conditional cache size: 1615, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1631, Positive cache size: 1631, Positive conditional cache size: 1616, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1632, Positive cache size: 1632, Positive conditional cache size: 1617, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1633, Positive cache size: 1633, Positive conditional cache size: 1618, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1634, Positive cache size: 1634, Positive conditional cache size: 1619, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1635, Positive cache size: 1635, Positive conditional cache size: 1620, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1636, Positive cache size: 1636, Positive conditional cache size: 1621, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1637, Positive cache size: 1637, Positive conditional cache size: 1622, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1638, Positive cache size: 1638, Positive conditional cache size: 1623, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1639, Positive cache size: 1639, Positive conditional cache size: 1624, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1640, Positive cache size: 1640, Positive conditional cache size: 1625, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1641, Positive cache size: 1641, Positive conditional cache size: 1626, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1642, Positive cache size: 1642, Positive conditional cache size: 1627, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1643, Positive cache size: 1643, Positive conditional cache size: 1628, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1644, Positive cache size: 1644, Positive conditional cache size: 1629, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1645, Positive cache size: 1645, Positive conditional cache size: 1630, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1646, Positive cache size: 1646, Positive conditional cache size: 1631, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1647, Positive cache size: 1647, Positive conditional cache size: 1632, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1648, Positive cache size: 1648, Positive conditional cache size: 1633, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1649, Positive cache size: 1649, Positive conditional cache size: 1634, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1650, Positive cache size: 1650, Positive conditional cache size: 1635, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1651, Positive cache size: 1651, Positive conditional cache size: 1636, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1652, Positive cache size: 1652, Positive conditional cache size: 1637, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1653, Positive cache size: 1653, Positive conditional cache size: 1638, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1654, Positive cache size: 1654, Positive conditional cache size: 1639, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1655, Positive cache size: 1655, Positive conditional cache size: 1640, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1656, Positive cache size: 1656, Positive conditional cache size: 1641, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1657, Positive cache size: 1657, Positive conditional cache size: 1642, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1658, Positive cache size: 1658, Positive conditional cache size: 1643, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1659, Positive cache size: 1659, Positive conditional cache size: 1644, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1660, Positive cache size: 1660, Positive conditional cache size: 1645, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1661, Positive cache size: 1661, Positive conditional cache size: 1646, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1662, Positive cache size: 1662, Positive conditional cache size: 1647, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1663, Positive cache size: 1663, Positive conditional cache size: 1648, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1664, Positive cache size: 1664, Positive conditional cache size: 1649, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1665, Positive cache size: 1665, Positive conditional cache size: 1650, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1666, Positive cache size: 1666, Positive conditional cache size: 1651, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1667, Positive cache size: 1667, Positive conditional cache size: 1652, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1668, Positive cache size: 1668, Positive conditional cache size: 1653, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1669, Positive cache size: 1669, Positive conditional cache size: 1654, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1670, Positive cache size: 1670, Positive conditional cache size: 1655, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1671, Positive cache size: 1671, Positive conditional cache size: 1656, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1672, Positive cache size: 1672, Positive conditional cache size: 1657, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1673, Positive cache size: 1673, Positive conditional cache size: 1658, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1674, Positive cache size: 1674, Positive conditional cache size: 1659, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1675, Positive cache size: 1675, Positive conditional cache size: 1660, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1676, Positive cache size: 1676, Positive conditional cache size: 1661, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1677, Positive cache size: 1677, Positive conditional cache size: 1662, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1678, Positive cache size: 1678, Positive conditional cache size: 1663, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1679, Positive cache size: 1679, Positive conditional cache size: 1664, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1680, Positive cache size: 1680, Positive conditional cache size: 1665, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1681, Positive cache size: 1681, Positive conditional cache size: 1666, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1682, Positive cache size: 1682, Positive conditional cache size: 1667, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1683, Positive cache size: 1683, Positive conditional cache size: 1668, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1684, Positive cache size: 1684, Positive conditional cache size: 1669, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1685, Positive cache size: 1685, Positive conditional cache size: 1670, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1686, Positive cache size: 1686, Positive conditional cache size: 1671, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1687, Positive cache size: 1687, Positive conditional cache size: 1672, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1688, Positive cache size: 1688, Positive conditional cache size: 1673, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1689, Positive cache size: 1689, Positive conditional cache size: 1674, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1690, Positive cache size: 1690, Positive conditional cache size: 1675, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1691, Positive cache size: 1691, Positive conditional cache size: 1676, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1692, Positive cache size: 1692, Positive conditional cache size: 1677, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1693, Positive cache size: 1693, Positive conditional cache size: 1678, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1694, Positive cache size: 1694, Positive conditional cache size: 1679, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1695, Positive cache size: 1695, Positive conditional cache size: 1680, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1696, Positive cache size: 1696, Positive conditional cache size: 1681, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1697, Positive cache size: 1697, Positive conditional cache size: 1682, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1698, Positive cache size: 1698, Positive conditional cache size: 1683, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1699, Positive cache size: 1699, Positive conditional cache size: 1684, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1700, Positive cache size: 1700, Positive conditional cache size: 1685, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1701, Positive cache size: 1701, Positive conditional cache size: 1686, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1702, Positive cache size: 1702, Positive conditional cache size: 1687, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1703, Positive cache size: 1703, Positive conditional cache size: 1688, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1704, Positive cache size: 1704, Positive conditional cache size: 1689, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1705, Positive cache size: 1705, Positive conditional cache size: 1690, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1706, Positive cache size: 1706, Positive conditional cache size: 1691, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1707, Positive cache size: 1707, Positive conditional cache size: 1692, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1708, Positive cache size: 1708, Positive conditional cache size: 1693, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1709, Positive cache size: 1709, Positive conditional cache size: 1694, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1710, Positive cache size: 1710, Positive conditional cache size: 1695, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1711, Positive cache size: 1711, Positive conditional cache size: 1696, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1712, Positive cache size: 1712, Positive conditional cache size: 1697, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1713, Positive cache size: 1713, Positive conditional cache size: 1698, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1714, Positive cache size: 1714, Positive conditional cache size: 1699, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1715, Positive cache size: 1715, Positive conditional cache size: 1700, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1716, Positive cache size: 1716, Positive conditional cache size: 1701, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1717, Positive cache size: 1717, Positive conditional cache size: 1702, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1718, Positive cache size: 1718, Positive conditional cache size: 1703, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1719, Positive cache size: 1719, Positive conditional cache size: 1704, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1720, Positive cache size: 1720, Positive conditional cache size: 1705, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1721, Positive cache size: 1721, Positive conditional cache size: 1706, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1722, Positive cache size: 1722, Positive conditional cache size: 1707, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1723, Positive cache size: 1723, Positive conditional cache size: 1708, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1724, Positive cache size: 1724, Positive conditional cache size: 1709, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1725, Positive cache size: 1725, Positive conditional cache size: 1710, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1726, Positive cache size: 1726, Positive conditional cache size: 1711, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1727, Positive cache size: 1727, Positive conditional cache size: 1712, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1728, Positive cache size: 1728, Positive conditional cache size: 1713, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1729, Positive cache size: 1729, Positive conditional cache size: 1714, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1730, Positive cache size: 1730, Positive conditional cache size: 1715, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1731, Positive cache size: 1731, Positive conditional cache size: 1716, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1732, Positive cache size: 1732, Positive conditional cache size: 1717, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1733, Positive cache size: 1733, Positive conditional cache size: 1718, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1734, Positive cache size: 1734, Positive conditional cache size: 1719, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1735, Positive cache size: 1735, Positive conditional cache size: 1720, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1736, Positive cache size: 1736, Positive conditional cache size: 1721, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1737, Positive cache size: 1737, Positive conditional cache size: 1722, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1738, Positive cache size: 1738, Positive conditional cache size: 1723, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1739, Positive cache size: 1739, Positive conditional cache size: 1724, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1740, Positive cache size: 1740, Positive conditional cache size: 1725, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1741, Positive cache size: 1741, Positive conditional cache size: 1726, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1742, Positive cache size: 1742, Positive conditional cache size: 1727, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1743, Positive cache size: 1743, Positive conditional cache size: 1728, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1744, Positive cache size: 1744, Positive conditional cache size: 1729, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1745, Positive cache size: 1745, Positive conditional cache size: 1730, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1746, Positive cache size: 1746, Positive conditional cache size: 1731, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1747, Positive cache size: 1747, Positive conditional cache size: 1732, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1748, Positive cache size: 1748, Positive conditional cache size: 1733, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1749, Positive cache size: 1749, Positive conditional cache size: 1734, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1750, Positive cache size: 1750, Positive conditional cache size: 1735, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1751, Positive cache size: 1751, Positive conditional cache size: 1736, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1752, Positive cache size: 1752, Positive conditional cache size: 1737, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1753, Positive cache size: 1753, Positive conditional cache size: 1738, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1754, Positive cache size: 1754, Positive conditional cache size: 1739, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1755, Positive cache size: 1755, Positive conditional cache size: 1740, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1756, Positive cache size: 1756, Positive conditional cache size: 1741, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1757, Positive cache size: 1757, Positive conditional cache size: 1742, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1758, Positive cache size: 1758, Positive conditional cache size: 1743, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1759, Positive cache size: 1759, Positive conditional cache size: 1744, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1760, Positive cache size: 1760, Positive conditional cache size: 1745, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1761, Positive cache size: 1761, Positive conditional cache size: 1746, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1762, Positive cache size: 1762, Positive conditional cache size: 1747, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1763, Positive cache size: 1763, Positive conditional cache size: 1748, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1764, Positive cache size: 1764, Positive conditional cache size: 1749, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1765, Positive cache size: 1765, Positive conditional cache size: 1750, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1766, Positive cache size: 1766, Positive conditional cache size: 1751, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1767, Positive cache size: 1767, Positive conditional cache size: 1752, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1768, Positive cache size: 1768, Positive conditional cache size: 1753, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1769, Positive cache size: 1769, Positive conditional cache size: 1754, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1770, Positive cache size: 1770, Positive conditional cache size: 1755, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1771, Positive cache size: 1771, Positive conditional cache size: 1756, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1772, Positive cache size: 1772, Positive conditional cache size: 1757, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1773, Positive cache size: 1773, Positive conditional cache size: 1758, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1774, Positive cache size: 1774, Positive conditional cache size: 1759, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1775, Positive cache size: 1775, Positive conditional cache size: 1760, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1776, Positive cache size: 1776, Positive conditional cache size: 1761, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1777, Positive cache size: 1777, Positive conditional cache size: 1762, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1778, Positive cache size: 1778, Positive conditional cache size: 1763, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1779, Positive cache size: 1779, Positive conditional cache size: 1764, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1780, Positive cache size: 1780, Positive conditional cache size: 1765, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1781, Positive cache size: 1781, Positive conditional cache size: 1766, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1782, Positive cache size: 1782, Positive conditional cache size: 1767, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1783, Positive cache size: 1783, Positive conditional cache size: 1768, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1784, Positive cache size: 1784, Positive conditional cache size: 1769, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1785, Positive cache size: 1785, Positive conditional cache size: 1770, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1786, Positive cache size: 1786, Positive conditional cache size: 1771, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1787, Positive cache size: 1787, Positive conditional cache size: 1772, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1788, Positive cache size: 1788, Positive conditional cache size: 1773, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1789, Positive cache size: 1789, Positive conditional cache size: 1774, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1790, Positive cache size: 1790, Positive conditional cache size: 1775, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1791, Positive cache size: 1791, Positive conditional cache size: 1776, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1792, Positive cache size: 1792, Positive conditional cache size: 1777, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1793, Positive cache size: 1793, Positive conditional cache size: 1778, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1794, Positive cache size: 1794, Positive conditional cache size: 1779, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1795, Positive cache size: 1795, Positive conditional cache size: 1780, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1796, Positive cache size: 1796, Positive conditional cache size: 1781, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1797, Positive cache size: 1797, Positive conditional cache size: 1782, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1798, Positive cache size: 1798, Positive conditional cache size: 1783, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1799, Positive cache size: 1799, Positive conditional cache size: 1784, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1800, Positive cache size: 1800, Positive conditional cache size: 1785, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1801, Positive cache size: 1801, Positive conditional cache size: 1786, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1802, Positive cache size: 1802, Positive conditional cache size: 1787, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1803, Positive cache size: 1803, Positive conditional cache size: 1788, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1804, Positive cache size: 1804, Positive conditional cache size: 1789, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1805, Positive cache size: 1805, Positive conditional cache size: 1790, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1806, Positive cache size: 1806, Positive conditional cache size: 1791, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1807, Positive cache size: 1807, Positive conditional cache size: 1792, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1808, Positive cache size: 1808, Positive conditional cache size: 1793, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1809, Positive cache size: 1809, Positive conditional cache size: 1794, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1810, Positive cache size: 1810, Positive conditional cache size: 1795, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1811, Positive cache size: 1811, Positive conditional cache size: 1796, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1812, Positive cache size: 1812, Positive conditional cache size: 1797, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1813, Positive cache size: 1813, Positive conditional cache size: 1798, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1814, Positive cache size: 1814, Positive conditional cache size: 1799, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1815, Positive cache size: 1815, Positive conditional cache size: 1800, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1816, Positive cache size: 1816, Positive conditional cache size: 1801, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1817, Positive cache size: 1817, Positive conditional cache size: 1802, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1818, Positive cache size: 1818, Positive conditional cache size: 1803, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1819, Positive cache size: 1819, Positive conditional cache size: 1804, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1820, Positive cache size: 1820, Positive conditional cache size: 1805, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1821, Positive cache size: 1821, Positive conditional cache size: 1806, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1822, Positive cache size: 1822, Positive conditional cache size: 1807, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1823, Positive cache size: 1823, Positive conditional cache size: 1808, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1824, Positive cache size: 1824, Positive conditional cache size: 1809, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1825, Positive cache size: 1825, Positive conditional cache size: 1810, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1826, Positive cache size: 1826, Positive conditional cache size: 1811, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1827, Positive cache size: 1827, Positive conditional cache size: 1812, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1828, Positive cache size: 1828, Positive conditional cache size: 1813, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1829, Positive cache size: 1829, Positive conditional cache size: 1814, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1830, Positive cache size: 1830, Positive conditional cache size: 1815, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1831, Positive cache size: 1831, Positive conditional cache size: 1816, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1832, Positive cache size: 1832, Positive conditional cache size: 1817, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1833, Positive cache size: 1833, Positive conditional cache size: 1818, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1834, Positive cache size: 1834, Positive conditional cache size: 1819, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1835, Positive cache size: 1835, Positive conditional cache size: 1820, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1836, Positive cache size: 1836, Positive conditional cache size: 1821, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1837, Positive cache size: 1837, Positive conditional cache size: 1822, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1838, Positive cache size: 1838, Positive conditional cache size: 1823, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1839, Positive cache size: 1839, Positive conditional cache size: 1824, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1840, Positive cache size: 1840, Positive conditional cache size: 1825, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1841, Positive cache size: 1841, Positive conditional cache size: 1826, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1842, Positive cache size: 1842, Positive conditional cache size: 1827, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1843, Positive cache size: 1843, Positive conditional cache size: 1828, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1844, Positive cache size: 1844, Positive conditional cache size: 1829, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1845, Positive cache size: 1845, Positive conditional cache size: 1830, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1846, Positive cache size: 1846, Positive conditional cache size: 1831, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1847, Positive cache size: 1847, Positive conditional cache size: 1832, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1848, Positive cache size: 1848, Positive conditional cache size: 1833, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1849, Positive cache size: 1849, Positive conditional cache size: 1834, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1850, Positive cache size: 1850, Positive conditional cache size: 1835, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1851, Positive cache size: 1851, Positive conditional cache size: 1836, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1852, Positive cache size: 1852, Positive conditional cache size: 1837, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1853, Positive cache size: 1853, Positive conditional cache size: 1838, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1854, Positive cache size: 1854, Positive conditional cache size: 1839, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1855, Positive cache size: 1855, Positive conditional cache size: 1840, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1856, Positive cache size: 1856, Positive conditional cache size: 1841, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1857, Positive cache size: 1857, Positive conditional cache size: 1842, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1858, Positive cache size: 1858, Positive conditional cache size: 1843, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1859, Positive cache size: 1859, Positive conditional cache size: 1844, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1860, Positive cache size: 1860, Positive conditional cache size: 1845, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1861, Positive cache size: 1861, Positive conditional cache size: 1846, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1862, Positive cache size: 1862, Positive conditional cache size: 1847, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1863, Positive cache size: 1863, Positive conditional cache size: 1848, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1864, Positive cache size: 1864, Positive conditional cache size: 1849, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1865, Positive cache size: 1865, Positive conditional cache size: 1850, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1866, Positive cache size: 1866, Positive conditional cache size: 1851, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1867, Positive cache size: 1867, Positive conditional cache size: 1852, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1868, Positive cache size: 1868, Positive conditional cache size: 1853, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1869, Positive cache size: 1869, Positive conditional cache size: 1854, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1870, Positive cache size: 1870, Positive conditional cache size: 1855, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1871, Positive cache size: 1871, Positive conditional cache size: 1856, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1872, Positive cache size: 1872, Positive conditional cache size: 1857, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1873, Positive cache size: 1873, Positive conditional cache size: 1858, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1874, Positive cache size: 1874, Positive conditional cache size: 1859, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1875, Positive cache size: 1875, Positive conditional cache size: 1860, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1876, Positive cache size: 1876, Positive conditional cache size: 1861, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1877, Positive cache size: 1877, Positive conditional cache size: 1862, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1878, Positive cache size: 1878, Positive conditional cache size: 1863, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1879, Positive cache size: 1879, Positive conditional cache size: 1864, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1880, Positive cache size: 1880, Positive conditional cache size: 1865, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1881, Positive cache size: 1881, Positive conditional cache size: 1866, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1882, Positive cache size: 1882, Positive conditional cache size: 1867, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1883, Positive cache size: 1883, Positive conditional cache size: 1868, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1884, Positive cache size: 1884, Positive conditional cache size: 1869, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1885, Positive cache size: 1885, Positive conditional cache size: 1870, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1886, Positive cache size: 1886, Positive conditional cache size: 1871, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1887, Positive cache size: 1887, Positive conditional cache size: 1872, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1888, Positive cache size: 1888, Positive conditional cache size: 1873, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1889, Positive cache size: 1889, Positive conditional cache size: 1874, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1890, Positive cache size: 1890, Positive conditional cache size: 1875, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1891, Positive cache size: 1891, Positive conditional cache size: 1876, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1892, Positive cache size: 1892, Positive conditional cache size: 1877, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1893, Positive cache size: 1893, Positive conditional cache size: 1878, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1894, Positive cache size: 1894, Positive conditional cache size: 1879, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1895, Positive cache size: 1895, Positive conditional cache size: 1880, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1896, Positive cache size: 1896, Positive conditional cache size: 1881, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1897, Positive cache size: 1897, Positive conditional cache size: 1882, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1898, Positive cache size: 1898, Positive conditional cache size: 1883, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1899, Positive cache size: 1899, Positive conditional cache size: 1884, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1900, Positive cache size: 1900, Positive conditional cache size: 1885, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1901, Positive cache size: 1901, Positive conditional cache size: 1886, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1902, Positive cache size: 1902, Positive conditional cache size: 1887, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1903, Positive cache size: 1903, Positive conditional cache size: 1888, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1904, Positive cache size: 1904, Positive conditional cache size: 1889, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1905, Positive cache size: 1905, Positive conditional cache size: 1890, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1906, Positive cache size: 1906, Positive conditional cache size: 1891, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1907, Positive cache size: 1907, Positive conditional cache size: 1892, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1908, Positive cache size: 1908, Positive conditional cache size: 1893, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1909, Positive cache size: 1909, Positive conditional cache size: 1894, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1910, Positive cache size: 1910, Positive conditional cache size: 1895, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1911, Positive cache size: 1911, Positive conditional cache size: 1896, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1912, Positive cache size: 1912, Positive conditional cache size: 1897, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1913, Positive cache size: 1913, Positive conditional cache size: 1898, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1914, Positive cache size: 1914, Positive conditional cache size: 1899, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1915, Positive cache size: 1915, Positive conditional cache size: 1900, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1916, Positive cache size: 1916, Positive conditional cache size: 1901, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1917, Positive cache size: 1917, Positive conditional cache size: 1902, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1918, Positive cache size: 1918, Positive conditional cache size: 1903, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1919, Positive cache size: 1919, Positive conditional cache size: 1904, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1920, Positive cache size: 1920, Positive conditional cache size: 1905, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1921, Positive conditional cache size: 1906, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1922, Positive cache size: 1922, Positive conditional cache size: 1907, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1923, Positive cache size: 1923, Positive conditional cache size: 1908, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1924, Positive cache size: 1924, Positive conditional cache size: 1909, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1925, Positive cache size: 1925, Positive conditional cache size: 1910, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1926, Positive cache size: 1926, Positive conditional cache size: 1911, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1927, Positive cache size: 1927, Positive conditional cache size: 1912, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1928, Positive cache size: 1928, Positive conditional cache size: 1913, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1929, Positive cache size: 1929, Positive conditional cache size: 1914, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1930, Positive cache size: 1930, Positive conditional cache size: 1915, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1931, Positive cache size: 1931, Positive conditional cache size: 1916, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1932, Positive cache size: 1932, Positive conditional cache size: 1917, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1933, Positive cache size: 1933, Positive conditional cache size: 1918, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1934, Positive cache size: 1934, Positive conditional cache size: 1919, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1935, Positive cache size: 1935, Positive conditional cache size: 1920, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1936, Positive cache size: 1936, Positive conditional cache size: 1921, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1937, Positive cache size: 1937, Positive conditional cache size: 1922, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1938, Positive cache size: 1938, Positive conditional cache size: 1923, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1939, Positive cache size: 1939, Positive conditional cache size: 1924, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1940, Positive cache size: 1940, Positive conditional cache size: 1925, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1941, Positive cache size: 1941, Positive conditional cache size: 1926, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1942, Positive cache size: 1942, Positive conditional cache size: 1927, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1943, Positive cache size: 1943, Positive conditional cache size: 1928, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1944, Positive cache size: 1944, Positive conditional cache size: 1929, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1945, Positive cache size: 1945, Positive conditional cache size: 1930, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1946, Positive cache size: 1946, Positive conditional cache size: 1931, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1947, Positive cache size: 1947, Positive conditional cache size: 1932, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1948, Positive cache size: 1948, Positive conditional cache size: 1933, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1949, Positive cache size: 1949, Positive conditional cache size: 1934, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1950, Positive cache size: 1950, Positive conditional cache size: 1935, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1951, Positive cache size: 1951, Positive conditional cache size: 1936, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1952, Positive cache size: 1952, Positive conditional cache size: 1937, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1953, Positive cache size: 1953, Positive conditional cache size: 1938, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1954, Positive cache size: 1954, Positive conditional cache size: 1939, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1955, Positive cache size: 1955, Positive conditional cache size: 1940, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1956, Positive cache size: 1956, Positive conditional cache size: 1941, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1957, Positive cache size: 1957, Positive conditional cache size: 1942, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1958, Positive cache size: 1958, Positive conditional cache size: 1943, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1959, Positive cache size: 1959, Positive conditional cache size: 1944, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1960, Positive cache size: 1960, Positive conditional cache size: 1945, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1961, Positive cache size: 1961, Positive conditional cache size: 1946, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1962, Positive cache size: 1962, Positive conditional cache size: 1947, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1963, Positive cache size: 1963, Positive conditional cache size: 1948, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1964, Positive cache size: 1964, Positive conditional cache size: 1949, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1965, Positive cache size: 1965, Positive conditional cache size: 1950, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1966, Positive cache size: 1966, Positive conditional cache size: 1951, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1967, Positive cache size: 1967, Positive conditional cache size: 1952, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1968, Positive cache size: 1968, Positive conditional cache size: 1953, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1969, Positive cache size: 1969, Positive conditional cache size: 1954, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1970, Positive cache size: 1970, Positive conditional cache size: 1955, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1971, Positive cache size: 1971, Positive conditional cache size: 1956, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1972, Positive cache size: 1972, Positive conditional cache size: 1957, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1973, Positive cache size: 1973, Positive conditional cache size: 1958, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1974, Positive cache size: 1974, Positive conditional cache size: 1959, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1975, Positive cache size: 1975, Positive conditional cache size: 1960, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1976, Positive cache size: 1976, Positive conditional cache size: 1961, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1977, Positive cache size: 1977, Positive conditional cache size: 1962, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1978, Positive cache size: 1978, Positive conditional cache size: 1963, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1979, Positive cache size: 1979, Positive conditional cache size: 1964, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1980, Positive cache size: 1980, Positive conditional cache size: 1965, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1981, Positive cache size: 1981, Positive conditional cache size: 1966, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1982, Positive cache size: 1982, Positive conditional cache size: 1967, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1983, Positive cache size: 1983, Positive conditional cache size: 1968, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1984, Positive cache size: 1984, Positive conditional cache size: 1969, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1985, Positive cache size: 1985, Positive conditional cache size: 1970, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1986, Positive cache size: 1986, Positive conditional cache size: 1971, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1987, Positive cache size: 1987, Positive conditional cache size: 1972, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1988, Positive cache size: 1988, Positive conditional cache size: 1973, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1989, Positive cache size: 1989, Positive conditional cache size: 1974, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1990, Positive cache size: 1990, Positive conditional cache size: 1975, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1991, Positive cache size: 1991, Positive conditional cache size: 1976, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1992, Positive cache size: 1992, Positive conditional cache size: 1977, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1993, Positive cache size: 1993, Positive conditional cache size: 1978, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1994, Positive cache size: 1994, Positive conditional cache size: 1979, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1995, Positive cache size: 1995, Positive conditional cache size: 1980, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1996, Positive cache size: 1996, Positive conditional cache size: 1981, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1997, Positive cache size: 1997, Positive conditional cache size: 1982, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1998, Positive cache size: 1998, Positive conditional cache size: 1983, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1999, Positive cache size: 1999, Positive conditional cache size: 1984, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2000, Positive cache size: 2000, Positive conditional cache size: 1985, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2001, Positive cache size: 2001, Positive conditional cache size: 1986, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2002, Positive cache size: 2002, Positive conditional cache size: 1987, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2003, Positive cache size: 2003, Positive conditional cache size: 1988, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2004, Positive cache size: 2004, Positive conditional cache size: 1989, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2005, Positive cache size: 2005, Positive conditional cache size: 1990, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2006, Positive cache size: 2006, Positive conditional cache size: 1991, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2007, Positive cache size: 2007, Positive conditional cache size: 1992, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2008, Positive cache size: 2008, Positive conditional cache size: 1993, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2009, Positive cache size: 2009, Positive conditional cache size: 1994, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2010, Positive cache size: 2010, Positive conditional cache size: 1995, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2011, Positive cache size: 2011, Positive conditional cache size: 1996, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2012, Positive cache size: 2012, Positive conditional cache size: 1997, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2013, Positive cache size: 2013, Positive conditional cache size: 1998, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2014, Positive cache size: 2014, Positive conditional cache size: 1999, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2015, Positive cache size: 2015, Positive conditional cache size: 2000, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2016, Positive cache size: 2016, Positive conditional cache size: 2001, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2017, Positive cache size: 2017, Positive conditional cache size: 2002, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2018, Positive cache size: 2018, Positive conditional cache size: 2003, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2019, Positive cache size: 2019, Positive conditional cache size: 2004, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2020, Positive cache size: 2020, Positive conditional cache size: 2005, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2021, Positive cache size: 2021, Positive conditional cache size: 2006, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2022, Positive cache size: 2022, Positive conditional cache size: 2007, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2023, Positive cache size: 2023, Positive conditional cache size: 2008, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown 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, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2024, Positive cache size: 2024, Positive conditional cache size: 2009, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2025, Positive cache size: 2025, Positive conditional cache size: 2010, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2026, Positive cache size: 2026, Positive conditional cache size: 2011, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2027, Positive cache size: 2027, Positive conditional cache size: 2012, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2028, Positive cache size: 2028, Positive conditional cache size: 2013, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2029, Positive cache size: 2029, Positive conditional cache size: 2014, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2030, Positive cache size: 2030, Positive conditional cache size: 2015, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2031, Positive cache size: 2031, Positive conditional cache size: 2016, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2032, Positive cache size: 2032, Positive conditional cache size: 2017, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2033, Positive cache size: 2033, Positive conditional cache size: 2018, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2034, Positive cache size: 2034, Positive conditional cache size: 2019, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2035, Positive cache size: 2035, Positive conditional cache size: 2020, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2036, Positive cache size: 2036, Positive conditional cache size: 2021, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2037, Positive cache size: 2037, Positive conditional cache size: 2022, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2038, Positive cache size: 2038, Positive conditional cache size: 2023, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2039, Positive cache size: 2039, Positive conditional cache size: 2024, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2040, Positive cache size: 2040, Positive conditional cache size: 2025, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2041, Positive cache size: 2041, Positive conditional cache size: 2026, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2042, Positive cache size: 2042, Positive conditional cache size: 2027, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2043, Positive cache size: 2043, Positive conditional cache size: 2028, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2044, Positive cache size: 2044, Positive conditional cache size: 2029, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2045, Positive cache size: 2045, Positive conditional cache size: 2030, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2046, Positive cache size: 2046, Positive conditional cache size: 2031, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2047, Positive cache size: 2047, Positive conditional cache size: 2032, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2048, Positive cache size: 2048, Positive conditional cache size: 2033, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2049, Positive cache size: 2049, Positive conditional cache size: 2034, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2050, Positive cache size: 2050, Positive conditional cache size: 2035, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2051, Positive cache size: 2051, Positive conditional cache size: 2036, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2052, Positive cache size: 2052, Positive conditional cache size: 2037, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2053, Positive cache size: 2053, Positive conditional cache size: 2038, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2054, Positive cache size: 2054, Positive conditional cache size: 2039, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2055, Positive cache size: 2055, Positive conditional cache size: 2040, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2056, Positive cache size: 2056, Positive conditional cache size: 2041, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2057, Positive cache size: 2057, Positive conditional cache size: 2042, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2058, Positive cache size: 2058, Positive conditional cache size: 2043, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2059, Positive cache size: 2059, Positive conditional cache size: 2044, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2060, Positive cache size: 2060, Positive conditional cache size: 2045, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2061, Positive cache size: 2061, Positive conditional cache size: 2046, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2062, Positive cache size: 2062, Positive conditional cache size: 2047, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2063, Positive cache size: 2063, Positive conditional cache size: 2048, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2064, Positive cache size: 2064, Positive conditional cache size: 2049, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2065, Positive cache size: 2065, Positive conditional cache size: 2050, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2066, Positive cache size: 2066, Positive conditional cache size: 2051, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2067, Positive cache size: 2067, Positive conditional cache size: 2052, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2068, Positive cache size: 2068, Positive conditional cache size: 2053, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2069, Positive cache size: 2069, Positive conditional cache size: 2054, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2070, Positive cache size: 2070, Positive conditional cache size: 2055, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2071, Positive cache size: 2071, Positive conditional cache size: 2056, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2072, Positive cache size: 2072, Positive conditional cache size: 2057, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2073, Positive cache size: 2073, Positive conditional cache size: 2058, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2074, Positive cache size: 2074, Positive conditional cache size: 2059, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2075, Positive cache size: 2075, Positive conditional cache size: 2060, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2076, Positive cache size: 2076, Positive conditional cache size: 2061, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2077, Positive cache size: 2077, Positive conditional cache size: 2062, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2078, Positive cache size: 2078, Positive conditional cache size: 2063, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2079, Positive cache size: 2079, Positive conditional cache size: 2064, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2080, Positive cache size: 2080, Positive conditional cache size: 2065, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2081, Positive cache size: 2081, Positive conditional cache size: 2066, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2082, Positive cache size: 2082, Positive conditional cache size: 2067, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2083, Positive cache size: 2083, Positive conditional cache size: 2068, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2084, Positive cache size: 2084, Positive conditional cache size: 2069, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2085, Positive cache size: 2085, Positive conditional cache size: 2070, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2086, Positive cache size: 2086, Positive conditional cache size: 2071, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2087, Positive cache size: 2087, Positive conditional cache size: 2072, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2088, Positive cache size: 2088, Positive conditional cache size: 2073, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2089, Positive cache size: 2089, Positive conditional cache size: 2074, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2090, Positive cache size: 2090, Positive conditional cache size: 2075, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2091, Positive cache size: 2091, Positive conditional cache size: 2076, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2092, Positive cache size: 2092, Positive conditional cache size: 2077, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2093, Positive cache size: 2093, Positive conditional cache size: 2078, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2094, Positive cache size: 2094, Positive conditional cache size: 2079, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2095, Positive cache size: 2095, Positive conditional cache size: 2080, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2096, Positive cache size: 2096, Positive conditional cache size: 2081, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2097, Positive cache size: 2097, Positive conditional cache size: 2082, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2098, Positive cache size: 2098, Positive conditional cache size: 2083, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2099, Positive cache size: 2099, Positive conditional cache size: 2084, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2100, Positive cache size: 2100, Positive conditional cache size: 2085, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2101, Positive cache size: 2101, Positive conditional cache size: 2086, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2102, Positive cache size: 2102, Positive conditional cache size: 2087, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2103, Positive cache size: 2103, Positive conditional cache size: 2088, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2104, Positive cache size: 2104, Positive conditional cache size: 2089, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2105, Positive cache size: 2105, Positive conditional cache size: 2090, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2106, Positive cache size: 2106, Positive conditional cache size: 2091, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2107, Positive cache size: 2107, Positive conditional cache size: 2092, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2108, Positive cache size: 2108, Positive conditional cache size: 2093, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2109, Positive cache size: 2109, Positive conditional cache size: 2094, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2110, Positive cache size: 2110, Positive conditional cache size: 2095, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2111, Positive cache size: 2111, Positive conditional cache size: 2096, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2112, Positive cache size: 2112, Positive conditional cache size: 2097, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2113, Positive cache size: 2113, Positive conditional cache size: 2098, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2114, Positive cache size: 2114, Positive conditional cache size: 2099, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2115, Positive cache size: 2115, Positive conditional cache size: 2100, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2116, Positive cache size: 2116, Positive conditional cache size: 2101, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2117, Positive cache size: 2117, Positive conditional cache size: 2102, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2118, Positive cache size: 2118, Positive conditional cache size: 2103, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2119, Positive cache size: 2119, Positive conditional cache size: 2104, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2120, Positive cache size: 2120, Positive conditional cache size: 2105, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2121, Positive cache size: 2121, Positive conditional cache size: 2106, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2122, Positive cache size: 2122, Positive conditional cache size: 2107, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2123, Positive cache size: 2123, Positive conditional cache size: 2108, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2124, Positive cache size: 2124, Positive conditional cache size: 2109, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2125, Positive cache size: 2125, Positive conditional cache size: 2110, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2126, Positive cache size: 2126, Positive conditional cache size: 2111, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2127, Positive cache size: 2127, Positive conditional cache size: 2112, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2128, Positive cache size: 2128, Positive conditional cache size: 2113, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2129, Positive cache size: 2129, Positive conditional cache size: 2114, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2130, Positive cache size: 2130, Positive conditional cache size: 2115, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2131, Positive cache size: 2131, Positive conditional cache size: 2116, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2132, Positive cache size: 2132, Positive conditional cache size: 2117, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2133, Positive cache size: 2133, Positive conditional cache size: 2118, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2134, Positive cache size: 2134, Positive conditional cache size: 2119, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2135, Positive cache size: 2135, Positive conditional cache size: 2120, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2136, Positive cache size: 2136, Positive conditional cache size: 2121, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2137, Positive cache size: 2137, Positive conditional cache size: 2122, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2138, Positive cache size: 2138, Positive conditional cache size: 2123, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2139, Positive cache size: 2139, Positive conditional cache size: 2124, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2140, Positive cache size: 2140, Positive conditional cache size: 2125, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2141, Positive cache size: 2141, Positive conditional cache size: 2126, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2142, Positive cache size: 2142, Positive conditional cache size: 2127, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2143, Positive cache size: 2143, Positive conditional cache size: 2128, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2144, Positive cache size: 2144, Positive conditional cache size: 2129, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2145, Positive cache size: 2145, Positive conditional cache size: 2130, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2146, Positive cache size: 2146, Positive conditional cache size: 2131, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2147, Positive cache size: 2147, Positive conditional cache size: 2132, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2148, Positive cache size: 2148, Positive conditional cache size: 2133, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2149, Positive cache size: 2149, Positive conditional cache size: 2134, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2150, Positive cache size: 2150, Positive conditional cache size: 2135, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2151, Positive cache size: 2151, Positive conditional cache size: 2136, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2152, Positive cache size: 2152, Positive conditional cache size: 2137, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2153, Positive cache size: 2153, Positive conditional cache size: 2138, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2154, Positive cache size: 2154, Positive conditional cache size: 2139, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2155, Positive cache size: 2155, Positive conditional cache size: 2140, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2156, Positive cache size: 2156, Positive conditional cache size: 2141, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2157, Positive cache size: 2157, Positive conditional cache size: 2142, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2158, Positive cache size: 2158, Positive conditional cache size: 2143, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2159, Positive cache size: 2159, Positive conditional cache size: 2144, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2160, Positive cache size: 2160, Positive conditional cache size: 2145, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2161, Positive cache size: 2161, Positive conditional cache size: 2146, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2162, Positive cache size: 2162, Positive conditional cache size: 2147, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2163, Positive cache size: 2163, Positive conditional cache size: 2148, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2164, Positive cache size: 2164, Positive conditional cache size: 2149, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2165, Positive cache size: 2165, Positive conditional cache size: 2150, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2166, Positive cache size: 2166, Positive conditional cache size: 2151, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2167, Positive cache size: 2167, Positive conditional cache size: 2152, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2168, Positive cache size: 2168, Positive conditional cache size: 2153, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2169, Positive cache size: 2169, Positive conditional cache size: 2154, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2170, Positive cache size: 2170, Positive conditional cache size: 2155, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2171, Positive cache size: 2171, Positive conditional cache size: 2156, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2172, Positive cache size: 2172, Positive conditional cache size: 2157, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2173, Positive cache size: 2173, Positive conditional cache size: 2158, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2174, Positive cache size: 2174, Positive conditional cache size: 2159, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2175, Positive cache size: 2175, Positive conditional cache size: 2160, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2176, Positive cache size: 2176, Positive conditional cache size: 2161, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2177, Positive cache size: 2177, Positive conditional cache size: 2162, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2178, Positive cache size: 2178, Positive conditional cache size: 2163, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2179, Positive cache size: 2179, Positive conditional cache size: 2164, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2180, Positive cache size: 2180, Positive conditional cache size: 2165, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2181, Positive cache size: 2181, Positive conditional cache size: 2166, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2182, Positive cache size: 2182, Positive conditional cache size: 2167, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2183, Positive cache size: 2183, Positive conditional cache size: 2168, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2184, Positive cache size: 2184, Positive conditional cache size: 2169, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2185, Positive cache size: 2185, Positive conditional cache size: 2170, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2186, Positive cache size: 2186, Positive conditional cache size: 2171, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2187, Positive cache size: 2187, Positive conditional cache size: 2172, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2188, Positive cache size: 2188, Positive conditional cache size: 2173, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2189, Positive cache size: 2189, Positive conditional cache size: 2174, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2190, Positive cache size: 2190, Positive conditional cache size: 2175, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2191, Positive cache size: 2191, Positive conditional cache size: 2176, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2192, Positive cache size: 2192, Positive conditional cache size: 2177, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2193, Positive cache size: 2193, Positive conditional cache size: 2178, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2194, Positive cache size: 2194, Positive conditional cache size: 2179, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2195, Positive cache size: 2195, Positive conditional cache size: 2180, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2196, Positive cache size: 2196, Positive conditional cache size: 2181, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2197, Positive cache size: 2197, Positive conditional cache size: 2182, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2198, Positive cache size: 2198, Positive conditional cache size: 2183, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2199, Positive cache size: 2199, Positive conditional cache size: 2184, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2200, Positive cache size: 2200, Positive conditional cache size: 2185, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2201, Positive cache size: 2201, Positive conditional cache size: 2186, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2202, Positive cache size: 2202, Positive conditional cache size: 2187, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2203, Positive cache size: 2203, Positive conditional cache size: 2188, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2204, Positive cache size: 2204, Positive conditional cache size: 2189, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2205, Positive cache size: 2205, Positive conditional cache size: 2190, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2206, Positive cache size: 2206, Positive conditional cache size: 2191, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2207, Positive cache size: 2207, Positive conditional cache size: 2192, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2208, Positive cache size: 2208, Positive conditional cache size: 2193, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2209, Positive cache size: 2209, Positive conditional cache size: 2194, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2210, Positive cache size: 2210, Positive conditional cache size: 2195, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2211, Positive cache size: 2211, Positive conditional cache size: 2196, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2212, Positive cache size: 2212, Positive conditional cache size: 2197, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2213, Positive cache size: 2213, Positive conditional cache size: 2198, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2214, Positive cache size: 2214, Positive conditional cache size: 2199, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2215, Positive cache size: 2215, Positive conditional cache size: 2200, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2216, Positive cache size: 2216, Positive conditional cache size: 2201, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2217, Positive cache size: 2217, Positive conditional cache size: 2202, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2218, Positive cache size: 2218, Positive conditional cache size: 2203, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2219, Positive cache size: 2219, Positive conditional cache size: 2204, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2220, Positive cache size: 2220, Positive conditional cache size: 2205, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2221, Positive cache size: 2221, Positive conditional cache size: 2206, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2222, Positive cache size: 2222, Positive conditional cache size: 2207, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2223, Positive cache size: 2223, Positive conditional cache size: 2208, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2224, Positive cache size: 2224, Positive conditional cache size: 2209, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2225, Positive cache size: 2225, Positive conditional cache size: 2210, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2226, Positive cache size: 2226, Positive conditional cache size: 2211, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2227, Positive cache size: 2227, Positive conditional cache size: 2212, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2228, Positive cache size: 2228, Positive conditional cache size: 2213, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2229, Positive cache size: 2229, Positive conditional cache size: 2214, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2230, Positive cache size: 2230, Positive conditional cache size: 2215, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2231, Positive cache size: 2231, Positive conditional cache size: 2216, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2232, Positive cache size: 2232, Positive conditional cache size: 2217, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2233, Positive cache size: 2233, Positive conditional cache size: 2218, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2234, Positive cache size: 2234, Positive conditional cache size: 2219, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2235, Positive cache size: 2235, Positive conditional cache size: 2220, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2236, Positive cache size: 2236, Positive conditional cache size: 2221, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2237, Positive cache size: 2237, Positive conditional cache size: 2222, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2238, Positive cache size: 2238, Positive conditional cache size: 2223, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2239, Positive cache size: 2239, Positive conditional cache size: 2224, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2240, Positive cache size: 2240, Positive conditional cache size: 2225, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2241, Positive cache size: 2241, Positive conditional cache size: 2226, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2242, Positive cache size: 2242, Positive conditional cache size: 2227, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2243, Positive cache size: 2243, Positive conditional cache size: 2228, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2244, Positive cache size: 2244, Positive conditional cache size: 2229, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2245, Positive cache size: 2245, Positive conditional cache size: 2230, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2246, Positive cache size: 2246, Positive conditional cache size: 2231, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2247, Positive cache size: 2247, Positive conditional cache size: 2232, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2248, Positive cache size: 2248, Positive conditional cache size: 2233, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2249, Positive cache size: 2249, Positive conditional cache size: 2234, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2250, Positive cache size: 2250, Positive conditional cache size: 2235, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2251, Positive cache size: 2251, Positive conditional cache size: 2236, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2252, Positive cache size: 2252, Positive conditional cache size: 2237, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2253, Positive cache size: 2253, Positive conditional cache size: 2238, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2254, Positive cache size: 2254, Positive conditional cache size: 2239, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2255, Positive cache size: 2255, Positive conditional cache size: 2240, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2256, Positive cache size: 2256, Positive conditional cache size: 2241, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2257, Positive cache size: 2257, Positive conditional cache size: 2242, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2258, Positive cache size: 2258, Positive conditional cache size: 2243, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2259, Positive cache size: 2259, Positive conditional cache size: 2244, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2260, Positive cache size: 2260, Positive conditional cache size: 2245, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2261, Positive cache size: 2261, Positive conditional cache size: 2246, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2262, Positive cache size: 2262, Positive conditional cache size: 2247, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2263, Positive cache size: 2263, Positive conditional cache size: 2248, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2264, Positive cache size: 2264, Positive conditional cache size: 2249, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2265, Positive cache size: 2265, Positive conditional cache size: 2250, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2266, Positive cache size: 2266, Positive conditional cache size: 2251, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2267, Positive cache size: 2267, Positive conditional cache size: 2252, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2268, Positive cache size: 2268, Positive conditional cache size: 2253, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2269, Positive cache size: 2269, Positive conditional cache size: 2254, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2270, Positive cache size: 2270, Positive conditional cache size: 2255, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2271, Positive cache size: 2271, Positive conditional cache size: 2256, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2272, Positive cache size: 2272, Positive conditional cache size: 2257, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2273, Positive cache size: 2273, Positive conditional cache size: 2258, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2274, Positive cache size: 2274, Positive conditional cache size: 2259, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2275, Positive cache size: 2275, Positive conditional cache size: 2260, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2276, Positive cache size: 2276, Positive conditional cache size: 2261, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2277, Positive cache size: 2277, Positive conditional cache size: 2262, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2278, Positive cache size: 2278, Positive conditional cache size: 2263, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2279, Positive cache size: 2279, Positive conditional cache size: 2264, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2280, Positive cache size: 2280, Positive conditional cache size: 2265, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2281, Positive cache size: 2281, Positive conditional cache size: 2266, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2282, Positive cache size: 2282, Positive conditional cache size: 2267, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2283, Positive cache size: 2283, Positive conditional cache size: 2268, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2284, Positive cache size: 2284, Positive conditional cache size: 2269, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2285, Positive cache size: 2285, Positive conditional cache size: 2270, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2286, Positive cache size: 2286, Positive conditional cache size: 2271, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2287, Positive cache size: 2287, Positive conditional cache size: 2272, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2288, Positive cache size: 2288, Positive conditional cache size: 2273, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2289, Positive cache size: 2289, Positive conditional cache size: 2274, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2290, Positive cache size: 2290, Positive conditional cache size: 2275, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2291, Positive cache size: 2291, Positive conditional cache size: 2276, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2292, Positive cache size: 2292, Positive conditional cache size: 2277, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2293, Positive cache size: 2293, Positive conditional cache size: 2278, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2294, Positive cache size: 2294, Positive conditional cache size: 2279, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2295, Positive cache size: 2295, Positive conditional cache size: 2280, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2296, Positive cache size: 2296, Positive conditional cache size: 2281, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2297, Positive cache size: 2297, Positive conditional cache size: 2282, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2298, Positive cache size: 2298, Positive conditional cache size: 2283, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2299, Positive cache size: 2299, Positive conditional cache size: 2284, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2300, Positive cache size: 2300, Positive conditional cache size: 2285, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2301, Positive cache size: 2301, Positive conditional cache size: 2286, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2302, Positive cache size: 2302, Positive conditional cache size: 2287, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2303, Positive cache size: 2303, Positive conditional cache size: 2288, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2304, Positive cache size: 2304, Positive conditional cache size: 2289, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2305, Positive cache size: 2305, Positive conditional cache size: 2290, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2306, Positive cache size: 2306, Positive conditional cache size: 2291, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2307, Positive cache size: 2307, Positive conditional cache size: 2292, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2308, Positive cache size: 2308, Positive conditional cache size: 2293, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2309, Positive cache size: 2309, Positive conditional cache size: 2294, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2310, Positive cache size: 2310, Positive conditional cache size: 2295, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2311, Positive cache size: 2311, Positive conditional cache size: 2296, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2312, Positive cache size: 2312, Positive conditional cache size: 2297, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2313, Positive cache size: 2313, Positive conditional cache size: 2298, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2314, Positive cache size: 2314, Positive conditional cache size: 2299, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2315, Positive cache size: 2315, Positive conditional cache size: 2300, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2316, Positive cache size: 2316, Positive conditional cache size: 2301, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2317, Positive cache size: 2317, Positive conditional cache size: 2302, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2318, Positive cache size: 2318, Positive conditional cache size: 2303, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2319, Positive cache size: 2319, Positive conditional cache size: 2304, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2320, Positive cache size: 2320, Positive conditional cache size: 2305, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2321, Positive cache size: 2321, Positive conditional cache size: 2306, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2322, Positive cache size: 2322, Positive conditional cache size: 2307, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2323, Positive cache size: 2323, Positive conditional cache size: 2308, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2324, Positive cache size: 2324, Positive conditional cache size: 2309, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2325, Positive cache size: 2325, Positive conditional cache size: 2310, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2326, Positive cache size: 2326, Positive conditional cache size: 2311, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2327, Positive cache size: 2327, Positive conditional cache size: 2312, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2328, Positive cache size: 2328, Positive conditional cache size: 2313, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2329, Positive cache size: 2329, Positive conditional cache size: 2314, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2330, Positive cache size: 2330, Positive conditional cache size: 2315, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2331, Positive cache size: 2331, Positive conditional cache size: 2316, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2332, Positive cache size: 2332, Positive conditional cache size: 2317, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2333, Positive cache size: 2333, Positive conditional cache size: 2318, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2334, Positive cache size: 2334, Positive conditional cache size: 2319, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2335, Positive cache size: 2335, Positive conditional cache size: 2320, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2336, Positive cache size: 2336, Positive conditional cache size: 2321, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2337, Positive cache size: 2337, Positive conditional cache size: 2322, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2338, Positive cache size: 2338, Positive conditional cache size: 2323, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2339, Positive cache size: 2339, Positive conditional cache size: 2324, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2340, Positive cache size: 2340, Positive conditional cache size: 2325, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2341, Positive cache size: 2341, Positive conditional cache size: 2326, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2342, Positive cache size: 2342, Positive conditional cache size: 2327, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2343, Positive cache size: 2343, Positive conditional cache size: 2328, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2344, Positive cache size: 2344, Positive conditional cache size: 2329, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2345, Positive cache size: 2345, Positive conditional cache size: 2330, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2346, Positive cache size: 2346, Positive conditional cache size: 2331, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2347, Positive cache size: 2347, Positive conditional cache size: 2332, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2348, Positive cache size: 2348, Positive conditional cache size: 2333, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2349, Positive cache size: 2349, Positive conditional cache size: 2334, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2350, Positive cache size: 2350, Positive conditional cache size: 2335, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2351, Positive cache size: 2351, Positive conditional cache size: 2336, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2352, Positive cache size: 2352, Positive conditional cache size: 2337, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2353, Positive cache size: 2353, Positive conditional cache size: 2338, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2354, Positive cache size: 2354, Positive conditional cache size: 2339, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2355, Positive cache size: 2355, Positive conditional cache size: 2340, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2356, Positive cache size: 2356, Positive conditional cache size: 2341, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2357, Positive cache size: 2357, Positive conditional cache size: 2342, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2358, Positive cache size: 2358, Positive conditional cache size: 2343, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2359, Positive cache size: 2359, Positive conditional cache size: 2344, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2360, Positive cache size: 2360, Positive conditional cache size: 2345, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2361, Positive cache size: 2361, Positive conditional cache size: 2346, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2362, Positive cache size: 2362, Positive conditional cache size: 2347, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2363, Positive cache size: 2363, Positive conditional cache size: 2348, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2364, Positive cache size: 2364, Positive conditional cache size: 2349, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2365, Positive cache size: 2365, Positive conditional cache size: 2350, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2366, Positive cache size: 2366, Positive conditional cache size: 2351, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2367, Positive cache size: 2367, Positive conditional cache size: 2352, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2368, Positive conditional cache size: 2353, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2369, Positive cache size: 2369, Positive conditional cache size: 2354, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2370, Positive cache size: 2370, Positive conditional cache size: 2355, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2371, Positive cache size: 2371, Positive conditional cache size: 2356, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2372, Positive cache size: 2372, Positive conditional cache size: 2357, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2373, Positive cache size: 2373, Positive conditional cache size: 2358, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2374, Positive cache size: 2374, Positive conditional cache size: 2359, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2375, Positive cache size: 2375, Positive conditional cache size: 2360, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2376, Positive cache size: 2376, Positive conditional cache size: 2361, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2377, Positive cache size: 2377, Positive conditional cache size: 2362, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2378, Positive cache size: 2378, Positive conditional cache size: 2363, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2379, Positive cache size: 2379, Positive conditional cache size: 2364, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2380, Positive cache size: 2380, Positive conditional cache size: 2365, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2381, Positive cache size: 2381, Positive conditional cache size: 2366, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2382, Positive cache size: 2382, Positive conditional cache size: 2367, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2383, Positive cache size: 2383, Positive conditional cache size: 2368, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2384, Positive cache size: 2384, Positive conditional cache size: 2369, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2385, Positive cache size: 2385, Positive conditional cache size: 2370, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2386, Positive cache size: 2386, Positive conditional cache size: 2371, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2387, Positive cache size: 2387, Positive conditional cache size: 2372, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2388, Positive cache size: 2388, Positive conditional cache size: 2373, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2389, Positive cache size: 2389, Positive conditional cache size: 2374, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2390, Positive cache size: 2390, Positive conditional cache size: 2375, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2391, Positive cache size: 2391, Positive conditional cache size: 2376, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2392, Positive cache size: 2392, Positive conditional cache size: 2377, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2393, Positive cache size: 2393, Positive conditional cache size: 2378, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2394, Positive cache size: 2394, Positive conditional cache size: 2379, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2395, Positive cache size: 2395, Positive conditional cache size: 2380, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2396, Positive cache size: 2396, Positive conditional cache size: 2381, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2397, Positive cache size: 2397, Positive conditional cache size: 2382, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2398, Positive cache size: 2398, Positive conditional cache size: 2383, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2399, Positive cache size: 2399, Positive conditional cache size: 2384, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2400, Positive cache size: 2400, Positive conditional cache size: 2385, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2401, Positive cache size: 2401, Positive conditional cache size: 2386, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2402, Positive cache size: 2402, Positive conditional cache size: 2387, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2403, Positive cache size: 2403, Positive conditional cache size: 2388, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2404, Positive cache size: 2404, Positive conditional cache size: 2389, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2405, Positive cache size: 2405, Positive conditional cache size: 2390, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2406, Positive cache size: 2406, Positive conditional cache size: 2391, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2407, Positive cache size: 2407, Positive conditional cache size: 2392, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2408, Positive cache size: 2408, Positive conditional cache size: 2393, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2409, Positive cache size: 2409, Positive conditional cache size: 2394, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2410, Positive cache size: 2410, Positive conditional cache size: 2395, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2411, Positive cache size: 2411, Positive conditional cache size: 2396, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2412, Positive cache size: 2412, Positive conditional cache size: 2397, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2413, Positive cache size: 2413, Positive conditional cache size: 2398, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2414, Positive cache size: 2414, Positive conditional cache size: 2399, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2415, Positive cache size: 2415, Positive conditional cache size: 2400, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2416, Positive cache size: 2416, Positive conditional cache size: 2401, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2417, Positive cache size: 2417, Positive conditional cache size: 2402, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2418, Positive cache size: 2418, Positive conditional cache size: 2403, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2419, Positive cache size: 2419, Positive conditional cache size: 2404, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2420, Positive cache size: 2420, Positive conditional cache size: 2405, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2421, Positive cache size: 2421, Positive conditional cache size: 2406, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2422, Positive cache size: 2422, Positive conditional cache size: 2407, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2423, Positive cache size: 2423, Positive conditional cache size: 2408, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2424, Positive cache size: 2424, Positive conditional cache size: 2409, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2425, Positive cache size: 2425, Positive conditional cache size: 2410, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2426, Positive cache size: 2426, Positive conditional cache size: 2411, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2427, Positive cache size: 2427, Positive conditional cache size: 2412, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2428, Positive cache size: 2428, Positive conditional cache size: 2413, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2429, Positive cache size: 2429, Positive conditional cache size: 2414, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2430, Positive cache size: 2430, Positive conditional cache size: 2415, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2431, Positive cache size: 2431, Positive conditional cache size: 2416, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2432, Positive cache size: 2432, Positive conditional cache size: 2417, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2433, Positive cache size: 2433, Positive conditional cache size: 2418, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2434, Positive cache size: 2434, Positive conditional cache size: 2419, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2435, Positive cache size: 2435, Positive conditional cache size: 2420, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2436, Positive cache size: 2436, Positive conditional cache size: 2421, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2437, Positive cache size: 2437, Positive conditional cache size: 2422, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2438, Positive cache size: 2438, Positive conditional cache size: 2423, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2439, Positive cache size: 2439, Positive conditional cache size: 2424, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2440, Positive cache size: 2440, Positive conditional cache size: 2425, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2441, Positive cache size: 2441, Positive conditional cache size: 2426, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2442, Positive cache size: 2442, Positive conditional cache size: 2427, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2443, Positive cache size: 2443, Positive conditional cache size: 2428, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2444, Positive cache size: 2444, Positive conditional cache size: 2429, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2445, Positive cache size: 2445, Positive conditional cache size: 2430, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2446, Positive cache size: 2446, Positive conditional cache size: 2431, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2447, Positive cache size: 2447, Positive conditional cache size: 2432, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2448, Positive cache size: 2448, Positive conditional cache size: 2433, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2449, Positive cache size: 2449, Positive conditional cache size: 2434, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2450, Positive cache size: 2450, Positive conditional cache size: 2435, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2451, Positive cache size: 2451, Positive conditional cache size: 2436, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2452, Positive cache size: 2452, Positive conditional cache size: 2437, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2453, Positive cache size: 2453, Positive conditional cache size: 2438, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2454, Positive cache size: 2454, Positive conditional cache size: 2439, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2455, Positive cache size: 2455, Positive conditional cache size: 2440, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2456, Positive cache size: 2456, Positive conditional cache size: 2441, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2457, Positive cache size: 2457, Positive conditional cache size: 2442, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2458, Positive cache size: 2458, Positive conditional cache size: 2443, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2459, Positive cache size: 2459, Positive conditional cache size: 2444, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2460, Positive cache size: 2460, Positive conditional cache size: 2445, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2461, Positive cache size: 2461, Positive conditional cache size: 2446, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2462, Positive cache size: 2462, Positive conditional cache size: 2447, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2463, Positive cache size: 2463, Positive conditional cache size: 2448, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2464, Positive cache size: 2464, Positive conditional cache size: 2449, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2465, Positive cache size: 2465, Positive conditional cache size: 2450, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2466, Positive cache size: 2466, Positive conditional cache size: 2451, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2467, Positive cache size: 2467, Positive conditional cache size: 2452, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2468, Positive cache size: 2468, Positive conditional cache size: 2453, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2469, Positive cache size: 2469, Positive conditional cache size: 2454, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2470, Positive cache size: 2470, Positive conditional cache size: 2455, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2471, Positive cache size: 2471, Positive conditional cache size: 2456, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2472, Positive cache size: 2472, Positive conditional cache size: 2457, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2473, Positive cache size: 2473, Positive conditional cache size: 2458, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2474, Positive cache size: 2474, Positive conditional cache size: 2459, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2475, Positive cache size: 2475, Positive conditional cache size: 2460, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2476, Positive cache size: 2476, Positive conditional cache size: 2461, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2477, Positive cache size: 2477, Positive conditional cache size: 2462, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2478, Positive cache size: 2478, Positive conditional cache size: 2463, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2479, Positive cache size: 2479, Positive conditional cache size: 2464, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2480, Positive cache size: 2480, Positive conditional cache size: 2465, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2481, Positive cache size: 2481, Positive conditional cache size: 2466, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2482, Positive cache size: 2482, Positive conditional cache size: 2467, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2483, Positive cache size: 2483, Positive conditional cache size: 2468, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2484, Positive cache size: 2484, Positive conditional cache size: 2469, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2485, Positive cache size: 2485, Positive conditional cache size: 2470, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2486, Positive cache size: 2486, Positive conditional cache size: 2471, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2487, Positive cache size: 2487, Positive conditional cache size: 2472, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2488, Positive cache size: 2488, Positive conditional cache size: 2473, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2489, Positive cache size: 2489, Positive conditional cache size: 2474, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2490, Positive cache size: 2490, Positive conditional cache size: 2475, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2491, Positive cache size: 2491, Positive conditional cache size: 2476, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2492, Positive cache size: 2492, Positive conditional cache size: 2477, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2493, Positive cache size: 2493, Positive conditional cache size: 2478, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2494, Positive cache size: 2494, Positive conditional cache size: 2479, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2495, Positive cache size: 2495, Positive conditional cache size: 2480, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2496, Positive cache size: 2496, Positive conditional cache size: 2481, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2497, Positive cache size: 2497, Positive conditional cache size: 2482, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2498, Positive cache size: 2498, Positive conditional cache size: 2483, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2499, Positive cache size: 2499, Positive conditional cache size: 2484, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2500, Positive cache size: 2500, Positive conditional cache size: 2485, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2501, Positive cache size: 2501, Positive conditional cache size: 2486, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2502, Positive cache size: 2502, Positive conditional cache size: 2487, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2503, Positive cache size: 2503, Positive conditional cache size: 2488, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2504, Positive cache size: 2504, Positive conditional cache size: 2489, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2505, Positive cache size: 2505, Positive conditional cache size: 2490, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2506, Positive cache size: 2506, Positive conditional cache size: 2491, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2507, Positive cache size: 2507, Positive conditional cache size: 2492, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2508, Positive cache size: 2508, Positive conditional cache size: 2493, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2509, Positive cache size: 2509, Positive conditional cache size: 2494, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2510, Positive cache size: 2510, Positive conditional cache size: 2495, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2511, Positive cache size: 2511, Positive conditional cache size: 2496, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2512, Positive cache size: 2512, Positive conditional cache size: 2497, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2513, Positive cache size: 2513, Positive conditional cache size: 2498, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2514, Positive cache size: 2514, Positive conditional cache size: 2499, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2515, Positive cache size: 2515, Positive conditional cache size: 2500, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2516, Positive cache size: 2516, Positive conditional cache size: 2501, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2517, Positive cache size: 2517, Positive conditional cache size: 2502, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2518, Positive cache size: 2518, Positive conditional cache size: 2503, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2519, Positive cache size: 2519, Positive conditional cache size: 2504, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2520, Positive cache size: 2520, Positive conditional cache size: 2505, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2521, Positive cache size: 2521, Positive conditional cache size: 2506, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2522, Positive cache size: 2522, Positive conditional cache size: 2507, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2523, Positive cache size: 2523, Positive conditional cache size: 2508, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2524, Positive cache size: 2524, Positive conditional cache size: 2509, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2525, Positive cache size: 2525, Positive conditional cache size: 2510, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2526, Positive cache size: 2526, Positive conditional cache size: 2511, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2527, Positive cache size: 2527, Positive conditional cache size: 2512, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2528, Positive cache size: 2528, Positive conditional cache size: 2513, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2529, Positive cache size: 2529, Positive conditional cache size: 2514, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2530, Positive cache size: 2530, Positive conditional cache size: 2515, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2531, Positive cache size: 2531, Positive conditional cache size: 2516, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2532, Positive cache size: 2532, Positive conditional cache size: 2517, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2533, Positive cache size: 2533, Positive conditional cache size: 2518, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2534, Positive cache size: 2534, Positive conditional cache size: 2519, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2535, Positive cache size: 2535, Positive conditional cache size: 2520, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2536, Positive cache size: 2536, Positive conditional cache size: 2521, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2537, Positive cache size: 2537, Positive conditional cache size: 2522, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2538, Positive cache size: 2538, Positive conditional cache size: 2523, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2539, Positive cache size: 2539, Positive conditional cache size: 2524, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2540, Positive cache size: 2540, Positive conditional cache size: 2525, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2541, Positive cache size: 2541, Positive conditional cache size: 2526, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2542, Positive cache size: 2542, Positive conditional cache size: 2527, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2543, Positive cache size: 2543, Positive conditional cache size: 2528, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2544, Positive cache size: 2544, Positive conditional cache size: 2529, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2545, Positive cache size: 2545, Positive conditional cache size: 2530, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2546, Positive cache size: 2546, Positive conditional cache size: 2531, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2547, Positive cache size: 2547, Positive conditional cache size: 2532, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2548, Positive cache size: 2548, Positive conditional cache size: 2533, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2549, Positive cache size: 2549, Positive conditional cache size: 2534, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2550, Positive cache size: 2550, Positive conditional cache size: 2535, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2551, Positive cache size: 2551, Positive conditional cache size: 2536, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2552, Positive cache size: 2552, Positive conditional cache size: 2537, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 2553, Positive conditional cache size: 2538, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2554, Positive cache size: 2554, Positive conditional cache size: 2539, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2555, Positive cache size: 2555, Positive conditional cache size: 2540, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2556, Positive cache size: 2556, Positive conditional cache size: 2541, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2557, Positive cache size: 2557, Positive conditional cache size: 2542, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2558, Positive cache size: 2558, Positive conditional cache size: 2543, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2559, Positive cache size: 2559, Positive conditional cache size: 2544, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2560, Positive cache size: 2560, Positive conditional cache size: 2545, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2561, Positive cache size: 2561, Positive conditional cache size: 2546, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2562, Positive cache size: 2562, Positive conditional cache size: 2547, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2563, Positive cache size: 2563, Positive conditional cache size: 2548, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2564, Positive cache size: 2564, Positive conditional cache size: 2549, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2565, Positive cache size: 2565, Positive conditional cache size: 2550, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2566, Positive cache size: 2566, Positive conditional cache size: 2551, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2567, Positive cache size: 2567, Positive conditional cache size: 2552, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2568, Positive cache size: 2568, Positive conditional cache size: 2553, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2569, Positive cache size: 2569, Positive conditional cache size: 2554, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2570, Positive cache size: 2570, Positive conditional cache size: 2555, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2571, Positive cache size: 2571, Positive conditional cache size: 2556, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2572, Positive cache size: 2572, Positive conditional cache size: 2557, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2573, Positive cache size: 2573, Positive conditional cache size: 2558, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2574, Positive cache size: 2574, Positive conditional cache size: 2559, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2575, Positive cache size: 2575, Positive conditional cache size: 2560, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2576, Positive cache size: 2576, Positive conditional cache size: 2561, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2577, Positive cache size: 2577, Positive conditional cache size: 2562, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2578, Positive cache size: 2578, Positive conditional cache size: 2563, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2579, Positive cache size: 2579, Positive conditional cache size: 2564, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2580, Positive cache size: 2580, Positive conditional cache size: 2565, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2581, Positive cache size: 2581, Positive conditional cache size: 2566, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2582, Positive cache size: 2582, Positive conditional cache size: 2567, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2583, Positive cache size: 2583, Positive conditional cache size: 2568, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2584, Positive cache size: 2584, Positive conditional cache size: 2569, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2585, Positive cache size: 2585, Positive conditional cache size: 2570, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2586, Positive cache size: 2586, Positive conditional cache size: 2571, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2587, Positive cache size: 2587, Positive conditional cache size: 2572, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2588, Positive cache size: 2588, Positive conditional cache size: 2573, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2589, Positive cache size: 2589, Positive conditional cache size: 2574, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2590, Positive cache size: 2590, Positive conditional cache size: 2575, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2591, Positive cache size: 2591, Positive conditional cache size: 2576, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2592, Positive cache size: 2592, Positive conditional cache size: 2577, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2593, Positive cache size: 2593, Positive conditional cache size: 2578, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2594, Positive cache size: 2594, Positive conditional cache size: 2579, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2595, Positive cache size: 2595, Positive conditional cache size: 2580, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2596, Positive cache size: 2596, Positive conditional cache size: 2581, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2597, Positive cache size: 2597, Positive conditional cache size: 2582, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2598, Positive cache size: 2598, Positive conditional cache size: 2583, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2599, Positive cache size: 2599, Positive conditional cache size: 2584, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2600, Positive cache size: 2600, Positive conditional cache size: 2585, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2601, Positive cache size: 2601, Positive conditional cache size: 2586, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2602, Positive cache size: 2602, Positive conditional cache size: 2587, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2603, Positive cache size: 2603, Positive conditional cache size: 2588, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2604, Positive cache size: 2604, Positive conditional cache size: 2589, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2605, Positive cache size: 2605, Positive conditional cache size: 2590, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2606, Positive cache size: 2606, Positive conditional cache size: 2591, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2607, Positive cache size: 2607, Positive conditional cache size: 2592, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2608, Positive cache size: 2608, Positive conditional cache size: 2593, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2609, Positive cache size: 2609, Positive conditional cache size: 2594, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2610, Positive cache size: 2610, Positive conditional cache size: 2595, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2611, Positive cache size: 2611, Positive conditional cache size: 2596, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2612, Positive cache size: 2612, Positive conditional cache size: 2597, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2613, Positive cache size: 2613, Positive conditional cache size: 2598, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2614, Positive cache size: 2614, Positive conditional cache size: 2599, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2615, Positive cache size: 2615, Positive conditional cache size: 2600, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2616, Positive cache size: 2616, Positive conditional cache size: 2601, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2617, Positive cache size: 2617, Positive conditional cache size: 2602, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2618, Positive cache size: 2618, Positive conditional cache size: 2603, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2619, Positive cache size: 2619, Positive conditional cache size: 2604, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2620, Positive cache size: 2620, Positive conditional cache size: 2605, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2621, Positive cache size: 2621, Positive conditional cache size: 2606, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2622, Positive cache size: 2622, Positive conditional cache size: 2607, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2623, Positive cache size: 2623, Positive conditional cache size: 2608, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2624, Positive cache size: 2624, Positive conditional cache size: 2609, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2625, Positive cache size: 2625, Positive conditional cache size: 2610, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2626, Positive cache size: 2626, Positive conditional cache size: 2611, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2627, Positive cache size: 2627, Positive conditional cache size: 2612, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2628, Positive cache size: 2628, Positive conditional cache size: 2613, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2629, Positive cache size: 2629, Positive conditional cache size: 2614, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2630, Positive cache size: 2630, Positive conditional cache size: 2615, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2631, Positive cache size: 2631, Positive conditional cache size: 2616, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2632, Positive cache size: 2632, Positive conditional cache size: 2617, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2633, Positive cache size: 2633, Positive conditional cache size: 2618, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2634, Positive cache size: 2634, Positive conditional cache size: 2619, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2635, Positive cache size: 2635, Positive conditional cache size: 2620, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2636, Positive cache size: 2636, Positive conditional cache size: 2621, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2637, Positive cache size: 2637, Positive conditional cache size: 2622, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2638, Positive cache size: 2638, Positive conditional cache size: 2623, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2639, Positive cache size: 2639, Positive conditional cache size: 2624, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2640, Positive cache size: 2640, Positive conditional cache size: 2625, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2641, Positive cache size: 2641, Positive conditional cache size: 2626, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2642, Positive cache size: 2642, Positive conditional cache size: 2627, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2643, Positive cache size: 2643, Positive conditional cache size: 2628, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2644, Positive cache size: 2644, Positive conditional cache size: 2629, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2645, Positive cache size: 2645, Positive conditional cache size: 2630, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2646, Positive cache size: 2646, Positive conditional cache size: 2631, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2647, Positive cache size: 2647, Positive conditional cache size: 2632, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2648, Positive cache size: 2648, Positive conditional cache size: 2633, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2649, Positive cache size: 2649, Positive conditional cache size: 2634, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2650, Positive cache size: 2650, Positive conditional cache size: 2635, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2651, Positive cache size: 2651, Positive conditional cache size: 2636, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2652, Positive cache size: 2652, Positive conditional cache size: 2637, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2653, Positive cache size: 2653, Positive conditional cache size: 2638, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2654, Positive cache size: 2654, Positive conditional cache size: 2639, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2655, Positive cache size: 2655, Positive conditional cache size: 2640, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2656, Positive cache size: 2656, Positive conditional cache size: 2641, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2657, Positive cache size: 2657, Positive conditional cache size: 2642, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2658, Positive cache size: 2658, Positive conditional cache size: 2643, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2659, Positive cache size: 2659, Positive conditional cache size: 2644, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2660, Positive cache size: 2660, Positive conditional cache size: 2645, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2661, Positive cache size: 2661, Positive conditional cache size: 2646, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2662, Positive cache size: 2662, Positive conditional cache size: 2647, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2663, Positive cache size: 2663, Positive conditional cache size: 2648, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2664, Positive cache size: 2664, Positive conditional cache size: 2649, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2665, Positive cache size: 2665, Positive conditional cache size: 2650, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2666, Positive cache size: 2666, Positive conditional cache size: 2651, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2667, Positive cache size: 2667, Positive conditional cache size: 2652, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2668, Positive cache size: 2668, Positive conditional cache size: 2653, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2669, Positive cache size: 2669, Positive conditional cache size: 2654, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2670, Positive cache size: 2670, Positive conditional cache size: 2655, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2671, Positive cache size: 2671, Positive conditional cache size: 2656, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2672, Positive cache size: 2672, Positive conditional cache size: 2657, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2673, Positive cache size: 2673, Positive conditional cache size: 2658, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2674, Positive cache size: 2674, Positive conditional cache size: 2659, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2675, Positive cache size: 2675, Positive conditional cache size: 2660, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2676, Positive cache size: 2676, Positive conditional cache size: 2661, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2677, Positive cache size: 2677, Positive conditional cache size: 2662, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2678, Positive cache size: 2678, Positive conditional cache size: 2663, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2679, Positive cache size: 2679, Positive conditional cache size: 2664, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2680, Positive cache size: 2680, Positive conditional cache size: 2665, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2681, Positive cache size: 2681, Positive conditional cache size: 2666, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2682, Positive cache size: 2682, Positive conditional cache size: 2667, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2683, Positive cache size: 2683, Positive conditional cache size: 2668, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2684, Positive cache size: 2684, Positive conditional cache size: 2669, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2685, Positive cache size: 2685, Positive conditional cache size: 2670, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2686, Positive cache size: 2686, Positive conditional cache size: 2671, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2687, Positive cache size: 2687, Positive conditional cache size: 2672, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2688, Positive cache size: 2688, Positive conditional cache size: 2673, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2689, Positive cache size: 2689, Positive conditional cache size: 2674, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2690, Positive cache size: 2690, Positive conditional cache size: 2675, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2691, Positive cache size: 2691, Positive conditional cache size: 2676, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2692, Positive cache size: 2692, Positive conditional cache size: 2677, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2693, Positive cache size: 2693, Positive conditional cache size: 2678, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2694, Positive cache size: 2694, Positive conditional cache size: 2679, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2695, Positive cache size: 2695, Positive conditional cache size: 2680, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2696, Positive cache size: 2696, Positive conditional cache size: 2681, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2697, Positive cache size: 2697, Positive conditional cache size: 2682, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2698, Positive cache size: 2698, Positive conditional cache size: 2683, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2699, Positive cache size: 2699, Positive conditional cache size: 2684, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2700, Positive cache size: 2700, Positive conditional cache size: 2685, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2701, Positive cache size: 2701, Positive conditional cache size: 2686, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2702, Positive cache size: 2702, Positive conditional cache size: 2687, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2703, Positive cache size: 2703, Positive conditional cache size: 2688, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2704, Positive cache size: 2704, Positive conditional cache size: 2689, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2705, Positive cache size: 2705, Positive conditional cache size: 2690, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2706, Positive cache size: 2706, Positive conditional cache size: 2691, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2707, Positive cache size: 2707, Positive conditional cache size: 2692, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2708, Positive cache size: 2708, Positive conditional cache size: 2693, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2709, Positive cache size: 2709, Positive conditional cache size: 2694, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2710, Positive cache size: 2710, Positive conditional cache size: 2695, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2711, Positive cache size: 2711, Positive conditional cache size: 2696, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2712, Positive cache size: 2712, Positive conditional cache size: 2697, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2713, Positive cache size: 2713, Positive conditional cache size: 2698, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2714, Positive cache size: 2714, Positive conditional cache size: 2699, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2715, Positive cache size: 2715, Positive conditional cache size: 2700, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2716, Positive cache size: 2716, Positive conditional cache size: 2701, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2717, Positive cache size: 2717, Positive conditional cache size: 2702, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2718, Positive cache size: 2718, Positive conditional cache size: 2703, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2719, Positive cache size: 2719, Positive conditional cache size: 2704, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2720, Positive cache size: 2720, Positive conditional cache size: 2705, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2721, Positive cache size: 2721, Positive conditional cache size: 2706, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2722, Positive cache size: 2722, Positive conditional cache size: 2707, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2723, Positive cache size: 2723, Positive conditional cache size: 2708, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2724, Positive cache size: 2724, Positive conditional cache size: 2709, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2725, Positive cache size: 2725, Positive conditional cache size: 2710, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2726, Positive cache size: 2726, Positive conditional cache size: 2711, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2727, Positive cache size: 2727, Positive conditional cache size: 2712, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2728, Positive cache size: 2728, Positive conditional cache size: 2713, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2729, Positive cache size: 2729, Positive conditional cache size: 2714, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2730, Positive cache size: 2730, Positive conditional cache size: 2715, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2731, Positive cache size: 2731, Positive conditional cache size: 2716, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2732, Positive cache size: 2732, Positive conditional cache size: 2717, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2733, Positive cache size: 2733, Positive conditional cache size: 2718, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2734, Positive cache size: 2734, Positive conditional cache size: 2719, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2735, Positive cache size: 2735, Positive conditional cache size: 2720, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2736, Positive cache size: 2736, Positive conditional cache size: 2721, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2737, Positive cache size: 2737, Positive conditional cache size: 2722, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2738, Positive cache size: 2738, Positive conditional cache size: 2723, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2739, Positive cache size: 2739, Positive conditional cache size: 2724, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2740, Positive cache size: 2740, Positive conditional cache size: 2725, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2741, Positive cache size: 2741, Positive conditional cache size: 2726, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2742, Positive cache size: 2742, Positive conditional cache size: 2727, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2743, Positive cache size: 2743, Positive conditional cache size: 2728, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2744, Positive cache size: 2744, Positive conditional cache size: 2729, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2745, Positive cache size: 2745, Positive conditional cache size: 2730, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2746, Positive cache size: 2746, Positive conditional cache size: 2731, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2747, Positive cache size: 2747, Positive conditional cache size: 2732, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2748, Positive cache size: 2748, Positive conditional cache size: 2733, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2749, Positive cache size: 2749, Positive conditional cache size: 2734, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2750, Positive cache size: 2750, Positive conditional cache size: 2735, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2751, Positive cache size: 2751, Positive conditional cache size: 2736, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2752, Positive cache size: 2752, Positive conditional cache size: 2737, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2753, Positive cache size: 2753, Positive conditional cache size: 2738, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2754, Positive cache size: 2754, Positive conditional cache size: 2739, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2755, Positive cache size: 2755, Positive conditional cache size: 2740, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2756, Positive cache size: 2756, Positive conditional cache size: 2741, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2757, Positive cache size: 2757, Positive conditional cache size: 2742, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2758, Positive cache size: 2758, Positive conditional cache size: 2743, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2759, Positive cache size: 2759, Positive conditional cache size: 2744, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2760, Positive cache size: 2760, Positive conditional cache size: 2745, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2761, Positive cache size: 2761, Positive conditional cache size: 2746, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2762, Positive cache size: 2762, Positive conditional cache size: 2747, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2763, Positive cache size: 2763, Positive conditional cache size: 2748, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2764, Positive cache size: 2764, Positive conditional cache size: 2749, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2765, Positive cache size: 2765, Positive conditional cache size: 2750, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2766, Positive cache size: 2766, Positive conditional cache size: 2751, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2767, Positive cache size: 2767, Positive conditional cache size: 2752, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2768, Positive cache size: 2768, Positive conditional cache size: 2753, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2769, Positive cache size: 2769, Positive conditional cache size: 2754, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2770, Positive cache size: 2770, Positive conditional cache size: 2755, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2771, Positive cache size: 2771, Positive conditional cache size: 2756, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2772, Positive cache size: 2772, Positive conditional cache size: 2757, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2773, Positive cache size: 2773, Positive conditional cache size: 2758, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2774, Positive cache size: 2774, Positive conditional cache size: 2759, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2775, Positive cache size: 2775, Positive conditional cache size: 2760, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2776, Positive cache size: 2776, Positive conditional cache size: 2761, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2777, Positive cache size: 2777, Positive conditional cache size: 2762, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2778, Positive cache size: 2778, Positive conditional cache size: 2763, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2779, Positive cache size: 2779, Positive conditional cache size: 2764, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2780, Positive cache size: 2780, Positive conditional cache size: 2765, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2781, Positive cache size: 2781, Positive conditional cache size: 2766, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2782, Positive cache size: 2782, Positive conditional cache size: 2767, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2783, Positive cache size: 2783, Positive conditional cache size: 2768, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2784, Positive cache size: 2784, Positive conditional cache size: 2769, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2785, Positive cache size: 2785, Positive conditional cache size: 2770, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2786, Positive cache size: 2786, Positive conditional cache size: 2771, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2787, Positive cache size: 2787, Positive conditional cache size: 2772, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2788, Positive cache size: 2788, Positive conditional cache size: 2773, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2789, Positive cache size: 2789, Positive conditional cache size: 2774, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2790, Positive cache size: 2790, Positive conditional cache size: 2775, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2791, Positive cache size: 2791, Positive conditional cache size: 2776, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2792, Positive cache size: 2792, Positive conditional cache size: 2777, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2793, Positive cache size: 2793, Positive conditional cache size: 2778, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2794, Positive cache size: 2794, Positive conditional cache size: 2779, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2795, Positive cache size: 2795, Positive conditional cache size: 2780, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2796, Positive cache size: 2796, Positive conditional cache size: 2781, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2797, Positive cache size: 2797, Positive conditional cache size: 2782, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2798, Positive cache size: 2798, Positive conditional cache size: 2783, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2799, Positive cache size: 2799, Positive conditional cache size: 2784, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2800, Positive cache size: 2800, Positive conditional cache size: 2785, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2801, Positive cache size: 2801, Positive conditional cache size: 2786, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2802, Positive cache size: 2802, Positive conditional cache size: 2787, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2803, Positive cache size: 2803, Positive conditional cache size: 2788, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2804, Positive cache size: 2804, Positive conditional cache size: 2789, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2805, Positive cache size: 2805, Positive conditional cache size: 2790, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2806, Positive cache size: 2806, Positive conditional cache size: 2791, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2807, Positive cache size: 2807, Positive conditional cache size: 2792, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2808, Positive cache size: 2808, Positive conditional cache size: 2793, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2809, Positive cache size: 2809, Positive conditional cache size: 2794, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2810, Positive cache size: 2810, Positive conditional cache size: 2795, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2811, Positive cache size: 2811, Positive conditional cache size: 2796, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2812, Positive cache size: 2812, Positive conditional cache size: 2797, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2813, Positive cache size: 2813, Positive conditional cache size: 2798, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2814, Positive cache size: 2814, Positive conditional cache size: 2799, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2815, Positive cache size: 2815, Positive conditional cache size: 2800, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2816, Positive cache size: 2816, Positive conditional cache size: 2801, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2817, Positive cache size: 2817, Positive conditional cache size: 2802, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2818, Positive cache size: 2818, Positive conditional cache size: 2803, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2819, Positive cache size: 2819, Positive conditional cache size: 2804, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2820, Positive cache size: 2820, Positive conditional cache size: 2805, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2821, Positive cache size: 2821, Positive conditional cache size: 2806, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2822, Positive cache size: 2822, Positive conditional cache size: 2807, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2823, Positive cache size: 2823, Positive conditional cache size: 2808, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2824, Positive cache size: 2824, Positive conditional cache size: 2809, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2825, Positive cache size: 2825, Positive conditional cache size: 2810, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2826, Positive cache size: 2826, Positive conditional cache size: 2811, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2827, Positive cache size: 2827, Positive conditional cache size: 2812, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2828, Positive cache size: 2828, Positive conditional cache size: 2813, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2829, Positive cache size: 2829, Positive conditional cache size: 2814, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2830, Positive cache size: 2830, Positive conditional cache size: 2815, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2831, Positive cache size: 2831, Positive conditional cache size: 2816, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2832, Positive cache size: 2832, Positive conditional cache size: 2817, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2833, Positive cache size: 2833, Positive conditional cache size: 2818, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2834, Positive cache size: 2834, Positive conditional cache size: 2819, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2835, Positive cache size: 2835, Positive conditional cache size: 2820, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2836, Positive cache size: 2836, Positive conditional cache size: 2821, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2837, Positive cache size: 2837, Positive conditional cache size: 2822, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2838, Positive cache size: 2838, Positive conditional cache size: 2823, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2839, Positive cache size: 2839, Positive conditional cache size: 2824, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2840, Positive cache size: 2840, Positive conditional cache size: 2825, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2841, Positive cache size: 2841, Positive conditional cache size: 2826, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2842, Positive cache size: 2842, Positive conditional cache size: 2827, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2843, Positive cache size: 2843, Positive conditional cache size: 2828, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2844, Positive cache size: 2844, Positive conditional cache size: 2829, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2845, Positive cache size: 2845, Positive conditional cache size: 2830, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2846, Positive cache size: 2846, Positive conditional cache size: 2831, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2847, Positive cache size: 2847, Positive conditional cache size: 2832, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2848, Positive cache size: 2848, Positive conditional cache size: 2833, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2849, Positive cache size: 2849, Positive conditional cache size: 2834, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2850, Positive cache size: 2850, Positive conditional cache size: 2835, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2851, Positive cache size: 2851, Positive conditional cache size: 2836, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2852, Positive cache size: 2852, Positive conditional cache size: 2837, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2853, Positive cache size: 2853, Positive conditional cache size: 2838, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2854, Positive cache size: 2854, Positive conditional cache size: 2839, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2855, Positive cache size: 2855, Positive conditional cache size: 2840, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2856, Positive cache size: 2856, Positive conditional cache size: 2841, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2857, Positive cache size: 2857, Positive conditional cache size: 2842, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2858, Positive cache size: 2858, Positive conditional cache size: 2843, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2859, Positive cache size: 2859, Positive conditional cache size: 2844, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2860, Positive cache size: 2860, Positive conditional cache size: 2845, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2861, Positive cache size: 2861, Positive conditional cache size: 2846, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2862, Positive cache size: 2862, Positive conditional cache size: 2847, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2863, Positive cache size: 2863, Positive conditional cache size: 2848, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2864, Positive cache size: 2864, Positive conditional cache size: 2849, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2865, Positive cache size: 2865, Positive conditional cache size: 2850, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2866, Positive cache size: 2866, Positive conditional cache size: 2851, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2867, Positive cache size: 2867, Positive conditional cache size: 2852, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2868, Positive cache size: 2868, Positive conditional cache size: 2853, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2869, Positive cache size: 2869, Positive conditional cache size: 2854, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2870, Positive cache size: 2870, Positive conditional cache size: 2855, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2871, Positive cache size: 2871, Positive conditional cache size: 2856, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2872, Positive cache size: 2872, Positive conditional cache size: 2857, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2873, Positive cache size: 2873, Positive conditional cache size: 2858, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2874, Positive cache size: 2874, Positive conditional cache size: 2859, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2875, Positive cache size: 2875, Positive conditional cache size: 2860, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2876, Positive cache size: 2876, Positive conditional cache size: 2861, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2877, Positive cache size: 2877, Positive conditional cache size: 2862, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2878, Positive cache size: 2878, Positive conditional cache size: 2863, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2879, Positive cache size: 2879, Positive conditional cache size: 2864, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2880, Positive cache size: 2880, Positive conditional cache size: 2865, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2881, Positive cache size: 2881, Positive conditional cache size: 2866, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2882, Positive cache size: 2882, Positive conditional cache size: 2867, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2883, Positive cache size: 2883, Positive conditional cache size: 2868, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2884, Positive cache size: 2884, Positive conditional cache size: 2869, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2885, Positive cache size: 2885, Positive conditional cache size: 2870, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2886, Positive cache size: 2886, Positive conditional cache size: 2871, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2887, Positive cache size: 2887, Positive conditional cache size: 2872, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2888, Positive cache size: 2888, Positive conditional cache size: 2873, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2889, Positive cache size: 2889, Positive conditional cache size: 2874, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2890, Positive cache size: 2890, Positive conditional cache size: 2875, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2891, Positive cache size: 2891, Positive conditional cache size: 2876, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2892, Positive cache size: 2892, Positive conditional cache size: 2877, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2893, Positive cache size: 2893, Positive conditional cache size: 2878, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2894, Positive cache size: 2894, Positive conditional cache size: 2879, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2895, Positive cache size: 2895, Positive conditional cache size: 2880, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2896, Positive cache size: 2896, Positive conditional cache size: 2881, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2897, Positive cache size: 2897, Positive conditional cache size: 2882, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2898, Positive cache size: 2898, Positive conditional cache size: 2883, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2899, Positive cache size: 2899, Positive conditional cache size: 2884, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2900, Positive cache size: 2900, Positive conditional cache size: 2885, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2901, Positive cache size: 2901, Positive conditional cache size: 2886, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2902, Positive cache size: 2902, Positive conditional cache size: 2887, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2903, Positive cache size: 2903, Positive conditional cache size: 2888, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2904, Positive cache size: 2904, Positive conditional cache size: 2889, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2905, Positive cache size: 2905, Positive conditional cache size: 2890, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2906, Positive cache size: 2906, Positive conditional cache size: 2891, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2907, Positive cache size: 2907, Positive conditional cache size: 2892, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2908, Positive cache size: 2908, Positive conditional cache size: 2893, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2909, Positive cache size: 2909, Positive conditional cache size: 2894, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2910, Positive cache size: 2910, Positive conditional cache size: 2895, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2911, Positive cache size: 2911, Positive conditional cache size: 2896, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2912, Positive cache size: 2912, Positive conditional cache size: 2897, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2913, Positive cache size: 2913, Positive conditional cache size: 2898, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2914, Positive cache size: 2914, Positive conditional cache size: 2899, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2915, Positive cache size: 2915, Positive conditional cache size: 2900, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2916, Positive cache size: 2916, Positive conditional cache size: 2901, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2917, Positive cache size: 2917, Positive conditional cache size: 2902, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2918, Positive cache size: 2918, Positive conditional cache size: 2903, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2919, Positive cache size: 2919, Positive conditional cache size: 2904, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2920, Positive cache size: 2920, Positive conditional cache size: 2905, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2921, Positive cache size: 2921, Positive conditional cache size: 2906, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2922, Positive cache size: 2922, Positive conditional cache size: 2907, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2923, Positive cache size: 2923, Positive conditional cache size: 2908, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2924, Positive cache size: 2924, Positive conditional cache size: 2909, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2925, Positive cache size: 2925, Positive conditional cache size: 2910, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2926, Positive cache size: 2926, Positive conditional cache size: 2911, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2927, Positive cache size: 2927, Positive conditional cache size: 2912, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2928, Positive cache size: 2928, Positive conditional cache size: 2913, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2929, Positive cache size: 2929, Positive conditional cache size: 2914, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2930, Positive cache size: 2930, Positive conditional cache size: 2915, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2931, Positive cache size: 2931, Positive conditional cache size: 2916, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2932, Positive cache size: 2932, Positive conditional cache size: 2917, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2933, Positive cache size: 2933, Positive conditional cache size: 2918, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2934, Positive cache size: 2934, Positive conditional cache size: 2919, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2935, Positive cache size: 2935, Positive conditional cache size: 2920, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2936, Positive cache size: 2936, Positive conditional cache size: 2921, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2937, Positive cache size: 2937, Positive conditional cache size: 2922, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2938, Positive cache size: 2938, Positive conditional cache size: 2923, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2939, Positive cache size: 2939, Positive conditional cache size: 2924, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2940, Positive cache size: 2940, Positive conditional cache size: 2925, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2941, Positive cache size: 2941, Positive conditional cache size: 2926, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2942, Positive cache size: 2942, Positive conditional cache size: 2927, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2943, Positive cache size: 2943, Positive conditional cache size: 2928, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2944, Positive cache size: 2944, Positive conditional cache size: 2929, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2945, Positive cache size: 2945, Positive conditional cache size: 2930, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2946, Positive cache size: 2946, Positive conditional cache size: 2931, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2947, Positive cache size: 2947, Positive conditional cache size: 2932, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2948, Positive cache size: 2948, Positive conditional cache size: 2933, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2949, Positive cache size: 2949, Positive conditional cache size: 2934, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2950, Positive cache size: 2950, Positive conditional cache size: 2935, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2951, Positive cache size: 2951, Positive conditional cache size: 2936, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2952, Positive cache size: 2952, Positive conditional cache size: 2937, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2953, Positive cache size: 2953, Positive conditional cache size: 2938, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2954, Positive cache size: 2954, Positive conditional cache size: 2939, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2955, Positive cache size: 2955, Positive conditional cache size: 2940, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2956, Positive cache size: 2956, Positive conditional cache size: 2941, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2957, Positive cache size: 2957, Positive conditional cache size: 2942, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2958, Positive cache size: 2958, Positive conditional cache size: 2943, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2959, Positive cache size: 2959, Positive conditional cache size: 2944, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2960, Positive cache size: 2960, Positive conditional cache size: 2945, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2961, Positive cache size: 2961, Positive conditional cache size: 2946, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2962, Positive cache size: 2962, Positive conditional cache size: 2947, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2963, Positive cache size: 2963, Positive conditional cache size: 2948, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2964, Positive cache size: 2964, Positive conditional cache size: 2949, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2965, Positive cache size: 2965, Positive conditional cache size: 2950, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2966, Positive cache size: 2966, Positive conditional cache size: 2951, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2967, Positive cache size: 2967, Positive conditional cache size: 2952, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2968, Positive cache size: 2968, Positive conditional cache size: 2953, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2969, Positive cache size: 2969, Positive conditional cache size: 2954, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2970, Positive cache size: 2970, Positive conditional cache size: 2955, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2971, Positive cache size: 2971, Positive conditional cache size: 2956, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2972, Positive cache size: 2972, Positive conditional cache size: 2957, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2973, Positive cache size: 2973, Positive conditional cache size: 2958, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2974, Positive cache size: 2974, Positive conditional cache size: 2959, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2975, Positive cache size: 2975, Positive conditional cache size: 2960, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2976, Positive cache size: 2976, Positive conditional cache size: 2961, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2977, Positive cache size: 2977, Positive conditional cache size: 2962, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2978, Positive cache size: 2978, Positive conditional cache size: 2963, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2979, Positive cache size: 2979, Positive conditional cache size: 2964, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2980, Positive cache size: 2980, Positive conditional cache size: 2965, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional 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: 78]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 32 for 9ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 32 for 9ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 32 for 9ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 91 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: 693.4s, OverallIterations: 2947, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 234.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38616 SdHoareTripleChecker+Valid, 164.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38616 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 135.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 338475 IncrementalHoareTripleChecker+Invalid, 351599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13124 mSolverCounterUnsat, 2 mSDtfsCounter, 338475 mSolverCounterSat, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9349 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 35.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=443occurred in iteration=16, InterpolantAutomatonStates: 14747, 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, 6.5s SatisfiabilityAnalysisTime, 130.4s InterpolantComputationTime, 32436 NumberOfCodeBlocks, 32436 NumberOfCodeBlocksAsserted, 2947 NumberOfCheckSat, 29489 ConstructedInterpolants, 0 QuantifiedInterpolants, 224157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2947 InterpolantComputations, 2947 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